Multiple mobile beacon set moving path planning method based on network density clustering of wireless sensor network

A wireless sensor and mobile beacon technology, applied in wireless communication, network topology, electrical components, etc., can solve the problems of increasing network positioning time, beacon moving path and network positioning time, limitations, etc., to achieve positioning rate and positioning accuracy. The effect of improving the network positioning time, reducing the network positioning time, and improving the network positioning rate

Active Publication Date: 2014-11-05
HOHAI UNIV CHANGZHOU
View PDF3 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Among the three methods, Scan has the shortest movement path, and the mobile beacon moves along the y-axis direction, but its linear movement path will cause unknown nodes to receive several collinear mobile beacon beacon signals, especially when the beacon communication The radius is too small, causing many unknown nodes to fail to locate
[0010] (1) Most of the existing research mainly stays in the path planning of static mobile beacons. This path planning method has the problems of collinear beacon positions, long beacon moving paths and network positioning time.
[0011

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
  • Multiple mobile beacon set moving path planning method based on network density clustering of wireless sensor network
  • Multiple mobile beacon set moving path planning method based on network density clustering of wireless sensor network
  • Multiple mobile beacon set moving path planning method based on network density clustering of wireless sensor network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0074] n=2, that is, when the number of hops in the cluster is 2, the network clustering result is as follows figure 2 shown. After determining the location of the cluster head, the mobile beacons perform global path planning to determine the sequence of traversing the cluster heads. The three mobile beacons are located at the vertices of the regular triangle with length R, and keep their relative positions unchanged, moving at a constant speed v , traverse all the cluster heads sequentially, such as image 3 shown.

[0075] In the process of local path planning, the three mobile beacons take the position of the cluster head as the center of the regular triangle, respectively follow the regular hexagonal path with side length a=R, and a=vt, such as image 3 shown. The three mobile beacons perform a partial path planning in each cluster, and the position of the beacon is rotated once, and then the relative position of the regular triangle is still maintained to move to 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 relates to a multiple mobile beacon set moving path planning method based on network density clustering of a wireless sensor network. The network comprises a plurality of static unknown nodes which are not evenly deployed and three mobile beacon nodes. The method includes the steps that network clustering is performed based on an DBCSAN; the positions of cluster heads are estimated; the overall path of mobile beacons is planned; the local path of the mobile beacons is planned; the mobile beacons move along the planned path at a constant speed v, a beacon data packet is broadcast every other time interval with the current position as a circle center and R as a communication radius, and each beacon data packet comprises the position of the mobile beacon at the moment and the beacon; the unknown nodes are used for continuously monitoring and receiving the beacon data packet, and the positions of the unknown nodes are calculated through a three-side measurement method; positioned nodes are upgraded into static beacons to assist in positioning the remaining unknown nodes. The method is high in positioning accuracy and beacon utilization rate, the beacon moving path is short, and communication expenditure is small.

Description

technical field [0001] The invention belongs to the field of wireless sensor networks, and in particular relates to a mobile path planning method for multiple mobile beacon groups in a wireless sensor network based on network density clustering. Background technique [0002] In recent years, with the development of wireless communication and digital electronic technology, Wireless Sensor Networks (WSNs) have been favored by government departments, industry, academia and scientific research all over the world due to their highly interdisciplinary nature and broad application prospects. The research on it has become one of the most challenging topics in the current IT field, and its application scenarios include environmental monitoring, biomedicine, industrial automation control, smart home and many other fields. Location information is of vital significance to the application of WSNs. Effective and reliable positioning technology and its optimization method are the key suppo...

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
IPC IPC(8): H04W40/02H04W64/00H04W84/18
Inventor 张晨语韩光洁朱川江旭江金芳王峰鲍娜
Owner HOHAI UNIV CHANGZHOU
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products