This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Energy-Efficient Routing in the Broadcast Communication Model
December 2002 (vol. 13 no. 12)
pp. 1201-1210

Abstract—The Broadcast Communication Model (BCM, for short) is a distributed system with no central arbiter populated by p stations denoted by S(1), S(2), ..., S(p) that communicate by transmitting messages on a communication channel. The stations are assumed to have the computing power of a laptop computer and to be synchronous—in particular, they all run the same program, albeit on different data. We assume that a station is expending power while transmitting or receiving messages. As it turns out, one of the most effective energy-saving strategies is to mandate individual stations to power their transceiver off (i.e., go to sleep) whenever they are not transmitting or receiving messages. Suppose that the p stations of the BCM store collectively n items such that station S(i), (1< i< p), stores s_i items. Each of the items has a unique destination which is the identity of the station to which the item must be routed. The goal is to route all the items to their destinations, while expending as little energy as possible. Since, in the worst case, each item must be transmitted at least once, every routing protocol must take at least \big. n\bigr. time slots to terminate. Furthermore, station \big. S(i)\bigr., (\big. 1\leq i\leq p\bigr.), must be awake for at least \big. s_i+d_i\bigr. time slots, where \big. d_i\bigr. denotes the number of items destined for \big. S(i)\bigr.. Since, in the BCM, every station is within transmission range from every other station, the design of energy-efficient protocols is highly nontrivial. An additional complication stems from the inherent asymmetry of the routing problem: no destination knows the identity of the sender, precluding a priori arrangements between senders and receivers. The main contribution of this work is to present an energy-efficient routing protocol for the single-channel, p-station BCM. We show that for every f\geq 1\bigr., the task of routing \big. n\bigr. items in this model can be completed with probability exceeding \big. 1-{\frac{1}{f}}\bigr., in \big. n+ O(q+\ln f)\bigr. time slots and that no station \big. S(i)\bigr., \big. (1 \leq i \leq p)\bigr., has to be awake for more than \big. s_i+d_i+O(q_i+r_i\log p+\log f)\bigr. time slots, where \big. q_i\bigr. is the number of stations that have items destined for \big. S(i)\bigr., \big. q=q_1+q_2+\cdots +q_p\bigr., and \big. r_i\bigr. is the number of stations for which \big. S(i)\bigr. has items. Since \big. q_i\leq d_i\bigr., \big. r_i\leq s_i\bigr. and \big. q\leq n\bigr., our protocol is close to optimal both in terms of overall completion time and energy efficiency.

