Fast, efficient, and robust multicast in wireless mesh networks

  • Authors:
  • Ian Chakeres;Chivukula Koundinya;Pankaj Aggarwal

  • Affiliations:
  • Motorola, Bangalore, India;Motorola, Bangalore, India;Motorola, Maitland, Florida

  • Venue:
  • Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

IEEE 802.11s mesh networks are extending the reach and speed of wireless networks, especially in the realm of public safety. For many applications (e.g. situational awareness and emulation of push-to-talk radio) multicast is an important network service. In the future, we expect to see even more multicast traffic in mesh networks, as more bandwidth intensive applications (e.g. video) become commonplace. In existing mesh networks, multicast is often slow, inefficient, and not particularly robust to packet loss. In this paper we describe, propose, and simulate a wide-range of mesh multicast algorithms to determine the most fast, efficient, and robust multicast algorithm. We examine the algorithms under a range of traffic loads and packet error rates. We find that even very simple mechanisms can dramatically improve multicast performance. We also find that complex robustness protocols can be very expensive and may significantly lower the congestion point.