A generalized probabilistic topology control for wireless sensor networks

Topology control is an effective method to improve energy-efficiency and increase the capacity in Wireless Sensor Networks (WSNs). To fully characterize WSNs with lossy links, we propose a novel probabilistic network model. Under this model, we meter the network quality using network reachability defined as the minimal of the upper limit of the end-to-end delivery ratio between any pair of nodes in the network. We attempt to find a minimal transmitting power for each node while the network reachability is above a given application-specified threshold, called probabilistic topology control (PTC). We prove that PTC is NP-hard and propose a fully distributed algorithm called BRASP. We prove that BRASP has the guaranteed performance. Two rules that must be followed by any algorithm have been identified. We conduct both simulations and prototype implementations based an 18-TelosB-node test-bed. The experimental results show that the network energy-efficiency can be improved by up to 250%. The average node degree is reduced by 50% which will lead to a great benefit for the network caDacitv. © 2009 IEEE

A Generalized Probabilistic Topology Control for Wireless Sensor Networks

Topology control is an effective method to improve the energy-efficiency and increase the communication capacity of Wireless Sensor Networks (WSNs). Traditional topology control algorithms are based on deterministic model that fails to consider lossy links which provide only probabilistic connectivity. Noticing this fact, we propose a novel probabilistic network model. We meter the network connectivity using network reachability. It is defined as the minimal of the upper limit of the end-to-end delivery ratio between any pair of nodes in the network. We attempt to find a minimal transmission power for each node while the network reachability is above a given application-specified threshold. The whole procedure is called probabilistic topology control (PTC). We prove that PTC is NP-hard and propose a fully distributed algorithm called BRASP. We prove that BRASP has the guaranteed performance and the communication overhead is O(vertical bar E vertical bar + vertical bar V vertical bar). The experimental results show that the network energy-efficiency can be improved by up to 250% and the average node degree is reduced by 50%