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

Least effort delivering zone-spanned virtual cluster multi-hop routing method

A multi-hop routing, the smallest technology, applied in the direction of advanced technology, electrical components, network topology, etc., can solve the problems of increased node computing load and computing complexity, reduce communication energy consumption, simplify the algorithm, and shorten the time of network failure Effect

Inactive Publication Date: 2010-12-15
NANJING UNIV OF TECH
View PDF3 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in these improved algorithms, the introduction of some complex parameters increases the computational load and computational complexity of nodes.

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
  • Least effort delivering zone-spanned virtual cluster multi-hop routing method
  • Least effort delivering zone-spanned virtual cluster multi-hop routing method
  • Least effort delivering zone-spanned virtual cluster multi-hop routing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] The technical scheme of the present invention is described in detail below in conjunction with accompanying drawing:

[0032] 1. Custom cross-region multi-hop routing algorithm LECSVCR

[0033] 1.1 Introduction to LEACH Algorithm

[0034] LEACH is a hierarchical low-power adaptive clustering routing protocol designed by Heinzelman et al. of MIT. Its implementation process introduces the concept of "round", and each cycle is divided into cluster establishment phase and data communication phase. In the establishment phase of the cluster, each surviving node generates a random number between 0 and 1, and if the number is less than the threshold T(n), it will publish the message that it is the cluster head. In each cycle, if the node has become the cluster head, T(n) is set to 0, so that the node will not be elected as the cluster head again in this round. T(n) is expressed as:

[0035] T ( n ) = ...

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 least effort delivering zone-spanned virtual cluster multi-hop routing method, and belongs to the field of computer communication networks. In the method, a control message is broadcast to an entire network by a sink by introducing a zone concept based on a low energy adaptive clustering hierarchy (LEACH) protocol according to the characteristics of a clustering multi-hop routing algorithm in a wireless sensor network; the zone to which each node belongs is determined by the node according to received signal intensity; and the direction of the multi-hop routing is specified through the limitation of the zone. During the network polling circulation, when a zone fails to select the cluster, the network generates a complementary cluster at the zone; and when the routing is established, the cluster is virtualized into one node to prevent direct communication between clusters with longer distance and perform the least effort delivering. The method can prolong the survival time of the network, balance the energy consumption of the node of the internet well, homogenize the distribution of dead nodes and expand the network size suitable for the protocol.

Description

technical field [0001] The invention relates to a routing method for load balancing in a wireless sensor network, and belongs to the technical field of multi-hop routing selection methods for computer communication networks. Background technique [0002] A wireless sensor network is a multi-hop wireless network composed of a large number of tiny, low-cost, and low-power sensor nodes deployed in the monitoring area. Due to the limited energy, processing power and storage capacity of sensor nodes, most of the routing protocols in the traditional MANET network cannot be well adapted to the sensor network environment. In the research and design of sensor networks, realizing the energy efficiency of routing protocols is one of the core issues that people pay attention to. With the deepening of research, a variety of routing protocol algorithms have been reported in the literature, mainly including flat routing protocols and hierarchical routing protocols. In the planar routing ...

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/02H04W84/18
CPCY02D30/70
Inventor 曹磊白光伟何风顾跃跃沈航
Owner NANJING UNIV OF 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