Energy efficient all-to-all broadcasting for situation awareness in wireless ad hoc networks ?
Ad hoc wireless networks have nodes with limited battery power and energy efficient communications are critical in such networks. In this paper, we consider energy efficient one-to-all and all-to-all broadcast operations in ad hoc networks. It is assumed that nodes have power control, and therefore, can adjust the range of their transmissions. Given a network of N nodes in a playing field of size DD, we first establish a lower bound and then present a simple scheme for one-to-all broadcast operation. Using simulations we show that the average energy cost of broadcasting from any source is within 25% of this lower bound in a network of 100 nodes in small fields of size and . In the situation awareness application, each node periodically transmits a small packet of 60 bytes to all other nodes in the network. For this all-to-all broadcast communication, we present a cluster scheme when nodes are allowed to transmit long distances, and a chain-based scheme when nodes are limited to only short distances. Our schemes for situation awareness significantly improve the life of the network compared to a scheme with direct transmissions.
energy efficiency broadcasting situation awareness wireless networks clustering greedy chain