A Novel Spatial TDMA Scheduler for Concurrent Transmit/Receive Wireless Mesh Networks
A Novel Spatial TDMA Scheduler for Concurrent Transmit/Receive Wireless Mesh Networks
复制标题
一种用于并发发送/接收无线网状网络的新型空间 TDMA 调度器
DOI：
10.1109/aina.2010.13
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Chen Meng
中科院分区：
文献类型：
--
作者：
Kwan;S. Soh;Chen Meng
无线网状网络的成功取决于其支持带宽密集型多媒体应用的能力。增加网络容量的一个关键方法是为无线路由器配备智能天线。因此，这些路由器能够将其传输集中在特定的邻居上，同时对其他节点造成很少的干扰。然而，这是假设存在一种链路调度算法，该算法以最大化网络容量的方式激活链路。为此，我们提出了一种新颖的链路激活算法，该算法最大限度地创建二部图，然后用于导出每个路由器的链路激活时间表。我们已经在节点度数和节点数量不断增加的各种拓扑上验证了所提出的算法。通过大量的仿真研究，我们发现我们的算法在每个时隙激活的链路数量、超帧长度、计算时间、路由长度和端到端延迟方面优于现有算法。
The success of wireless mesh networks hinges on their ability to support bandwidth intensive, multi-media applications. A key approach to increasing network capacity is to equip wireless routers with smart antennas. These routers, therefore, are capable of focusing their transmission on specific neighbors whilst causing little interference to other nodes. This, however, assumes there is a link scheduling algorithm that activates links in a way that maximizes network capacity. To this end, we propose a novel link activation algorithm that maximally creates a bipartite graph, which is then used to derive the link activation schedule of each router. We have verified the proposed algorithm on various topologies with increasing node degrees as well as node numbers. From extensive simulation studies, we find that our algorithm outperforms existing algorithms in terms of the number of links activated per slot, superframe length, computation time, route length and end-to-end delay.