Open Access   Article Go Back

A Consistent Routing Protocol Based On Graph Theory For Efficient Vehicle To Vehicle Communication

A.Navis Vigilia1 , J.Suresh Suseela2

Section:Survey Paper, Product Type: Journal Paper
Volume-6 , Issue-12 , Page no. 899-907, Dec-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i12.899907

Online published on Dec 31, 2018

Copyright © A.Navis Vigilia, J.Suresh Suseela . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: A.Navis Vigilia, J.Suresh Suseela, “A Consistent Routing Protocol Based On Graph Theory For Efficient Vehicle To Vehicle Communication,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.12, pp.899-907, 2018.

MLA Style Citation: A.Navis Vigilia, J.Suresh Suseela "A Consistent Routing Protocol Based On Graph Theory For Efficient Vehicle To Vehicle Communication." International Journal of Computer Sciences and Engineering 6.12 (2018): 899-907.

APA Style Citation: A.Navis Vigilia, J.Suresh Suseela, (2018). A Consistent Routing Protocol Based On Graph Theory For Efficient Vehicle To Vehicle Communication. International Journal of Computer Sciences and Engineering, 6(12), 899-907.

BibTex Style Citation:
@article{Vigilia_2018,
author = {A.Navis Vigilia, J.Suresh Suseela},
title = {A Consistent Routing Protocol Based On Graph Theory For Efficient Vehicle To Vehicle Communication},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {12 2018},
volume = {6},
Issue = {12},
month = {12},
year = {2018},
issn = {2347-2693},
pages = {899-907},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3436},
doi = {https://doi.org/10.26438/ijcse/v6i12.899907}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i12.899907}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3436
TI - A Consistent Routing Protocol Based On Graph Theory For Efficient Vehicle To Vehicle Communication
T2 - International Journal of Computer Sciences and Engineering
AU - A.Navis Vigilia, J.Suresh Suseela
PY - 2018
DA - 2018/12/31
PB - IJCSE, Indore, INDIA
SP - 899-907
IS - 12
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
464 293 downloads 197 downloads
  
  
           

Abstract

Vehicular Ad-hoc Networks (VANETs) are made exclusive for vehicular communications in which each node makes a bidirectional connectivity with other nodes. VANET has attracted more researchers and has unlocked a track to cultivate few applications like propagation of travel alerts, traffic status, and user defined applications. Each node in VANET has some unique features like dynamic network structure, high mobility, low processing speed and low memory. These features make VANET unique and different from other wireless networks. These features need a special attention, while designing a routing protocol to VANETs. This paper proposes a novel consistent routing protocol called CRP for inter vehicular communications to achieve a consistent and reliable route between the source and destination. Based on link reliability value and graph traversals, a source node predicts a reliable path among the neighboring nodes. The proposed algorithm is designed to work in a stressful urban environment and significantly outperforms than the other existing algorithms.

Key-Words / Index Term

Consistent, graph theory, protocol, reliable, vehicle ad hoc networks (VANETs), wireless, urban

References

[1] Neelesh Gupta and Roopam Gupta, “Routing protocols in Mobile Ad-hoc Networks: An overview”, IEEE International Conference on Emerging Trends in Robotics and Technologies, 2010, pp. 173-177
[2] J. Monteiro, A. Goldman and A. Ferreira, “Performance evaluation of dynamic networks using an evolving graph combinatorial model”, IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2006, pp. 173-180.
[3] G. Mao and B. D. O. Anderson, “Graph theoretic models and tools for the analysis of dynamic wireless multi-hop networks”, IEEE Wireless Communications and Networks Conference, 2009, pp. 1-6.
[4] T. Taleb, M. Ochi, A. Jamalipour, N. Kato and Y. Nemoto, “An efficient vehicle-heading based routing protocol for VANET networks”, IEEE Wireless Communications and Networks Conference, 2006, pp. 2199-2204.
[5] K. T. Feng, C. H. Hsu and T. E. Lu, “Velocity-assisted predictive mobility and location-aware routing protocols for mobile ad hoc networks”, IEEE Transactions on Vehicular Technology 57(1) (2008), 448-464
[6] V. Namboodiri and L. Gao, “Prediction-based routing for vehicular ad hoc networks”, IEEE Transactions on Vehicular Technology 56(4) (2007), 2332-2345
[7] Hao Jiang Hao Guo and Lijia Chen, “Reliable and efficient alarm message routing in VANET”, IEEE International Conference on Distributed Computing Systems, 2008, pp. 186-191.
[8] Peiyuan Lai, Xinhong Wang, Ning Lu and Fuqiang Liu, “A Reliable broadcast routing scheme based on mobility prediction for VANET”, IEEE Intelligent Vehicles Symposium, 2009, pp. 1083-1087.
[9] Hassan Aboubakr Omar, Weihua Zhuang and Li Li, VeMAC: “A TDMA based MAC protocol for reliable broadcast in VANETs”, IEEE Transactions on Mobile Computing 12(9), 1724-1736
[10] G. Pallis, D. Katsaros, M. D. Dikaiakos, N. Loulloudes, and L. Tassiulas, “On the structure and evolution of vehicular networks”, IEEE/ACM Annual Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2009, pp. 1-10.
[11] M. Rudack, M. Meincke, K. Jobmann and M. Lott, “On the dynamics of ad hoc networks for inter vehicle communication (IVC)”, International Conference on Wireless Networks, 2002.
[12] I. D. Chakeres and E. M. Belding-Royer, “AODV routing protocol implementation design”, IEEE International Workshop on Distributed Computing Systems, 2004, pp. 698-703.
[13] Kavin Tantipongsakul and Akharin Khunkitti, “Dynamic policy-based routing using firewall rules”, IEEE European Symposium on Computer Modeling and Simulation, 2009, pp. 540-545.