A framework for analyzing the performance of distributed lifetime-efficient routing schemes in wireless sensor networks

Jalal Habibi, Amir G. Aghdam, Ali Ghrayeb

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (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 shortest paths for the nodes in order to balance the flowing traffic within the network and increase the lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for this vast category of schemes. A framework is provided in this work to analytically derive the best achievable performance 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. In particular, the proposed framework provides the optimal route selection as a benchmark to evaluate the energy efficiency of existing routing algorithms.

Original languageEnglish
Title of host publicationProceedings of the 2013 Research in Adaptive and Convergent Systems, RACS 2013
Pages283-288
Number of pages6
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event2013 Research in Adaptive and Convergent Systems, RACS 2013 - Montreal, QC, Canada
Duration: 1 Oct 20134 Oct 2013

Other

Other2013 Research in Adaptive and Convergent Systems, RACS 2013
CountryCanada
CityMontreal, QC
Period1/10/134/10/13

Fingerprint

Wireless sensor networks
Routing algorithms
Costs
Parallel algorithms
Energy efficiency
Energy utilization

Keywords

  • distributed shortest path routing
  • lifetime maximization
  • multi-parametric programming
  • wireless sensor networks

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Habibi, J., Aghdam, A. G., & Ghrayeb, A. (2013). A framework for analyzing the performance of distributed lifetime-efficient routing schemes in wireless sensor networks. In Proceedings of the 2013 Research in Adaptive and Convergent Systems, RACS 2013 (pp. 283-288) https://doi.org/10.1145/2513228.2516926

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

Proceedings of the 2013 Research in Adaptive and Convergent Systems, RACS 2013. 2013. p. 283-288.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Habibi, J, Aghdam, AG & Ghrayeb, A 2013, A framework for analyzing the performance of distributed lifetime-efficient routing schemes in wireless sensor networks. in Proceedings of the 2013 Research in Adaptive and Convergent Systems, RACS 2013. pp. 283-288, 2013 Research in Adaptive and Convergent Systems, RACS 2013, Montreal, QC, Canada, 1/10/13. https://doi.org/10.1145/2513228.2516926
Habibi J, Aghdam AG, Ghrayeb A. A framework for analyzing the performance of distributed lifetime-efficient routing schemes in wireless sensor networks. In Proceedings of the 2013 Research in Adaptive and Convergent Systems, RACS 2013. 2013. p. 283-288 https://doi.org/10.1145/2513228.2516926
Habibi, Jalal ; Aghdam, Amir G. ; Ghrayeb, Ali. / A framework for analyzing the performance of distributed lifetime-efficient routing schemes in wireless sensor networks. Proceedings of the 2013 Research in Adaptive and Convergent Systems, RACS 2013. 2013. pp. 283-288
@inproceedings{8034b58194e8406f9ac36427e4758e73,
title = "A framework for analyzing the performance of 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 shortest paths for the nodes in order to balance the flowing traffic within the network and increase the lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for this vast category of schemes. A framework is provided in this work to analytically derive the best achievable performance 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. 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, multi-parametric programming, wireless sensor networks",
author = "Jalal Habibi and Aghdam, {Amir G.} and Ali Ghrayeb",
year = "2013",
doi = "10.1145/2513228.2516926",
language = "English",
isbn = "9781450323482",
pages = "283--288",
booktitle = "Proceedings of the 2013 Research in Adaptive and Convergent Systems, RACS 2013",

}

TY - GEN

T1 - A framework for analyzing the performance of distributed lifetime-efficient routing schemes in wireless sensor networks

AU - Habibi, Jalal

AU - Aghdam, Amir G.

AU - Ghrayeb, Ali

PY - 2013

Y1 - 2013

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 shortest paths for the nodes in order to balance the flowing traffic within the network and increase the lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for this vast category of schemes. A framework is provided in this work to analytically derive the best achievable performance 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. 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 shortest paths for the nodes in order to balance the flowing traffic within the network and increase the lifetime. However, the optimal link cost values and the maximum achievable lifetime are not known for this vast category of schemes. A framework is provided in this work to analytically derive the best achievable performance 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. 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 - multi-parametric programming

KW - wireless sensor networks

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

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

U2 - 10.1145/2513228.2516926

DO - 10.1145/2513228.2516926

M3 - Conference contribution

AN - SCOPUS:84891474740

SN - 9781450323482

SP - 283

EP - 288

BT - Proceedings of the 2013 Research in Adaptive and Convergent Systems, RACS 2013

ER -