Broadcasting and Activity Scheduling in AD HOC Networks

Abstract

In a multi-hop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius. In a flooding or broadcasting task, a source node sends the same message to all the nodes in the network. It is an important task used for paging, alarming, location updates, route discoveries or even routing in highly mobile environments.In the activity-scheduling problem, each node decides between active or passive state so that the network remains connected and its lifetime is maximized. The desirable properties of a scalable flooding or activity-scheduling scheme are reliability (reaching all nodes in a collision free environment), and power and bandwidth efficiency, which can be measured by savings in rebroadcasts. Until recently, blind flooding was used as a solution: each node receiving the message for the first time will re-transmit it. This s olution, however, has collision, contention and redundancy problems. This chapter surveys existing methods for flooding a wireless network intelligently (using omni-directional or directional antennas, with equal or adjusted transmission radii) and for scheduling node activities.

Controlled Gossiping in Ad Hoc Networks

“…Another broad review of different broadcast approaches is presented in [7] by Stojmenović and Wu. The paper provides a taxonomy of broadcasting methods based on their determinism, type of network information required, reliability, and contents of the "hello" and broadcast messages.…”

A Context-Aware Broadcast Protocol for Mobile Wireless Networks

“…In addition to that, it offers a set of mobility models allowing the simulation of a variety of environmental conditions. 5 . Our simulation campaign relied on the following parameters.…”

“…It has been extensively studied in the past and many broadcast protocols dedicated to mobile ad hoc networks have been proposed. Static approaches like SBA, Multipoint-Relaying [5] provide efficient solutions. Furthermore, approaches originating from distributed computing and complex systems [6] [7] were described.…”

On the timeliness of multi-hop non-beaconed ZigBee broadcast communications

“…The formation of a network is managed by a coordinator assigning PAN addresses using an hierarchical tree structure scheme. The propagation of broadcasts in Mobile Ad-Hoc Networks (MANETs) has been extensively studied in [25,23,11] where work has been carried on to mitigate the issue identified by Ni et al [20] as the broadcast storm problem. The main goals were to devise efficient, reliable, fast and simple broadcast algorithms resulting in a small redundancy, improved collision avoidance (from rebroadcasts) and autonomy [10].…”