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

Routing algorithm for dynamically adjusting forward angle based on residual energy

A technology of residual energy and dynamic adjustment, applied in the field of communication, can solve the problem of excessive energy consumption of key nodes, achieve the effect of maintaining effective coverage, improving the uniformity of energy consumption, and balancing network energy consumption

Active Publication Date: 2016-05-25
KUNMING UNIV OF SCI & TECH
View PDF3 Cites 22 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Aiming at the problem of limited network energy and the excessive energy consumption of key nodes around the Sink node in the existing routing algorithm, the present invention provides a routing algorithm that dynamically adjusts the forward angle based on the remaining energy

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
  • Routing algorithm for dynamically adjusting forward angle based on residual energy
  • Routing algorithm for dynamically adjusting forward angle based on residual energy
  • Routing algorithm for dynamically adjusting forward angle based on residual energy

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0027] Example 1: Such as Figure 1-4 As shown, a routing algorithm that dynamically adjusts the forward angle based on the remaining energy, and a routing algorithm that dynamically adjusts the forward angle based on the remaining energy. When a node is ready to select the next hop node, the current node's forward angle range is judged Whether the remaining energy of the inner neighbor node is lower than the remaining energy threshold of the node E th :

[0028] If the remaining energy of neighboring nodes within the forward angle range of the current node is lower than the remaining energy threshold E th , The node increases the forward angle; among them, the principle of the node increases the forward angle: from the minimum forward angle A min To maximum forward angle A max , Until the maximum forward angle range, there is no meeting that the remaining energy is higher than the remaining energy threshold E th When it is a neighbor node, follow its probability transfer functi...

Embodiment 2

[0043] Example 2: Such as Figure 1-4 As shown, a routing algorithm that dynamically adjusts the forward angle based on the remaining energy, and a routing algorithm that dynamically adjusts the forward angle based on the remaining energy. When a node is ready to select the next hop node, the current node's forward angle range is judged Whether the remaining energy of the inner neighbor node is lower than the remaining energy threshold of the node E th :

[0044] If the remaining energy of neighboring nodes within the forward angle range of the current node is lower than the remaining energy threshold E th , The node increases the forward angle; among them, the principle of the node increases the forward angle: from the minimum forward angle A min To maximum forward angle A max , Until the maximum forward angle range, there is no meeting that the remaining energy is higher than the remaining energy threshold E th When the neighbor node is the neighbor node, follow its probabilit...

Embodiment 3

[0052] Example 3: Such as Figure 1-4 As shown, a routing algorithm that dynamically adjusts the forward angle based on the remaining energy, and a routing algorithm that dynamically adjusts the forward angle based on the remaining energy. When a node is ready to select the next hop node, the current node's forward angle range is judged Whether the remaining energy of the inner neighbor node is lower than the remaining energy threshold of the node E th :

[0053] If the remaining energy of neighboring nodes within the forward angle range of the current node is lower than the remaining energy threshold E th , The node increases the forward angle; among them, the principle of the node increases the forward angle: from the minimum forward angle A min To maximum forward angle A max , Until the maximum forward angle range, there is no meeting that the remaining energy is higher than the remaining energy threshold E th When the neighbor node is the neighbor node, follow its probabilit...

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 routing algorithm for dynamically adjusting a forward angle based on residual energy, belonging to the field of communication. When a certain node prepares to select a next-hop node, whether the residual energy of a neighbour node in the forward angle range of a current node is less than a residual energy threshold value of a node or not can be judged; if the residual energy of the neighbour node in the forward angle range of the current node is less than the residual energy threshold value, the forward angle of the node is increased; and, if a node, the residual energy of which is not less than the residual energy threshold value, exists in the neighbour node in the forward angle range of the current node, selection of the next-hop node is carried out by following a probability transition function. The routing algorithm disclosed by the invention is reasonable in design; a key node can be sheltered better; the network energy consumption can be balanced; the energy consumption uniformity degree of the node is improved; the information transmission success rate is also relatively high; the effective network coverage rate can be kept better; the robustness of a wireless sensor network can be improved; and premature paralysis of the network can be effectively prevented.

Description

Technical field [0001] The invention relates to a routing algorithm for dynamically adjusting a forward angle based on residual energy, and belongs to the communication field. Background technique [0002] With the renewal of micro-electromechanical systems (MEMS) technology, smart sensors have developed rapidly, making wireless sensor networks (Wireless Sensor Networks, WSNs) a brand-new information acquisition and processing technology. The perception, collection, transmission and processing of the monitored object information make wireless sensor networks widely used in many fields such as environmental monitoring, disaster pollution monitoring, and smart home. Network routing mainly realizes the transmission of source node information to target nodes, which is the basis of efficient network communication, and routing optimization issues have also become very important. [0003] However, the characteristics of wireless sensor network, such as limited energy, network self-organi...

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/10H04W84/18
CPCH04W40/10H04W84/18Y02D30/70
Inventor 孔庆平向凤红张茂兴毛剑琳
Owner KUNMING UNIV OF SCI & TECH
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