
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Koji Nakano, Stephan Olariu, Albert Y. Zomaya, "EnergyEfficient Routing in the Broadcast Communication Model," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 12, pp. 12011210, December, 2002.  
BibTex  x  
@article{ 10.1109/TPDS.2002.1158259, author = {Koji Nakano and Stephan Olariu and Albert Y. Zomaya}, title = {EnergyEfficient Routing in the Broadcast Communication Model}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {13}, number = {12}, issn = {10459219}, year = {2002}, pages = {12011210}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2002.1158259}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  EnergyEfficient Routing in the Broadcast Communication Model IS  12 SN  10459219 SP1201 EP1210 EPD  12011210 A1  Koji Nakano, A1  Stephan Olariu, A1  Albert Y. Zomaya, PY  2002 KW  Broadcast communications KW  busbased computer systems KW  radio networks KW  reservation protocols KW  demand assignment multiple access KW  routing KW  energyefficient protocols. VL  13 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 energysaving 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
[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. 13601370, 1994.
[3] N. Alon, A. BarNoy, N. Linial, and D. Peleg, “SingleRound Simulation on Radio Networks,” J. Algorithms, vol. 13, pp. 188210, 1992.
[4] A. Bagchi and S.L. Hakimi, “Data Transfer in Broadcast Networks,” IEEE Trans. Computers, vol. 41, pp. 842847, 1992.
[5] N. Bambos and J.M. Rulnick, “Mobile Power Management for Wireless Communication Networks,” Wireless Networks, vol. 3, pp. 314, 1997.
[6] R. BarYehuda, O. Goldreich, and A. Itai, “Efficient Emulation of SingleHop Radio Network with Collision Detection on MultiHop Radio Network with No Collision Detection,” Distributed Computing, vol. 5, pp. 6771, 1991.
[7] D. Bertzekas and R. Gallager, Data Networks, second ed. PrenticeHall, 1992.
[8] J.L. Bordim, J. Cui, T. Hayashi, K. Nakano, and S. Olariu, “EnergyEfficient Initialization Protocols for Ad Hoc Radio Networks,” Proc. ISAAC '99, pp. 215224, 1999.
[9] J.I. Capetanakis, “Tree Algorithms for Packet Broadcast Channels,” IEEE Trans. Information Theory, vol. 25, pp. 505515, 1979.
[10] G.H. Chen and W.W. Liang, “ConflictFree Broadcasting Algorithms for Graph Traversals and Their Applications,” Parallel Computing, vol. 18, pp. 439448, 1992.
[11] I. Chlamtac and O. Ganz, “Performance Models for Asynchronous Multitrunk HYPER Channel Networks,” IEEE Trans. Computers, vol. 36, pp. 138146, 1987.
[12] I. Chlamtac and S. Kutten, “TreeBased Broadcasting in Multihop Radio Networks,” IEEE Trans. Computers, vol. 36, pp. 12091223, 1987.
[13] I. Chlamtac and A. Faragó, “An Optimal Channel Access Protocol with Multiple Reception Capacity,” IEEE Trans. Computers, vol. 43, pp. 480484, 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. 210219, 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. 11301159, 1984.
[17] W.R. Franta and M.B. Bilodeau, “Analysis of Prioritized CSMA Protocol Based on Staggered Delays,” Acta Informatica, pp. 299324, vol. 13, 1980.
[18] W.R. Franta and J.R. Heath, “Measurement and Analysis of HYPER Channel Networks,” IEEE Trans. Computers, vol. 33, pp. 11241130, 1984.
[19] M. Gerla and T.C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, pp. 255265, 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. 13691379, 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. 666671, 1982.
[23] C.R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE Trans. Special Areas of Comm., pp. 12651275, 1999,
[24] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[25] K. Nakano, “Optimal Sorting Algorithms on BusConnected Processor Arrays,” IEICE Trans. Fundamentals, vol. E76A, no. 11, pp. 20082015, 1994.
[26] K. Nakano and S. Olariu, “Randomized Initialization Protocols for Ad Hoc Radio Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, pp. 749759, 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. 253267, June 2000.
[28] K. Nakano, S. Olariu, and J.L. Schwing, “BroadcastEfficient Sorting in the Presence of Few Channels,” Proc. Int'l Conf. Parallel Processing, pp. 1215, Aug. 1997.
[29] K. Nakano, S. Olariu, and J. Schwing, “BroadcastEfficient Algorithms on the CoarseGrain Broadcast Communication Model with Few Channels,” Proc. Int'l Parallel Processing Symp., pp. 3135, 1998.
[30] K. Nakano, S. Olariu, and J.L. Schwing, “BroadcastEfficient Protocols for Mobile Radio Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 10, pp. 12761289, 1999.
[31] K. Nakano, S. Olariu, and A. Zomaya, “EnergyEfficient Permutation Routing Protocols in Radio Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, pp. 544557, 2000.
[32] M. JoaNg and I.T. Lu, “A PeertoPeer ZoneBased TwoLevel Link State Routing for Mobile Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, pp. 14151425, 1999.
[33] B. Parkinson and S. Gilbert, “NAVSTAR: Global Positioning SystemTen Years Later,” Proc. IEEE, pp. 11771186, 1983.
[34] R.A. Powers, “Batteries for LowPower Electronics,” Proc. IEEE, vol. 83, pp. 687693, 1995.
[35] A.K. Salkintzis and C. Chamzas, “An InBand PowerSaving Protocol for Mobile Data Networks,” IEEE Trans. Comm., vol. 46, pp. 11941205, 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 MultiAccess Protocol with Signalling for Ad Hoc Networks,” ACM Computer Comm. Rev., vol. 28, pp. 526 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 HandHeld 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. 435467, 1980.
[41] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “Multicasting in EnergyLimited 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. 14681472, 1990.
[43] C.B. Yang, R.C.T. Lee, and W.T. Chen, “ConflictFree Sorting Algorithms under Single and MultiChannel Broadcast Communication Models,” Proc. ICCI '91, pp. 350359, 1991.