Distributed graph coloring link dispatch of wireless sensor network

A wireless sensor and wireless link technology, applied in network topology, wireless communication, network traffic/resource management, etc., can solve problems such as unresolved network secondary conflicts, reduce network transmission energy consumption, shorten algorithm delay, and improve The effect of dyeing accuracy

Inactive Publication Date: 2013-09-11
SHANDONG UNIV AT WEIHAI +1
View PDF3 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] In order to overcome the deficiencies of the existing link scheduling schemes, the present invention applies the vertex coloring algorithm to the link scheduling, and through the vertex coloring of the conflict graph of the network links, the conflict-free time slot allocation of the links can be obtained, which can solve the problem of edge coloring Network secondary conflict issues that cannot be resolved by methods

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
  • Distributed graph coloring link dispatch of wireless sensor network
  • Distributed graph coloring link dispatch of wireless sensor network
  • Distributed graph coloring link dispatch of wireless sensor network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] Step 1: After the network is established, each wireless node first broadcasts its own location information, and collects the location information of neighboring nodes, and obtains the perfect network connectivity in the two-hop neighborhood through multiple rounds of broadcasting. Each wireless node constructs a network communication graph according to the collected local network connectivity. figure 1 An example of a communication diagram of a simple wireless network ( G ), there are 4 nodes and 3 links in the network.

[0034] Step 2: In addition to the connectivity information of the network, each node also needs to know the link transmission conflicts in the two-hop neighborhood. figure 2 It is shown that there are two types of transmission collisions between wireless links. figure 2 ( a - c ) are the sender-sender conflict, receiver-receiver conflict, and sender-receiver conflict respectively, and this type of conflict is called a primary conflict. figure...

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 a distributed graph coloring link dispatch scheme of a wireless sensor network based on a graph coloring algorithm. According to the scheme, firstly, partial interference information is obtained through packet switching among nodes; secondly, a graph vertex coloring analysis is carried out on a generated localized network conflict graph; thirdly, the conflict-free time slot allocation of a wireless sensor network link is obtained. To improve the coloring success rate, two mechanisms are provided. One mechanism is a broadcast safeguard mechanism for improving the broadcast information delivery rate, and the other mechanism is a conflict processing mechanism for solving the coloring conflict problem. According to the distributed link dispatch scheme, the problems of packet loss, delay and the like caused by multi-hop transmission are solved, and the transmitting energy consumption is reduced. The result of the network simulation shows that the distributed graph coloring link dispatch scheme has the advantages over a conventional link dispatch method on the aspects of energy consumption, the space reusing rate, the packet loss probability and the like.

Description

technical field [0001] The invention relates to a link scheduling method in the wireless sensor network field. Background technique [0002] Wireless sensor networks are widely used in various fields, but due to the limited energy supply of nodes, energy consumption must be reduced as much as possible. Since data transmission energy consumption is the main energy consumption of wireless sensor networks, it is required to turn off the antenna or reduce the idle listening frequency as much as possible in the idle state of the node. [0003] At present, the scheduling protocol based on the time division multiplexing mechanism can effectively reduce the energy consumption of the wireless network. This type of protocol performs time slot allocation and time slot multiplexing for nodes or links, in which nodes only perform corresponding actions (such as sending, receiving or sleeping) in specific time slots. The link scheduling protocol is an energy-efficient time-division multi...

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): H04W4/06H04W28/16H04W52/02H04W84/18
CPCY02D30/70
Inventor 董恩清李晓阳乔富龙张军蕊
Owner SHANDONG UNIV AT WEIHAI
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap