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

Method for collecting and routing data in wireless sensor network and device thereof

A wireless sensor and network data technology, applied in network topology, wireless communication, error prevention/detection using the return channel, etc., can solve the problems of nodes not considering resource constraints, blind resource utilization, and long cluster head generation time

Inactive Publication Date: 2010-01-27
NORTHWEST UNIV(CN)
View PDF0 Cites 41 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this protocol also has serious defects: 1. Implosion, that is, a node receives multiple copies of the same data from neighboring nodes at almost the same time; 2. Overlap, a node receives almost the same data sent by multiple nodes monitoring the same area. ;3. Resource utilization is blind, nodes do not consider their own resource limitations, and forward data under any circumstances
Although the HEED protocol balances the energy consumption of the network and the distribution of cluster heads is more reasonable, but because the cluster head election adopts an iterative method, the generation of cluster heads takes a long time and the communication overhead is large

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
  • Method for collecting and routing data in wireless sensor network and device thereof
  • Method for collecting and routing data in wireless sensor network and device thereof
  • Method for collecting and routing data in wireless sensor network and device thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment approach 1

[0150] Route establishment phase:

[0151] Step 1: The base station sends a hello packet. The content of the packet is the node number of the node, the number of hops from itself to the base station, the remaining energy, and the LEAF identifier; among them, the number of hops from the base station to itself is 0, and the number of hops from other nodes to the base station initialized to infinity;

[0152]Step 2: The node receives the hello packet and establishes a neighbor table. The content of the neighbor table includes the node number of the neighbor node, the number of hops from the neighbor node to the base station, the remaining energy of the neighbor node, and the link quality indication to the neighbor node;

[0153] Step 3: If the number of hops to the base station decreases, broadcast your own hello packet;

[0154] Generate the hibernate scheduling stage:

[0155] Step 4-1: The node starts its own Tw after waiting for a random time, and broadcasts the hello packe...

Embodiment approach 2

[0166] Embodiment 2: The difference between this embodiment and the routing method described in Embodiment 1 is that if the node does not receive a hello packet during Ttopo, step 4-2 is performed;

[0167] Step 4-2: The node waits for the random time Trandom, starts to monitor the time Tw, and broadcasts the route repair package with T1 as the period. The content of the route repair package includes the time difference Δt between the current time of the node and the start time of the latest Tw, and the hop from itself to the base station. The number of steps, the remaining energy and the node number of the node, where T1<Tw; stop sending when the data collection phase begins, and execute step 11;

[0168] Step 11: Update the number of hops from the node itself to the base station, the number of hops is the smallest hop number in the neighbor table plus 1; if the number of hops is smaller than the number of hops that have not been updated before, wait for the neighbor nodes to ...

Embodiment approach 3

[0170] Embodiment 3: The difference between this embodiment and the routing method described in Embodiment 1 is that in step 6-1, when a routing repair package is received, step 12 is performed;

[0171] Step 12: Update the neighbor table information, where the calculation formula of the time difference t between the neighbor node and the local node is Δt1-Δt2, where Δt1 is the time difference contained in the routing repair packet sent by the sending node, and Δt2 is the current time distance of the current node from the latest Tw The time difference of the start time; if the number of hops in the received routing repair packet is infinite, reply a routing repair packet;

[0172] In Embodiment 3, when a node receives a routing repair packet during the data collection phase, it judges that a new node has joined, and replies with a routing repair packet, which includes the time difference Δt between the current time of the node and the start time of the latest Tw, and the time d...

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 provides a method for collecting and routing data in a wireless sensor network and a device thereof. The method comprises a route establishment stage, a sleep scheduling generation stage and a data collection stage, and comprises the following steps: sending out a hello packet by a base station, receiving the hello packet by a node, establishing a neighbor table, and broadcasting the hello packet; broadcasting the hello packet or a route repair packet by the node at random time; updating the neighbor table; monitoring a wireless channel by the node, executing the action to transmit an environmental data packet or update neighbor table information or sending the hello packet according to the type of the received data packets after a neighbor node wakes. In the invention, a sleep cycle of the neighbor node is determined by the difference between the received hello packet and self monitoring time based on an asynchronous sleep scheduling mechanism, thus preventing overhead resulted from time synchronization; and the method can help repair local route during a short time and adaptively repair the problem of failed sending caused by offset accumulation of a timer.

Description

technical field [0001] The present invention relates to the technical field of wireless sensor networks, in particular to a data collection and routing method and device for wireless sensor networks. Background technique [0002] In recent years, the wireless sensor network has developed rapidly. The wireless sensor network is composed of multiple sensor nodes deployed in a certain area, and forms a multi-hop network system through wireless communication. Sent to users or watchers. It has broad application prospects: environmental monitoring and forecasting, medical care, smart home, monitoring, transportation, exploration, logistics management and safety testing, etc. [0003] The routing protocol is the core technology of the network layer in the wireless sensor network, and it is also one of the hotspots of research at home and abroad. Above all, maximize the network life cycle as much as possible. The current routing protocols of wireless sensor networks are mainly di...

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): H04W40/24H04W84/18H04L1/16H04L1/18
Inventor 房鼎益黄学青刘微姗陈晓江孙镌宸安娜刘宝英汤战勇何路张谦魏媛
Owner NORTHWEST UNIV(CN)
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com