Sorting in c log n parallel steps
Combinatorica
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
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
An Optimal Randomized Ranking Algorithm on the k-channel Broadcast Communication Model
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
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
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
| Hi-index | 0.00 |
By k-disturbed sequence we mean a sequence obtained from a sorted sequence by changing the values of at most k elements. We present an algorithm for single-hop radio networks that sorts a k-disturbed sequence of length n (where each station stores single key) in time 4n + k ċ (⌈lg k⌉2 + ⌈lg(n - k + 1)⌉ + 6⌈ lg k⌉) - 2 with energetic cost 3 ċ ⌈(⌈lg k⌉+1)(⌈lg k⌉+2)/2⌊n/k⌋⌉ + 4 ċ ⌈ ⌈lg k⌉/⌊n/k⌋ ⌉ + 10. If (⌈lg k⌉+1)(⌈lg k⌉+2)/2 + ⌈lg k⌉ ≤ ◊n/k⌋ then the energetic cost is bounded by 14.