DIP3S: A DISTRIBUTED ROUTING ALGORITHM FOR POWER-CONSERVING BROADCASTING IN WIRELESS AD HOC NETWORKS

摘要

Given a set of ad hoc network nodes and a distinguished source node, the minimum-energy broadcasting problem is to assign appropriate power levels to all nodes in the network so that all nodes are reachable from the source, and that the total power usage is as small as possible. In the centralized version of the problem, one finds such power assignment given the entire network topology. In the distributed version, a power assignment is found by exchanging information between neighboring nodes. In this paper, we proposed a new distributed algorithm called the distributed incremental power with potential power saving (DIP3S) to construct a power-effective broadcast tree. Simulations show that the new algorithm not only works better than known distributed algorithms, but also better than the centralized version of the broadcast incremental power (BIP) algorithm, and the newly proposed algorithm based on relative neighborhood graph (RBOP).