Routing protocol for bus vehicle network with cyclical movement

doi:10.11772/j.issn.1001-9081.2015.02.0313

Journal of Computer Applications ›› 2015, Vol. 35 ›› Issue (2): 313-316.DOI: 10.11772/j.issn.1001-9081.2015.02.0313

Previous Articles Next Articles

Routing protocol for bus vehicle network with cyclical movement

PENG Yali, XU Hong, YIN Hong, ZHANG Zhiming

School of Software, Jiangxi Normal University, Nanchang Jiangxi 330022, China

Received:2014-09-15 Revised:2014-11-21 Online:2015-02-10 Published:2015-02-12

周期性移动公交车载网络路由协议

彭雅丽, 徐虹, 尹红, 章志明

江西师范大学软件学院, 南昌 330022

通讯作者: 彭雅丽
作者简介:彭雅丽(1983-),女,江西南昌人,讲师,硕士,主要研究方向:无线传感器网络、智能交通; 徐虹(1979-),女,江西南昌人,讲师,硕士,主要研究方向:传感器网络; 尹红(1966-),女,江西南昌人,高级实验师,主要研究方向:计算机网络; 章志明(1978-),男,江西临川人,副教授,硕士,主要研究方向:传感器网络、网络安全。
基金资助:
国际合作重大专项基金资助项目(2010DFB90460);国家自然科学基金资助项目(61363077);江西省青年科学基金资助项目(20122BAB211037);校青年成长基金资助项目。

Abstract

Abstract:

As an important part of the urban vehicle network, bus vehicle network provides supports for a wide range of urban-vehicle communication network due to cyclical movement law. However, the complex urban road environment brings great challenges to highly efficient and reliable routing protocols for bus vehicle network. In bus vehicle network with the characteristics of cyclical movement, a new protocol named SRMHR (Single & Realmending-Multi Hop Routing) was proposed to ensure the single hop link's life time and multi-hop submission probability in limited delay. According to the signal propagation attenuation model and vehicle mobility model, a single hop selection mechanism and a multi-hop delay probability forwarding mechanism were proposed to ensure the reliability and effectiveness of bus-assistant forwarding. On the urban traffic simulation platform, using real road traffic data of slight adjustment, the performance of signal attenuation model, single hop selection mechanism and light correction model under different traffic densities were tested. The results prove the validity of each link of the scheme. Comparison with SF (Spray and Focus) and SW (Spray and Wait) proves that SRMHR protocol has a higher successful rate of data transmission and lower delivery delay.

Key words: vehicle network, routing protocol, delay probability, stochastic dynamic programming, forwarding candidate set

摘要：

公交车载网络作为城市车载网络中的重要组成部分,由于具有周期性移动规律,能为城市车载网络的大范围通信提供支撑,而复杂的城市道路环境给公交车载网络的高效可靠路由协议带来了极大的挑战。针对具有周期运动特征的公交车载网络,设计单跳与实时改进的多跳路由协议SRMHR,保证单跳转发的链路生存时间以及多跳转发有限延时内的提交概率;根据城市信号传播衰减特征和车辆移动模型设计单跳链路筛选机制,并结合改进的多跳延时相关概率转发模型,保证公交转发的高效、可靠。在城市交通模拟仿真平台上,结合微调的真实道路交通数据,分别测试了方案中信号衰减模型、不同车流密度下候选筛选以及红灯延时修正的性能参数,验证了方案中各环节的有效性;最后与SF和SW协议的性能进行了对比,结果表明SRMHR协议具有较高的数据传输成功率和较低的递交延时。

关键词: 车载网络, 路由协议, 延时概率, 随机动态规划, 候选转发集

CLC Number:

TN929.5

PENG Yali, XU Hong, YIN Hong, ZHANG Zhiming. Routing protocol for bus vehicle network with cyclical movement[J]. Journal of Computer Applications, 2015, 35(2): 313-316.

彭雅丽, 徐虹, 尹红, 章志明. 周期性移动公交车载网络路由协议[J]. 计算机应用, 2015, 35(2): 313-316.

References

[1] World Bank Group. The world bank indicators [EB/OL]. [2014-06-06]. http://data.worldbank.org/indicator.
[2] XU Y, YU S, ZHAO Z. A RFID routing node address-configuration Scheme [J]. Journal of Jiangxi Normal University: Natural Science Edition, 2014, 38(2): 128-131. (徐永谦,余松森,赵振宇.一种RFID路由节点地址分配方法[J].江西师范大学学报:自然科学版,2014,38(2):128-131)
[3] SUN J, ZHU X, ZHANG C, et al. RescueMe: location-based secure and dependable VANETs for disaster rescue [J]. IEEE Journal on Selected Areas in Communications, 2011, 29(3): 659-669.
[4] OLIVEIRA R, LUÍS M, FURTADO A, et al. Improving path duration in high mobility vehicular Ad Hoc networks [J]. Ad Hoc Networks, 2013, 11(1): 89-103.
[5] WU L. The research on routing issues in wireless Ad Hoc network [D]. Chengdu: University of Electronic Science and Technology of China, 2010.(吴磊.无线自组织网络中的路由技术相关问题研究[D].成都:电子科技大学,2010.)
[6] FALL K. A delay-tolerant network architecture for challenged Internets [C]//SIGCOMM '03: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM, 2003:27-34.
[7] WU L, WU D, LIU M, et al. Periodic intermittently connected-based data delivery in opportunistic networks [J]. Journal of Software, 2013,24(3):507-525.(吴磊,武德安,刘明,等.机会网络中面向周期性间歇连通的数据传输[J].软件学报,2013,24(3):507-525.)
[8] ZHU H, ZHU Y, LI M, et al. SEER: metropolitan-scale traffic perception based on lossy sensory data [C]//INFOCOM 2009: Proceedings of 28th IEEE Conference on Computer Communications. New York: IEEE Communications Society, 2009: 217-255.
[9] XU X. A mobile robot path planning approach under complex environments [J]. Journal of Jiangxi Normal University: Natural Science Edition, 2014, 38(1): 84-88. (徐雪松.复杂环境中移动机器人路径规划[J].江西师范大学学报:自然科学版,2014,38(1):84-88.)
[10] ALTIN A, FORTZ B, THORUP M. Intra-domain traffic engineering with shortest path routing protocols [J]. Annals of Operations Research, 2013, 204(1): 65-95.
[11] JAIN S, FALL K, PATRA R. Routing in a delay tolerant network [C]//SIGCOMM 2004: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM, 2004: 145-158.
[12] VELLAMBI B N, SUBRAMANIAN R, FEKRI F. Reliable and efficient message delivery in delay tolerant networks using rateless codes [C]//MobiOpp'07: Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking. New York: ACM, 2007: 91-98.
[13] LI Z, ZHA X, LIU F, et al. Indexing based multi-level clustering routing algorithm in public transportation delay tolerant networks [J]. Journal of Computer Research and Development, 2011, 48(3):407-414. (李陟,查玄阅,刘凤玉,等.公交时延容忍网络中基于索引的多级分组路由算法[J].计算机研究与发展,2011,48(3):407-414.)
[14] ZHAO J, CAO G. VADD: Vehicle-Assisted data delivery in vehicular Ad Hoc networks[C].//Proceedings of the INFOCOM 2006. New York:IEEE Communications Society, 2006. 1-12.
[15] SONG C, LIU M, GONG H, et al. Distributed real-time information based routing protocol in vehicular Ad-Hoc networks [J]. Journal of Software, 2011, 22(3):466-480. (宋超,刘明,龚海刚,等.基于分布式实时信息的车载网络路由协议[J].软件学报,2011,22(3):466-480.)
[16] GAO S, ZHANG H, XU H. Efficient data gathering approach in sensor networks with path-fixed sinks[J].Journal of Software, 2010,21(1):147-162. (郜帅,张宏科,徐怀松.Sink轨迹固定传感器网络的高效数据采集机制[J].软件学报, 2010,21(1):147-162.)
[17] KUANG L, WANG Z, XU M, et al. End-to-end transmission time-based opportunistic routing protocols for bus networks[J]. Turkish Journal of Electrical Engineering & Computer Sciences, 2013, 21(2): 470-492.
[18] GAO S, ZHANG H, DAS S. Efficient data collection in wireless sensor networks with path-constrained mobile sinks [J]. IEEE Transactions on Mobile Computing, 2011, 10(4): 592-608.