[1] Multiple Access Comm.: Foundations for Emerging Technologies. N. Abramson, ed., New York: IEEE Press, 1993.
[2] N. Abramson, “Multiple Access in Wireless Digital Networks,” Proc. IEEE, vol. 82, pp. 1360-1370, 1994.
[3] N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, “Single-Round Simulation on Radio Networks,” J. Algorithms, vol. 13, pp. 188-210, 1992.
[4] A. Bagchi and S.L. Hakimi, “Data Transfer in Broadcast Networks,” IEEE Trans. Computers, vol. 41, pp. 842-847, 1992.
[5] N. Bambos and J.M. Rulnick, “Mobile Power Management for Wireless Communication Networks,” Wireless Networks, vol. 3, pp. 3-14, 1997.
[6] R. Bar-Yehuda, O. Goldreich, and A. Itai, “Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with No Collision Detection,” Distributed Computing, vol. 5, pp. 67-71, 1991.
[7] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[8] J.L. Bordim, J. Cui, T. Hayashi, K. Nakano, and S. Olariu, “Energy-Efficient Initialization Protocols for Ad Hoc Radio Networks,” Proc. ISAAC '99, pp. 215-224, 1999.
[9] J.I. Capetanakis, “Tree Algorithms for Packet Broadcast Channels,” IEEE Trans. Information Theory, vol. 25, pp. 505-515, 1979.
[10] G.-H. Chen and W.-W. Liang, “Conflict-Free Broadcasting Algorithms for Graph Traversals and Their Applications,” Parallel Computing, vol. 18, pp. 439-448, 1992.
[11] I. Chlamtac and O. Ganz, “Performance Models for Asynchronous Multitrunk HYPER Channel Networks,” IEEE Trans. Computers, vol. 36, pp. 138-146, 1987.
[12] I. Chlamtac and S. Kutten, “Tree-Based Broadcasting in Multihop Radio Networks,” IEEE Trans. Computers, vol. 36, pp. 1209-1223, 1987.
[13] I. Chlamtac and A. Faragó, “An Optimal Channel Access Protocol with Multiple Reception Capacity,” IEEE Trans. Computers, vol. 43, pp. 480-484, 1994.
[14] P.H. Dana, “The Geographer's Craft Project,” Dept. of Geography, Univ. of Texas, Austin, Sept. 1999, Also available at http://www.utexas.edu/depts/grg/gcraf/notes/ gpsgps.html.
[15] R. Dechter and L. Kleinrock, “Broadcast Communication and Distributed Algorithms,” IEEE Trans. Computers, vol. 35, pp. 210-219, 1986.
[16] M. Fine and F.A. Tobagi, “Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks,” IEEE Trans. Computers, vol. 33, pp. 1130-1159, 1984.
[17] W.R. Franta and M.B. Bilodeau, “Analysis of Prioritized CSMA Protocol Based on Staggered Delays,” Acta Informatica, pp. 299-324, vol. 13, 1980.
[18] W.R. Franta and J.R. Heath, “Measurement and Analysis of HYPER Channel Networks,” IEEE Trans. Computers, vol. 33, pp. 1124-1130, 1984.
[19] M. Gerla and T.-C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, pp. 255-265, 1995.
[20] A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, “Scalable Routing Strategies for Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, pp. 1369-1379, 1999.
[21] E.D. Kaplan, Understanding GPS: Principles and Applications. Boston: Artech House, 1996.
[22] S. Levitan, “Algorithms for Broadcast Protocol Multiprocessors,” Proc. Third Int'l Conf. Distributed Computing Systems, pp. 666-671, 1982.
[23] C.R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE Trans. Special Areas of Comm., pp. 1265-1275, 1999,
[24] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[25] K. Nakano, “Optimal Sorting Algorithms on Bus-Connected Processor Arrays,” IEICE Trans. Fundamentals, vol. E-76A, no. 11, pp. 2008-2015, 1994.
[26] K. Nakano and S. Olariu, “Randomized Initialization Protocols for Ad Hoc Radio Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, pp. 749-759, 2000,
[27] K. Nakano and S. Olariu, “Randomized Leader Election Protocols for Ad Hoc Networks,” Proc. Seventh Int'l Colloquium Structural Information & Communication Complexity (Scirocco), pp. 253-267, June 2000.
[28] K. Nakano, S. Olariu, and J.L. Schwing, “Broadcast-Efficient Sorting in the Presence of Few Channels,” Proc. Int'l Conf. Parallel Processing, pp. 12-15, Aug. 1997.
[29] K. Nakano, S. Olariu, and J. Schwing, “Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels,” Proc. Int'l Parallel Processing Symp., pp. 31-35, 1998.
[30] K. Nakano, S. Olariu, and J.L. Schwing, “Broadcast-Efficient Protocols for Mobile Radio Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 10, pp. 1276-1289, 1999.
[31] K. Nakano, S. Olariu, and A. Zomaya, “Energy-Efficient Permutation Routing Protocols in Radio Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, pp. 544-557, 2000.
[32] 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.
[33] B. Parkinson and S. Gilbert, “NAVSTAR: Global Positioning SystemTen Years Later,” Proc. IEEE, pp. 1177-1186, 1983.
[34] R.A. Powers, “Batteries for Low-Power Electronics,” Proc. IEEE, vol. 83, pp. 687-693, 1995.
[35] A.K. Salkintzis and C. Chamzas, “An In-Band Power-Saving Protocol for Mobile Data Networks,” IEEE Trans. Comm., vol. 46, pp. 1194-1205, 1998.
[36] R. Sanchez, J. Evans, and G. Minden, “Networking on the Battlefield: Challenges in Highly Dynamic Multihop Wireless Networks,” Proc. IEEE MILCOM '99, Oct. 1999.
[37] S. Singh and C.S. Raghavendra, “PAMASPoweraware Multi-Access Protocol with Signalling for Ad Hoc Networks,” ACM Computer Comm. Rev., vol. 28, pp. 5-26 1998.
[38] 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.
[39] 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.
[40] F. Tobagi and V.B. Hunt, “Performance Evaluation of Carrier Sense Multiple Access with Collision Detection,” Computer Networks, vol. 4, pp. 435-467, 1980.
[41] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “Multicasting in Energy-Limited Ad Hoc Wireless Networks,” Proc. MILCOM '98, 1998.
[42] C.B. Yang, R.C.T. Lee, and W.-T. Chen, “Parallel Graph Algorithms Based upon Broadcast Communications,” IEEE Trans. Computers, vol. 39, pp. 1468-1472, 1990.
[43] C.B. Yang, R.C.T. Lee, and W.-T. Chen, “Conflict-Free Sorting Algorithms under Single and Multi-Channel Broadcast Communication Models,” Proc. ICCI '91, pp. 350-359, 1991.

Index Terms:
Broadcast communications, bus-based computer systems, radio networks, reservation protocols, demand assignment multiple access, routing, energy-efficient protocols.
Citation:
Koji Nakano, Stephan Olariu, Albert Y. Zomaya, "Energy-Efficient Routing in the Broadcast Communication Model," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 12, pp. 1201-1210, Dec. 2002, doi:10.1109/TPDS.2002.1158259
Usage of this product signifies your acceptance of the Terms of Use.