
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, James L. Schwing, "BroadcastEfficient Protocols for Mobile Radio Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 12, pp. 12761289, December, 1999.  
BibTex  x  
@article{ 10.1109/71.819949, author = {Koji Nakano and Stephan Olariu and James L. Schwing}, title = {BroadcastEfficient Protocols for Mobile Radio Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {10}, number = {12}, issn = {10459219}, year = {1999}, pages = {12761289}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.819949}, 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  BroadcastEfficient Protocols for Mobile Radio Networks IS  12 SN  10459219 SP1276 EP1289 EPD  12761289 A1  Koji Nakano, A1  Stephan Olariu, A1  James L. Schwing, PY  1999 KW  Mobile radio networks KW  singlehop networks KW  permutation routing KW  ranking KW  sorting KW  DAMA. VL  10 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The main contribution of this work is to present elegant broadcastefficient protocols for permutation routing, ranking, and sorting on singlehop Mobile Radio Networks with
[1] A. Bagchi and S. Hakimi, "Data Transfers in Broadcast Networks," IEEE Trans. Computers, vol. 41, no. 7, pp. 842847, July 1992.
[2] 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. 67–71, 1991.
[3] R. BarYehuda, O. Goldreich, and A. Itai, “On the TimeComplexity of Broadcast in MultiHop Radio Networks: An Exponential Gap between Determinism and Randomization,” J. Computer and Systems Sciences, vol. 45, pp. 104–126, 1992.
[4] D. Bertzekas and R. Gallager, Data Networks, second ed. PrenticeHall, 1992.
[5] U. Black, Mobile and Wireless Networks. Upper Saddle River, N.J.: PrenticeHall, 1996.
[6] J.I. Capetankis, "Tree Algorithm for Packet Broadcasting Channel," IEEE Trans. Information Theory, vol. 25, pp. 505515, Sept. 1979.
[7] G.H. Chen and W.W. Liang, “ConflictFree Broadcasting Algorithms for Graph Traversals and Their Applications,” Parallel Computing, vol. 18,pp. 439–448, 1992.
[8] I. Chlamtac and O. Ganz, “Performance Models for Asynchronous Multitrunk HYPERchannel Networks,” IEEE Trans. Computers, vol. 36,pp. 138–146, 1987.
[9] I. Chlamtac and S. Kutten, “Tree Based Broadcasting in Multihop Radio Networks,” IEEE Trans. Computers, vol. 36, no. 10, Oct. 1987.
[10] C.T. Chou, I. Cidon, I.S. Gopal, and S. Zaks, “Synchronizing Asynchronous Bounded Delay Networks,” IEEE Trans. Communications, vol. 38,pp. 144–147, 1990.
[11] R. Dechter and L. Kleinrock, “Broadcast Communication and Distributed Algorithms,” IEEE Trans. Computers, vol. 35,pp. 210–219, 1986.
[12] K. Feher, Wireless Digital Communications. McGrawHill, 1995.
[13] M. Fine and F.A Tobagi, “Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks,” IEEE Trans. Computers, vol. 33,pp. 1,130–1,159, 1984.
[14] W.R. Franta and M.B. Bilodeau, “Analysis of Prioritized CSMA Protocol Based on Staggered Delays,” Acta Informatica, vol. 13,pp. 299–324, 1980.
[15] W.R. Franta and J.R. Heath, “Measurement and Analysis of HYPERchannel Networks,” IEEE Trans. Computers, vol. 33,pp. 1,124–1,130, 1984.
[16] V.K. Garg and J.E. Wilkes, Wireless and Personal Communication Systems, PrenticeHall, 1996.
[17] M. Gerla and T.C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, pp. 255–265, 1995.
[18] E.P. Harris and K.W. Warren, “Low Power Technologies: A System Perspective,” Proc. Third Int'l Workshop Mobile Multimedia Comm., Sept. 1996.
[19] T. Hayashi, K. Nakano, and S. Olariu, “Randomized Initialization Protocols for Packet Radio Networks,” Proc. 13th Int'l Parallel Processing Symp., pp. 544548, Apr. 1999.
[20] S. Levitan, “Algorithms for Broadcast Protocol Multiprocessors,” Proc. Third Int'l Conf. Distributed Computing Systems, pp. 666–671, 1982.
[21] S.P. Levitan and C.C. Foster, "Finding an Extremum in a Network," Proc. Int'l Symp. Computer Architecture, pp. 321325, 1982.
[22] 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.
[23] W. MangioneSmith and P.S. Ghang, “A Low Power Medium Access Control Protocol for Portable Multimedia Devices,” Proc. Third Int'l Workshop Mobile Multimedia Comm., Sept. 1996.
[24] J.M. Marberg and E. Gafni, “Sorting and Selection in MultiChannel Broadcast Networks,” Proc. Int'l Conf. Parallel Processing, pp. 846–850, Aug. 1985.
[25] R.M. Metcalfe and D.R. Boggs, “Ethernet: Distributed Packet Switching for Local Computer Networks,” Comm. ACM, vol. 19, pp. 395–404, 1976.
[26] S. Murthy and J.J. GarciaLunaAceves, “A Routing Protocol for Packet Radio Networks,” Proc. First Ann. ACM Conf. Mobile Computing and Networking, pp. 86–95, 1995.
[27] K. Nakano, “Optimal Sorting Algorithms on BusConnected Processor Arrays,” IEICE Trans. Fundamentals, vol. 11, no. 11,pp. 2,008–2,015, 1994.
[28] K. Nakano, S. Olariu, and J.L. Schwing, “BroadcastEfficient Sorting in the Presence of Few Channels,” Proc. Int'l Conf. Parallel Processing, pp. 12–15, Aug. 1997.
[29] K.V.S. Ramarao, “Distributed Sorting on Local Area Networks,” IEEE Trans. Computers, vol. 37,pp. 239–243, 1988.
[30] 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.
[31] F. Tobagi and V.B. Hunt, “Performance Evaluation of Carrier Sense Multiple Access with Collision Detection,” Computer Networks, vol. 4,pp. 435467, 1980.
[32] R.J. Wilson, Introduction to Graph Theory. Longman, 1985.
[33] C.B. Yang, R.C.T. Lee, and W.T. Chen, "Parallel Graph Algorithms Based upon Broadcast Communications," IEEE Trans. Computers, vol. 39, no. 12, pp. 1,4681,472, Dec. 1990.
[34] C.B. Yang, R.C.T. Lee, and W.T. Chen, “ConflictFree Sorting Algorithms under Single and Multichannel Broadcast Communication Models,” Proc. ICCI, Lecture Notes in Computer Science 497, pp. 350–359, 1991.