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

Adaptive Clustering Algorithm Based on Density Estimation for Coexistence of 1-hop and 2-hop Clusters in Vanets

A 2-hop, density estimation technology, applied in wireless communication, transmission system, network topology, etc., can solve problems such as single clustering structure

Active Publication Date: 2020-03-17
XI AN JIAOTONG UNIV
View PDF1 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to overcome the defect that the clustering structure is single in the existing VANETs, ​​provide a kind of self-adaptive clustering method based on density estimation 1-hop and 2-hop cluster coexistence in VANETs, ​​compared with the traditional clustering algorithm ratio, this method can effectively improve the communication performance 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
  • Adaptive Clustering Algorithm Based on Density Estimation for Coexistence of 1-hop and 2-hop Clusters in Vanets
  • Adaptive Clustering Algorithm Based on Density Estimation for Coexistence of 1-hop and 2-hop Clusters in Vanets
  • Adaptive Clustering Algorithm Based on Density Estimation for Coexistence of 1-hop and 2-hop Clusters in Vanets

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] Below in conjunction with accompanying drawing and embodiment the present invention is described in further detail:

[0055] Such as figure 1 As shown, in the VANETs provided by the present invention, the adaptive clustering method based on the coexistence of 1-hop and 2-hop clusters of density estimation comprises the following steps:

[0056] By getting the current position of the node (x i,t ,y i,t ), speed v i,t and acceleration a i,t It is estimated that the node is at (t+T s ) time position and speed

[0057]

[0058]

[0059] By judging (t+T s ) Euclidean distance between nodes at time Compared with the node communication radius TR, the node is at (t+T s ) estimated value of the number of 1-hop neighbor nodes at time And then calculate each node in (t+T s ) time DF, 1-hopVF and 2-hopVF are stored in the entry of each node:

[0060]

[0061] In the formula:

[0062]

[0063] is the 1-hop neighbor node set of node i, for Any node j...

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 1-hop and 2-hop clusters coexistent adaptive clustering method based on density estimation in VANETs. The method comprises the following steps: estimating the 1-hop neighbor node density in the future time, as the formula, based on the current position and current speed of a node, comparing the 1-hop neighbor node density with a threshold, and judging whether the node is suitable to form the 1-hop cluster or the 2-hop cluster, and initializing the node as a cluster head node; in each cluster, selecting a node with the minimum relative mobility, that is the formula is the minimum, as a cluster head, reducing other nodes in the cluster to cluster members, and if there are two or multiple nodes with the minimum relative mobility, then selecting a node with the minimum ID as the cluster head; and performing post maintenance of a cluster structure based on the possible situations in the network. A clustering algorithm disclosed by the invention has the advantages of being low in delay and low in packet loss.

Description

technical field [0001] The invention relates to a clustering routing protocol CBRP (Clustering Based Routing Protocol) based on minimum ID clustering in VANETs, ​​in particular to an adaptive clustering method in VANETs in which 1-hop and 2-hop clusters coexist based on density estimation. Background technique [0002] With the improvement of people's living standards year after year, the number of cars has increased sharply, the urban traffic density has increased significantly, and the problem of road congestion has become more and more serious. Therefore, with the rapid development of computer technology and communication technology, V2V communication between vehicles and V2I communication between vehicles and roadside equipment have promoted the development and upgrading of VANET. Although VANET is an application of Ad Hoc network, due to its special network environment, motion rules and application background, the wireless channel is unstable, the network capacity is li...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H04W40/02H04W40/20H04W40/22H04W84/18H04L29/08
CPCH04L67/12H04W40/026H04W40/20H04W40/22H04W84/18
Inventor 王霞武璐琪
Owner XI AN JIAOTONG 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