End-to-End Delay Constrained Routing and Scheduling for Wireless Sensor Networks

End-to-End Delay Constrained Routing and Scheduling for Wireless Sensor Networks
复制标题

无线传感器网络的端到端延迟约束路由和调度

DOI:
10.1109/icc.2011.5962517
复制
发表时间:
2011
期刊:
2011 IEEE International Conference on Communications (ICC)
影响因子:
--
通讯作者:
K. Letaief
K. Letaief
中科院分区:
--
文献类型:
--
作者:
Qing Wang;Pingyi Fan;D. Wu;K. Letaief

文献摘要

被引文献

相似文献

本文研究了多跳无线传感器网络的端到端路由和链路调度问题。在我们考虑的有效的链路调度器的目的是分配时隙给不同的用户,以尽量减少信道的使用受到约束的数据速率,延迟边界,延迟边界违反概率。我们还提出了一个耦合的鲁棒多径路由结构,满足衰落信道的流量限制的基础上,基于SINR的干扰模型。这里的有效容量(EC)模型,然后联合路由和链路调度可以制定为一个混合整数优化问题。此外,由于混合整数优化问题是NP完全的,我们提出了一个计算上可行的EC为基础的列生成算法(EC-CGA)来搜索一个次优解。仿真结果给出了我们所提出的方案的性能进行评估。
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.