Exploiting downstream mobility to achieve fast upstream message propagation in vehicular ad hoc networks

被引:5
作者
Agarwal, Ashish [1 ]
Starobinski, David [1 ]
Little, Thomas D. C. [1 ]
机构
[1] Boston Univ, Dept Elect & Comp Engn, Boston, MA 02215 USA
来源
2007 MOBILE NETWORKING FOR VEHICULAR ENVIRONMENTS | 2007年
关键词
D O I
10.1109/MOVE.2007.4300826
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Vehicular ad-hoc networks (VANETs) promise to enable many novel applications in transportation systems including accident avoidance, congestion sensing, traffic metering, and general in-car information services. Yet implementing multi-hop vehicular communications is highly challenging due to the highly time-varying nature of vehicles. In addition to node mobility and the impediments of wireless communication, a network comprised of moving vehicles is a dynamic system that can be fragmented into many individual components of disparate connectivity. In this paper we describe and analyze a routing scheme that exploits this dynamic connectivity for the purpose of message propagation of attributed (or labelled) data in a fragmented VANET. Our analysis provides upper and lower bounds on message propagation rate as a function of the traffic density, vehicle speed, and radio range; and sheds light into the role played by each of these network parameters. An important insight from our analysis is that vehicle mobility in the opposite traffic direction can be used to achieve substantial gains in message propagation rates. Our analytical findings are supported by extensive simulations. The simulation results indicate that under certain traffic conditions an increase in vehicle mobility results in an order-of-magnitude increase in message propagation rate.
引用
收藏
页码:13 / 18
页数:6
相关论文
共 14 条
[1]  
Agarwal A., 2007, P SMART TRANSP WORKS
[2]  
[Anonymous], 2006, P 7 ACM INT S MOB AD
[3]  
[Anonymous], P SIGCOMM
[4]  
[Anonymous], 2006, P 3 ANN INT C MOB UB
[5]  
[Anonymous], INTRO PROBABILITY MO
[6]  
BERGER I, 2007, STANDARDS CAR TALK
[7]  
Burgess J., 2006, P IEEE INFOCOM, P1, DOI DOI 10.1109/INFOCOM.2006.228
[8]  
Dousse O, 2002, IEEE INFOCOM SER, P1079, DOI 10.1109/INFCOM.2002.1019356
[9]  
FARKAS KI, 2004, IEEE PERVAS COMPUT, V5, P55
[10]  
FUSSLER H, 2002, P INT C MOB COMP NET, V7, P47