CN103248570B - Based on the adaptive routing method copied in vehicle self-organizing network - Google Patents
Based on the adaptive routing method copied in vehicle self-organizing network Download PDFInfo
- Publication number
- CN103248570B CN103248570B CN201310143310.4A CN201310143310A CN103248570B CN 103248570 B CN103248570 B CN 103248570B CN 201310143310 A CN201310143310 A CN 201310143310A CN 103248570 B CN103248570 B CN 103248570B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- message
- possibility
- current
- needs
- 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.)
- Expired - Fee Related
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
Based on the adaptive routing method copied in vehicle self-organizing network, comprise step: when a vehicle i having a message copying meets the vehicle j of not this message copying, what judge this message currently needs to send possibility and whether equals 0; During as equaled 0, then do not copy this message; Otherwise copy, and enter next step; Vehicle i calculates the current of this message and completes transmission possibility, more current complete send possibility and current need send possibility; If complete current and send possibility and be more than or equal to current needs and send possibility, then this respective message current is needed to send possibility and is set to 0 by vehicle i and vehicle j respectively; Otherwise it is L part copy that vehicle i produces quantity to this message, and divides the message copying of generation to vehicle i and vehicle j equally, and enters next step; The current needs that vehicle i and vehicle j resets this message separately sends possibility.The present invention realizes higher transmission success rate with less communication cost.
Description
Technical field
The present invention relates to route method and technology field in a kind of vehicle self-organizing network, specifically in a kind of vehicle self-organizing network based on the vehicle network method for routing of the adaptive control message copying quantity copied.
Background technology
Route is that the hot topic in vehicle self-organizing network one of studies a question.In the route of vehicle self-organizing network, message has a source vehicle and an object vehicle usually, and the task of route is that message is sent to its destination from Qi Yuan.The index of route comprises transmission success rate, transmission lag, communication cost, transmitting efficiency etc.
Method for routing in vehicle self-organizing network is main is method for routing based on copying.Spread in vehicle network based on some copies of the method for routing copied by message, if a copy of it message copying arrives destination, even if message sends successfully.At present, infect route, directly transmission and spray-and-wait main comprising based on the method for routing copied, but these method for routing there is its respective shortcoming.(1) in infection route, each message carrier gives any one node that it runs into, until it's life cycle has past this message message copying.Although infect route can realize higher transmission success rate and lower transmission lag, its communication cost is but huge.Therefore, when there being network capacity to retrain, infection route is also inapplicable.(2) in directly transmitting, source node carries message always, unless just met destination node forwarding.Although directly the communication cost of transmission is very little, its transmission success rate is but very low.(3) in spray-and-wait, route is divided into two stages: dispersing stage and loitering phase.At dispersing stage, source node is that a message produces some copies, and then these copies are scattered to other node, the mode of distribution comprises source-spray and binary-spray.At loitering phase, any one message carrier carries message, unless just met destination node forwarding.Can regard with infection route the compromise sending success rate and communication cost as unlike, spray-and-wait, it, by the number of copies of each message in net control, controls the communication cost of whole network.But the strategy of what spray-and-wait taked is a kind of static cost control message copying, once source node determines the number of copies of a message, in routing procedure, this number of copies just no longer changes, and this results in limitation.In addition, be in advance very difficult for spray-and-wait arranges a suitable message copying quantity, and suitable message copying quantity is different in different environments.Therefore, spray-and-wait can not realize higher transmission success rate with lower communication cost.
Summary of the invention
The object of the invention is to overcome the deficiency of the existing method for routing based on copying in vehicle self-organizing network, there is provided in a kind of vehicle self-organizing network based on the adaptive routing method copied, can most message be sent successfully, the method for routing of communication cost can be reduced again as far as possible.This method for routing is the method for routing based on copying, and it takes the number of copies of adaptive policy control message, above-mentioned prior art of comparing carry other based on the method for routing copied, achieve higher transmission success rate with lower communication cost.
Principle of the present invention is as follows:
Each message has a source vehicle and an object vehicle, and a given life cycle.When two cars is mutually in the communication distance of the other side, we claim this two cars to meet.When two cars meets, this two cars can messaging mutually.
For a piece of news, certain supposing this message carries vehicle c, and the object vehicle d of this message, this message is at time t
2expired afterwards, current time is t
1.At time t
2before, the collision probability of vehicle c and vehicle d is
wherein m
cdrepresent the average adjacent communication time interval of vehicle c and vehicle d.The adjacent communication time interval refers to the time interval that two cars meets for twice in succession, and the average adjacent communication time interval refers to the mean value in all adjacent communication time intervals.The adjacent communication time interval between two cars is obeys index distribution.Suppose that this message has m to carry vehicle, allow v
1, v
2..., v
mrepresent this m respectively and carry vehicle, then the transmission possibility of this message is
wherein
represent vehicle v
mwith the collision probability of object vehicle d.Can find out according to this formula, this message to carry vehicle more, the transmission possibility of this message is larger.Meanwhile, because this message needs to send to more carrier, so communication cost also increases thereupon.
Based on this, basic thought of the present invention is, controls the number of copies of this message according to the transmission possibility of certain message adaptively.Set one and send possibility threshold value, if the transmission possibility of certain message is less than this threshold value, then for this message produces the copy of some; If send possibility to be greater than or equal to this threshold value, then no longer for this message produces copy.If object vehicle d met by any vehicle having message copying, this vehicle just sends message to object vehicle d.After object vehicle d receives message, even if this message sends successfully.According to this basic thought, message can be sent to object vehicle from source vehicle with less communication cost and higher transmission success rate by the present invention.
Technical solution of the present invention is as follows:
Based on the adaptive routing method copied in vehicle self-organizing network, its feature is, the method comprises the steps:
(1), when the vehicle i having a message copying when meets the vehicle j of not this message copying, what vehicle i judged this message currently needs to send possibility and whether equals 0;
(2) when the current transmission possibility that needs of this message equals 0, then vehicle i does not copy this message to vehicle j;
When the current transmission possibility that needs of this message is not equal to 0, then vehicle i copies this message to vehicle j, and enters step (3);
(3) vehicle i calculates the current of this message and completes transmission possibility, and more current complete send possibility and current need send possibility;
(4) if current completing sends possibility and be more than or equal to current needs and send possibility, then this respective message current is needed to send possibility and is set to 0 by vehicle i and vehicle j respectively;
If complete current and send possibility and be less than current needs and send possibility, then vehicle i produces quantity to this message is L part copy, and to divide the message copying of generation to vehicle i and vehicle j equally, and enters step (5);
(5) vehicle i resets the current of this message needs transmission possibility, and current needs that vehicle j resets this message sends possibility.
Compared with prior art, the invention has the advantages that: by control message number of copies adaptively, the most message in vehicle self-organizing network are allowed to be sent to object vehicle with less communication cost from source vehicle within its life cycle, that is, achieve higher transmission success rate with less communication cost, and there is the feature of reliability and superiority.
Accompanying drawing explanation
Fig. 1 is the flow chart producing message copying.
Fig. 2 is the flow chart of assignment messages copy.
Embodiment
Below in conjunction with drawings and Examples, the present invention is elaborated, but should not limit the scope of the invention with this.
Please first consult Fig. 1, Fig. 1 is the flow chart producing message copying, as shown in the figure, one is had to the vehicle of message copying, and this vehicle has oneself needs transmission possibility for the current of this message.If vehicle i having a message copying has met the vehicle j of not this message copying, what vehicle i judged its this message has currently needed to send possibility and whether has equaled 0.If equal 0, vehicle i not by this message copying to vehicle j.If be not equal to 0, vehicle i just by this message copying to vehicle j, and calculate this message currently complete that to send possibility be P
cfd=1-(1-P
id) (1-P
jd), wherein P
idrepresent the collision probability of vehicle i and object vehicle d, P
jdrepresent the collision probability of vehicle j and object vehicle d.Then, vehicle i more current complete send possibility and current need send possibility.If complete current and send possibility and be more than or equal to current needs and send possibility, then vehicle i is for this message produces copy, and vehicle i and j its this message is all set currently need transmission possibility to be 0.If complete current and send possibility and be less than current needs and send possibility, then vehicle i is that this message produces the copy of some, and the number of copies of generation is L=log
(1-Pad)(1-P
crd)/(1-P
cfd), wherein P
adrepresent the mean value of all vehicles (except vehicle d) in vehicle self-organizing network and the collision probability of object vehicle d, P
crdthe current needs representing this message of vehicle i sends possibility, P
cfdrepresent the current of this message and complete transmission possibility.
Fig. 2 is the flow chart of assignment messages copy, and as shown in the figure, vehicle i, after meeting vehicle j, produces L part copy.In this L part copy, L/2 part copy is assigned to vehicle i, and L/2 part copy is assigned to vehicle j.After distributing copy, the current transmission possibility that needs that vehicle i resets its this message is
the current transmission possibility that needs that vehicle j resets its this message is
Claims (1)
1. in vehicle self-organizing network based on the adaptive routing method copied, it is characterized in that, the method comprises the steps:
(1), when the vehicle i having a message copying when meets the vehicle j of not this message copying, what vehicle i judged this message currently needs to send possibility and whether equals 0;
(2) when the current transmission possibility that needs of this message equals 0, then vehicle i does not copy this message to vehicle j;
When the current transmission possibility that needs of this message is not equal to 0, then vehicle i copies this message to vehicle j, and enters step (3);
(3) vehicle i calculates the current of this message and completes transmission possibility, and more current complete send possibility and current need send possibility;
(4) if current completing sends possibility and be more than or equal to current needs and send possibility, then this respective message current is needed to send possibility and is set to 0 by vehicle i and vehicle j respectively;
If complete current and send possibility and be less than current needs and send possibility, then vehicle i produces quantity to this message is L part copy, and to divide the message copying of generation to vehicle i and vehicle j equally, and enters step (5);
(5) vehicle i resets the current of this message needs transmission possibility, and current needs that vehicle j resets this message sends possibility;
Current the completing that described step (3) vehicle i calculates this message sends possibility P
cfd, formula is as follows:
P
cfd＝1－(1－P
id)(1－P
jd)
Wherein, P
idrepresent the collision probability of vehicle i and object vehicle d, P
jdrepresent the collision probability of vehicle j and object vehicle d;
In described step (4), this message produces quantity is L part copy, and computing formula is as follows:
L＝log
(1－Pad)(1－P
crd)/(1－P
cfd)，
Wherein P
adrepresent the mean value of the collision probability of all vehicles in vehicle self-organizing network except vehicle d and object vehicle d, P
crdrepresenting current needs that vehicle i sends this message sends possibility, P
cfdrepresent the current of this message and complete transmission possibility;
The current needs of this message that in described step (5), vehicle i resets sends possibility P
icrd, formula is as follows:
Wherein, P
idrepresent the collision probability of vehicle i and object vehicle d, P
adrepresent the mean value of the collision probability of all vehicles except vehicle d in vehicle self-organizing network and object vehicle d;
The current needs of this message that in described step (5), vehicle j resets sends possibility P
jcrd, formula is as follows:
Wherein, P
jdrepresent the collision probability of vehicle j and object vehicle d, P
adrepresent the mean value of the collision probability of all vehicles except vehicle d in vehicle self-organizing network and object vehicle d.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310143310.4A CN103248570B (en) | 2013-04-23 | 2013-04-23 | Based on the adaptive routing method copied in vehicle self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310143310.4A CN103248570B (en) | 2013-04-23 | 2013-04-23 | Based on the adaptive routing method copied in vehicle self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103248570A CN103248570A (en) | 2013-08-14 |
| CN103248570B true CN103248570B (en) | 2016-02-24 |
Family
ID=48927798
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310143310.4A Expired - Fee Related CN103248570B (en) | 2013-04-23 | 2013-04-23 | Based on the adaptive routing method copied in vehicle self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103248570B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1568179B1 (en) * | 2002-12-02 | 2008-07-23 | NTT DoCoMo, Inc. | Method and apparatus to integrate routing between administrator operated networks and self-organizing networks |
| CN101808306A (en) * | 2010-01-07 | 2010-08-18 | 北京航空航天大学 | Self-adapting urgent message announcement method based on vehicle network |
| CN102802121A (en) * | 2012-09-01 | 2012-11-28 | 北京理工大学 | Vehicle-mounted IOT (Internet of Things) routing method on basis of geographical positions |
-
2013
- 2013-04-23 CN CN201310143310.4A patent/CN103248570B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1568179B1 (en) * | 2002-12-02 | 2008-07-23 | NTT DoCoMo, Inc. | Method and apparatus to integrate routing between administrator operated networks and self-organizing networks |
| CN101808306A (en) * | 2010-01-07 | 2010-08-18 | 北京航空航天大学 | Self-adapting urgent message announcement method based on vehicle network |
| CN102802121A (en) * | 2012-09-01 | 2012-11-28 | 北京理工大学 | Vehicle-mounted IOT (Internet of Things) routing method on basis of geographical positions |
Non-Patent Citations (1)
| Title |
|---|
| 《车辆网络中的一种有效的信息查询方案》;邓左祥，周小平;《计算机与现代化》;20121130;第190-193页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103248570A (en) | 2013-08-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Cordeschi et al. | Reliable adaptive resource management for cognitive cloud vehicular networks | |
| Li et al. | Pipeline slot based fast rerouting scheme for delay optimization in duty cycle based M2M communications | |
| CN102355406B (en) | Self-adaption data distributing method based on node density distribution in vehicle-mounted ad hoc network | |
| Liu et al. | End‐to‐end delay and packet drop rate performance for a wireless sensor network with a cluster‐tree topology | |
| US9059869B2 (en) | Interface selection in a hybrid communication device | |
| US11564124B2 (en) | Method and apparatus for reducing scheduling latency in a wireless communication system | |
| Wen et al. | Energy-efficient and delay-aware distributed routing with cooperative transmission for Internet of Things | |
| TW200935937A (en) | Methods and apparatus related to scheduling traffic in a wireless communications system using shared air link traffic resources | |
| WO2017020728A1 (en) | Wireless communication method and device | |
| Yang et al. | Cooperative clustering‐based medium access control for broadcasting in vehicular ad‐hoc networks | |
| CN107343268B (en) | Non-orthogonal multicast and unicast transmission beamforming method and system | |
| Havinal et al. | Mecor: Minimal energy consumption with optimized routing in manet | |
| Shi et al. | Adding duty cycle only in connected dominating sets for energy efficient and fast data collection | |
| Khabbazian et al. | Localized broadcasting with guaranteed delivery and bounded transmission redundancy | |
| Du et al. | A prophet-based DTN protocol for VANETs | |
| Vegni et al. | Scarf: A social-aware reliable forwarding technique for vehicular communications | |
| Xiao et al. | A cooperative offloading game on data recovery for reliable broadcast in VANET | |
| Sharanappa et al. | Performance analysis of CSMA, MACA and MACAW protocols for VANETs | |
| CN103248570B (en) | Based on the adaptive routing method copied in vehicle self-organizing network | |
| CN108055667B (en) | Cognitive vehicle network combined routing and resource allocation method | |
| Chen et al. | Energy‐Efficient Broadcast Scheduling Algorithm in Duty‐Cycled Multihop Wireless Networks | |
| Zhou et al. | Dynamic DTN routing strategies based on knowledge | |
| CN104754755A (en) | Data transmission method and device | |
| Wang et al. | A dynamic spectrum decision algorithm for underwater cognitive acoustic networks | |
| Lee et al. | A stochastic process based routing algorithm for wireless Ad Hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| 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: 20160224 |