A Combined Modified OpportunisticNeighbor Selection and Vehicle Localization Routing Approach for Improved Connectivity in Indian Road Scenario

  • Authors

    • Jothy. N
    • Jayanthi. K
    • Gunasundari. R
    2018-07-26
    https://doi.org/10.14419/ijet.v7i3.4.16182
  • Modified Opportunistic Neighbor Selection (MONS), Vehicle Localization (VL), Routing in VANETs
  • In the recent years, VANET is becoming a spectacular research area in wireless networks. The high mobility vehicular node in VANET dynamically changes the network topology resulting in highly unstable vehicle connectivity. This induces network partitioning and hence ensuring link availability remains to be a challenging task.  To surpass these issues, design of efficient VANET routing algorithms is necessary. The routing design for VANET scenario is highly complex and challenging making the existing AODV, greedy, cluster based routing algorithms to suffer from degraded link quality resulting in high end-to-end delay and significant packet loss. Although Opportunistic Neighbor Selection (ONS) scheme proves to be a better routing logic, it does not seem to always ensure link availability at road intersections, particularly in Indian road scenario, where multi road lane discipline is very hard to implement. To overcome these limitations, a combination of Modified Opportunistic Neighbor Selection (MONS) and Vehicle Localization (VL) routing logic for adoption in Indian road sector has been proposed in this paper. This paper addresses the connectivity challenges and provides better solution to achieve improved performance. In this work, two specific scenarios namely: varied mobility/node density rates is considered by treating the other fixed inorder to evaluate the suitability of the proposed logic in terms of packet delivery ratio, end-to-end delay.

     

     

  • References

    1. [1] Sherali Zeadally, Ray Hunt, Yuh-Shyan Chen and Angela Irwin, “Vehicular ad hoc networks (VANETS): status, results, and challenges,†Springer-Telecommunication System, Vol.50, No.217-241, August 2012.

      [2] W. Liang, Z. Li, H. Zhang, S. Wang, and R. Bie, “Vehicular ad hoc networks: Architectures, research issues, methodologies, challenges, and trends,†International Journal of Distributed Sensor Networks, vol. 2015, pp. 1-11, Jan. 2015.

      [3] B Karp, HT Kung, “GPSR: greedy perimeter stateless routing for wireless networks,†in Proceedings of Mobile Computing and Networking, Boston, pp. 243–254, August 2000.

      [4] M.A. Togou, A. Hafid, L. Khoukhi, “SCRP: Stable CDS-Based Routing Protocol for Urban Vehicular Ad Hoc Networks,†IEEE Transactions Intelligent Transportation Systems, vol. 17, no. 5, 2016, pp: 1298-1307.

      [5] N. Chakchouk, “A Survey on Opportunistic Routing in Wireless Communication Networks, â€IEEE Communications and surveys vol. 17, no. 4, pp: 2214-2241, 2015.

      [6] W. Chen, C.T. Lea, S. He, X.Y. Zhe, “Opportunistic Routing and Scheduling for Wireless Networks,†IEEE Transactions on Wireless Communication, vol. 16, no. 1, pp: 320-330, 2017.

      [7] Y. Xie, J. Bao, Z. Song, “A Hybrid Opportunistic Routing Scheme Based on Nodes Grouping strategy for VANETs in Urban Scenarios,†in Proceedings of 25th Wireless and Optical Communication Conference chengdu, China, May 2016, pp: 1-5.

      [8] Xuelian Cai, Ying He, Chunchun Zhao, Lina Zhu and Changle Li,â€LSGO: Link State aware Geographic Opportunistic routing protocol for VANETs,†EURASIP Journal on Wireless Communications and Networking 2014.

      [9] Amjad Mehmood, Akbar khanan, Abdul Hakim H. M. Mohamed, Houbing Song,†ANTSC: An Intelligent Naïve Bayesian Probabilistic Estimation Practice for Traffic Flow to Form Stable Clustering in VANET,†IEEE Access, vol.6, pp. 4452-4461, 2017.

  • Downloads

  • How to Cite

    N, J., K, J., & R, G. (2018). A Combined Modified OpportunisticNeighbor Selection and Vehicle Localization Routing Approach for Improved Connectivity in Indian Road Scenario. International Journal of Engineering & Technology, 7(3.16), 52-56. https://doi.org/10.14419/ijet.v7i3.4.16182