Energy-Efficient Permutation Routing in Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Routing in the Broadcast Communication Model
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
An Optimal Randomized Ranking Algorithm on the k-channel Broadcast Communication Model
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
An Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks
IEEE Transactions on Parallel and Distributed Systems
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
Sorting long sequences in a single hop radio network
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations 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
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 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 3mri + si + di + 3 energetic cost and nm + n + p time cost, where station ai stores si keys (ri distinct keys) and receives di keys. On the basis of this sorting, we construct routing protocols with energetic costs (3⌈log2p⌉+2)ri+si+di+5 and (3⌈log2p⌉+4)ri+si+di +6, and time costs n⌈log2p⌉+n+3p and r⌈log2 p⌉+n+r+3p, respectively, where r is sum of all ri. Our routing is attractive alternative for previous solutions, since it is efficient, deterministic and simple.