Sensor node neighbor discovering method and system

Abstract

The invention relates to a sensor node neighbor discovering method and system based on a rectangle matrix. The method comprises the following steps: arranging a work cycle of any wireless sensor node in the wireless sensor network into a matrix; taking any row in the matrix as a longitudinal reviving time slot; selecting any one time slot from the row, and transversely selecting a transversal reviving time slot at intervals at an interval node from the time slot; when selecting the transversal reviving time slot, if the last reviving time slot falls into the selected row after passing through the next interval, after passing through the next interval, transversely selecting a time slot nearest to the penultimate revive time slot to be taken as the last transversal reviving time slot, according to the amount of the longitudinal reviving time slots and the transversal reviving time slots, gaining the whole reviving time slots, and according to whole reviving time slots and all time slots in the network matrix, gaining a duty cycle. The method and the system can enhance the efficiency of ensuring the mutual discovery of any two neighbor nodes in limit time.

Description

technical field [0001] The invention relates to the technical field of wireless sensor networks, in particular to a sensor node neighbor discovery method and system. Background technique [0002] At present, there are two main types of neighbor discovery algorithms in sensor networks: non-deterministic and deterministic. Among them, the most typical non-deterministic neighbor discovery algorithm is the birthday algorithm based on probability (M.J.McGlynn and S.A.Borbash, Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks, in MobiHoc, 2001). With randomness, it cannot guarantee that the sensor nodes can accurately discover their neighbors within a specific time, which is not conducive to the use in practical applications. The deterministic neighbor discovery algorithm can ensure that the sensor nodes can accurately discover their neighbors within a certain period of time, that is, any two nodes that have always been physi...

AI Technical Summary

Problems solved by technology

Although the above-mentioned neighbor discovery algorithms have good effects, their energy efficiency has room for further improvement, that is, under the same energy consumption situation, the average neighbor discovery delay of the algorithm has room for further reduction, and the discovery probability has room for further increase ; For long-term unattended application projects based on wireless sensor networks, the improvement of energy efficiency is very important, because it can directly extend the life cycle of sensor networks

Images