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

• Autorzy: Barootkar M. , Rahbar A. G. , Sabaei M.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

carry-and-forward mechanism; contact history knowledge; direction and location aware routing; opportunistic routing; vehicular ad hoc networks

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2016
• Tom: nr 1
• Strony: 68--83
• Opis fizyczny: Bibliogr. 39 poz., rys., tab.

Twórcy

autor

Barootkar M.

• Computer Networks Research Lab, Electrical Engineering Technologies Research Center Sahand, University of Technology, Tabriz, Iran

autor

Rahbar A. G.

• Computer Networks Research Lab, Electrical Engineering Technologies Research Center Sahand, University of Technology, Tabriz, Iran

autor

Sabaei M.

• Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran

Bibliografia

• [1] K. C. Lee and M. Gerla, „Opportunistic vehicular routing", in Proc. Eur. Wirel. Conf. EW 2010, Lucca, Italy, 2010, pp. 873-880.
• [2] A. Casteigts, A. Nayak, and I. Stojmenovic, „Communication protocols for vehicular ad hoc networks", Wirel. Commun. Mob. Comput., vol. 11, no. 5, pp. 567-582, 2011.
• [3] R. C. Shah, S. Wietholter, J. Rabaey, and A. Wolisz, „When does opportunistic routing make sense?", in Proc. 3rd IEEE Int. Conf. Pervasive Comput. Commun. Worksh. PerCom 2005, Kauai Island, HI, USA, 2005, pp. 350-356.
• [4] Z. Zhang and Q. Zhang, „Delay/disruption tolerant mobile ad hoc networks: latest developments", Wirel. Commun. Mob. Comput., vol. 7, no. 10, pp. 1219-1232, 2007.
• [5] W. Chen, R. K. Guha, T. J. Kwon, J. Lee, and Y.-Y. Hsu, „A survey and challenges in routing and data dissemination in vehicular ad hoc networks", Wirel. Commun. Mob. Comput., vol. 11, no. 7, pp. 787-795, 2011.
• [6] X. Zhao, „An adaptive approach for optimized opportunistic routing over delay tolerant mobile ad hoc networks", Ph.D. thesis, Computer Science Department, Rhodes University, Grahamstown, South Africa, 2007.
• [7] R. J. D'Souza and J. Jose, „Routing approaches in delay tolerant networks: A survey", Int. J. Comp. Appl., vol. 1, no. 17, pp. 8-14, 2010.
• [8] A. Vahdat and D. Becker, „Epidemic routing for partially connected ad hoc networks", Tech. Rep. CS-200006, Duke University, 2000.
• [9] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, „MaxProp: routing for vehicle-based disruption tolerant networks", in Proc. 25th IEEE Int. Conf. Comp. Commun. INFOCOM 2006, Barcelona, Spain, 2006, pp. 1-11.
• [10] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, „Single-copy routing in intermittently connected mobile networks", IEEE/ACM Trans. on Netw., vol. 16, no. 1, pp. 63-76, 2008.
• [11] T. Spyropoulos, K. Psounis, and C. Raghavendra, „Spray and wait: an efficient routing scheme for intermittently connected mobile networks", in Proc. ACM SIGCOMM Worksh. Delay-tolerant Netw. WDTN'05, Philadelphia, PA, USA, 2005, pp. 252-259.
• [12] S. C. Nelson, M. Bakht, R. Kravets, and A. F. Harris, „Encounter based routing in DTNs", in Proc. 28th Conf. Comp. Commun. IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 2009, pp. 846- 854.
• [13] H. Kang and D. Kim, „Vector routing for delay tolerant networks", in Proc. 68th IEEE Veh. Technol. Conf. VTC 2008-Fall, Calgary, Canada, 2008, pp. 122-135.
• [14] E. Bulut, Z. Wang, and B. K. Szymański, „Cost-effective multi period spraying for routing in delay-tolerant networks", IEEE/ACM Trans. on Netw., vol. 18, no. 5, pp. 1530-1543, 2010.
• [15] K. A. Harras and K. C. Almeroth, „Controlled ooding in disconnected sparse mobile networks", Wirel. Commun. Mob. Comput., vol. 9, no. 1, pp. 21-33, 2009.
• [16] L. M. Kiah, L. K. Qabajeh, and M. M. Qabajeh, Unicast positionbased routing protocols for ad-hoc networks", Acta Polytechnica Hungarica, vol. 7, no. 5, pp. 19-46, 2010.
• [17] H. Takagi and L. Kleinrock, „Optimal transmission ranges for randomly distributed packet radio terminals", IEEE Trans. on Commun., vol. 32, no. 3, pp. 246-257, 1984.
• [18] X. Li, M. Li, W Shu, and M. Y. Wu, „Packet-oriented routing in delay-tolerant vehicular sensor networks", J. Inform. Sci. Engin. (JISE), vol. 25, no. 6, pp. 1803-1817, 2009.
• [19] P.-C. Cheng, K. C. Lee, M. Gerla, and J. Härri, „GeoDTN+Nav: Geographic DTN routing with navigator prediction for urban vehicular environments", Mob. Netw. Appl., vol. 15, no. 1, pp. 61-82, 2010.
• [20] I. Jang, W. Choi, and H. Lim, „An opportunistic forwarding protocol with relay acknowledgment for vehicular ad hoc networks", Wirel. Commun. Mob. Comput., vol. 11, no. 7, pp. 939-953, 2011.
• [21] A. Lindgren, A. Doria, and O. Schelen, „Probabilistic routing in intermittently connected networks", ACM SIGMOBILE Mob. Comput. Commun. Rev., vol. 7, no. 3, pp. 19-20, 2003.
• [22] D. Yu and Y.-B. Ko, „FFRDV: Fastest-ferry routing in DTN-enabled vehicular ad hoc networks", in Proc. 11th Int. Conf. Adv. Commun. Technol. ICACT 2009, Phoenix Park, Korea, 2009, vol. 2, pp. 1410-1414.
• [23] Y. Ding, C. Wang, and L. Xiao, „A static-node assisted adaptive routing protocol in vehicular networks", in Proc. 4th ACM Int. Worksh. Veh. Ad Hoc Netw. VANET'07, Montreal, Quebec, Canada, 2007, pp. 59-68.
• [24] I. Leontiadis and C. Mascolo, „GeOpps: Geographical opportunistic routing for vehicular networks", in Proc. IEEE Int. Symp. World of Wirel., Mob. Multimed. Netw. WoWMoM 2007, Helsinki, Finland, 2007.
• [25] C. Liu and J. Wu, „An optimal probabilistically forwarding protocol in delay tolerant networks", in Proc. 10th ACM Int. Symp. Mob. Ad Hoc Netw. Comput. ACM MobiHoc 2009, New Orleans, Louisiana, USA, 2009, pp. 105-114.
• [26] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, „Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility", in Proc. 5th IEEE Int. Conf. Pervasive Comput. Commun. Worksh. PerCom 2007, White Plains, New York, USA, 2007.
• [27] Routing in delay-tolerant networking [Online]. Available: http://en.wikipedia.org/wiki/Routing in delay-tolerant networking
• [28] H. Fubler, M. Mauve, H. Hartenstein, D. Vollmer, and M. Kasemann, „Location-based routing for vehicular ad-hoc networks", ACM SIG-MOBILE Mob. Comput. Commun. Rev., vol. 7, no. 1, pp. 47-49, 2003.
• [29] M. Jerbi, S.-M. Senouci, T. Rasheed, and Y. M. Ghamri-Doudane, „Towards eficient geographic routing in urban vehicular networks", IEEE Trans. Veh. Technol., vol. 58, no. 9, pp. 5048-5059, 2009.
• [30] F. Li and Y. Wang, „Routing in vehicular ad hoc networks: A survey", IEEE Veh. Technol. Mag., vol. 2, no. 2, pp. 12-22, 2007.
• [31] J. M. Soares, M. Franceschinis, R. M. Rocha, W. Zhang, and M. A. Spirito, „Opportunistic data collection in sparse wireless sensor networks", EURASIP J. Wirel. Commun. Netw., vol. 2011, pp. 6:1-6:20, 2011.
• [32] G. Owen and M. Adda, „SOLS: Self organizing distributed location server for wireless ad hoc networks", Int. J. Comp. Netw. & Commun. (IJCNC), vol. 1, no. 1, pp. 17-30, 2009.
• [33] S. Farrell et al., „Report on an arctic summer DTN 2010 trial", Tech. rep., Trinity College, Dublin, Ireland, 2011 (draft 2011-05-18 Work-in-progress) [Online]. Available: http://dtn.dsg.cs.tcd.ie/n4c-summer10/summer10.pdf
• [34] J. A. B. Link, C. Wollgarten, S. Schupp, and K. Wehrle, „Perfect difference sets for neighbor discovery energy eficient and fair", in Proc. 3rd ACM Extreme Conf. on Commun. ExtremeCom 2011, Manaus, Brazil, 2011.
• [35] Opportunistic Network Environment (ONE) homepage, ver. 1.4.1 [Online]. Available: http://www.netlab.tkk.?/%7Ejo/dtn/ (accessed June 2011).
• [36] V. Soares, J. Rodrigues, P. Salvador, and A. Nogueira, „Improvement of messages delivery time on vehicular delay-tolerant networks", in Proc. Int. Worksh. Next Gener. Wirel. Mob. Netw. NGWMN 2009, Vienna, Austria, 2009.
• [37] A. Keränen, T. Kärkkäinen, and J. Ott, „Simulating mobility and DTNs with the ONE", J. Commun., vol. 5, no. 2, pp. 92-105, 2010.
• [38] V. Soares, F. Farahmand, and J. R. Rodrigue, „Improving vehicular delay-tolerant network performance with relay nodes", in Proc. 5th Euro-Ngi Conf. Next Gener. Internet Netw. NGI 2009, Aveiro, Portugal, 2009.
• [39] F. Alnajjar and T. Saadawi, „Performance analysis of routing protocols in delay/disruption tolerant mobile ad hoc networks", in Proc. 10th WSEAS Int. Conf. on Elec., Hardw., Wirel. Opt. Commun. EHAC'11, and 10th WSEAS Int. Conf. on Sig. Process., Robot. And Autom. ISPRA'11, and 3rd WSEAS Int. Conf. Nanotechnol. NANOTECHNOLOGY'11, Cambridge, UK, 2011, pp. 407-417.

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę.