LDAOR - Location and Direction Aware Opportunistic Routing in Vehicular Ad hoc Networks

Routing in Vehicular Ad hoc Networks (VANETs) has found significant attention because of its unique features such as lack of energy constraints and high-speed vehicles applications. Besides, since these networks are highly dynamic, design process of routing algorithms suitable for an urban environment is extremely challenging. Appropriate algorithms could be opportunistic routing (OR) where traffic transmission is performed using the store-carry-forward mechanism. An efficient OR mechanism, called Location and Direction Aware Opportunistic Routing (LDAOR), is proposed in this paper. It is based on the best neighbor node selection by using vehicles positions, vehicles directions, and prioritization of messages from buffers, based on contact histories and positions of neighbor nodes to destination. In LDAOR, when multiple nodes make contact with a carrier node, the closest neighbor node to destination is selected as the best forwarder. However, when only one node makes contact with the carrier node, the message is delivered to it if it moves toward the destination. Using the ONE simulator, the obtained performance evaluation results show that the LDAOR operates better than conventional OR algorithms. The LDAOR not only increases delivery rate, but also reduces network overhead, traffic loss, and number of aborted messages. Keywords—carry-and-forward mechanism, contact history knowledge, direction and location aware routing, opportunistic routing, vehicular ad hoc networks.

[1]  Jan M. Rabaey,et al.  When does opportunistic routing make sense? , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[2]  Martin Mauve,et al.  Location-Based Routing for Vehicular Ad-Hoc Networks , 2002 .

[3]  Tarek Saadawi,et al.  Performance analysis of routing protocols in delay/disruption tolerant mobile ad hoc networks , 2011 .

[4]  Sidi-Mohammed Senouci,et al.  > Replace This Line with Your Paper Identification Number (double-click Here to Edit) < , 2022 .

[5]  Young-Bae Ko,et al.  FFRDV: Fastest-Ferry Routing in DTN-enabled Vehicular Ad Hoc Networks , 2009, 2009 11th International Conference on Advanced Communication Technology.

[6]  J. Ott,et al.  Simulating Mobility and DTNs with the ONE , 2010 .

[7]  Qian Zhang,et al.  Delay/disruption tolerant mobile ad hoc networks: latest developments , 2007, Wirel. Commun. Mob. Comput..

[8]  M. Adda,et al.  SOLS : Self Organising Distributed Location Server for Wireless Ad Hoc Networks , 2009 .

[9]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[10]  Cecilia Mascolo,et al.  GeOpps: Geographical Opportunistic Routing for Vehicular Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[11]  John Lee,et al.  A survey and challenges in routing and data dissemination in vehicular ad-hoc networks , 2008, ICVES.

[12]  Mario Gerla,et al.  Opportunistic vehicular routing , 2010, 2010 European Wireless Conference (EW).

[13]  Ivan Stojmenovic,et al.  Communication protocols for vehicular ad hoc networks , 2011, Wirel. Commun. Mob. Comput..

[14]  Stephen Farrell,et al.  Report on an Arctic summer DTN trial , 2011, Wirel. Networks.

[15]  Joel J. P. C. Rodrigues,et al.  Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks , 2009, 2009 International Conference on Parallel Processing Workshops.

[16]  Xu Li,et al.  Packet-Oriented Routing in Delay-Tolerant Vehicular Sensor Networks , 2009, J. Inf. Sci. Eng..

[17]  Joel J. P. C. Rodrigues,et al.  Improving Vehicular Delay-Tolerant Network Performance with Relay Nodes , 2009, 2009 Next Generation Internet Networks.

[18]  Lixin Gao,et al.  Prediction-Based Routing for Vehicular Ad Hoc Networks , 2007, IEEE Transactions on Vehicular Technology.

[19]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

[20]  Klaus Wehrle,et al.  Perfect difference sets for neighbor discovery: energy efficient and fair , 2011, ExtremeCom.

[21]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[22]  Yu Wang,et al.  Routing in vehicular ad hoc networks: A survey , 2007, IEEE Vehicular Technology Magazine.

[23]  Li Xiao,et al.  A static-node assisted adaptive routing protocol in vehicular networks , 2007, VANET '07.

[24]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[25]  Maurizio A. Spirito,et al.  Opportunistic Data Collection in Sparse Wireless Sensor Networks , 2011, EURASIP J. Wirel. Commun. Netw..

[26]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[27]  Mario Gerla,et al.  GeoDTN+Nav: Geographic DTN Routing with Navigator Prediction for Urban Vehicular Environments , 2010, Mob. Networks Appl..

[28]  Xiaogeng Zhao An adaptive approach for optimized opportunistic routing over Delay Tolerant Mobile Ad hoc Networks , 2008 .

[29]  Mo Adda,et al.  Self organising distributed location server for wireless ad hoc networks , 2009 .

[30]  Hyuk Lim,et al.  An opportunistic forwarding protocol with relay acknowledgment for vehicular ad hoc networks , 2011, Wirel. Commun. Mob. Comput..

[31]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[32]  Jörg Ott,et al.  Simulating Mobility and DTNs with the ONE (Invited Paper) , 2010, J. Commun..

[33]  B. Szymanski,et al.  Cost Effective Multi-Period Spraying for Routing in Delay Tolerant Networks , 2012 .

[34]  Dongkyun Kim,et al.  Vector Routing for Delay Tolerant Networks , 2008, 2008 IEEE 68th Vehicular Technology Conference.

[35]  Johny Jose,et al.  Routing Approaches in Delay Tolerant Networks: A Survey , 2010 .

[36]  Liana K. Qabajeh,et al.  Unicast position-based routing protocols for ad-hoc networks , 2010 .

[37]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[38]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[39]  Kevin C. Almeroth,et al.  Controlled flooding in disconnected sparse mobile networks , 2009, Wirel. Commun. Mob. Comput..

[40]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[41]  Boleslaw K. Szymanski,et al.  Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks , 2010, IEEE/ACM Transactions on Networking.

[42]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.