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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0071] In order to make the objects, features and advantages of the present invention more comprehensible, specific implementations of the present invention will be described in detail below in conjunction with the accompanying drawings.
[0072] The inter-cluster multi-hop routing algorithm based on virtual sectorization is implemented according to the following steps:
[0073] 1) Initial stage T 1 : At 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 k-th ring, and the value range of k is 1≤k≤s,
[0074] The sink k node packs the position of p, ε and sink k into a SINK_NOTIFY_MSG message and broadcasts it with a radius R, and the node calculates the distance from the sink k according to the RSSI value, so as to obtain the cluster head selection prob...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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