Message Transmission Scheduling on Tandem Multi-hop Lossy Wireless Links
Message Transmission Scheduling on Tandem Multi-hop Lossy Wireless Links
复制标题
串联多跳有损无线链路的消息传输调度
DOI：
10.1007/978-3-319-33936-8_3
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
M. Tsuru
中科院分区：
文献类型：
--
作者：
Agussalim;M. Tsuru
本文提出了一个框架上的消息传输调度的一个简单的串联多跳传输模型与有损不可靠的无线链路，其中每个ofN节点周期性地产生一个消息，每T时隙。这种模型具有实际重要性，例如，在野外的低成本串联传感器网络中。每个消息可以在单个时隙内发送到相邻节点，并且应该在T个时隙内以存储等待转发的方式从其源节点中继到串联边缘的网关之一。我们的框架包括：（i）由中央服务器解析地导出的所有链路上的静态全局时隙分配;以及（ii）在每个链路上的分配时隙上利用基于简单XOR网络编码的主动恢复进行传输的本地消息选择。仿真结果表明，所有的消息被成功地传递到服务器（通过网关）所提出的框架的概率是可比的，甚至优于基于ACK的反应式恢复计划。
This paper proposes a framework for message transmission scheduling on a simple tandem multi-hop transmission model with lossy unreliable wireless links, where each ofNnodes periodically generates a message everyTtime-slots. Such a model is of practical importance, e.g., in low-cost serially-arranged sensor networks in the wild. Each message can be transmitted to an adjacent in a single time-slot, and should be relayed in a store-wait-and-forward manner from its source node to one of gateways at the edges of the tandem withinTtime-slots. Our framework consists of: (i) a static global time-slot assignment over all links analytically derived by a central server; and (ii) a local message selection for transmission with a simple XOR network coding-based proactive recovery over assigned time-slots on each link. Simulation results show the probability that all messages are successfully delivered to the server (via gateways) by the proposed framework is comparable to or even better than that by ACK-based reactive recovery schemes.