Allocation method based on wireless sensor network hidden node conflicts
A wireless sensor network and hidden node technology, applied in the node conflict grouping, based on the distribution of wireless sensor network hidden node conflicts, can solve the problems of receiving errors, hidden node conflicts, etc., to improve algorithm performance and save storage space Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0037] Example: Small-scale Internet of Things simulation experiment of node grouping through non-hidden relationship symmetric adjacency matrix partition complete graph
[0038] A single-layer Zigbee network with 20 nodes is used for simulation, assuming that the maximum listening distance of the nodes is 500M, and the nodes are randomly distributed in a circle with the central node as the center and a radius of 500M, as follows figure 2 Shown:
[0039] The listenable node list of each node is as follows Table 1:
[0040] Table 1
[0041]
[0042]
[0043] For example, the signal coverage of node 1 is as follows image 3 shown.
[0044] The initial non-hidden relationship adjacency matrix is shown in Table 2 below:
[0045] Table 2
[0046]
[0047] After the adjacency relationship is cleaned up, the symmetric adjacency matrix is shown in Table 3:
[0048] table 3
[0049]
[0050] A plurality of complete graphs are divided according to the method of the...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


