WLC07-1: Algorithms for Efficient Broadcasting in Wireless Multi-hop Networks

In wireless multi-hop networks, broadcasting is required for many purposes to disseminate a message to all hosts in the network, such as routing and data dissemination. Flooding is the simplest form of broadcasting, however it causes the ´broadcast storm´ problem in which redundant broadcast and scheduling are two core subproblems to be solved. In this paper, we address the problem of redundant broadcast and design a new completely localized algorithm, i.e, the decision is made based on the local topology information only. The advantage of this algorithms is that it can adapt to the topology change quickly than other non-localized algorithms due to its locality while achieve even better performance in efficiency than the best known non-localized algorithm does.