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 - Ben Letaief, Khaled
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
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. © 2011 IEEE.
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. © 2011 IEEE.
UR - http://www.scopus.com/inward/record.url?scp=80052140663&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-80052140663&origin=recordpage
U2 - 10.1109/icc.2011.5962517
DO - 10.1109/icc.2011.5962517
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781612842332
T3 - IEEE International Conference on Communications
BT - 2011 IEEE International Conference on Communications, ICC 2011
T2 - 2011 IEEE International Conference on Communications, ICC 2011
Y2 - 5 June 2011 through 9 June 2011
ER -