Group member phase selection method and system based on group neighbor discovery mechanism

Abstract

The invention relates to an intra-group member phase selection method and system based on a group neighbor discovery mechanism. The intra-group member phase selection method comprises the steps that when only a master node exists in a node group, an initial group sequence is the same as the sequence of the current master node, wherein the group sequence includes N phases; when the situation that a new node is added to the node group is discovered, the new node serves as a slave node of the master node, the slave node corresponds to a sequence, with N phase positions, in a group, and an or operation is carried out on the slave nodes and the current group sequence to obtain N combined sequences; the time delay between each combined sequence and the group sequence to obtain N sets of time delay, and the N sets of time delay are sorted by size; the minimum set of time delay is obtained, and the phase position corresponding to the minimum set of time delay serves as an optimum phase; the master node distributes the optimum phase to the slave node, and the group sequence is updated as a sequence obtained after the or operation is carried out on the current group sequence and the slave node. According to the intra-group member phase selection method, the optimal combination of phase differences is selected, and the discovery time delay of other existing neighbor discovery strategies is shortened.

Description

technical field [0001] The invention relates to a group member phase selection method and system based on a group neighbor discovery mechanism, and belongs to the field of wireless sensor network technology and wireless personal area network. Background technique [0002] Neighbor discovery is an important research point in the field of wireless sensor networks and wireless personal area networks, and it is generally used to discover communication opportunities through neighbor discovery. The energy problem is always an important problem in the application of wireless sensor nodes and wireless personal area network equipment. As we all know, a wireless communication module is the most energy-consuming module in a wireless device. Therefore, the dormancy scheduling mechanism is one of the most common and effective mechanisms for prolonging the service life of devices in wireless sensor nodes and wireless personal area network devices. The so-called dormancy scheduling mecha...

AI Technical Summary

Problems solved by technology

The problem is: how to guarantee that no matter when two nodes come up, they can guarantee to wake up and communicate in the same time slot

Due to the lack of global information in distributed systems, it is difficult to coordinate with asymmetric dormancy scheduling protocols, and it is difficult to guarantee the worst discovery delay. The main research is on symmetric dormancy scheduling protocols.

Images