Self-adaptive competition window adjusting method based on interference analysis

Abstract

The invention discloses a self-adaptive competition window adjusting algorithm based on interference analysis and belongs to the technical field of wireless communication. The method is suitable for a time slot Aloha mechanism and comprises the steps of: determining a competition window value and back-off time, namely counting collision times and successful times in a period, acquiring corresponding channel busy indexes according to the counted values, and updating the competition window value according to the channel busy indexes when a next period begins; and determining back-off time, namely performing interference analysis on all nodes, determining a neighboring node number of each node and accordingly acquiring a quantile, and choosing the back-off time according to the quantile values when the nodes are successfully sent or collided. According to the self-adaptive competition window adjusting algorithm, the interference analysis is used for choosing the back-off time, so that the algorithm is low in complexity, and network time delay and collision probability are effectively reduced, and throughout performance is improved.

Description

technical field [0001] The invention relates to an adaptive contention window adjustment algorithm based on interference analysis in the ALOHA protocol, and belongs to the technical field of wireless communication. Background technique [0002] With the rapid development of wireless communication technology, in order to better share channel resources, we need to continuously optimize the MAC layer protocol. As a specific competition solution in the MAC protocol, the backoff mechanism determines the waiting time before each node sends data. The purpose is to ensure the effectiveness of access and achieve reasonable utilization when multiple nodes that interfere with each other send at the same time. The purpose of system resources. The algorithm should meet the following requirements as much as possible: not only to reduce the collision probability between nodes, but also to consider the delay factor to avoid the reduction of channel utilization due to too long backoff time,...

AI Technical Summary

Problems solved by technology

This kind of algorithm is beneficial to improve the performance in the environment where the nodes are densely distributed, but the fairness is very poor, and the algorithm complexity is too high; the third type of algorithm is mainly to dynamically adjust the competition window according to the status of the network. Good, and often have a significant effect in improving network performance

Cali.F et al. proposed a dynamic distributed algorithm. In this algorithm, each node estimates the number of nodes that may conflict with it in the network, and adjusts its competition window accordingly to make it optimal. The algorithm has done a simulation experiment, and the results show that the throughput performance of the algorithm has been greatly improved, but other performance of the network is not ideal

[0004]There is another algorithm based on IEEE 802.11 DCF adaptively and dynamically adjusting the contention window, which dynamically adjusts the contention window value through the instant conflict probability in the statistical period, and this algorithm reduces the channel Idle, which effectively improves the channel utilization rate, but its disadvantage is that since the distribution of nodes in the network is not evenly distributed, and the interference between each other is also different, so the update of the competition window with a unified rule does not take into account the space of the nodes distributed

Images