Neighbor discovery method based on the greatest common divisor of cycle length

Abstract

The invention discloses a neighbor discovery method based on the greatest common divisor of period length. The specific steps of the method of the present invention are as follows: Step 1, obtain the set of basic cycle duration; Step 2, set the basic cycle duration and super cycle duration of each node; Step 3, set the working mode of each node; Step 4, the node finds its neighbor nodes. The present invention can not only work according to time slots, but also can work according to non-time slots. It is applicable to a large number of scenarios. The number of time slots included in the basic period length can be either a prime number or a composite number. Knowing the duty cycle of the neighbor nodes, the node parameters can be optimized, and the lower bound of the worst-case discovery delay can be obtained in both the symmetric duty cycle and the asymmetric duty cycle, and the average discovery delay is short.

Description

Technical field[0001]The present invention relates to the field of communication technology, and more relates generally to a neighbor discovery method based on the number of cycle lengths in the field of wireless communication technology. The present invention can be used in moving nodes in the self-organizing network to discover their adjacent neighbor nodes, nodes, and neighbor nodes typically refer to a smartphone mobile terminal in the self-organizing network.Background technique[0002]Nodes and neighbor nodes in mobile self-organizing networks typically refer to smartphone mobile terminals, and neighbor discovery in mobile self-organizing networks is usually smartphones to find neighbor smartphones. Neighbor discovery is a basic and important function in the self-organizing network. In the mobile self-organizing network, neighbor discovery makes the node find other nodes within its communication range, and makes full use of short-lived communication timing to implement informati...

AI Technical Summary

Problems solved by technology

However, the shortcomings of this method are: the Hello protocol requires that all nodes in the network must work according to the time slots, and Hello (including protocols such as Disco and U-Connect) assumes that if the active time slots of two nodes overlap, then it can discover each other

However, the disadvantage of this method is that it is necessary to know the duty cycle of the neighbor node to optimize the parameters and reduce the discovery delay. Parameters to reduce the discovery delay; this method considers that the time to send a beacon is very short, so the delay of discovery can be reduced by shortening the base cycle length and increasing the frequency of sending beacons, which ignores other overheads of sending beacons

For example, the time between when the radio is turned on and when the beacon is actually sent out is much longer than the beacon transmission time, which results in the actual duty cycle of the method being much larger than the theoretical duty cycle; the method uses two unilateral findings To achieve mutual discovery between two nodes, which increases the average discovery delay

Images