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.


Sensor Network Radio Network Time Slot Time Cost Energetic Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Datta, A., Zomaya, A.Y.: An Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks. IEEE Trans. Parallel Distrib. Syst. 15, 331–338 (2004)CrossRefGoogle Scholar
  2. 2.
    Kik, M.: Merging and Merge-sort in a Single Hop Radio Network. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 341–349. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Kik, M.: Sorting Long Sequences in a Single Hop Radio Network. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 573–583. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Nakano, K.: An Optimal Randomized Ranking Algorithm on the k-channel Broadcast Communication Model. In: ICPP 2002, pp. 493–500 (2002)Google Scholar
  5. 5.
    Nakano, K., Olariu, S., Zomaya, A.Y.: Energy-Efficient Permutation Routing in Radio Networks. IEEE Transactions on Parallel and Distributed Systems 12, 544–557 (2001)CrossRefGoogle Scholar
  6. 6.
    Nakano, K., Olariu, S., Zomaya, A.Y.: Energy-Efficient Routing in the Broadcast Communication Model. IEEE Trans. Parallel Distrib. Syst. 13, 1201–1210 (2002)CrossRefGoogle Scholar
  7. 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. 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. 9.
    Compendium of Large-Scale Optimization Problems (DELIS, Subproject 3),

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Maciej Gȩbala
    • 1
  • Marcin Kik
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of TechnologyWrocławPoland

Personalised recommendations