Counting-Sort and Routing in a Single Hop Radio Network
We consider two problems. First, sorting of n integer keys from the [0,2 m − 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 3mr i + s i + d i + 3 energetic cost and nm + n + p time cost, where station a i stores s i keys (r i distinct keys) and receives d i keys. On the basis of this sorting, we construct routing protocols with energetic costs (3⌈log2 p⌉ + 2)r i + s i + d i + 5 and (3⌈log2 p⌉ + 4)r i + s i + d i + 6, and time costs n⌈log2 p⌉ + n + 3p and r⌈log2 p⌉ + n + r + 3p, respectively, where r is sum of all r i . Our routing is attractive alternative for previous solutions, since it is efficient, deterministic and simple.
KeywordsSensor Network Radio Network Time Slot Time Cost Energetic Cost
Unable to display preview. Download preview PDF.
- 4.Nakano, K.: An Optimal Randomized Ranking Algorithm on the k-channel Broadcast Communication Model. In: ICPP 2002, pp. 493–500 (2002)Google Scholar
- 7.Singh, M., Prasanna, V.K.: Optimal Energy Balanced Algorithm for Selection in Single Hop Sensor Network. In: IEEE International Workshop on Sensor Network Protocols and Applications SNPA ICC (May 2003)Google Scholar
- 8.Singh, M., Prasanna, V.K.: Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Sensor Network. In: IEEE Conference on Pervasive Computing and Communications PERCOM (March 2003)Google Scholar
- 9.Compendium of Large-Scale Optimization Problems (DELIS, Subproject 3), http://ru1.cti.gr/delis-sp3/