End-to-end delay constrained routing and scheduling for wireless sensor networks

Qing Wang, Pingyi Fan, Dapeng Oliver Wu, Khaled Letaief

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

9 Citations (Scopus)

Abstract

In the paper, we consider the end-to-end routing and link scheduling problem for multi-hop wireless sensor networks. The efficient link scheduler under our consideration is intended to assign time slots to different users so as to minimize channel usage subject to constraints on data rate, delay bound, and delay bound violation probability. We also present a coupled robust multi-path routing structure satisfying the restriction of flows over fading channels based on an SINR-based interference model. Here the effective capacity (EC) model is used and then the joint routing and link scheduling can be formulated as a mixed integer optimization problem. Moreover, because the mixed integer optimization problem is NP-complete, we propose a computationally feasible EC-based Column-Generation-Algorithm (EC-CGA) to search for a sub-optimal solution. Simulation results are given to evaluate the performance of our proposed scheme.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Communications, ICC 2011
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: 5 Jun 20119 Jun 2011

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period5/6/119/6/11

Fingerprint

Wireless sensor networks
Scheduling
Fading channels
Computational complexity

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Wang, Q., Fan, P., Wu, D. O., & Letaief, K. (2011). End-to-end delay constrained routing and scheduling for wireless sensor networks. In 2011 IEEE International Conference on Communications, ICC 2011 [5962517] https://doi.org/10.1109/icc.2011.5962517

End-to-end delay constrained routing and scheduling for wireless sensor networks. / Wang, Qing; Fan, Pingyi; Wu, Dapeng Oliver; Letaief, Khaled.

2011 IEEE International Conference on Communications, ICC 2011. 2011. 5962517.

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

Wang, Q, Fan, P, Wu, DO & Letaief, K 2011, End-to-end delay constrained routing and scheduling for wireless sensor networks. in 2011 IEEE International Conference on Communications, ICC 2011., 5962517, 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, Japan, 5/6/11. https://doi.org/10.1109/icc.2011.5962517
Wang Q, Fan P, Wu DO, Letaief K. End-to-end delay constrained routing and scheduling for wireless sensor networks. In 2011 IEEE International Conference on Communications, ICC 2011. 2011. 5962517 https://doi.org/10.1109/icc.2011.5962517
Wang, Qing ; Fan, Pingyi ; Wu, Dapeng Oliver ; Letaief, Khaled. / End-to-end delay constrained routing and scheduling for wireless sensor networks. 2011 IEEE International Conference on Communications, ICC 2011. 2011.
@inproceedings{1650297809f34f8bb5394a8350ee28d1,
title = "End-to-end delay constrained routing and scheduling for wireless sensor networks",
abstract = "In the paper, we consider the end-to-end routing and link scheduling problem for multi-hop wireless sensor networks. The efficient link scheduler under our consideration is intended to assign time slots to different users so as to minimize channel usage subject to constraints on data rate, delay bound, and delay bound violation probability. We also present a coupled robust multi-path routing structure satisfying the restriction of flows over fading channels based on an SINR-based interference model. Here the effective capacity (EC) model is used and then the joint routing and link scheduling can be formulated as a mixed integer optimization problem. Moreover, because the mixed integer optimization problem is NP-complete, we propose a computationally feasible EC-based Column-Generation-Algorithm (EC-CGA) to search for a sub-optimal solution. Simulation results are given to evaluate the performance of our proposed scheme.",
author = "Qing Wang and Pingyi Fan and Wu, {Dapeng Oliver} and Khaled Letaief",
year = "2011",
doi = "10.1109/icc.2011.5962517",
language = "English",
isbn = "9781612842332",
booktitle = "2011 IEEE International Conference on Communications, ICC 2011",

}

TY - GEN

T1 - End-to-end delay constrained routing and scheduling for wireless sensor networks

AU - Wang, Qing

AU - Fan, Pingyi

AU - Wu, Dapeng Oliver

AU - Letaief, Khaled

PY - 2011

Y1 - 2011

N2 - In the paper, we consider the end-to-end routing and link scheduling problem for multi-hop wireless sensor networks. The efficient link scheduler under our consideration is intended to assign time slots to different users so as to minimize channel usage subject to constraints on data rate, delay bound, and delay bound violation probability. We also present a coupled robust multi-path routing structure satisfying the restriction of flows over fading channels based on an SINR-based interference model. Here the effective capacity (EC) model is used and then the joint routing and link scheduling can be formulated as a mixed integer optimization problem. Moreover, because the mixed integer optimization problem is NP-complete, we propose a computationally feasible EC-based Column-Generation-Algorithm (EC-CGA) to search for a sub-optimal solution. Simulation results are given to evaluate the performance of our proposed scheme.

AB - In the paper, we consider the end-to-end routing and link scheduling problem for multi-hop wireless sensor networks. The efficient link scheduler under our consideration is intended to assign time slots to different users so as to minimize channel usage subject to constraints on data rate, delay bound, and delay bound violation probability. We also present a coupled robust multi-path routing structure satisfying the restriction of flows over fading channels based on an SINR-based interference model. Here the effective capacity (EC) model is used and then the joint routing and link scheduling can be formulated as a mixed integer optimization problem. Moreover, because the mixed integer optimization problem is NP-complete, we propose a computationally feasible EC-based Column-Generation-Algorithm (EC-CGA) to search for a sub-optimal solution. Simulation results are given to evaluate the performance of our proposed scheme.

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

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

U2 - 10.1109/icc.2011.5962517

DO - 10.1109/icc.2011.5962517

M3 - Conference contribution

AN - SCOPUS:80052140663

SN - 9781612842332

BT - 2011 IEEE International Conference on Communications, ICC 2011

ER -