利用节点选择的分布式无线自组网区域调度算法设计

The Design of Distributed Ad Hoc Network Regional Scheduling Algorithm Using Node Selection

摘要:

在无线自组网中,调度算法允许节点共享无线信道以便成功解码并传输数据。但由于冲突问题,调度算法需要高效最大化空间复用且最小化重发,为了能够使算法以一种分布式的方式实现,还应考虑网络中节点的协调检测选择。为此,提出一种基于节点选择的分布式无线自组网区域调度算法,使用随机几何推导了一种最优保护区域,该区域能以一种分布式方法实现,并根据节点接受的“Hello”消息包选择合适邻居节点。在该算法中,随着不同网络参数如路径损失、中断、扩频增益和节点密度的变化,最优保护区域大小和性能也在变化。仿真结果表明,该算法的性能接近于高复杂度和最优的集中算法性能,并且允许新链路的建立而不影响正在进行的数据传输。

Abstract:

Scheduling algorithms in ad hoc networks allow nodes to share the wireless channel so that concurrent transmissions can be decoded successfully. Scheduling needs to be efficient to maximize spatial reuse and minimize retransmissions due to collisions. In order to make the scheduling algorithm be easily implementable in a distributed manner, the coordination detection options of nodes in the network should also be considered. Therefore, this paper proposes a distributed ad hoc network regional scheduling algorithm based on node selection. Using stochastic geometry, we derive a near-optimal guard zone which can be easily realized in a distributed manner and according to the “Hello” message packet we can choose the right neighbor node. In this algorithm, the size and performance of optimal protection area are changing varies with different network parameters like path loss, outage, spreading gain, and node density. The simulation results show that the performance of this algorithm is close to the high complexity and optimal performance of centralized algorithm and it allows the establishment of new links without affecting the ongoing data transmission.