arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.4465cs.NI
收藏

不可靠信道下多跳无线传感器网络端到端时延保证

Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks over Unreliable Channels

I-Hong Hou

摘要:

无线传感器网络已越来越多地用于大面积的实时监控。在这样的应用中,重要的是支持端到端的延迟约束的数据包交付,即使相应的流需要多跳传输。除了延迟约束之外,实时监控的每个流可能需要对满足延迟约束的分组的吞吐量的一些保证。此外,由于无线传感器网络通常部署在具有挑战性的环境中,因此特别考虑不可靠的无线传输的影响是很重要的。在本文中,我们研究的问题,提供端到端的延迟保证多跳无线网络。我们提出了一个模型,共同考虑端到端的延迟约束和流量的吞吐量要求,需要多跳传输,无线传输的不可靠性。我们开发了一个设计可行性最优政策的框架。然后,我们证明了这个框架的效用,考虑两种类型的系统:一个传感器配备了全双工无线电,另一个传感器配备了半双工无线电。当传感器配备全双工无线电时,我们提出了一种在线分布式调度策略,并证明了该策略是可行的最优。我们还提供了一个启发式的传感器配备半双工无线电系统。我们表明,这种启发式仍然是可行的最佳的一些拓扑结构。

英文摘要:

Wireless sensor networks have been increasingly used for real-time surveillance over large areas. In such applications, it is important to support end-to-end delay constraints for packet deliveries even when the corresponding flows require multi-hop transmissions. In addition to delay constraints, each flow of real-time surveillance may require some guarantees on throughput of packets that meet the delay constraints. Further, as wireless sensor networks are usually deployed in challenging environments, it is important to specifically consider the effects of unreliable wireless transmissions. In this paper, we study the problem of providing end-to-end delay guarantees for multi-hop wireless networks. We propose a model that jointly considers the end-to-end delay constraints and throughput requirements of flows, the need for multi-hop transmissions, and the unreliable nature of wireless transmissions. We develop a framework for designing feasibility-optimal policies. We then demonstrate the utility of this framework by considering two types of systems: one where sensors are equipped with full-duplex radios, and the other where sensors are equipped with half-duplex radios. When sensors are equipped with full-duplex radios, we propose an online distributed scheduling policy and proves the policy is feasibility-optimal. We also provide a heuristic for systems where sensors are equipped with half-duplex radios. We show that this heuristic is still feasibility-optimal for some topologies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