Perfect periodic scheduling for binary tree routing in wireless networks
Perfect periodic scheduling for binary tree routing in wireless networks
复制标题
无线网络中二叉树路由的完美周期调度
DOI：
10.1016/j.ejor.2015.05.031
复制
发表时间：
2015
影响因子：
6.4
通讯作者：
Kim E
中科院分区：
文献类型：
--
作者：
Kim E
在本文中，我们解决了协调无线网状网络数据传输的问题。网格节点的单一任务性质要求在传输过程中同时激活相邻节点。这使得本地网状节点流量与通过网关通过接入网络转发到互联网的流量的协调调度变得非常困难。此外，对于分组数据，协调传输调度的性质对数据吞吐量和能量消耗都有很大影响。完美的定期调度，其中每个需求本身都定期得到服务，提供了一个强大的解决方案。在本文中，我们使用中国剩余定理探讨了完美周期表的模运算性质。当接入网络路由树具有链式或二叉树结构时，我们提供多项式时间优化算法。结果表明，可以同时实现节能和高吞吐量。该方法具有普适性。
In this paper we tackle the problem of co-ordinating transmission of data across a Wireless Mesh Network. The single task nature of mesh nodes imposes simultaneous activation of adjacent nodes during transmission. This makes the co-ordinated scheduling of local mesh node traffic with forwarded traffic across the access network to the Internet via the Gateway notoriously difficult. Moreover, with packet data the nature of the co-ordinated transmission schedule has a big impact upon both the data throughput and energy consumption. Perfect Periodic Scheduling, in which each demand is itself serviced periodically, provides a robust solution. In this paper we explore the properties of Perfect Periodic Schedules with modulo arithmetic using the Chinese Remainder Theorem. We provide a polynomial time, optimisation algorithm, when the access network routing tree has a chain or binary tree structure. Results demonstrate that energy savings and high throughput can be achieved simultaneously. The methodology is generalisable.