Overall cost minimization for data aggregation in energy-constrained wireless sensor networks

In wireless sensor networks (WSNs), sensor nodes are usually powered by batteries of limited capacity, which results in dynamic changes of available paths for data aggregation due to node failures caused by energy depletion. For transmitting certain amount of data generated by source node, the overall transmission cost is affected by two major factors, using sequence of available paths and amount of data imposed on each path, which becomes a major issue significantly influencing the efficient usage of the networks. To address this issue, we consider the optimization problem of how to minimize the overall transmission cost of given data delivered from the source node to the sink node in the energy-constrained WSN. Specifically, we first describe the problem on the basis of the minimum cost flow theory and derive the upper bound for the data amount in terms of the number of packets that can be successfully transmitted from the source node to the sink node. Then, we propose specific algorithms to derive the optimal paths and their optimal data amounts, and then achieve the minimized overall transmission cost for the certain amount of data. Extensive simulations show that significant performance enhancement can be achieved by using our proposed algorithms.

[1]  Songwu Lu,et al.  A scalable solution to minimum cost forwarding in large sensor networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[2]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[3]  Davood Izadi,et al.  Data monitoring sensor network for BigNet research Testbed , 2009, 2009 International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP).

[4]  Keith J. Blow,et al.  Radio range adjustment for energy efficient wireless sensor networks , 2006, Ad Hoc Networks.

[5]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[6]  Haohong Wang,et al.  Cross-layer optimization for video summary transmission over wireless networks , 2007, IEEE Journal on Selected Areas in Communications.

[7]  Yong Fan,et al.  A distributed relay node placement strategy based on balanced network lifetime for wireless sensor networks , 2010, 2010 IEEE International Conference on Wireless Communications, Networking and Information Security.

[8]  Jan M. Rabaey,et al.  Energy aware routing for low energy ad hoc sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[9]  Harry Leib,et al.  Performance of truncated type-II hybrid ARQ schemes with noisy feedback over block fading channels , 2000, IEEE Trans. Commun..

[10]  Gang Zhou,et al.  Minimum Cost Routing with a Lifetime Guarantee in Wireless Sensor Networks , 2010, 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing.

[11]  Wei An,et al.  The Maximized Relay Capacity and Optimal Data Transmission for Wireless Sensor Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[12]  H. K. Dai,et al.  On the Bounded-Delay Minimum-Cost Path Problem of Quality-of-Service Routing , 2007, 2007 16th International Conference on Computer Communications and Networks.