IEICE TRANSACTIONS on Communications
A Transmission Range Optimization Algorithm to Avoid Energy Holes in Wireless Sensor Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E94-B No.11 pp.3026-3036
- Publication Date
- 2011/11/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E94.B.3026
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Vinh TRAN-QUANG, Phat NGUYEN HUU, Takumi MIYOSHI, "A Transmission Range Optimization Algorithm to Avoid Energy Holes in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 11, pp. 3026-3036, November 2011, doi: 10.1587/transcom.E94.B.3026.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.3026/_p
Copy
@ARTICLE{e94-b_11_3026,
author={Vinh TRAN-QUANG, Phat NGUYEN HUU, Takumi MIYOSHI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Transmission Range Optimization Algorithm to Avoid Energy Holes in Wireless Sensor Networks},
year={2011},
volume={E94-B},
number={11},
pages={3026-3036},
abstract={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.},
keywords={},
doi={10.1587/transcom.E94.B.3026},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - A Transmission Range Optimization Algorithm to Avoid Energy Holes in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3026
EP - 3036
AU - Vinh TRAN-QUANG
AU - Phat NGUYEN HUU
AU - Takumi MIYOSHI
PY - 2011
DO - 10.1587/transcom.E94.B.3026
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2011
AB - 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.
ER -
English
