CN107171958A - A kind of section subregion route selecting method of SDN In-vehicle networkings - Google Patents
A kind of section subregion route selecting method of SDN In-vehicle networkings Download PDFInfo
- Publication number
- CN107171958A CN107171958A CN201710374607.XA CN201710374607A CN107171958A CN 107171958 A CN107171958 A CN 107171958A CN 201710374607 A CN201710374607 A CN 201710374607A CN 107171958 A CN107171958 A CN 107171958A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- region
- car
- linktoend
- hopnumber
- 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
- 238000000034 method Methods 0.000 title claims abstract description 15
- 230000006855 networking Effects 0.000 title claims abstract description 12
- 102100029768 Histone-lysine N-methyltransferase SETD1A Human genes 0.000 claims abstract description 24
- 101000865038 Homo sapiens Histone-lysine N-methyltransferase SETD1A Proteins 0.000 claims abstract description 24
- 238000004891 communication Methods 0.000 claims abstract description 23
- 230000009191 jumping Effects 0.000 claims description 23
- 238000005096 rolling process Methods 0.000 claims description 15
- 230000000644 propagated effect Effects 0.000 claims description 10
- 230000005540 biological transmission Effects 0.000 abstract description 14
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000013316 zoning Methods 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/17—Interaction among intermediate nodes, e.g. hop by hop
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of section subregion route selecting method of SDN In-vehicle networkings, it is ensured that before the selected vehicle in latter region leaves region, and the selected vehicle in previous region can stable connection therewith always；When the selected vehicle in last region in section leaves section, it is not necessary to recalculate whole piece communication link, it is only necessary to above-mentioned algorithm is repeated in Set1, one propagation vehicle of selection is added in existing communication link；Data transmission efficiency is effectively improved, transmission stability is improved, the shortcoming of redundancy ability difference is overcome.
Description
Technical field
The present invention relates to the technical field of In-vehicle networking, selected more particularly, to a kind of section subregion of SDN In-vehicle networkings
Path method.
Background technology
In the centralized In-vehicle networking of traditional SDN thoughts, flutterred according to section information of vehicles one Zhang Tuo of formation of collection
Figure, selects a scheme by source point to terminal Jing Guo fewest number of hops using shortest path first, can cause the transmission of data
As far as possible terminal is passed to by most short link；This method ensure that the route calculated every time is all effective and most short.
Due to the high mobility of vehicle, the topology in vehicle-mounted net is highly dynamic change, when vehicle condition is complicated, route break frequency
Numerous, it may be necessary to frequently to calculate shortest route, this carrys out very big router-level topology expense and handling capacity expense to vehicle-mounted guipure.Together
When, huge handling capacity means channel congestion, causes the slow even packet loss of routing table distribution, this can further reduce transmission again
Efficiency；Therefore the transmission method of shortest path is a kind of way of redundancy ability difference.
The content of the invention
The problem to be solved in the present invention is：There is provided a kind of raising data transmission efficiency, redundancy ability good SDN In-vehicle networkings
Section subregion route selecting method.
The present invention realizes that the technical scheme that above-mentioned purpose is proposed is as follows：
A kind of section subregion route selecting method of SDN In-vehicle networkings, comprises the following steps：
S1. section is in turn divided into n border circular areas, wherein, the radius in first region and last region is
D/2；The radius of n-2 border circular areas between first region and last region is D, and described D believes for vehicle
Cease the radius of transmission；
S2. the minimum hop count minhop of all cars of last region Setn is initializedk=1, link information linktoendk
={ k }；Described minhopkThe hop count required for last region is reached for vehicle k；Described linktoendkRepresent car
K reaches the link information that last region is formed；
S3. for region Seti, the set of all vehicles in the region is found out；I represents ith zone, wherein i
=(1,2,3 ..., n-1)；Judge whether the vehicle a in Seti can keep being connected until car b with any vehicle b in Seti+1
Region Seti+1 is left, if can, jumping figure value hopnumber (a, b)=1 most short between car a and car b；Otherwise in disconnection
Calculate in time t between car a and car b with the presence or absence of repeater car can to set up between car a and car b contact up to car b from
Open region Seti+1, if so, then making jumping figure value hopnumber (a, b)=2；And according to hopnumber minimum in Seti+1
(a, b), records linktoenda={ a, linktoendb, and update minhopa=minhopb+hopnumber(a,b)；It is no
Then, hopnumber (a, b)=∞；
S4. the jumping figure value hopnumber and linktoend for obtaining rolling stock in the Seti of region are calculated by step S3
Value；
S5. by step S3~S4, jumping figure value hopnumber and the linktoend value of the vehicle in Zone Full is calculated,
And update the minhop values of rolling stock；
S6. all car minhop in Set1 are ranked up, select the vehicle c of minimum hop count minhop in Set1, according to
The vehicle c of record linktoendcInformation, select the minimum communication links of minhop and propagated；
S7. after the propagation vehicle in last region leaves the section, the vehicle in first region Set1 is repeated
Step S3~S5, calculates the most short jumping figure value between the first car in the rolling stock and last communication link in Set1
Hopnumber and linktoend values, select the minimum vehicles of hopnumber and are added in communication link and propagated.
In such scheme, the vehicle in section is managed using the method for section subregion, in the Seti of zoning
All vehicles and region Seti+1 in each car jumping figure value, the jumping figure value of all vehicles in posting field Seti
Hopnumber (a, b) and link information linktoend, and update minhop；The hop count of each car in Zone Full is calculated successively
Value hopnumber and linktoend value, and update the minhop values of rolling stock；Then, all car minhop in Set1 are entered
Row sequence, selects the vehicle c of minimum hop count minhop in Set1, according to the vehicle c of record linktoendcInformation, choose
Go out the minimum communication links of minhop to be propagated；After the propagation vehicle in last region leaves the section；Calculate
Most short jumping figure value hopnumber between first car in rolling stock in Set1 and last communication link and
Linktoend values, select the minimum vehicles of hopnumber and are added in communication link and propagated；It need not compute repeatedly
The minhop values of each vehicle in Zone Full, it is only necessary to calculate the rolling stock in Set1, jumping figure value is chosen from Set1
Minimum vehicle is added to the original communication link of communication；Data transmission efficiency is effectively improved, transmission stability is improved, gram
Take the shortcoming of redundancy ability difference.
It is preferred that, described link information linktoend represents that vehicle reaches the link letter that last region is formed
Breath；
For example：linktoendk={ k, a, b }, represent vehicle k reach last region link be followed successively by vehicle k →
Vehicle a → vehicle b.Compared with prior art, the beneficial effects of the invention are as follows：
The present invention provides a kind of method of section partition management, it is ensured that the selected vehicle in latter region leaves region
Before, the selected vehicle in previous region can stable connection therewith always；When section last region selected vehicle from
During section of opening a way, it is not necessary to recalculate whole piece communication link, it is only necessary to above-mentioned algorithm is repeated in Set1, a propagation car is selected
It is added in existing communication link；Data transmission efficiency is effectively improved, transmission stability is improved, overcomes redundancy ability
The shortcoming of difference.
Brief description of the drawings
The section subregion route selecting method specific steps flow chart for the SDN In-vehicle networkings that Fig. 1 provides for the present invention.
Embodiment
Accompanying drawing being given for example only property explanation, it is impossible to be interpreted as the limitation to this patent；It is attached in order to more preferably illustrate the present embodiment
Scheme some parts to have omission, zoom in or out, do not represent the size of actual product；To those skilled in the art,
Some known features and its explanation may be omitted and will be understood by accompanying drawing；Patent for a better understanding of the present invention, below
Technical scheme is described further with reference to accompanying drawing and case study on implementation.
Specific embodiments of the present invention are described below：
A kind of section subregion route selecting method of SDN In-vehicle networkings, specific steps flow chart is as shown in Figure 1：Including following step
Suddenly：
S1. section is in turn divided into n border circular areas, wherein, the radius in first region and last region is
D/2；The radius of n-2 border circular areas between first region and last region is D, and described D believes for vehicle
Cease the radius of transmission；
S2. the minimum hop count minhop of all cars of last region Setn is initializedk=1, link information linktoendk
={ k }；Described minhopkThe hop count required for last region is reached for vehicle k；Described linktoendkRepresent car
K reaches the link information that last region is formed；
S3. for region Seti, the set of all vehicles in the region is found out；I represents ith zone, wherein i
=(1,2,3 ..., n-1)；Judge whether the vehicle a in Seti can keep being connected until car b with any vehicle b in Seti+1
Region Seti+1 is left, if can, jumping figure value hopnumber (a, b)=1 most short between car a and car b；Otherwise in disconnection
Calculate in time t between car a and car b with the presence or absence of repeater car can to set up between car a and car b contact up to car b from
Open region Seti+1, if so, then making jumping figure value hopnumber (a, b)=2；And according to hopnumber minimum in Seti+1
(a, b), records linktoenda={ a, linktoendb, and update minhopa=minhopb+hopnumber(a,b)；It is no
Then, hopnumber (a, b)=∞；
S4. the jumping figure value hopnumber and linktoend for obtaining rolling stock in the Seti of region are calculated by step S3
Value；
S5. by step S3~S4, jumping figure value hopnumber and the linktoend value of the vehicle in Zone Full is calculated,
And update the minhop values of rolling stock；
S6. all car minhop in Set1 are ranked up, select the vehicle c of minimum hop count minhop in Set1, according to
The vehicle c of record linktoendcInformation, select the minimum communication links of minhop and propagated；
S7. after the propagation vehicle in last region leaves the section, the vehicle in first region Set1 is repeated
Step S3~S5, calculates the most short jumping figure value between the first car in the rolling stock and last communication link in Set1
Hopnumber and linktoend values, select the minimum vehicles of hopnumber and are added in communication link and propagated.
Wherein, in the present embodiment, the vehicle in section is managed using the method for section subregion, zoning
The jumping figure value of all vehicles in the jumping figure value of all vehicles and each car in the Seti+1 of region in Seti, posting field Seti
Hopnumber (a, b) and link information linktoend, and update minhop；The hop count of each car in Zone Full is calculated successively
Value hopnumber and linktoend value, and update the minhop values of rolling stock；Then, all car minhop in Set1 are entered
Row sequence, selects the vehicle c of minimum hop count minhop in Set1, according to the vehicle c of record linktoendcInformation, choose
Go out the minimum communication links of minhop to be propagated；After the propagation vehicle in last region leaves the section；Calculate
Most short jumping figure value hopnumber between first car in rolling stock in Set1 and last communication link and
Linktoend values, select the minimum vehicles of hopnumber and are added in communication link and propagated；It need not compute repeatedly
The minhop values of each vehicle in Zone Full, it is only necessary to calculate the rolling stock in Set1, jumping figure value is chosen from Set1
Minimum vehicle is added to the original communication link of communication；Data transmission efficiency is effectively improved, transmission stability is improved, gram
Take the shortcoming of redundancy ability difference.
In the present embodiment, described link information linktoend represents that vehicle reaches what last region was formed
Link information；
For example：linktoendk={ k, a, b }, represent vehicle k reach last region link be followed successively by vehicle k →
Vehicle a → vehicle b.Compared with prior art, the beneficial effects of the invention are as follows：
Obviously, the above embodiment of the present invention is only intended to clearly illustrate example of the present invention, and is not pair
The restriction of embodiments of the present invention.For those of ordinary skill in the field, may be used also on the basis of the above description
To make other changes in different forms.There is no necessity and possibility to exhaust all the enbodiments.It is all this
Any modifications, equivalent substitutions and improvements made within the spirit and principle of invention etc., should be included in the claims in the present invention
Protection domain within.
Claims (2)
1. a kind of section subregion route selecting method of SDN In-vehicle networkings, it is characterised in that：Comprise the following steps：
S1. section is in turn divided into n border circular areas, wherein, the radius in first region and last region is D/2；
The radius of n-2 border circular areas between first region and last region is D, and described D passes for information of vehicles
Defeated radius；
S2. the minimum hop count minhop of all cars of last region Setn is initializedk=1, link information linktoendk=
{k}；Described minhopkThe hop count required for last region is reached for vehicle k；Described linktoendkRepresent vehicle K
Reach the link information that last region is formed；
S3. for region Seti, the set of all vehicles in the region is found out；I represents ith zone, wherein i=
(1,2,3 ..., n-1)；Judge the vehicle a in Seti whether can with Seti+1 any vehicle b keep be connected until car b from
Open region Seti+1, if can, jumping figure value hopnumber (a, b)=1 most short between car a and car b；Otherwise disconnection when
Between calculate in t between car a and car b and to set up contact between car a and car b up to car b leaves with the presence or absence of repeater car
Region Seti+1, if so, then making jumping figure value hopnumber (a, b)=2；And according to hopnumber minimum in Seti+1 (a,
B), linktoend is recordeda={ a, linktoendb, and update minhopa=minhopb+hopnumber(a,b)；Otherwise,
Hopnumber (a, b)=∞；
S4. jumping figure value hopnumber and the linktoend value for obtaining rolling stock in the Seti of region is calculated by step S3；
S5. by step S3~S4, jumping figure value hopnumber and the linktoend value of the vehicle in Zone Full is calculated, and more
The minhop values of new rolling stock；
S6. all car minhop in Set1 are ranked up, the vehicle c of minimum hop count minhop in Set1 are selected, according to record
Vehicle c linktoendcInformation, select the minimum communication links of minhop and propagated；
S7. after the propagation vehicle in last region leaves the section, to the vehicle repeat step in first region Set1
S3~S5, calculates the most short jumping figure value between the first car in the rolling stock and last communication link in Set1
Hopnumber and linktoend values, select the minimum vehicles of hopnumber and are added in communication link and propagated.
2. the section subregion route selecting method of SDN In-vehicle networkings according to claim 1, it is characterised in that：Described link
Information linktoend represents that vehicle reaches the link information that last region is formed；
For example：linktoendk={ k, a, b }, the link that expression vehicle k reaches last region is followed successively by vehicle k → vehicle a
→ vehicle b.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710374607.XA CN107171958B (en) | 2017-05-24 | 2017-05-24 | Road section partition routing method of SDN vehicle-mounted network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710374607.XA CN107171958B (en) | 2017-05-24 | 2017-05-24 | Road section partition routing method of SDN vehicle-mounted network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107171958A true CN107171958A (en) | 2017-09-15 |
| CN107171958B CN107171958B (en) | 2020-04-07 |
Family
ID=59821645
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710374607.XA Expired - Fee Related CN107171958B (en) | 2017-05-24 | 2017-05-24 | Road section partition routing method of SDN vehicle-mounted network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107171958B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109600712A (en) * | 2018-12-27 | 2019-04-09 | 沈阳航空航天大学 | A kind of adaptive routing method based on software definition car networking |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100080168A1 (en) * | 2008-09-29 | 2010-04-01 | Toyota Infotechnology Center Co., Ltd. | Probabilistic routing for vehicular ad hoc network |
| US20130282263A1 (en) * | 2010-04-20 | 2013-10-24 | Clarence Augustine Teck Huo Tee | Junction Adaptive Reactive Routing (JARR) Protocol for Vehicular Ad-Hoc Networks in a City Environment |
| CN104618979A (en) * | 2015-01-30 | 2015-05-13 | 广东迅通科技股份有限公司 | Adaptive partition routing method based on cross aiding |
| CN104731963A (en) * | 2015-04-03 | 2015-06-24 | 重庆邮电大学 | Grid path recommending method and system based on internet of vehicle |
| CN105245563A (en) * | 2015-08-27 | 2016-01-13 | 重庆邮电大学 | Dynamic clustering method based on vehicle node connection stability |
| CN105898696A (en) * | 2016-04-11 | 2016-08-24 | 广东工业大学 | Interval confidence evaluation-based roadside node positioning method |
| CN106658634A (en) * | 2016-12-27 | 2017-05-10 | 中山大学 | Software-defined vehicle-mounted network system |
-
2017
- 2017-05-24 CN CN201710374607.XA patent/CN107171958B/en not_active Expired - Fee Related
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100080168A1 (en) * | 2008-09-29 | 2010-04-01 | Toyota Infotechnology Center Co., Ltd. | Probabilistic routing for vehicular ad hoc network |
| US20130282263A1 (en) * | 2010-04-20 | 2013-10-24 | Clarence Augustine Teck Huo Tee | Junction Adaptive Reactive Routing (JARR) Protocol for Vehicular Ad-Hoc Networks in a City Environment |
| CN104618979A (en) * | 2015-01-30 | 2015-05-13 | 广东迅通科技股份有限公司 | Adaptive partition routing method based on cross aiding |
| CN104731963A (en) * | 2015-04-03 | 2015-06-24 | 重庆邮电大学 | Grid path recommending method and system based on internet of vehicle |
| CN105245563A (en) * | 2015-08-27 | 2016-01-13 | 重庆邮电大学 | Dynamic clustering method based on vehicle node connection stability |
| CN105898696A (en) * | 2016-04-11 | 2016-08-24 | 广东工业大学 | Interval confidence evaluation-based roadside node positioning method |
| CN106658634A (en) * | 2016-12-27 | 2017-05-10 | 中山大学 | Software-defined vehicle-mounted network system |
Non-Patent Citations (2)
| Title |
|---|
| 张明川，等: ""一种面向智慧协同网络的自适配路由策略研究"", 《一种面向智慧协同网络的自适配路由策略研究》 * |
| 杨志伟，等: ""软件定义车联网的数据转发机制"", 《计算机应用》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109600712A (en) * | 2018-12-27 | 2019-04-09 | 沈阳航空航天大学 | A kind of adaptive routing method based on software definition car networking |
| CN109600712B (en) * | 2018-12-27 | 2020-11-20 | 沈阳航空航天大学 | Self-adaptive routing method based on software defined internet of vehicles |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107171958B (en) | 2020-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102113404B (en) | Relay apparatus, control method, and program | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| US20100284383A1 (en) | Internet-orientated ad-hoc network | |
| CN102014458A (en) | Method and apparatus for admission control of data in a mesh network | |
| CN108322392B (en) | Link damage perception energy efficiency routing method for differentiated services in elastic optical network | |
| CN103780499B (en) | The method of routing iinformation and the node of communication network are sent in network | |
| CN109962773A (en) | Wide area quantum cryptography networks data encryption method for routing | |
| CN104378229A (en) | Link prediction method for opportunity network | |
| Abboud et al. | Impact of microscopic vehicle mobility on cluster-based routing overhead in VANETs | |
| CN104660502B (en) | To the method and device of outside neighborhood of border gate protocol notice route | |
| CN107171958A (en) | A kind of section subregion route selecting method of SDN In-vehicle networkings | |
| Korba et al. | Anomaly-based intrusion detection system for ad hoc networks | |
| CN113132827B (en) | Modulation adaptive route calculation method and device under elastic optical network | |
| CN108551403B (en) | Transmission network planning method and system | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| Bai et al. | Salvaging route reply for on-demand routing protocols in mobile ad-hoc networks | |
| CN106792971A (en) | Network node system of selection based on ant group algorithm | |
| CN105898871A (en) | Resource distribution method of multi-hop multi-frequency-point wireless mesh network | |
| CN105704756A (en) | Multirate wireless Mesh network routing metric and channel distribution combination method | |
| CN106034289A (en) | Forwarding control method in D2D multicast communication | |
| Wang et al. | A MANET routing protocol using Q-learning method integrated with Bayesian network | |
| CN104468356B (en) | A kind of message forwarding method of more destination nodes | |
| CN105263121A (en) | Route method based on crossroads in opportunistic vehicular ad hoc network | |
| CN106850428A (en) | Opportunistic routing protocol method based on 802.11 perception link-quality | |
| Hazarika | A Load-Based Approach to Forming a Connected Dominating Set for an Ad Hoc Network |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200407 |