K-screening neighbor channel allocation method based on node degree

Abstract

The invention discloses a K-screening neighbor channel allocation method based on the node degree. The allocation method includes the steps that KM devices with the largest node degree are selected from devices in a network and sequentially allocated in the channel with the largest distance, and disturbance variables of corresponding channels are updated; allocated WIFI nodes are rejected out of a topological graph, and remaining WIFI nodes are selected and allocated with the channels according to the process until the number of nodes not allocated in the network is smaller than (K-t)N / K (t=1,2,...,K-1); when the number of the nodes not allocated in the network is smaller than (K-t)N / K, the (K-t) M WIFI devices are selected each time for selection of the nodes and channel allocation until all the WIFI devices are allocated with the channels. The sorting workloads are reduced, a lot of RSSI comparison is not needed, and therefore the time for on-line channel reallocation is greatly shortened when a network topology changes.

Description

technical field [0001] The invention relates to the field of wireless communication, in particular to a method for quickly allocating channels between WIFI devices based on node degrees. Background technique [0002] In the field of wireless communication, with the development of wireless communication and the popularization of WIFI devices, it is necessary to deploy hundreds or even thousands of WIFI devices. However, whether it is a 2.4G frequency band or a 5.8G frequency band, the number of available channels is often limited. In a high-density scenario with thousands of WIFIs (the so-called high-density scenario means that there are a large number of WIFI devices in a limited area ), each channel carries a large number of devices. Neighboring WIFI devices on the same channel often interfere with each other in the process of sending and receiving messages at the same time, which greatly reduces the performance of the network. Obviously, if the neighboring devices that int...

AI Technical Summary

Problems solved by technology

Although another algorithm based on the number of neighbors sorts avoids a lot of complicated RSSI value comparisons and improves the speed of channel allocation to a certain extent, its performance still needs to be further improved for high-density scenarios.