Rapid networking method based on centre node control

Abstract

The invention discloses a rapid networking method based on centre node control, and mainly solves the problem that the collision probability is relatively high when the existing networking method is adopted in a specific scene. The implementation scheme of the rapid networking method is as follows: (1), a centre node forms a to-be-accessed node set H by using a to-be-accessed node; (2), the centre node divides a channel into a beacon period; furthermore, a beacon frame including the node identifier is sent at the beginning time of the beacon period; (3), after being matched with the node identifier in the beacon frame, the to-be-accessed node sends an access request; (4), after receiving the access request, the centre node updates the to-be-accessed node set H; and (5), when no node exists in the to-be-accessed node set H, rapid networking is ended. By means of the rapid networking method disclosed by the invention, the collision probability of the to-be-accessed node can be avoided in the specific scene; the networking efficiency can be increased; and thus, the rapid networking method can be suitable for all kinds of local area networks and access networks, which are networked by adoption of a CSMA mechanism, and belong to star topology.

Description

technical field [0001] The invention belongs to the technical field of communication, and relates to a fast networking method, which can be applied to various local area networks and access network fields that adopt a CSMA mechanism to form a network and belong to a star topology. Background technique [0002] In a star network, a central node and multiple slave nodes form a network. Under the control of the central node, multiple slave nodes require network access, and the central node usually specifies an access period including several time slots for the slave nodes to randomly compete for access and send network access request messages. In existing networking schemes, slave nodes usually compete for network access in a binary exponential backoff manner. [0003] In the binary exponential backoff method, each time the slave node participates in the competition, it randomly selects a value from the backoff window [0, CW-1] as the number of backoff slots, and sends a netwo...

AI Technical Summary

Problems solved by technology

[0004] In the above binary exponential backoff method, since K min The value is fixed and usually K min The value is small. In the case of a large number of slave nodes, especially when multiple slave nodes are powered on at the same time or are powered on again after a failure such as a power failure, a large number of slave nodes participate in the competition for the first time in the backoff window [0, CW min -1] randomly select a value as the number of backoff slots, at this time due to the CW min A small value causes multiple nodes to have the same number of backoff time slots, causing a large number of collisions and retransmissions. Until the CW starts to increase, the probability of collisions can be reduced. At this time, a large number of collisions and retransmissions may cause the entire network to The networking efficiency is very low, and even the networking fails

Images