IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

Scalable Position-Based Multicast for Mobile Ad-hoc Networks

Author(s): Matthias Transier, Holger Füßler, Jörg Widmer, Martin Mauve, Wolfgang Effelsberg.
Title: Scalable Position-Based Multicast for Mobile Ad-hoc Networks
Published: TR-04-002, Department for Mathematics and Computer Science, University of Mannheim, January 2004
Abstract: In this paper we present Scalable Position-Based Multicast (SPBM),a multicast routing protocol for ad-hoc networks. SPBM uses the geographicposition of nodes to provide a highly scalable group membership scheme and toforward data packets in a way that is very robust to changes in the topology ofthe network. SPBM bases the forwarding decision on whether there are groupmembers located in a given direction or not, allowing for a hierarchicalaggregation of membership information: the further away a region is from anintermediate node the higher the level of aggregation should be for thisregion. Because of aggregation, the overhead for group membership managementscales logarithmically with the number of nodes and is independent of thenumber of multicast senders for a given multicast group. Furthermore, we showthat group management overhead is bounded by a constant if the frequency ofmembership updates is scaled down with the aggregation level. This scaling ofthe update frequency is reasonable since the higher the level of aggregationthe lower the number of membership changes for the aggregate. The performanceof SPBM is investigated by means of simulation, including a comparison withODMRP, and through mathematical analysis. We also describe an open sourcekernel implementation of SPBM that has been successfully deployed on hand-heldcomputers.
Bib entry: [XML] [BibTeX]
Download: [PDF]
Responsible for the content: E-MailWE Informatik