Routing protocol for bus vehicle network with cyclical movement

周期性移动公交车载网络路由协议

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

[1]	REN Xiuli, CHEN Yang. Routing protocol optimized for data transmission delay in wireless sensor networks [J]. Journal of Computer Applications, 2020, 40(1): 196-201.
[2]	LI Anchao, CHEN Guifen. Uneven clustering protocol based on odd-even round clustering and double cluster head [J]. Journal of Computer Applications, 2018, 38(7): 1995-2000.
[3]	HE Wangji, MA Xiaoyuan, LI Xin, TANG Weisheng. Energy balancing routing protocol for low-power and lossy network [J]. Journal of Computer Applications, 2018, 38(4): 1095-1101.
[4]	LUO Yujie, ZHANG Jian, TANG Zhangguo, LI Huanzhou. Research summary of secure routing protocol for low-power and lossy networks [J]. Journal of Computer Applications, 2018, 38(12): 3462-3470.
[5]	YUAN Peiyan, SONG Mingyang. Lightweight distributed social distance routing algorithm in mobile opportunistic network [J]. Journal of Computer Applications, 2018, 38(1): 13-19.
[6]	LI Shuangshuang, YANG Wenzhong, WU Xiangqian. Routing protocol based on unequal partition area for wireless sensor network [J]. Journal of Computer Applications, 2016, 36(11): 3010-3015.
[7]	HUANG Tinghui, YI Kai, CUI Gengshen, WANG Yuliang. Hierarchical routing protocol based on non-uniform clustering for wireless sensor network [J]. Journal of Computer Applications, 2016, 36(1): 66-71.
[8]	YANG Xiaofeng, WANG Rui, PENG Li. Hybrid multi-hop routing algorithm of effective energy-hole avoidance for wireless sensor networks [J]. Journal of Computer Applications, 2015, 35(7): 1815-1819.
[9]	REN Xiuli, WANG Chong. Multi-path routing protocol based on three-dimensional space and regional co-evolution in wireless sensor network [J]. Journal of Computer Applications, 2015, 35(3): 610-614.
[10]	ZHAO Zuopeng, ZHANG Nana, HOU Mengting, GAO Meng. Clustering routing algorithm based on attraction factor and hybrid transmission [J]. Journal of Computer Applications, 2015, 35(12): 3331-3335.
[11]	YUAN Peiyan, WANG Chenyang, LI Sijia. Data forwarding strategy based on gathering point in mobile opportunistic networks [J]. Journal of Computer Applications, 2015, 35(11): 3038-3042.
[12]	LIANG Yumin CAO Tianjie. Lightweight protocol with anonymity for Ad Hoc network based on bilinear pairings [J]. Journal of Computer Applications, 2013, 33(12): 3402-3405.
[13]	LI Shibao LOU Linlin CHEN Xiangrui HONG Li. Probabilistic forwarding algorithm of mobile Ad Hoc networks based on directional prediction [J]. Journal of Computer Applications, 2013, 33(08): 2117-2120.
[14]	FU Yuanke TANG Lun CHEN Qianbin GONG Pu. Vehicular Ad Hoc network routing protocol and its research progress [J]. Journal of Computer Applications, 2013, 33(07): 1793-1801.
[15]	WEN Ding CAI Ying LI Zhuo. Two-hop incentive compatible routing protocol in disruptiontolerant networks [J]. Journal of Computer Applications, 2013, 33(06): 1500-1504.