Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Rapid data anastomosing algorithm used for wireless sensor network

A wireless sensor and fusion algorithm technology, applied in wireless network applications and wireless sensor network applications, can solve the problems of increasing data request failure rate, wasting communication bandwidth and energy, and wasting communication bandwidth, so as to reduce the amount of data transmission and reduce the Transmission delay, the effect of extending the life cycle

Inactive Publication Date: 2008-08-27
BEIJING JIAOTONG UNIV
View PDF0 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] (1) Waste of communication bandwidth and energy: In a sensor network with high coverage, there is redundancy in the information reported by adjacent nodes, and the transmission of data by each node alone will waste communication bandwidth; at the same time, transmitting a large amount of data will consume too much energy for the entire network. More energy, shorten the lifetime of the network
[0004] (2) Reduce the efficiency of information collection: Multiple nodes transmitting data at the same time will increase the difficulty of coordination at the data link layer, causing frequent conflicts and collisions, reducing communication efficiency, thus affecting the timeliness of information collection
The PEGASIS algorithm of the single-chain structure mainly has the following two defects: (1) The average delay is large: data needs to be transmitted sequentially along the single-chain structure, and the delay of collecting data is determined by the distance between the leader node and the single-chain end node, so the average delay Proportional to the number of nodes
(2) Poor robustness: Due to the susceptibility of sensor nodes to failure, if an appropriate repair strategy is not adopted, the transmission path of the single-chain structure will easily increase the failure rate of data requests

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
  • Rapid data anastomosing algorithm used for wireless sensor network
  • Rapid data anastomosing algorithm used for wireless sensor network
  • Rapid data anastomosing algorithm used for wireless sensor network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] Firstly, the sensor network structure using CFDASC algorithm is given, figure 1 An example of the initial node distribution diagram is given. There are 100 nodes randomly distributed in a plane area of ​​50m×50m, and the sink node is located at 75m. figure 2 It is the case that the nodes in the cell are clustered. How to select the cluster head will be introduced later. image 3 It gives how the data is transmitted to the Sink node through the chain data fusion algorithm in the case of clustering determination. Step 1. Network initialization:

[0030] At this stage, virtual cells are formed, and each virtual cell has a label according to its location to facilitate data transmission. At the same time, nodes in each virtual cell (that is, in a cluster) must have a unique number in the cluster . Such as figure 1 As shown, each virtual cell can be represented by the form G ij mark, where the subscripts i and j represent the horizontal and vertical coordinates correspo...

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

Disclosed is a quick chain data fusion algorithm based on virtual cell grids. A whole sensor zone is divided into virtual cell grids; data are sent to an appointed node for fusion by the nodes in the cell grids, the chain data fusion process is started in the vertical direction of the cell grids and the data are sent to the Sink node each time by only one node in each chain. The nodes play the role of data fusion in turn for balancing the energy consumption of the nodes. The invention has the advantages that the data transmission chain constructed in the CFDASC algorithm is short, therefore the time delay in data transmission is short. The algorithm has good robustness, that is, each chain transmits data to the Sink node; and has good energy saving property, that is, all the data in the wireless sensor network zone are finally fused into the data transmitted by a plurality of chains, the data account for transmission is largely reduced in the data transmission process and most of the energy is effectively saved.

Description

technical field [0001] The invention relates to a fast data fusion algorithm applied to a wireless sensor network. The invention is suitable for the application field of wireless network, especially for the application field of wireless sensor network. Background technique [0002] Wireless sensor network (wireless sensor network, WSN) 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. Process the information of the perceived objects in the network coverage area and send it to the observer. The resources of wireless sensor network nodes are very limited, mainly reflected in several aspects such as battery energy, processing power, storage capacity and communication bandwidth. In the process of collecting information, it is inappropriate to use each node to transmit data to the sink node separately, mainly for the following two reasons. [0003] (1) ...

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): H04L12/56H04L12/24H04W52/02
CPCY02D30/70
Inventor 吴昊丁一鸣
Owner BEIJING JIAOTONG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products