Abstract
We consider two problems. First, sorting of n integer keys from the [0,2m − 1] range, stored in p stations of a single-hop and single channel radio network. Second problem is routing of the packets between the stations of the network. We introduce counting-sort algorithm which has 3mr i + s i + d i + 3 energetic cost and nm + n + p time cost, where station a i stores s i keys (r i distinct keys) and receives d i keys. On the basis of this sorting, we construct routing protocols with energetic costs (3⌈log2 p⌉ + 2)r i + s i + d i + 5 and (3⌈log2 p⌉ + 4)r i + s i + d i + 6, and time costs n⌈log2 p⌉ + n + 3p and r⌈log2 p⌉ + n + r + 3p, respectively, where r is sum of all r i . Our routing is attractive alternative for previous solutions, since it is efficient, deterministic and simple.
Partially supported by KBN grant 3 T11C 011 26.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Datta, A., Zomaya, A.Y.: An Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks. IEEE Trans. Parallel Distrib. Syst. 15, 331–338 (2004)
Kik, M.: Merging and Merge-sort in a Single Hop Radio Network. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 341–349. Springer, Heidelberg (2006)
Kik, M.: Sorting Long Sequences in a Single Hop Radio Network. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 573–583. Springer, Heidelberg (2006)
Nakano, K.: An Optimal Randomized Ranking Algorithm on the k-channel Broadcast Communication Model. In: ICPP 2002, pp. 493–500 (2002)
Nakano, K., Olariu, S., Zomaya, A.Y.: Energy-Efficient Permutation Routing in Radio Networks. IEEE Transactions on Parallel and Distributed Systems 12, 544–557 (2001)
Nakano, K., Olariu, S., Zomaya, A.Y.: Energy-Efficient Routing in the Broadcast Communication Model. IEEE Trans. Parallel Distrib. Syst. 13, 1201–1210 (2002)
Singh, M., Prasanna, V.K.: Optimal Energy Balanced Algorithm for Selection in Single Hop Sensor Network. In: IEEE International Workshop on Sensor Network Protocols and Applications SNPA ICC (May 2003)
Singh, M., Prasanna, V.K.: Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Sensor Network. In: IEEE Conference on Pervasive Computing and Communications PERCOM (March 2003)
Compendium of Large-Scale Optimization Problems (DELIS, Subproject 3), http://ru1.cti.gr/delis-sp3/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gȩbala, M., Kik, M. (2008). Counting-Sort and Routing in a Single Hop Radio Network. In: Kutyłowski, M., Cichoń, J., Kubiak, P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2007. Lecture Notes in Computer Science, vol 4837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77871-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-77871-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77870-7
Online ISBN: 978-3-540-77871-4
eBook Packages: Computer ScienceComputer Science (R0)