# [1]陶军,肖鹏,刘莹,等.基于拓扑连通概率的车载自组织网络路由算法[J].东南大学学报(自然科学版),2013,43(2):286-289.[doi:10.3969/j.issn.1001-0505.2013.02.011] 　Tao Jun,Xiao Peng,Liu Ying,et al.Routing algorithm based on probability of topology connectivity in vehicular ad hoc networks[J].Journal of Southeast University (Natural Science Edition),2013,43(2):286-289.[doi:10.3969/j.issn.1001-0505.2013.02.011] 点击复制 基于拓扑连通概率的车载自组织网络路由算法() 分享到： var jiathis_config = { data_track_clickback: true };

43

2013年第2期

286-289

2013-03-20

## 文章信息/Info

Title:
Routing algorithm based on probability of topology connectivity in vehicular ad hoc networks

Author(s):
Key Laboratory of Computer Network and Information Integration of Ministry of Education, Southeast University, Nanjing 210096, China

Keywords:

TP393
DOI:
10.3969/j.issn.1001-0505.2013.02.011

Abstract:
To overcome the shortcomings of the contention delay function in REAR(receipt estimation alarm routing)algorithm and reduce the number of broadcasting packages, improvement is put forward in three aspects and a new algorithm called RPR(receipt-based probabilistic routing)algorithm is proposed. First, the parameters of the contention delay function are modified. By exchanging data among the nodes, the ranking information can be obtained and used as the parameter of the contention delay function. Secondly, by shortening the transition time of broadcasting packages and reducing the number of data package transition, the number of packages is reduced. Finally, by cutting back the probability accumulation from previous nodes, the conditions of judging next-hop nodes are simplified and the performance of the algorithm is improved. Both the REAR algorithm and the RPR algorithm are implemented in NS2. The contrast experiment results show that the number of the broadcasting packages and the transition time in the RPR algorithm can be reduced to 78% and 72% of those in the REAR algorithm, and the coverage rate can be increased from 93% to 99%.

## 参考文献/References:

[1] Hao J, Hao G, Li J C. Reliable and efficient alarm message routing in VANETs [C]//Proceedings of the 28th International Conference on Distributed Computing Systems Workshops. Beijing, China, 2008:186-191.
[2] Yan G Y, Rawat D B, El-Tawab S.Ticket-based reliable routing in VANETs[C]//Proceedings of IEEE 6th International Conference on Mobile Ad Hoc and Sensor Systems. Macao, China, 2009: 609-614.
[3] Naumov V, Naumov V, Gross T. Connectivity-aware routing(CAR)in vehicular ad hoc networks[C]//Proceedings of 2007 IEEE International Conference on Computer Communications. Anchorage, Alaska, USA, 2007: 1919-1927.
[4] Yan G Y, Olariu S, Salleh S. A probabilistic routing protocol in VANETs[C]//Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia. Kuala Lumpur, Malaysia, 2009: 179-186.
[5] Karnadi F K, Mo Z H. Rapid generation of realistic mobility models for VANETs[C]//Proceedings of 2007 Wireless Communications and Networking Conference. Washington DC, USA, 2007: 2506-2511.
[6] Abedi O, Fathy M, Taghiloo J. Enhancing AODV routing protocol using mobility parameters in VANETs[C]//Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications. Washington DC, USA, 2008: 229-235.
[7] Namboodiri V, Gao L. Prediction-based routing for vehicular ad hoc networks [J]. IEEE Transactions on Vehicular Technology, 2007, 56(4): 2332-2345.
[8] Lee Y, Lee H, Choi N, et al. Macro-level and micro-level routing(MMR)for urban vehicular ad hoc networks [C]//Proceedings of 2007 IEEE Global Telecommunications Conference. Washington DC, USA, 2007: 715-719.
[9] Korkmaz G, Ekici E, Ozguner F. Black-burst-based multihop broadcast protocols for vehicular,networks [J]. IEEE Transactions on Vehicular Technology, 2007, 56(5): 3159-3167.
[10] Xu Q, Mak T, Ko J, et al. Medium access control protocol design for vehicle-vehicle safety messages [J]. IEEE Transactions on Vehicular Technology, 2007, 56(2): 499-518.