Unlock instant, AI-driven research and patent intelligence for your innovation.

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

Inactive Publication Date: 2018-11-02
SOUTH CHINA UNIV OF TECH
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a method for allocating hidden node conflicts based on wireless sensor networks, and to solve the practical problem that nodes that are mutually hidden nodes in a network segment send messages to the same non-hidden node at the same time, resulting in receiving errors

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Allocation method based on wireless sensor network hidden node conflicts
  • Allocation method based on wireless sensor network hidden node conflicts
  • Allocation method based on wireless sensor network hidden node conflicts

Examples

Experimental program
Comparison scheme
Effect test

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...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an allocation method based on wireless sensor network hidden node conflicts. The hidden relation among nodes is represented by a symmetric adjacent matrix, multiple groups areobtained through partitioning to represent groups of the nodes, the intra-group nodes can monitor message sending, and the hidden conflict problem exists among the groups. If two nodes cannot monitormessages of the opposite ends due to the signal coverage of the nodes, the two nodes are hidden nodes to each other, and when the two nodes sends the messages to a center node simultaneously, the messages are superimposed, and then a message error is made. The grouped wireless sensor nodes conduct message sending in the time slice areas of the groups of the nodes, due to the fact that the nodes send the messages by adopting the mode that channels are monitored firstly, and the messages are sent when it is confirmed that the channels are idle, the intra-group nodes can avoid the mutual conflicts, and the extra-group nodes do not send the messages in the same time slice area, so that the practical problem that a receiving error is caused due to the fact that the nodes which are hidden nodesto each other in a network segment send the message to the same non-hidden node simultaneously is solved.

Description

technical field [0001] The invention relates to a method for grouping node conflicts, in particular to a method for assigning hidden node conflicts based on a wireless sensor network, and belongs to the field of network technology. Background technique [0002] The wireless sensor network is composed of a large number of cheap micro-sensor nodes deployed in the monitoring area, and forms a multi-hop, self-organizing network system through wireless communication to achieve cooperative perception, collection and processing of the perceived information in the network coverage area. Object information. IEEE 802.15.4 (hereinafter referred to as LR-WPAN) is a new standard designed for low-speed wireless personal area network. Compared with other wireless network protocols (Wi-Fi, Bluetooth), it has low power consumption, low cost and short The distance and other characteristics are more suitable for the mac protocol as a WSN, and the development prospects are broad. However, LR-...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W74/08
CPCH04W74/0816
Inventor 李拥军周玮康
Owner SOUTH CHINA UNIV OF TECH