Cross-layer greedy forwarding algorithm for VANET

被引:1
|
作者
Hammouche, Y. [1 ]
Merniz, S. [1 ]
机构
[1] Abdel Hamid Mehri Constantine 2 Univ, MISC Lab, Constantine, Algeria
关键词
VANET; routing; cross-layer; greedy; AD-HOC NETWORKS; DESIGN; PROTOCOL;
D O I
10.3233/JHS-220689
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, vehicular communication systems have taken an important place in Intelligent Transport Systems (ITS). These systems are designed on self-organizing networks, known as Vehicular Ad hoc NETworks (VANETs). Their objective is to struggle against road safety problems and road traffic congestion by integrating information and communication technologies in road infrastructures and vehicles. VANET differs from other types of ad hoc networks by high mobility and very dynamic topology. Consequently, the design of an efficient VANET routing protocol becomes a challenging task. Many routing schemes with QoS (Quality of Service) have been proposed in the literature for VANET, to satisfy the performances required by the different applications running upon such networks. Cross-layer designs, which make it possible to exchange and share information between the different layers of the network, have shown to be efficient in VANETs. This paper proposes an improved version of the geographic Greedy algorithm as a cross-layer routing protocol for VANETs. The cooperation between the network layer and the lower layers involves three cyber-physical parameters: Speed, position and Signal-to-Noise Ratio (SNR). The simulation results over the Network Simulator-3 (NS3) demonstrated the effectiveness of the proposed solution in terms of end-to-end delay, throughput and packet delivery ratio.
引用
收藏
页码:167 / 179
页数:13
相关论文
共 50 条
  • [1] Flow-based cross-layer forwarding algorithm for concurrent multipath
    Han, Lai-Quan
    Wang, Jin-Kuan
    Wang, Cui-Rong
    [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2009, 30 (03): : 357 - 360
  • [2] Adaptive Traffic Management with VANET in V to I Communication Using Greedy Forwarding Algorithm
    Yugapriya, R.
    Dhivya, P.
    Dhivya, M. M.
    Kirubakaran, S.
    [J]. 2014 INTERNATIONAL CONFERENCE ON INFORMATION COMMUNICATION AND EMBEDDED SYSTEMS (ICICES), 2014,
  • [3] Cross-Layer Assisted Forwarding Strategy for Opportunistic Communication
    Teixeira, Thiago
    Deshmukh, Rajvardhan
    Zink, Michael
    [J]. 2019 IEEE 20TH INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS (WOWMOM), 2019,
  • [4] MAC layer based cross-layer solutions for VANET routing: A review
    Nigam, Ujjwal
    Silakari, Sanjay
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2021, 21 (12): : 636 - 642
  • [5] A Cross-Layer MAC Aware Pseudonym (MAP) Scheme for the VANET
    Liu, Zishan
    Zhang, Lin
    Ni, Wei
    Collings, Iain B.
    [J]. 2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
  • [6] Connectivity-based Cross-Layer Opportunistic Forwarding for MWSNs
    Karyakarte, Mandar Subhash
    Tavildar, Anil Srinivas
    Khanna, Rajesh
    [J]. IETE JOURNAL OF RESEARCH, 2015, 61 (05) : 457 - 465
  • [7] Greedy forwarding mechanism and decomposition areas in urban environment for VANET
    Laanaoui, My Driss
    Raghay, Said
    [J]. 2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS), 2014, : 1206 - 1211
  • [8] Cross-layer Algorithm For QoS in WBANs
    Issaoui, Leila
    Sethom, Kaouthar
    [J]. 2016 INTERNATIONAL SYMPOSIUM ON SIGNAL, IMAGE, VIDEO AND COMMUNICATIONS (ISIVC), 2016, : 247 - 252
  • [9] The Modeling and Cross-Layer Optimization of 802.11p VANET Unicast
    Xie, Yu
    Ho, Ivan Wang-Hei
    Magsino, Elmer R.
    [J]. IEEE ACCESS, 2018, 6 : 171 - 186
  • [10] Cross-layer optimization for VANET city scenario using Taguchi mechanism
    Hanah, Aznor
    Farook, Rohani S. Mohamed
    Rejab, Mohamad Rizal Abdul
    Fadzil, Mohd Fairuz Muhamad
    Elias, Shamsul Jamel
    Dawam, Siti Rafidah Muhamat
    [J]. 6TH IEEE INTERNATIONAL CONFERENCE ON RECENT ADVANCES AND INNOVATIONS IN ENGINEERING (ICRAIE), 2021,