The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2008 vol.19)
pp: 347-362
Several multicast protocols for mobile ad hoc networks have been proposed that build multicast trees using location information available from GPS or localization algorithms and use geographic forwarding to forward packets down the multicast trees. These stateless multicast protocols carry encoded membership, location and tree information in each packet and are more efficient and robust than stateful protocols (ADMR, ODMRP) as they avoid the difficulty of maintaining distributed state in the presence of frequent topology changes. However, current stateless multicast protocols are not scalable to large groups because of the perpacket encoding overhead, and the centralized group membership and location management. We present the Hierarchical Rendezvous Point Multicast (HRPM) protocol which significantly improves the scalability of stateless multicast with respect to the group size. HRPM consists of two key design ideas: (1) hierarchical decomposition of a large group into a hierarchy of recursively organized manageable-sized subgroups, and (2) use of distributed geographic hashing to construct and maintain such a hierarchy at virtually no cost. Our detailed simulations demonstrates that HRPM achieves significantly enhanced scalability and performance due to hierarchical organization and distributed hashing.
Wireless networks, multicast, mobile ad hoc networks, scalable routing, hashing.
Saumitra M. Das, Himabindu Pucha, Y. Charlie Hu, "Distributed Hashing for Scalable Multicast in Wireless Ad Hoc Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 3, pp. 347-362, March 2008, doi:10.1109/TPDS.2007.70731
[1] C. de Morais Cordeiro, H. Gossain, and D.P. Agrawal, “Multicast over Wireless Mobile Ad Hoc Networks: Present and Future Directions,” IEEE Network, vol. 17, no. 1, Jan.-Feb. 2003.
[2] E.M. Royer and C.E. Perkins, “Multicast Operation of the Ad Hoc On-Demand Distance Vector Routing Protocol,” Proc. ACM MobiCom '99, Aug. 1999.
[3] J.G. Jetcheva and D.B. Johnson, “Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless Ad Hoc Networks,” Proc. ACM MobiHoc '01, Oct. 2001.
[4] S.-J. Lee, M. Gerla, and C.-C. Chiang, “On-Demand Multicast Routing Protocol,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '99), Sept. 1999.
[5] J. Xie, R.R. Talpade, A. Mcauley, and M. Liu, “AMRoute: Ad Hoc Multicast Routing Protocol,” Mobile Networks and Applications, vol. 7, no. 6, pp. 429-439, 2002.
[6] C. Gui and P. Mohapatra, “Efficient Overlay Multicast for Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '03), Mar. 2003.
[7] P. Sinha, R. Sivakumar, and V. Bharghavan, “MCEDAR: Multicast Core-Extraction Distributed Ad Hoc Routing,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '99), Sept. 1999.
[8] L. Ji and S. Corson, “Differential Destination Multicast—A MANET Multicast Routing Protocol for Small Groups,” Proc. IEEE INFOCOM '01, Apr. 2001.
[9] C. Gui and P. Mohapatra, “Scalable Multicasting for Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM '04, Mar. 2004.
[10] J. Luo, P.T. Eugster, and J.-P. Hubaux, “Route-Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks,” Proc. IEEE INFOCOM '03, Mar. 2003.
[11] S. Basagni, I. Chlamtac, and V. Syrotiuk, “Location-Aware Dependable Multicast for Mobile Ad Hoc Networks,” Computer Networks, vol. 36, pp. 659-670, Aug. 2001.
[12] K. Chen and K. Nahrstedt, “Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET,” Proc. IEEE INFOCOM '02, June 2002.
[13] M. Mauve, H. Füßler, J. Widmer, and T. Lang, “Position-Based Multicast Routing for Mobile Ad Hoc Networks,” Technical Report CS TR-03-004, Univ. of Mannheim, 2003.
[14] USCG Navigation Center GPS Page, http://www.navcen.uscg. nil/gpsdefault.html , Jan. 2000.
[15] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Proc. Third ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing (DIALM '99), Aug. 1999.
[16] B. Karp and H. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom 2000, Aug. 2000.
[17] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case Optimal and Average-Case Efficient Geometric Ad Hoc Routing,” Proc. ACM MobiHoc '03, June 2003.
[18] L. Kleinrock and F. Kamoun, “Hierarchical Routing for Large Networks: Performance Evaluation and Optimization,” Computer Networks, vol. 1, pp. 155-174, 1977.
[19] S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, “GHT: A Geographic Hash Table for Data-Centric Storage in Sensornets,” Proc. First ACM Workshop Wireless Sensor Networks and Applications (WSNA '02), Sept. 2002.
[20] J. Li, J. Jannotti, D.S.J.D. Couto, D.R. Karger, and R. Morris, “A Scalable Location Service for Geographic Ad Hoc Routing,” Proc. ACM MobiCom '00, Aug. 2000.
[21] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 1990.
[22] Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, “Geographic Routing Made Practical,” Proc. Second Usenix Symp. Networked Systems Design and Implementation (NSDI '05), May 2005.
[23] C. Carter, S. Yi, P. Ratanchandani, and R. Kravets, “Manycast: Exploring the Space between Anycast and Multicast in Ad Hoc Networks,” Proc. ACM MobiCom, 2003.
[24] H. Takahashi and A. Matsuyama, “An Approximate Solution for the Steiner Problem in Graphs,” Math. Japonica, vol. 24, pp. 573-577, 1980.
[25] E.N. Gilbert and H.O. Pollak, “Steiner Minimal Trees,” SIAM J.Applied Math., vol. 16, pp. 1-20, 1968.
[26] P.M. Ruiz and A.F.G. Skarmeta, “Approximation Algorithms for Minimum Bandwidth Multicast Trees in Wireless Mesh Networks,” Lecture Notes in Computer Science, 2006.
[27] P.M. Ruiz and I. Stojmenovic, “Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks,” Handbook on Approximation Algorithms and Metaheuristics, T. Gonzalez, ed., Chapman and Hall/CRC, 2006.
[28] X. Zeng, R. Bagrodia, and M. Gerla, “Glomosim: A Library for Parallel Simulation of Large-Scale Wireless Networks,” Proc. 12th Workshop Parallel and Distributed Simulation (PADS '98), May 1998.
[29] J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful,” Proc. IEEE INFOCOM '03, Apr. 2003.
[30] S.-J. Lee, W. Su, J. Hsu, M. Gerla, and R. Bagrodia, “A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols,” Proc. IEEE INFOCOM '00, Mar. 2000.
[31] K. Obraczka, G. Tsudik, and K. Viswanath, “Pushing the Limits of Multicast in Ad Hoc Networks,” Proc. 21st Int'l Conf. Distributed Computing Systems (ICDCS '01), Apr. 2001.
[32] R. Boivie, N. Feldman, and C. Metz, “Small Group Multicast: A New Solution for Multicasting on the Internet,” IEEE Internet Computing, vol. 4, no. 3, pp. 75-79, 2000.
[33] I. Stojmenovic, “Localized Network Layer Protocols in Sensor Networks Based on Optimizing Cost over Progress Ratio,” IEEE Network, vol. 20, no. 1, Jan.-Feb. 2006.
[34] J. Sanchez, P. Ruiz, X. Liu, and I. Stojmenovic, “GMR: Geographic Multicast Routing for Wireless Sensor Networks,” Proc. Third Ann. IEEE Conf. Sensor, Mesh, and Ad Hoc Comm. and Networks (SECON), 2006.
[35] S. Wu and K.S. Candan, “GMP: Distributed Geographic Multicast Routing in Wireless Sensor Networks,” Proc. 26th IEEE Intl' Conf. Distributed Computing Systems (ICDCS), 2006.
[36] M. Transier, H. Fuler, J. Widmer, M. Mauve, and W. Effelsberg, “Scalable Position-Based Multicast for Mobile Ad-hoc Networks,” Proc. First Int'l Workshop Broadband Wireless Multimedia: Algorithms, Architectures and Applications (BroadWim '04), Oct. 2004.
[37] I. Stoica, T.S.E. Ng, and H. Zhang, “REUNITE: A Recursive Unicast Approach to Multicast,” Proc. IEEE INFOCOM '00, Mar. 2000.
[38] C. Wu and Y. Tay, “AMRIS: A Multicast Protocol for Ad Hoc Wireless Networks,” Proc. Military Comm. Conf. (MILCOM '99), Nov. 1999.
[39] E. Madruga and J. Garcia-Luna-Aceves, “Scalable Multicasting: The Core Assisted Mesh Protocol,” ACM/Baltzer Mobile Networks and Applications, special issue on management of mobility in distributed systems, vol. 6, no. 1, 2001.
[40] S.M. Das, H. Pucha, and Y.C. Hu, “Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing,” Proc. IEEE INFOCOM '05, Mar. 2005.
[41] X. Li, Y.J. Kim, R. Govindan, and W. Hong et al., “Multi-Dimensional Range Queries in Sensor Networks,” Proc. First ACM Conf. Embedded Networked Sensor Systems (SenSys '03), Nov. 2003.
[42] B. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy, and S. Shenker, “DIFS: A Distributed Index for Features in Sensor Networks,” Proc. First IEEE Int'l Workshop Sensor Network Protocols and Applications (SNPA '03), May 2003.
[43] I. Stojmenovic, “Home Region Based Location Updates and Destination Search Schemes in Ad Hoc Wireless Networks,” Technical Report TR-99-10, School of Information Technology and Eng., Univ. of Ottawa, Sept. 1999.
[44] G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” USC/ISI Technical Report ISI/RR-87-180, Mar. 1987.
[45] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Wireless Networks, vol. 7, no. 6, 2001.
[46] H. Frey and I. Stojmenovic, “On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks,” Proc. ACM MobiCom, 2006.
[47] A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic Routing without Location Information,” Proc. ACM MobiCom '03, Sept. 2003.
13 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool