Sorting in c log n parallel steps
Combinatorica
Introduction to algorithms
Broadcast-Efficient Protocols for Mobile Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Permutation Routing in Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Merging and merge-sort in a single hop radio network
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Ranking and Sorting in Unreliable Single Hop Radio Network
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Counting-sort and routing in a single hop radio network
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Correcting sorted sequences in a single hop radio network
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
| Hi-index | 0.00 |
We propose an algorithm for merging two sorted sequences of length km 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 6mk+8m–4 and 8k+4⌈log2(m+1)⌉+6, respectively. This algorithm can be applied for sorting a sequence of length N=kn 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.