Skip to main content
Log in

A hierarchical approach to position-based multicast for mobile ad-hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In this paper we present Scalable Position-Based Multicast (SPBM), a multicast routing protocol for ad-hoc networks. SPBM uses the geographic position of nodes to provide a highly scalable group membership scheme and to forward data packets in a way that is very robust to changes in the topology of the network. SPBM bases the forwarding decision on whether or not there are group members located in a given direction, allowing a hierarchical aggregation of membership information. The farther away a region is from an intermediate node, the higher the level of aggregation for this region should be. Because of aggregation, the overhead for group membership management scales logarithmically with the number of nodes and is independent of the number of multicast senders for a given multicast group. Furthermore, we show that group management overhead is bounded by a constant if the frequency of membership updates is scaled down with the aggregation level. This scaling of the update frequency is reasonable since the higher the level of aggregation is, the lower the number of membership changes for the aggregate will be. The performance of SPBM is investigated by means of simulation, including a comparison with ODMRP, and through mathematical analysis. We also describe an open source kernel implementation of SPBM that has been successfully deployed on hand-held computers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. Basagni, I. Chlamtac, and V. R. Syrotiuk, “Location aware, dependable multicast for mobile ad hoc networks,” in: Computer Networks, 36(5–6):659–670, August 2001.

  2. B. H. Bloom, “Space/Time Trade-offs in Hash Coding with Allowable Errors,” in: Communications of the ACM, 13(7):422–426, July 1970.

  3. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with guaranteed delivery in ad hoc Wireless Networks,” in: Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications (DIAL-M ’99), Seattle, WS (Aug. 1999), pp. 48–55.

  4. K. Chen and K. Nahrstedt, “Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET,” in: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), New York City, New York (June 2002), pp. 1192–1201.

  5. C.-C. Chiang, M. Gerla, and L. Zhang, “Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile Wireless Networks,” ACM-Baltzer Journal of Cluster Computing: Special Issue on Mobile Computing, 1(2):187–196, December 1998.

  6. J. Crowcroft and I. Phillips, TCP/IP and Linux Protocol Implementation. John Wiley & Sons, 2002.

  7. S. K. Das, B. S. Manoj, and C. S. R. Murthy, “A Dynamic Core Based Multicast Routing Protocol for Ad hoc Wireless Networks,” in: Proceedings of the third ACM international symposium on Mobile and ad hoc networking & computing (MobiHoc ’02), Lausanne, Switzerland (June 2002), pp. 24–35.

  8. V. Devarapalli and D. Sidhu, “MZR: A Multicast Protocol for Mobile Ad Hoc Networks,” in: Proceedings of the IEEE International Conference on Communications (ICC), volume 3, Helsinki, Finland (June 2001), pp. 886–891.

  9. G. G. Finn, “Routing and addressing problems in large metropolitan-scale internetworks,” Technical Report ISI/RR-87-180, ISI, March 1987.

  10. H. Füßler, J. Widmer, M. Käsemann, M. Mauve, and H. Hartenstein. “Contention-Based Forwarding for Mobile Ad-Hoc Networks,” Elsevier’;s Ad Hoc Networks, 1(4):351–369, 2003.

  11. J. J. Garcia-Luna-Aceves and E. L. Madruga, “A Multicast Routing Protocol for Ad-Hoc Networks,” in: Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 1999), New York City, New York (March 1999), pp. 784–792.

  12. S. Giordano, I. Stojmenovic, and L. Blažević, “Position-Based Routing Algorithms for AdHoc Networks: A Taxonomy,” in: D.-Z. Du, editor, Ad Hoc Wireless Networking. Kluwer Academic Publishers, November 2003.

  13. J. G. Jetcheva and D. B. Johnson, “Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless Ad Hoc Networks,” in: Proceedings of the second ACM international symposium on Mobile and ad hoc networking & computing (MobiHoc ’01), Long Beach, California (Oct. 2001), pp. 33–44.

  14. L. Ji and M. S. Corson, “A Lightweight Adaptive Multicast Algorithm,” in: Proceedings of IEEE Global Telecommunications Conference (Globecom1998), Sydney, Australia (November 1998), pp. 1036–1042.

  15. L. Ji and M. S. Corson, “Differential Destination Multicast—A MANET Multicast Routing Protocol for Small Groups,” in: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), Anchorage, Alaska (April 2001), pp. 1192–1202.

  16. D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” in: T. Imielinski and H. Korth, editors, Mobile Computing, vol. 353, pp. 153–181. Kluwer Academic Publishers, 1996.

  17. B. N. Karp and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” in: Proceedings of the sixth annual ACM/IEEE International Conference on Mobile computing and networking (MobiCom ’00), Boston, Massachusetts (Aug. 2000), pp. 243–254.

  18. Y.-B. Ko and N. H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” in: Proceedings of the fourth annual ACM/IEEE International Conference on Mobile computing and networking (MobiCom ’98), Dallas, Texas (Oct. 1998), pp. 66–75.

  19. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, “Geometric Ad-Hoc Routing: Of Theory and Practice,” in: Proceedings of the 22nd ACM Annual Symposium on Principles of Distributed Computing (PODC ’03), Boston, MA (July 2003), pp. 63–72.

  20. F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case optimal and average-case efficient geometric ad-hoc routing,” in: Proceedings of the fourth ACM international symposium on Mobile and ad hoc networking & computing (MobiHoc ’03), Annapolis, Maryland (June 2003), pp. 267–278.

  21. S. Lee and C. Kim, “Neighbor Supporting Ad hoc Multicast Routing Protocol,” in: Proceedings of the first ACM international symposium on Mobile and ad hoc networking & computing (MobiHoc ’00), Boston, Massachusetts (Aug. 2000), pp. 37–44.

  22. S.-J. Lee, M. Gerla, and C.-C. Chiang, “On-Demand Multicast Routing Protocol,” in: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC ’99), New Orleans, LA (Sept. 1999), pp. 1298–1302.

  23. S.-J. Lee, W. Su, and M. Gerla. On-Demand Multicast routing Protocol (ODMRP) for Ad Hoc Networks. Internet Draft, draft-ietf-manet-odmrp-02.txt, work in progress, 2000.

  24. S.-J. Lee, W. Su, J. Hsu, M. Gerla, and R. Bagrodia, “A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols,” in: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), Tel Aviv, Israel (March 2000), pp. 565–574.

  25. M. Liu, R. R. Talpade, A. McAuley, and E. Bommaiah, “AMRoute: Adhoc Multicast Routing Protocol,” Technical report, CSHCN, University of Maryland, 1999.

  26. M. Mauve, H. Füßler, J. Widmer, and T. Lang, “Position-Based Multicast Routing for Mobile Ad-Hoc Networks,” Technical Report TR-03-004, Department of Computer Science, University of Mannheim, 2003.

  27. M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad-Hoc Networks,” in: IEEE Network, 15(6):30–39, November/December 2001.

  28. H. Moustafa and H. Labiod, “SRMP: A Mesh-based Protocol for Multicast Communication in ad hoc networks,” in: 2002 International Conference on Third Generation Wireless and Beyond, San Francisco, CA (May 2002), pp. 43–48.

  29. J. Nonnenmacher and E. W. Biersack, “Scalable Feedback for Large Groups,” in: IEEE/ACM Transactions on Networking (TON), 7(3):375–386, 1999.

  30. The ns-2 network simulator. http://www.isi.edu/nsnam/ns/.

  31. Wireless multicast extensions for ns-2.1b8. http://www.monarch.cs.rice.edu/multicast_extensions.html.

  32. E. M. Royer and C. E. Perkins, “Multicast Operation of the Ad-hoc On-Demand Distance Vector Routing Protocol,” in: Proceedings of the fifth annual ACM/IEEE International Conference on Mobile computing and networking (MobiCom ’99), Seattle, Washington (Aug. 1999), pp. 207–218.

  33. P. Sinha, R. Sivakumar, and V. Bharghavan, “MCEDAR: Multicast Core-Extraction Distributed Ad hoc Routing,” in: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC ’99), New Orleans, LA (Sept. 1999), pp. 1313–1317.

  34. C.-K. Toh, G. Guichal, and S. Bunchua, “ABAM: On-Demand Associativity-Based Multicast Routing for Ad Hoc Mobile Networks,” in: Proceedings of the IEEE 50th Vehicular Technology Conference (VTC’;00), Boston, MA (Sept. 2000), pp. 987–993.

  35. M. Transier, H. Füßler, T. Butter, and W. Effelsberg, “Implementing Scalable Position-Based Multicast for the Linux Kernel,” in: Proceedings of the 2nd German Workshop on Mobile Ad-hoc Networking (WMAN 2004), Ulm, Germany, September 2004.

  36. C. W. Wu and Y. C. Tay, “AMRIS: A Multicast Protocol for Ad Hoc Wireless Networks,” in: Proc. of IEEE Military Communications Conference (MILCOM), Atlantic City, NJ (Nov. 1999), pp. 25–29.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthias Transier.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Transier, M., Füßler, H., Widmer, J. et al. A hierarchical approach to position-based multicast for mobile ad-hoc networks. Wireless Netw 13, 447–460 (2007). https://doi.org/10.1007/s11276-006-9199-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-9199-x

Keywords

Navigation