Advertisement

Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks

  • J. L. Bordim
  • J. Cui
  • T. Hayashi
  • K. Nakano
  • S. Olariu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)

Abstract

The main contribution of this work is to propose energy- efficient randomized initialization protocols for ad-hoc radio networks (ARN, for short). First, we show that if the number n of stations is known beforehand, the single-channel ARN can be initialized by a protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. We then go on to address the case where the number n of stations in the ARN is not known beforehand. We begin by discussing, an elegant protocol that provides a tight approximation of n. Interestingly, this protocol terminates, with high probability, in O((log n)2) time slots and no station has to be awake for more than O(log n) time slots. We use this protocol to design an energy-efficient initialization protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. Finally, we design an energy-efficient initialization protocol for the k-channel ARN that terminates, with high probability, in \( O(\frac{n} {k} + \log n) \) time slots, with no station being awake for more than O(log n) time slots.

Keywords

Time Slot Packet Radio Initialization Protocol Tight Approximation Current Time Slot 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, Single-round simulation on radio networks, Journal of Algorithms, 13, (1992), 188–210.Google Scholar
  2. 2.
    R. Dechter and L. Kleinrock, Broadcast communication and distributed algorithms, IEEE Transactions on Computers, C-35, (1986), 210–219.Google Scholar
  3. 3.
    T. Hayashi, K. Nakano, and S. Olariu, Randomized initialization protocols for Packet Radio Networks, Proc. 13th International Parallel Processing Symposium, (1999), 544–548.Google Scholar
  4. 4.
    R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.Google Scholar
  5. 5.
    S. Murthy and J. J. Garcia-Luna-Aceves, A routing protocol for packet radio networks, Proc. First Annual ACM Conference on Mobile Computing and Networking, Berkeley, California, 1995, 86–95.Google Scholar
  6. 6.
    K. Nakano, Optimal initializing algorithms for a reconfigurable mesh, Journal of Parallel and Distributed Computing, 24, (1995), 218–223.Google Scholar
  7. 7.
    K. Nakano, Optimal sorting algorithms on bus-connected processor arrays, IEICE Transactions Fundamentals, E-76A, 11, (1994), 2008–2015.Google Scholar
  8. 8.
    K. Nakano, S. Olariu, and J. L. Schwing, Broadcast-efficient protocols for ad-hoc radio networks with few channels, IEEE Transactions on parallel and Distributed Systems, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • J. L. Bordim
    • 1
  • J. Cui
    • 1
  • T. Hayashi
    • 1
  • K. Nakano
    • 1
  • S. Olariu
    • 2
  1. 1.Department of Electrical and Computer EngineeringNagoya Institute of TechnologyShowa-kuJapan
  2. 2.Department of Computer ScienceOld Dominion UniversityNorfolkUSA

Personalised recommendations