Sorting Long Sequences in a Single Hop Radio Network
We propose an algorithm for merging two sorted sequences of length kOpen image in new windowm stored in two sequences of m stations of single-hop single-channel radio network, where each station stores a block of of k consecutive elements. The time and energetic cost of this algorithm are 6mOpen image in new windowk+8m–4 and 8k+4⌈log2(m+1)⌉+6, respectively. This algorithm can be applied for sorting a sequence of length N=kOpen image in new windown in a network consisting of n stations with memory limited by Θ(k) words. For \(k=\Omega(\lg n)\), the energetic cost of such sorting is \(O(k\cdot\lg n)\) and the time is \(O(N\lg n)\). Moreover, the constants hidden by the big “Oh” are reasonably small, to make the algorithm attractive for practical applications.
Unable to display preview. Download preview PDF.
- 2.Batcher, K.E.: Sorting networks and their applications. In: Proceedings of 32nd AFIPS, pp. 307–314 (1968)Google Scholar
- 3.Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms (1994)Google Scholar
- 5.Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1973)Google Scholar
- 8.Singh, M., Prasanna, V.K.: Optimal Energy Balanced Algorithm for Selection in Single Hop Sensor Network. In: SNPA ICC (May 2003)Google Scholar
- 9.Singh, M., Prasanna, V.K.: Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Sensor Network. In: PERCOM (March 2003)Google Scholar
- 10.Compendium of Large-Scale Optimization Problems (DELIS, Subproject 3), http://ru1.cti.gr/delis-sp3/