Area based beaconless broadcasting in ad hoc and sensor networks

Abstract

We consider the broadcasting problem in ad hoc and sensor networks where no 'Hello' messages are used in order to preserve power and bandwidth. We propose five Area based Beaconless Broadcasting Algorithms (ABBAs). In 2D, each node calculates the ratio P of its perimeter along the circle of transmission radius, which is covered by the transmissions of the same packet. The node then sets or updates its timeout proportionally to P. We also consider an alternative random timeout function. If the perimeter becomes fully covered, the node cancels the retransmission; otherwise, it retransmits. We also describe four 3D ABBAs, these protocols are based on covering three projections, covering particular points on intersection circles, covering intersection points of three spheres, and covering intersection circles. Three ABBAs are the first reliable broadcasting protocols, other than blind flooding. 2D ABBA is compared with two beaconless protocols, OFP and Geoflood, showing its overall superiority.