国产欧美精品一区二区,中文字幕专区在线亚洲,国产精品美女网站在线观看,艾秋果冻传媒2021精品,在线免费一区二区,久久久久久青草大香综合精品,日韩美aaa特级毛片,欧美成人精品午夜免费影视

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.