DEAR: Delay-bounded energy-constrained adaptive routing in wireless sensor networks

Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, Chonggang Wang

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

27 Citations (Scopus)

Abstract

Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with reliability, differential delay, and transmission energy consumption constraints in wireless sensor networks. We aim to route the connections in a manner such that link failure does not shut down the entire stream but allows a continuing flow for a significant portion of the traffic along multiple paths. This flexibility enabled by a multi-path routing scheme has the tradeoff of differential delay among the different paths. This requires increased memory in the base station to buffer the traffic until the data arrives on all the paths. Therefore, differential delay between the multiple paths should be bounded in a range to reduce additional hardware cost in the base station. Moreover, the energy consumption constraint should also be satisfied when transmitting packets among multiple paths. We present a pseudo-polynomial time solution to solve a special case of DEAR, representing edge delays as integers. Next, an (1+α)-approximation algorithm is proposed to solve the optimization version of the DEAR problem. An efficient heuristic is provided for the DEAR problem. We present numerical results confirming the advantage of our schemes as the first solution for the DEAR problem.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages1593-1601
Number of pages9
DOIs
StatePublished - 2012
EventIEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States
Duration: Mar 25 2012Mar 30 2012

Other

OtherIEEE Conference on Computer Communications, INFOCOM 2012
CountryUnited States
CityOrlando, FL
Period3/25/123/30/12

Fingerprint

Base stations
Wireless sensor networks
Energy utilization
Approximation algorithms
Energy efficiency
Polynomials
Hardware
Data storage equipment
Costs

Keywords

  • differential delay
  • multi-path routing
  • polynomial time approximation
  • restricted maximum flow
  • wireless sensor network

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Bai, S., Zhang, W., Xue, G., Tang, J., & Wang, C. (2012). DEAR: Delay-bounded energy-constrained adaptive routing in wireless sensor networks. In Proceedings - IEEE INFOCOM (pp. 1593-1601). [6195528] https://doi.org/10.1109/INFCOM.2012.6195528

DEAR : Delay-bounded energy-constrained adaptive routing in wireless sensor networks. / Bai, Shi; Zhang, Weiyi; Xue, Guoliang; Tang, Jian; Wang, Chonggang.

Proceedings - IEEE INFOCOM. 2012. p. 1593-1601 6195528.

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

Bai, S, Zhang, W, Xue, G, Tang, J & Wang, C 2012, DEAR: Delay-bounded energy-constrained adaptive routing in wireless sensor networks. in Proceedings - IEEE INFOCOM., 6195528, pp. 1593-1601, IEEE Conference on Computer Communications, INFOCOM 2012, Orlando, FL, United States, 3/25/12. https://doi.org/10.1109/INFCOM.2012.6195528
Bai S, Zhang W, Xue G, Tang J, Wang C. DEAR: Delay-bounded energy-constrained adaptive routing in wireless sensor networks. In Proceedings - IEEE INFOCOM. 2012. p. 1593-1601. 6195528 https://doi.org/10.1109/INFCOM.2012.6195528
Bai, Shi ; Zhang, Weiyi ; Xue, Guoliang ; Tang, Jian ; Wang, Chonggang. / DEAR : Delay-bounded energy-constrained adaptive routing in wireless sensor networks. Proceedings - IEEE INFOCOM. 2012. pp. 1593-1601
@inproceedings{f4916ca2b6ec46fb92a92c900188027c,
title = "DEAR: Delay-bounded energy-constrained adaptive routing in wireless sensor networks",
abstract = "Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with reliability, differential delay, and transmission energy consumption constraints in wireless sensor networks. We aim to route the connections in a manner such that link failure does not shut down the entire stream but allows a continuing flow for a significant portion of the traffic along multiple paths. This flexibility enabled by a multi-path routing scheme has the tradeoff of differential delay among the different paths. This requires increased memory in the base station to buffer the traffic until the data arrives on all the paths. Therefore, differential delay between the multiple paths should be bounded in a range to reduce additional hardware cost in the base station. Moreover, the energy consumption constraint should also be satisfied when transmitting packets among multiple paths. We present a pseudo-polynomial time solution to solve a special case of DEAR, representing edge delays as integers. Next, an (1+α)-approximation algorithm is proposed to solve the optimization version of the DEAR problem. An efficient heuristic is provided for the DEAR problem. We present numerical results confirming the advantage of our schemes as the first solution for the DEAR problem.",
keywords = "differential delay, multi-path routing, polynomial time approximation, restricted maximum flow, wireless sensor network",
author = "Shi Bai and Weiyi Zhang and Guoliang Xue and Jian Tang and Chonggang Wang",
year = "2012",
doi = "10.1109/INFCOM.2012.6195528",
language = "English (US)",
isbn = "9781467307758",
pages = "1593--1601",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - DEAR

T2 - Delay-bounded energy-constrained adaptive routing in wireless sensor networks

AU - Bai, Shi

AU - Zhang, Weiyi

AU - Xue, Guoliang

AU - Tang, Jian

AU - Wang, Chonggang

PY - 2012

Y1 - 2012

N2 - Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with reliability, differential delay, and transmission energy consumption constraints in wireless sensor networks. We aim to route the connections in a manner such that link failure does not shut down the entire stream but allows a continuing flow for a significant portion of the traffic along multiple paths. This flexibility enabled by a multi-path routing scheme has the tradeoff of differential delay among the different paths. This requires increased memory in the base station to buffer the traffic until the data arrives on all the paths. Therefore, differential delay between the multiple paths should be bounded in a range to reduce additional hardware cost in the base station. Moreover, the energy consumption constraint should also be satisfied when transmitting packets among multiple paths. We present a pseudo-polynomial time solution to solve a special case of DEAR, representing edge delays as integers. Next, an (1+α)-approximation algorithm is proposed to solve the optimization version of the DEAR problem. An efficient heuristic is provided for the DEAR problem. We present numerical results confirming the advantage of our schemes as the first solution for the DEAR problem.

AB - Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with reliability, differential delay, and transmission energy consumption constraints in wireless sensor networks. We aim to route the connections in a manner such that link failure does not shut down the entire stream but allows a continuing flow for a significant portion of the traffic along multiple paths. This flexibility enabled by a multi-path routing scheme has the tradeoff of differential delay among the different paths. This requires increased memory in the base station to buffer the traffic until the data arrives on all the paths. Therefore, differential delay between the multiple paths should be bounded in a range to reduce additional hardware cost in the base station. Moreover, the energy consumption constraint should also be satisfied when transmitting packets among multiple paths. We present a pseudo-polynomial time solution to solve a special case of DEAR, representing edge delays as integers. Next, an (1+α)-approximation algorithm is proposed to solve the optimization version of the DEAR problem. An efficient heuristic is provided for the DEAR problem. We present numerical results confirming the advantage of our schemes as the first solution for the DEAR problem.

KW - differential delay

KW - multi-path routing

KW - polynomial time approximation

KW - restricted maximum flow

KW - wireless sensor network

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

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

U2 - 10.1109/INFCOM.2012.6195528

DO - 10.1109/INFCOM.2012.6195528

M3 - Conference contribution

AN - SCOPUS:84861636303

SN - 9781467307758

SP - 1593

EP - 1601

BT - Proceedings - IEEE INFOCOM

ER -