Abstract
We present two merging algorithms on a single-channel single-hop radio network without collision detection. The simpler of these algorithms merges two sorted sequences of length n in time 4n with energetic cost for each station \(\approx {\rm lg} {\it n}\). The energetic cost of broadcasting is constant. This yields the merge-sort for n elements in time 2nlg n, where the energetic cost for each station is \(\frac{1}{2}{\rm lg}^{2}{\it n}+\frac{7}{2} {\rm lg}{\it n}\) (the energetic cost of broadcasting is only 2 lg n), which seems to be suitable for practical applications due to its simplicity and low constants. We also present algorithm for merging in time O(nlg*n) with energetic cost O(lg* n).
Partially supported by KBN, grant number 3T11C 011 26 in year 2004 and by the European Union within the 6th Framework Programme under contract 001907 (DELIS).
This is a preview of subscription content, log in via an institution to check access.
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
Ajtai, M., Komlós, J., Szemerédi, E.: Sorting in c logn Parallel Steps. Combinatorica 3, 1–19 (1983)
Batcher, K.E.: Sorting Networks and Their Applications. In: Proceedings of 32nd AFIPS, pp. 307–314 (1968)
Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time Bounds for Selection. Journal of Computer System Sciences 7(4), 448–461 (1973)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms (1994)
Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Efficient Algorithms for Leader Election in Radio Networks. In: ACM PODC 2002, pp. 51–57. ACM Press, New York (2002)
Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Energy-Efficient Size Approximation for Radio Networks with No Collision Detection. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 279–289. Springer, Heidelberg (2002)
Kutyłowski, M., Letkiewicz, D.: Computing Average Value in Ad Hoc Networks. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 511–520. Springer, Heidelberg (2003)
Nakano, K., Olariu, S.: Efficient Initialization Protocols for Radio Networks with No Collision Detection. In: ICPP 2000, pp. 263–270. IEEE Computer Society Press, New York (2000)
Nakano, K., Olariu, S.: Broadcast-Efficient Protocols for Mobile Radio Networks with Few Channels. IEEE Transactions on Parallel and Distributed Systems 10, 1276–1289 (1999)
Singh, M., Prasanna, V.K.: Optimal Energy Balanced Algorithm for Selection in Single Hop Sensor Network. In: SNPA ICC (May 2003)
Singh, M., Prasanna, V.K.: Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Sensor Network. In: 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
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kik, M. (2006). Merging and Merge-Sort in a Single Hop Radio Network. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_32
Download citation
DOI: https://doi.org/10.1007/11611257_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31198-0
Online ISBN: 978-3-540-32217-7
eBook Packages: Computer ScienceComputer Science (R0)