CN109640295A - There is both candidate nodes set construction method of the infrastructure car networking towards connection prediction in City scenarios - Google Patents
There is both candidate nodes set construction method of the infrastructure car networking towards connection prediction in City scenarios Download PDFInfo
- Publication number
- CN109640295A CN109640295A CN201910097641.6A CN201910097641A CN109640295A CN 109640295 A CN109640295 A CN 109640295A CN 201910097641 A CN201910097641 A CN 201910097641A CN 109640295 A CN109640295 A CN 109640295A
- Authority
- CN
- China
- Prior art keywords
- node
- car networking
- rsu
- infrastructure
- candidate
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/46—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for vehicle-to-vehicle communication [V2V]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/18—Communication route or path selection, e.g. power-based or shortest path routing based on predicted events
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Traffic Control Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
In the car networking for having infrastructure, because there is the auxiliary of infrastructure RSU, whole network may be at connected state, i.e. vehicle can realize connection by truck traffic or the forwarding of RSU node within the scope of RSU.However, since vehicle may have acceleration and deceleration in the process of moving, turning, all standing, sail out of the various actions such as road network, i.e. freedom degree is very high, RSU node is caused not only to need real-time update when being managed control to region, it also needs that the vehicle node in region is instructed to be connected in time when topological structure changes, to will lead to RSU traffic congestion and data loss problem.Therefore, analyzing with the prediction that is connected to for solving the problems, such as car networking network node in urban road scene is to solve the access effective ways of car networking network.The present invention provide in view of the above problems have in City scenarios infrastructure car networking towards connection prediction both candidate nodes set construction method, be related to be connected to candidate node set tectonic model be connected to candidate node set construction algorithm.
Description
Technical field
The present invention relates to car networking fields, and in particular to has infrastructure car networking towards connection prediction in City scenarios
Both candidate nodes set construction method.
Background technique
In the car networking for having infrastructure, because there is the auxiliary of infrastructure RSU, whole network may be at connected state
State, i.e. vehicle can realize connection by truck traffic or the forwarding of RSU node within the scope of RSU, and across RSU vehicle can be made by RSU
Be connected to for routing gateway because the position RSU fix across RSU inter-vehicular communication can according to traditional routing mode into
Row.And since vehicle may have acceleration and deceleration in the process of moving, turning, all standing, sail out of the various actions such as road network, i.e. freedom degree very
Height causes RSU node not only to want real-time update when being managed control to region, it is also necessary to become in topological structure
The vehicle node in region is instructed to be connected in time when change, thus guarantee the real-time and stability of connection, i.e., it is access, and
And load balancing can be to avoid traffic congestion and loss of data.
In conclusion when there is presently no to there is infrastructure car networking network part node presentation Weak link in City scenarios,
The candidate node set for implementing connection prediction is studied.Therefore, the car networking network for having infrastructure in City scenarios is kept
Integrated connection property, mitigates the load balancing of RSU, so that effective transmission of car networking data be effectively ensured.
Summary of the invention
Goal of the invention:
Research method of the present invention is to mitigate RSU's for the car networking network entirety connectivity for having infrastructure in City scenarios
Problem of load balancing constructs the candidate node set towards connection prediction, when Weak link is presented in car networking network part node, still
The integrated connection of car networking network can so be kept.
Correlative study is carried out currently without to this problem.
For this purpose, the present invention specifically gives following technical scheme realization:
There is both candidate nodes set construction method of the infrastructure car networking towards connection prediction in City scenarios, which is characterized in that tool
Body method includes the following steps:
Step 1. is connected to candidate node set tectonic model
Step 2. is connected to candidate node set construction algorithm
The connection candidate node set tectonic model, comprising steps of
Because there are RSU nodes to carry out auxiliary communication in the car networking for having infrastructure, when temporary not connection situation goes out
Now, RSU node can play the effect for being similar to interchanger in network as bridging nodes, so that already off subnet
Again it is connected to.But originally can by data that vehicle self-organizing network is transmitted will approach RSU node forward, can make
RSU node load increases suddenly, simultaneously because the high of vehicle moves fast characteristic, transmits in contrast static RSU internodal data
It is inefficient.Therefore it when t moment is after detecting Weak link, needs that effective method is taken to obtain being chosen node, so that not
The t+ δ moment come can preferentially obtain effectively being connected to side from selected node after connecting disconnection, and then RSU node is avoided to fulfil friendship
The responsibility changed planes.
The disconnected two node v of t moment in car networkingi, vjA possibility that being connected within the shorter Δ t time is defined as saving
Point gravitation VertexAttraction, is denoted as VA (vi, vj), mathematic(al) representation is (1):
Wherein Relu function is common activation primitive in deep learning, and Relu (x)=max (0, x), functional image is as schemed
Shown in 2Relu functional picture,Coefficient is the centrality feature in order to meet node.VecDis(xi, xj)
It is the prediction measures model (Cheng Jiujun that intensity is connected between the vehicle node analyzed based on car networking space-time data in City scenarios
Filed in equal inventors' on July 25th, 2018 " between the vehicle node analyzed based on car networking space-time data in City scenarios
It is connected to the prediction measures model of intensity " (applicant: Tongji University, number of patent application: 201810824233.1) trained in
Vector distance calculates function, xi, xjFor node vi, vjCorresponding attribute vector.
Two node set S in car networkinga, SbMaximum a pair of of the point of intermediate node gravitation is defined as connection both candidate nodes
CandidatePoint is denoted as CP (Sa, Sb), model are as follows:
According to the calculation formula of CandidatePoint, when Weak link disconnects, it would be desirable to the node collection S=CP preferentially detected
(BVa, Γ (BVb))∪CP(BVb, Γ (BVa))∪CP(Γ(BVa), Γ (BVb)), and the element in gathering is < vi, vj> top
For point to form, the node gravitation size sequence between two o'clock is consistent with priority order in Candidate Set is connected to.
The connection candidate node set construction algorithm, comprising steps of
Have in the car networking of infrastructure, all RSU information and its node set V (t), line set E (t) of t moment are set, even
Logical intensity set W (t), corresponding Weak link point set BV (t), Weak link side collection BE (t) obtain connection candidate node set construction and calculate
Method, specific algorithm process is as shown in algorithm 1.
Beneficial effect
Present invention aims at disclose road network situation and all extremely complex feelings of structure in a kind of consideration City scenarios actual traffic
Under condition, when providing one kind has infrastructure car networking network node that Weak link is presented, in order to keep car networking network to be integrally connected to
Property, construct the candidate node set towards connection prediction.
Vehicle may have that acceleration and deceleration, turning, all standing, to sail out of the freedom degrees such as road network very high each in the process of moving in City scenarios
Kind of behavior, in the case where the connection ability and RSU node traffic congestion and loss of data that lead to overall network, providing one kind can
Think the connection predicting candidate node set construction method for thering is infrastructure car networking network integrally to remain connection.
Detailed description of the invention
The crossing Fig. 1 network topological diagram
Fig. 2 Relu functional picture
Fig. 3 building connection both candidate nodes set algorithm
Fig. 4 is the method for the present invention flow chart
Specific embodiment
" the vehicle analyzed based on car networking space-time data in City scenarios filed in the inventors such as Cheng Jiujun on July 25th, 2018
The prediction measures model of intensity is connected between node " (applicant: Tongji University, number of patent application: 201810824233.1)
Disclosure can be considered as the component part of description of the invention.
Specific implementation process of the invention is as shown in figure 4, include following 2 aspects:
1. being connected to candidate node set tectonic model
2. being connected to candidate node set construction algorithm
①
It is connected to candidate node set tectonic model
Because there are RSU nodes to carry out auxiliary communication in the car networking for having infrastructure, when temporary not connection situation goes out
Now, RSU node can play the effect for being similar to interchanger in network as bridging nodes, so that already off subnet
Again it is connected to.But originally can by data that vehicle self-organizing network is transmitted will approach RSU node forward, can make
RSU node load increases suddenly, simultaneously because the high of vehicle moves fast characteristic, transmits in contrast static RSU internodal data
It is inefficient.Therefore it when t moment is after detecting Weak link, needs that effective method is taken to obtain being chosen node, so that not
The t+ δ moment come can preferentially obtain effectively being connected to side from selected node after connecting disconnection, and then RSU node is avoided to fulfil friendship
The responsibility changed planes.
As shown in Fig. 1 road conditions network topological diagram, e is detected1, e2, e3For Weak link, the reason is that node v1It turns to and sails out of the net
Network, so will lead to top v2Node and connected network and lower section network disconnect, and the temporary of network is caused not to be connected to.We need
It will be to neighbor node, that is, v of two sides2With v3, v4Connection possibility calculated and predicted to deciding whether to be included in alternative section
RSU node also or when disconnecting directly is carried out auxiliary communication as temporary bridge contact by point.
If grouping number k=2 when Weak link detects, i.e. figure G may be divided into a, two subgraphs of b, the top on Weak link both sides
Point constitutes boundary node set BVaWith BVb.And the neighbors set in figure is denoted as Γ (ξ), when ξ is node, then Γ (ξ) is indicated
The set of all neighbors of ξ, when ξ is set, Γ (ξ) is expressed as all and ξ interior joint adjacent node set, whereinSo our target is will be to (BVa, Γ (BVb)), (BVb, Γ (BVa)), (Γ (BVa), Γ (BVb))
Whether three group nodes carry out relevant calculation, therefore, it is determined that there is satisfactory alternate node to occur.
The disconnected two node v of t moment in car networkingi, vjA possibility that being connected within the shorter Δ t time is defined as saving
Point gravitation VertexAttraction, is denoted as VA (vi, vj), mathematic(al) representation is (1):
Wherein Relu function is common activation primitive in deep learning, and Relu (x)=max (0, x), functional image is as schemed
Shown in 2Relu functional picture,Coefficient is the centrality feature in order to meet node.VecDis(xi,
xj) it is the prediction measures model (journey that intensity is connected between the vehicle node analyzed based on car networking space-time data in City scenarios
" the vehicle node analyzed based on car networking space-time data in City scenarios filed in the inventors such as long army on July 25th, 2018
Between be connected to intensity prediction measures model " (applicant: Tongji University, number of patent application: 201810824233.1) in training
Good vector distance calculates function, xi, xjFor node vi, vjCorresponding attribute vector.
According to the prediction measures model for being connected to intensity between the vehicle node analyzed based on car networking space-time data in City scenarios
(" the vehicle section analyzed based on car networking space-time data in City scenarios filed in the inventors such as Cheng Jiujun on July 25th, 2018
The prediction measures model of intensity is connected between point " (applicant: number of patent application: 201810824233.1) Tongji University, determines
Percent continuity ConnexFactor (v whether connection between nodei, vj, t) and=[Distance (vi, vj)≤Range] it depends on
The distance between node, therefore estimate that the position of t+ time Δt is extremely important according to the state of node t moment.Because when Δ t
Between it is shorter, basic displacement calculation formula can be usedIt handles, remembers two nodes after Δ t
Distance is Distance (v 'i, v 'j), there is no practical significance not because the time is too short in the intercurrent of short duration connection of Δ t
Give consideration.
Two node set S in car networkinga, SbMaximum a pair of of the point of intermediate node gravitation is defined as connection both candidate nodes
CandidatePoint is denoted as CP (Sa, Sb), model are as follows:
According to the calculation formula of CandidatePoint, when Weak link disconnects, it would be desirable to the node collection S=CP preferentially detected
(BVa, Γ (BVb))∪CP(BVb, Γ (BVa))∪CP(Γ(BVa), Γ (BVb)), and the element in gathering is < vi, vj> top
For point to form, the node gravitation size sequence between two o'clock is consistent with priority order in Candidate Set is connected to.
②
It is connected to candidate node set construction algorithm
Have in the car networking of infrastructure, all RSU information and its node set V (t), line set E (t) of t moment are set, even
Logical intensity set W (t), corresponding Weak link point set BV (t), Weak link side collection BE (t) obtain connection candidate node set construction and calculate
Method, for specific algorithm process as shown in algorithm 1, algorithm flow chart is specifically as shown in Figure 3.
(journey is long for the prediction measures model of connection intensity between the vehicle node analyzed based on car networking space-time data in City scenarios
Filed in the inventors such as army on July 25th, 2018 " vehicle node analyzed based on car networking space-time data in City scenarios it
Between be connected to intensity prediction measures model " (applicant: Tongji University, number of patent application: 201810824233.1), the patent Shen
The technical solution that please be provide are as follows: reachability problem caused by frequently changing for car networking space-time data isomery and topology, structure
The neural network model based on the polymerization of the tensor factor is built, for predicting the connection intensity between vehicle node.), propose one kind
There is both candidate nodes set construction method of the infrastructure car networking towards connection prediction in City scenarios.
To be connected to intensity as the weight on side, the connection candidate node set of construction connection prediction is new so as to effectively select
Bridging nodes fundamentally facilitate the car networking for having infrastructure in City scenarios to effectively mitigate the load balancing of RSU
Network integrally keeps being connected to.
Claims (1)
1. there is both candidate nodes set construction method of the infrastructure car networking towards connection prediction in City scenarios, which is characterized in that
Specific method includes the following steps:
Step 1. building connection candidate node set tectonic model；
Step 2. is connected to candidate node set construction algorithm；
The connection candidate node set tectonic model, comprising steps of
The disconnected two node v of t moment in car networkingi,vjA possibility that being connected within the shorter Δ t time is defined as saving
Point gravitation VertexAttraction, is denoted as VA (vi,vj), mathematic(al) representation is (1):
Wherein Relu function be deep learning in common activation primitive, Relu (x)=max (0, x),System
Number is the centrality feature in order to meet node.VecDis(xi,xj) it is existing based on car networking space-time data in City scenarios
It is connected to trained vector distance in the prediction measures model of intensity between the vehicle node of analysis and calculates function, xi,xjFor node
vi,vjCorresponding attribute vector；
Two node set S in car networkinga,SbMaximum a pair of of the point of intermediate node gravitation is defined as connection both candidate nodes
CandidatePoint is denoted as CP (Sa,Sb), model are as follows:
The connection candidate node set construction algorithm, comprising steps of
Have in the car networking of infrastructure, all RSU information and its node set V (t), line set E (t) of t moment are set, even
Logical intensity set W (t), corresponding Weak link point set BV (t), Weak link side collection BE (t) obtain connection candidate node set construction and calculate
Method, specific algorithm process is as shown in algorithm 1:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910097641.6A CN109640295B (en) | 2019-01-31 | 2019-01-31 | Candidate node set construction method for communication prediction oriented in infrastructure Internet of vehicles in urban scene |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910097641.6A CN109640295B (en) | 2019-01-31 | 2019-01-31 | Candidate node set construction method for communication prediction oriented in infrastructure Internet of vehicles in urban scene |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109640295A true CN109640295A (en) | 2019-04-16 |
| CN109640295B CN109640295B (en) | 2020-08-14 |
Family
ID=66064490
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910097641.6A Active CN109640295B (en) | 2019-01-31 | 2019-01-31 | Candidate node set construction method for communication prediction oriented in infrastructure Internet of vehicles in urban scene |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109640295B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112689267A (en) * | 2020-12-16 | 2021-04-20 | 同济大学 | Dynamic evolution method for open type unmanned vehicle group in expressway scene |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102724663A (en) * | 2011-03-29 | 2012-10-10 | 上海永畅信息科技有限公司 | Relay-based cooperative communication system for Internet of Vehicles |
| CN102737503A (en) * | 2012-06-20 | 2012-10-17 | 东南大学 | Communication connectivity analysis method for bus dynamic scheduling under internet of vehicles environment |
| CN103702387A (en) * | 2014-01-08 | 2014-04-02 | 重庆邮电大学 | Social network-based vehicle-mounted self-organization network routing method |
| CN103747063A (en) * | 2013-12-27 | 2014-04-23 | 哈尔滨工业大学 | Vehicle networking information broadcast based on MTPA algorithm |
| CN104598727A (en) * | 2015-01-07 | 2015-05-06 | 哈尔滨工业大学 | Urban road environment-oriented link time-delay dynamic predication method of V2V in VANETs (Vehicular Ad Hoc Networks) in consideration of intersection |
| CN104851282A (en) * | 2015-04-24 | 2015-08-19 | 同济大学 | City Internet of Vehicles data transmission path selection method based on connectivity mechanism |
| WO2015160859A1 (en) * | 2014-04-14 | 2015-10-22 | Sirius Xm Radio Inc. | Systems, methods and applications for using and enhancing vehicle to vehicle communications including synergies and interoperation with satellite radio |
| CN105722176A (en) * | 2016-01-29 | 2016-06-29 | 同济大学 | Connection method of Internet of Vehicles massive heterogeneous network with infrastructure in city scene |
| WO2017062120A1 (en) * | 2015-10-05 | 2017-04-13 | Qualcomm Incorporated | Minimization of resource allocation delay for v2x application |
| CN106972898A (en) * | 2017-03-15 | 2017-07-21 | 北京大学 | Car networking data transmission scheduling method based on channel estimating |
| CN107196835A (en) * | 2017-05-31 | 2017-09-22 | 同济大学 | The connection base component building method that car networking large scale network interconnects |
| WO2018174763A1 (en) * | 2017-03-24 | 2018-09-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Resource allocation methods and nodes with self-adapting to different synchronizations |
-
2019
- 2019-01-31 CN CN201910097641.6A patent/CN109640295B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102724663A (en) * | 2011-03-29 | 2012-10-10 | 上海永畅信息科技有限公司 | Relay-based cooperative communication system for Internet of Vehicles |
| CN102737503A (en) * | 2012-06-20 | 2012-10-17 | 东南大学 | Communication connectivity analysis method for bus dynamic scheduling under internet of vehicles environment |
| CN103747063A (en) * | 2013-12-27 | 2014-04-23 | 哈尔滨工业大学 | Vehicle networking information broadcast based on MTPA algorithm |
| CN103702387A (en) * | 2014-01-08 | 2014-04-02 | 重庆邮电大学 | Social network-based vehicle-mounted self-organization network routing method |
| WO2015160859A1 (en) * | 2014-04-14 | 2015-10-22 | Sirius Xm Radio Inc. | Systems, methods and applications for using and enhancing vehicle to vehicle communications including synergies and interoperation with satellite radio |
| CN104598727A (en) * | 2015-01-07 | 2015-05-06 | 哈尔滨工业大学 | Urban road environment-oriented link time-delay dynamic predication method of V2V in VANETs (Vehicular Ad Hoc Networks) in consideration of intersection |
| CN104851282A (en) * | 2015-04-24 | 2015-08-19 | 同济大学 | City Internet of Vehicles data transmission path selection method based on connectivity mechanism |
| WO2017062120A1 (en) * | 2015-10-05 | 2017-04-13 | Qualcomm Incorporated | Minimization of resource allocation delay for v2x application |
| CN105722176A (en) * | 2016-01-29 | 2016-06-29 | 同济大学 | Connection method of Internet of Vehicles massive heterogeneous network with infrastructure in city scene |
| CN105722176B (en) * | 2016-01-29 | 2019-04-02 | 同济大学 | There is the connectivity method of the large scale scale heterogeneous network of the car networking of infrastructure in City scenarios |
| CN106972898A (en) * | 2017-03-15 | 2017-07-21 | 北京大学 | Car networking data transmission scheduling method based on channel estimating |
| WO2018174763A1 (en) * | 2017-03-24 | 2018-09-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Resource allocation methods and nodes with self-adapting to different synchronizations |
| CN107196835A (en) * | 2017-05-31 | 2017-09-22 | 同济大学 | The connection base component building method that car networking large scale network interconnects |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112689267A (en) * | 2020-12-16 | 2021-04-20 | 同济大学 | Dynamic evolution method for open type unmanned vehicle group in expressway scene |
| CN112689267B (en) * | 2020-12-16 | 2022-05-13 | 同济大学 | Dynamic evolution method for open type unmanned vehicle group in expressway scene |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109640295B (en) | 2020-08-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zheng et al. | Adaptive communication protocols in flying ad hoc network | |
| Liu et al. | Distributed cooperative reinforcement learning-based traffic signal control that integrates V2X networks’ dynamic clustering | |
| Oubbati et al. | SEARCH: An SDN-enabled approach for vehicle path-planning | |
| CN105208616A (en) | Road topology based adaptive multi-copy routing method in vehicular ad hoc network | |
| Ji et al. | Efficient and reliable cluster-based data transmission for vehicular ad hoc networks | |
| CN107426694B (en) | Fuzzy clustering method for vehicle-mounted self-organizing network | |
| Huang et al. | Vehicle-to-Infrastructure (V2I) offloading from cellular network to 802.11 p Wi-Fi network based on the Software-Defined Network (SDN) architecture | |
| CN112954769B (en) | Underwater wireless sensor network routing method based on reinforcement learning | |
| Araujo et al. | CARTIM: A proposal toward identification and minimization of vehicular traffic congestion for VANET | |
| CN105101086B (en) | A kind of data transfer path system of selection based on traffic density distribution | |
| CN106102099A (en) | A kind of isomery car networking changing method based on residence time | |
| CN107690169A (en) | A kind of retransmission method of GPSR Routing Protocols suitable for car networking | |
| CN108667668B (en) | Accessibility routing method based on Internet of vehicles communication base in urban road scene | |
| Shen et al. | AODV-PNT: An improved version of AODV routing protocol with predicting node trend in VANET | |
| CN109640295A (en) | There is both candidate nodes set construction method of the infrastructure car networking towards connection prediction in City scenarios | |
| CN107969008A (en) | A kind of software definition Sensor Network concentrated route computational methods | |
| Syfullah et al. | Mobility-based clustering algorithm for multimedia broadcasting over IEEE 802.11 p-LTE-enabled VANET | |
| CN106161118A (en) | In a kind of wireless sense network, the k of balancing energy jumps cluster routing method | |
| CN106330536A (en) | Method for acquiring network state information of wmSDN | |
| CN108881016A (en) | The polygonal colour sorting community load-balancing algorithm of car networking self-organizing network | |
| CN111356199B (en) | Vehicle-mounted self-organizing network routing method in three-dimensional scene | |
| CN108650141B (en) | Large-scale network accessibility model design method based on Internet of vehicles communication base | |
| Prakash et al. | Path Load Balancing Adaptive Gateway Discovery in MANET-Internet Integration Using PSO. | |
| Gazori et al. | Sbgrp as an improved stable cds-based routing protocol in vehicular ad hoc networks | |
| CN103957574B (en) | A kind of automobile-used network route method based on topological Prognostics |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |