Publication 2000 Issue No. 8 - August Abstract - Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
August 2000 (vol. 11 no. 8)
pp. 851-863
 ASCII Text x Koji Nakano, Stephan Olariu, "Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 851-863, August, 2000.
 BibTex x @article{ 10.1109/71.877942,author = {Koji Nakano and Stephan Olariu},title = {Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {11},number = {8},issn = {1045-9219},year = {2000},pages = {851-863},doi = {http://doi.ieeecomputersociety.org/10.1109/71.877942},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision DetectionIS - 8SN - 1045-9219SP851EP863EPD - 851-863A1 - Koji Nakano, A1 - Stephan Olariu, PY - 2000KW - Radio networksKW - wireless networksKW - mobile computingKW - initialization.VL - 11JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—A radio network ($RN$, for short) is a distributed system consisting of $n$ radio stations. We assume that the stations are small, bulk-produced, hand-held devices running on batteries and cannot be distinguished by serial or manufacturing number. Since recharging batteries may not be possible while on mission, we are interested in designing protocols that are highly energy-efficient. The initialization problem is to assign each of the $n$ stations in the RN a unique ID. The initialization problem is nontrivial since the stations are assumed to be indistinguishable. The problem is fundamental, since practically all communication protocols for $RN$s proceed under the assumption that the RN has been initialized in advance. The main contribution of this work is to propose energy-efficient randomized initialization protocols for single-hop $RN$s lacking collision detection capabilities. First, we show that if the number $n$ of stations is known beforehand, the single-channel $RN$ can be initialized by a protocol that terminates, with probability exceeding $1 - {\frac{1}{n}}$, in $O(n)$ time slots, with no station being awake for more than $O(\log \log n)$ time slots. We then go on to address the multichannel case and show that if $k$, $(k \geq 1)$, channels are available, an n-station $RN$ can be initialized, with probability exceeding $1 - {\frac{1}{n}}$, in $O({n\over k}+\log n)$ time slots, with no station being awake for more than $O(\log\log n)$ time slots.

[1] N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, “Single-Round Simulation on Radio Networks,” J. Algorithms, vol. 13, pp. 188–210, 1992.
[2] D.J. Baker, “Data/Voice Communication over a Multihop, Mobile, High Frequency Network,” Proc. MILCOM '97, pp. 339–343, 1997.
[3] N. Bambos and J.M. Rulnick, “Mobile Power Management for Wireless Communication Networks,” Wireless Networks, vol. 3, pp. 3–14, 1997.
[4] R. Bar-Yehuda, O. Goldreich, and A. Itai, “Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multihop Radio Network with No Collision Detection,” Distributed Computing, vol. 5, pp. 67–71, 1991.
[5] R. Bar-Yehuda, O. Goldreich, and A. Itai, “On the Time-Complexity of Broadcast in Multi-Hop Radio Networks: An Exponential Gap between Determinism and Randomization,” J. Computer and Systems Sciences, vol. 45, pp. 104–126, 1992.
[6] U. Black, Mobile and Wireless Networks. Upper Saddle River, N.J.: Prentice-Hall, 1996.
[7] J.L. Bordim, J. Cui, T. Hayashi, K. Nakano, and S. Olariu, “Energy-Efficient Initialization Protocols for Ad-Hoc Radio Networks,” Proc. Int'l Symp. Algorithms and Computation, pp. 215–224, Dec. 1999.
[8] P.H. Dana, “The Geographer's Craft Project,” Dept. of Geography, Univ. of Texas, Austin, Sept. 1999. http://www.utexas.edu/depts/grg/gcraf/notes/ gpsgps.html.
[9] W.C. Fifer and F.J. Bruno, “Low Cost Packet Radio,” Proc. IEEE, vol. 75, pp. 33-42, 1987.
[10] M. Gerla and T.-C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, pp. 255–265, 1995.
[11] E.P. Harris and K.W. Warren, “Low Power Technologies: A System Perspective,” Proc. Third Int'l Workshop Multimedia Comm., 1996.
[12] T. Hayashi, K. Nakano, and S. Olariu, “Randomized Initialization Protocols for Packet Radio Networks,” Proc. 13th Int'l Parallel Processing Symp., pp. 544-548, Apr. 1999.
[13] E. D. Kaplan, Understanding GPS: Principles and Applications. Boston: Artech House, 1996.
[14] C.R. Lin and M. Gerla, “Adaptive Clustering in Mobile Wireless Networks,” IEEE J. Selected Areas in Communications, vol. 16, pp. 1,265–1,275, 1997.
[15] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[16] K. Nakano, “Optimal Initializing Algorithms for a Reconfigurable Mesh,” J. Parallel and Distributed Computing, vol. 24, pp. 218-223, 1995.
[17] K. Nakano and S. Olariu, “Randomized$O(\log\log n)$-Round Leader Election Protocols in Packet Radio Networks,” Proc. Int'l Symp. Algorithms and Computation, pp. 209–218, 1998.
[18] K. Nakano, S. Olariu, and J. L. Schwing, “Broadcast-Efficient Protocols for Ad-Hoc Radio Networks with Few Channels,” IEEE Trans., Parallel and Distributed Systems, vol. 12, pp. 1,276-1,289, 1999.
[19] M. Joa-Ng and I.-T. Lu, “A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, pp. 1415–1425, 1999.
[20] B. Parkinson and S. Gilbert, “NAVSTAR: Global Positioning System–Ten Years Later,” Proc. IEEE, pp. 1,177-1,186, 1983.
[21] R.A. Powers, “Batteries for Low-Power Electronics,” Proc. IEEE, vol. 83, pp. 687-693, 1995.
[22] R. Ramanathan and M. Steenstrup, “Hierarchically-Organized, Multihop Wireless Networks for Quality-of-Service Support,” Mobile Networks and Applications, vol. 3, pp. 101–119, 1998.
[23] D. Raychaudhuri and N.D. Wilson, "ATM-Based Transport Architecture for Multiservices Wireless Personal Communication Network," IEEE J. Selected Areas Comm., vol. 12, no. 8, Oct. 1994, pp. 4101-1414.
[24] A.K. Salkintzis and C. Chamzas, “An In-Band Power-Saving Protocol for Mobile Data Networks,” IEEE Trans. Comm., pp. 1,194–1,205, 1998.
[25] R. Sanchez, J. Evans, and G. Minden, “Networking on the Battlefield: Challenges in Highly Dynamic Multihop Wireless Networks,” Proc. IEEE MILCOM '99, Oct. 1999.
[26] K. Sivalingam, M.B. Srivastava, and P. Agrawal, “Low Power Link and Access Protocols for Wireless Multimedia Networks,” Proc. IEEE Vehicular Technology Conf., (VTC '97), May 1997.
[27] M. Stemm, P. Gauthier, and D. Harada, “Reducing Power Consumption on Network Interfaces in Hand-Held Devices,” Proc. Third Int'l Workshop Multimedia Comm., 1996.
[28] J.E. Wieselthier, G.D. Nguyen, and A. Ephemerides, “Multicasting in Energy-Limited Ad-Hoc Wireless Networks,” Proc. MILCOM '98, 1998.

Index Terms:
Radio networks, wireless networks, mobile computing, initialization.
Citation:
Koji Nakano, Stephan Olariu, "Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 851-863, Aug. 2000, doi:10.1109/71.877942