A transmission range optimization algorithm to avoid energy holes in wireless sensor networks

Vinh Tran-Quang, Phat Nguyen Huu, Takumi Miyoshi

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)3026-3036
Number of pages11
JournalIEICE Transactions on Communications
VolumeE94-B
Issue number11
DOIs
Publication statusPublished - 2011 Nov

Fingerprint

Sensor nodes
Base stations
Wireless sensor networks
Routing algorithms
Dynamic programming
Differential thermal analysis
Energy utilization
Communication

Keywords

  • Dynamic programming
  • Energy efficiency
  • Routing protocol
  • Wireless sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

A transmission range optimization algorithm to avoid energy holes in wireless sensor networks. / Tran-Quang, Vinh; Nguyen Huu, Phat; Miyoshi, Takumi.

In: IEICE Transactions on Communications, Vol. E94-B, No. 11, 11.2011, p. 3026-3036.

Research output: Contribution to journalArticle

@article{35134d5bb23547d9a2be58751135f532,
title = "A transmission range optimization algorithm to avoid energy holes in wireless sensor networks",
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 = "Dynamic programming, Energy efficiency, Routing protocol, Wireless sensor networks",
author = "Vinh Tran-Quang and {Nguyen Huu}, Phat and Takumi Miyoshi",
year = "2011",
month = "11",
doi = "10.1587/transcom.E94.B.3026",
language = "English",
volume = "E94-B",
pages = "3026--3036",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "11",

}

TY - JOUR

T1 - A transmission range optimization algorithm to avoid energy holes in wireless sensor networks

AU - Tran-Quang, Vinh

AU - Nguyen Huu, Phat

AU - Miyoshi, Takumi

PY - 2011/11

Y1 - 2011/11

N2 - 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.

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.

KW - Dynamic programming

KW - Energy efficiency

KW - Routing protocol

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=80155186709&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80155186709&partnerID=8YFLogxK

U2 - 10.1587/transcom.E94.B.3026

DO - 10.1587/transcom.E94.B.3026

M3 - Article

AN - SCOPUS:80155186709

VL - E94-B

SP - 3026

EP - 3036

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 11

ER -