Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks

  • Authors:

  • Melih Onus;Andrea Richa;Kishore Kothapalli;Christian Scheideler

  • Affiliations:

  • Arizona State University, Tempe;Arizona State University, Tempe;Johns Hopkins University;Johns Hopkins University

  • Venue:
  • ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper considers the problem of broadcasting and information gathering in wireless ad-hoc networks, i.e. in wireless networks without any infrastructure in addition to the mobile hosts. Broadcasting is the problem of sending a packet from a source node in the network to all other nodes in the network. Information gathering is the problem of sending one packet each from a subset of the nodes to a single sink node in the network. Most of the proposed theoretical wireless network models oversimplify wireless communication properties. We will use a model that takes into account that nodes have different transmission and interference ranges, and we propose algorithms in this model that achieve a high time and work-efficiency. We present algorithms for broadcasting a single or multiple message(s), and for information gathering. Our algorithms have the advantage that they are very simple and self-stabilizing, and would therefore even work in a dynamic environment. Also, our algorithms require only a constant amount of storage at any host. Thus, our algorithms can be used in wireless systems with very simple devices, such as sensors.