Virtual sector-based inter-cluster multi-hop routing algorithm

A multi-hop routing and inter-cluster technology, applied in the field of inter-cluster multi-hop routing algorithm based on virtual sectoring, can solve the problems of uneven distribution of cluster heads and high energy consumption of wireless sensor networks

Inactive Publication Date: 2019-02-15
苏州东辉睿鹏科技有限公司
View PDF2 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The present invention overcomes the deficiencies of the existing technology, solves the problems of large energy consumption and uneven distribution of cluster heads in the current wireless sensor network, and aims to provide a multi-hop cluster routing algorithm between clusters based on virt

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
  • Virtual sector-based inter-cluster multi-hop routing algorithm
  • Virtual sector-based inter-cluster multi-hop routing algorithm
  • Virtual sector-based inter-cluster multi-hop routing algorithm

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0071] In order to make the objectives, features, and advantages of the present invention more obvious and understandable, the specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0072] The multi-hop routing algorithm between clusters based on virtual fan division is implemented according to the following steps:

[0073] 1) Initial stage T 1 : In the initial stage T 1 , Calculate the number of cluster heads in each ring m = {m 1 ,m 2 ,...,m s }, then the cluster head probability of each ring p = {p 1 ,p 2 ,...,p s }, where p k =m k / N k , S is the total number of rings in the network, N k Is the number of nodes in the kth ring, and the value range of k is 1≤k≤s,

[0074] The sin k node packs the positions of p, ε, and sin k into a SINK_NOTIFY_MSG message and broadcasts it with a radius R. The node calculates the distance to sin k according to the RSSI value to obtain the cluster head selection probability p of ...

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 virtual sector-based inter-cluster multi-hop clustered routing algorithm VSMC, belonging to the field of network node algorithm. The invention solves the problems that a wireless sensor network consumes a large amount of energy and the cluster head is unevenly distributed. The virtual sector-based inter-cluster multi-hop clustered routing algorithm VSMC comprises the following steps: firstly, performing virtual sector on an area according to the optimal number of cluster heads, so that the number of the cluster heads is kept at the theoretical optimal value and the distribution is uniform; secondly, comprehensively considering energy and geographical location factors to design intra-cluster and inter-cluster cost formulas, and reasonably selecting the cluster headand a father cluster head; and finally, obtaining a distance threshold formula through comparative analysis of energy consumption, and establishing a transmission mode of the inter-cluster multi-hoprouting. Therefore, the VSMC algorithm disclosed by the invention can effectively optimize the uneven distribution of the cluster head and prolong the network life cycle.

Description

technical field [0001] The invention belongs to the field of network node algorithms, in particular to an inter-cluster multi-hop routing algorithm based on virtual fanning. Background technique [0002] In recent years, with the technical innovation of electronic technology and wireless communication, wireless sensor network (WSN) has been developed rapidly. Energy limitation is one of the salient features of wireless sensor networks, so an efficient and energy-saving routing protocol is needed to save energy and prolong the life of the network. [0003] Network routing protocols save energy by finding the optimal path from the source node to the destination node. From the perspective of network topology, routing protocols are divided into two categories: flat routing protocols and clustering routing protocols. Clustering routing protocols have better scalability and higher energy utilization than flat routing protocols, so they become one of the effective ways to improve...

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/10H04W40/20H04W40/22H04W84/18
CPCH04W40/10H04W40/20H04W40/22H04W84/18Y02D30/70
Inventor 康琳王海东杨泽辉吕庆平
Owner 苏州东辉睿鹏科技有限公司
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