A Boundary Node Judgment Method Based on Local Area Projection

Abstract

The invention discloses a boundary node determination method based on local area projection, which utilizes the communication relationship between wireless sensor nodes to divide the nodes in the wireless sensor three-dimensional network into local areas; prunes the nodes in the local area, and The remaining nodes are copied, and the copied point is projected onto the two-dimensional plane; the node to be determined is used as the coordinate origin, and the nodes in the two-dimensional plane are sorted by the angle between the nodes and the positive direction of the X-axis, and they are searched sequentially from the starting node loop, until the end point is not found to form a loop, it can be determined that the node to be determined is a boundary point; for a node that forms a loop, according to the connection between adjacent quadrant nodes and the size of the included angle, it can be determined whether the node to be determined is a boundary point point. The method of the invention can avoid failure of nodes due to excessive communication, and improve the accuracy of border point determination.

Description

technical field [0001] The invention relates to the field of wireless sensor networks, in particular to a boundary node determination method based on local area projection. Background technique [0002] In wireless sensor networks, the coverage of the network is very important. Whether the nodes can cover the planned area of ​​the entire network is related to the forwarding efficiency of data packets in the network, the correctness of data collection, the energy consumption of a single node and the network life cycle, so it is necessary to ensure For the high coverage of the network, to calculate the coverage of the wireless sensor network first needs to find the coverage holes in the network; the wireless sensor network can adopt a centralized or distributed operation system. When using a centralized operation system, it is usually necessary to collect all Node data can easily lead to increased traffic in the network, increased energy consumption of a single node, and singl...

AI Technical Summary

Problems solved by technology

[0002] In wireless sensor networks, the coverage of the network is very important. Whether the nodes can cover the planned area of ​​the entire network is related to the forwarding efficiency of data packets in the network, the correctness of data collection, the energy consumption of a single node and the network life cycle, so it is necessary to ensure For the high coverage of the network, to calculate the coverage of the wireless sensor network first needs to find the coverage holes in the network; the wireless sensor network can adopt a centralized or distributed operation system. When using a centralized operation system, it is usually necessary to collect all Node data can easily lead to increased traffic in the network, increased energy consumption of a single node, and single-point failure of the central processing unit. Therefore, wireless sensor networks usually use a distributed method for system operation; and in a distributed system, border nodes can be Indicates the existence of coverage holes, and the misjudgment of boundary nodes will affect the calculation results of coverage

[0003] Fang Qing, Gao Jie and others published an article titled "Location and Avoidance of Holes in Sensor Networks", which mentioned that coverage holes are defined as rings composed of boundary nodes, through which boundary nodes are Greedy message push is used to locate the boundary nodes. In this process, the messages will be blocked on the nodes because the geographical location of the boundary nodes is at the boundary of the hole, resulting in inaccurate calculation coverage; Li Wei, Zhang Wei, etc. published an article titled "Coverage Hole and Boundary Node Discovery in Wireless Sensor Networks", the method in this article constructs the Delaunay triangles of all nodes in the network, and passes the common edges of adjacent Delaunay triangles It is too cumbersome to determine whether a node is a boundary node by connecting the line segment formed by the center of the empty circle formed by these triangles; therefore, a method for determining the boundary node is needed to solve the above problems

Images