A framework for evaluating the best achievable performance by distributed lifetime-efficient routing schemes in wireless sensor networks

Jalal Habibi, Amir G. Aghdam, Ali Ghrayeb

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain the shortest paths for the nodes to balance the flowing traffic within the network and increase its lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for the majority of the existing schemes. A framework is provided in this work to analytically derive the best achievable performance that can be obtained by any distributed routing algorithm based on the shortest-path approach. Given a network configuration and an energy consumption model, the presented framework provides the optimal link cost assignment which yields the maximum lifetime in a distributed shortest-path routing strategy. The results are extended to the case of variable link cost assignment as well. A heuristic algorithm is also developed to obtain approximate solutions to the best performance problem with limited computational complexity. In particular, the proposed framework provides the optimal route selection as a benchmark to evaluate the energy efficiency of existing routing algorithms.

Original languageEnglish
Article number7042328
Pages (from-to)3231-3246
Number of pages16
JournalIEEE Transactions on Wireless Communications
Volume14
Issue number6
DOIs
Publication statusPublished - 1 Jun 2015

Fingerprint

Wireless Sensor Networks
Wireless sensor networks
Lifetime
Routing
Shortest path
Costs
Routing algorithms
Routing Algorithm
Assignment
Heuristic algorithms
Distributed Algorithms
Energy Efficiency
Energy Efficient
Parallel algorithms
Heuristic algorithm
Energy Consumption
Energy efficiency
Assign
Computational complexity
Computational Complexity

Keywords

  • Distributed shortest-path routing
  • Lifetime maximization
  • Minimum-cost routing
  • Multi-parametric programming
  • Wireless sensor networks

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

A framework for evaluating the best achievable performance by distributed lifetime-efficient routing schemes in wireless sensor networks. / Habibi, Jalal; Aghdam, Amir G.; Ghrayeb, Ali.

In: IEEE Transactions on Wireless Communications, Vol. 14, No. 6, 7042328, 01.06.2015, p. 3231-3246.

Research output: Contribution to journalArticle

@article{311b0308ef514cada492833b6769ac6c,
title = "A framework for evaluating the best achievable performance by distributed lifetime-efficient routing schemes in wireless sensor networks",
abstract = "This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain the shortest paths for the nodes to balance the flowing traffic within the network and increase its lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for the majority of the existing schemes. A framework is provided in this work to analytically derive the best achievable performance that can be obtained by any distributed routing algorithm based on the shortest-path approach. Given a network configuration and an energy consumption model, the presented framework provides the optimal link cost assignment which yields the maximum lifetime in a distributed shortest-path routing strategy. The results are extended to the case of variable link cost assignment as well. A heuristic algorithm is also developed to obtain approximate solutions to the best performance problem with limited computational complexity. In particular, the proposed framework provides the optimal route selection as a benchmark to evaluate the energy efficiency of existing routing algorithms.",
keywords = "Distributed shortest-path routing, Lifetime maximization, Minimum-cost routing, Multi-parametric programming, Wireless sensor networks",
author = "Jalal Habibi and Aghdam, {Amir G.} and Ali Ghrayeb",
year = "2015",
month = "6",
day = "1",
doi = "10.1109/TWC.2015.2403351",
language = "English",
volume = "14",
pages = "3231--3246",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - A framework for evaluating the best achievable performance by distributed lifetime-efficient routing schemes in wireless sensor networks

AU - Habibi, Jalal

AU - Aghdam, Amir G.

AU - Ghrayeb, Ali

PY - 2015/6/1

Y1 - 2015/6/1

N2 - This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain the shortest paths for the nodes to balance the flowing traffic within the network and increase its lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for the majority of the existing schemes. A framework is provided in this work to analytically derive the best achievable performance that can be obtained by any distributed routing algorithm based on the shortest-path approach. Given a network configuration and an energy consumption model, the presented framework provides the optimal link cost assignment which yields the maximum lifetime in a distributed shortest-path routing strategy. The results are extended to the case of variable link cost assignment as well. A heuristic algorithm is also developed to obtain approximate solutions to the best performance problem with limited computational complexity. In particular, the proposed framework provides the optimal route selection as a benchmark to evaluate the energy efficiency of existing routing algorithms.

AB - This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain the shortest paths for the nodes to balance the flowing traffic within the network and increase its lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for the majority of the existing schemes. A framework is provided in this work to analytically derive the best achievable performance that can be obtained by any distributed routing algorithm based on the shortest-path approach. Given a network configuration and an energy consumption model, the presented framework provides the optimal link cost assignment which yields the maximum lifetime in a distributed shortest-path routing strategy. The results are extended to the case of variable link cost assignment as well. A heuristic algorithm is also developed to obtain approximate solutions to the best performance problem with limited computational complexity. In particular, the proposed framework provides the optimal route selection as a benchmark to evaluate the energy efficiency of existing routing algorithms.

KW - Distributed shortest-path routing

KW - Lifetime maximization

KW - Minimum-cost routing

KW - Multi-parametric programming

KW - Wireless sensor networks

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

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

U2 - 10.1109/TWC.2015.2403351

DO - 10.1109/TWC.2015.2403351

M3 - Article

VL - 14

SP - 3231

EP - 3246

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 6

M1 - 7042328

ER -