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

Inter-cluster multi-hop routing algorithm of energy consumption balance in wireless sensor networks

A wireless sensor and multi-hop routing technology, applied in wireless communication, network topology, electrical components, etc., can solve problems such as prolonging the network life cycle, and achieve the effect of prolonging the network life cycle

Active Publication Date: 2018-10-26
BEIJING INFORMATION SCI & TECH UNIV
View PDF3 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The technical effect of this new method described by Cisco Technologies Inc., which uses an iterative process called Minimization Energy Consumption Inter-Cluster Routing (MEC), improves power efficiency while extending its lifespan for longer periods than previous methods such as Distributed Power Control or Multiplexed Passive Load Balancing techniques.

Problems solved by technology

The technical problem addressed in this patent text is the uneven energy consumption in wireless sensor networks. The existing clustering algorithms and routing protocols have limitations in selecting cluster heads and determining inter-cluster communication, leading to some nodes consuming more energy than others. This imbalance affects the stability and lifespan of the network.

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
  • Inter-cluster multi-hop routing algorithm of energy consumption balance in wireless sensor networks
  • Inter-cluster multi-hop routing algorithm of energy consumption balance in wireless sensor networks
  • Inter-cluster multi-hop routing algorithm of energy consumption balance in wireless sensor networks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] 1: The cluster head selection method is: when the network is initialized, the aggregation node collects and saves the ID information, location information, and remaining energy information of the nodes in the entire network, and then only updates the remaining energy of the nodes. The converging node sorts all nodes and energy, takes the top 5% points as the cluster head, and takes the radius r ch Search for nearby nodes to form a cluster. If the entire area cannot achieve full coverage, for the remaining unclustered nodes, take the node with the energy of the top 5% as the cluster head, and use the radius r ch Search for nearby nodes to form a cluster. This cycle is repeated until the entire area is fully covered by communication. After the node sleeps for a fixed time, it receives the network clustering table broadcast by the sink node.

[0039] Because the search radius r ch It is related to the remaining energy of the node and the distance from the sink k node. ...

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 an inter-cluster multi-hop routing algorithm of energy consumption balance in wireless sensor networks. The algorithm is characterized in that, in a wireless sensor network, collaborative inequality relation between cluster head nodes is deduced, collaborative orders and collaborative competition relation between the cluster head nodes are considered, and therefore, the inter-cluster multi-hop routing algorithm of energy consumption balance can be designed. The advantages of the algorithm are that the algorithm has more advantages in network total energy consumption and the number of surviving nodes compared with DCEM algorithm, and can better prolong network life cycles.

Description

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

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
Owner BEIJING INFORMATION SCI & TECH 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

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