A Transmission Range Optimization Algorithm to Avoid Energy Holes in Wireless Sensor Networks


IEICE TRANSACTIONS on Communications   Vol.E94-B    No.11    pp.3026-3036
Publication Date: 2011/11/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E94.B.3026
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
energy efficiency,  routing protocol,  dynamic programming,  wireless sensor networks,  

Full Text: PDF>>
Buy this Article

The many-to-one communication nature of wireless sensor networks (WSNs) leads to an unbalanced traffic distribution, and, accordingly, sensor nodes closer to the base station have to transmit more packets than those at the periphery of the network. This problem causes the nodes closer to the base station to deplete their energy prematurely, forming a hole surrounding the base station. This phenomenon is called the energy hole problem, and it severely reduces the network lifetime. In this paper, we present a cooperative power-aware routing algorithm for uniformly deployed WSNs. The proposed algorithm is based on the idea of replacing the constant transmission range of relaying sensor nodes with an adjusted transmission range, in such a way that each individual node consumes its energy smoothly. We formulate the dynamic transmission range adjustment optimization (DTA) problem as a 0-1 Multiple Choice Knapsack Problem (0-1 MCKP) and present a dynamic programming method to solve the optimization problem. Simulations confirm that the proposed method helps to balance the energy consumption of sensor nodes, avoiding the energy hole problem and extending the network lifetime.