Cross-Layer Greedy-Based Routing in VANETs: Virtual Multibackbones Approach
An efficient data packet delivery in a vehicular ad hoc network (VANET) is still a challenging task because of the rapid changes in the network topology and the instability of link quality, especially for nonsafety applications. Several routing schemes are proposed to improve the reliability of data...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Applied Computational Intelligence and Soft Computing |
| Online Access: | http://dx.doi.org/10.1155/2024/5750055 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832557349599969280 |
|---|---|
| author | Mohamed Nabil Said El Kafhali Abdelmajid Hajami Abdelkrim Haqiq |
| author_facet | Mohamed Nabil Said El Kafhali Abdelmajid Hajami Abdelkrim Haqiq |
| author_sort | Mohamed Nabil |
| collection | DOAJ |
| description | An efficient data packet delivery in a vehicular ad hoc network (VANET) is still a challenging task because of the rapid changes in the network topology and the instability of link quality, especially for nonsafety applications. Several routing schemes are proposed to improve the reliability of data delivery between vehicles. These protocols still suffer from the growth of the data packet delivery delay, the lost data packets, and the control packets. For this reason, we propose a novel cross-layer routing protocol, which is the first that uses virtual multibackbones and combines them with the quality of the link to choose the next forwarder vehicle. The next candidate forwarders, among neighbors, are those that keep a minimum of link quality during the data packet delivery delay. Then, among these candidates, we select that is closest to the destination vehicle to receive and forward the data. In addition, our proposal gives priority to those that travel toward the destination vehicle avoiding the forwarding of data several times by the same vehicle. The substantial simulations show that our protocol outperforms certain of the well-known existing schemes in the VANET area by varying the vehicle density on the highway. It exhibits an improvement of 6.72% in the average end-to-end delay of data delivery, 14.44% in the packet delivery ratio, 11.2% in the throughput, and 6.4% in the control overhead as compared to other schemes. |
| format | Article |
| id | doaj-art-0d8118e3058d403e9d3651a05ac1f97b |
| institution | Kabale University |
| issn | 1687-9732 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Applied Computational Intelligence and Soft Computing |
| spelling | doaj-art-0d8118e3058d403e9d3651a05ac1f97b2025-02-03T05:15:52ZengWileyApplied Computational Intelligence and Soft Computing1687-97322024-01-01202410.1155/2024/5750055Cross-Layer Greedy-Based Routing in VANETs: Virtual Multibackbones ApproachMohamed Nabil0Said El Kafhali1Abdelmajid Hajami2Abdelkrim Haqiq3Faculty of SciencesFaculty of Sciences and TechniquesFaculty of Sciences and TechniquesFaculty of Sciences and TechniquesAn efficient data packet delivery in a vehicular ad hoc network (VANET) is still a challenging task because of the rapid changes in the network topology and the instability of link quality, especially for nonsafety applications. Several routing schemes are proposed to improve the reliability of data delivery between vehicles. These protocols still suffer from the growth of the data packet delivery delay, the lost data packets, and the control packets. For this reason, we propose a novel cross-layer routing protocol, which is the first that uses virtual multibackbones and combines them with the quality of the link to choose the next forwarder vehicle. The next candidate forwarders, among neighbors, are those that keep a minimum of link quality during the data packet delivery delay. Then, among these candidates, we select that is closest to the destination vehicle to receive and forward the data. In addition, our proposal gives priority to those that travel toward the destination vehicle avoiding the forwarding of data several times by the same vehicle. The substantial simulations show that our protocol outperforms certain of the well-known existing schemes in the VANET area by varying the vehicle density on the highway. It exhibits an improvement of 6.72% in the average end-to-end delay of data delivery, 14.44% in the packet delivery ratio, 11.2% in the throughput, and 6.4% in the control overhead as compared to other schemes.http://dx.doi.org/10.1155/2024/5750055 |
| spellingShingle | Mohamed Nabil Said El Kafhali Abdelmajid Hajami Abdelkrim Haqiq Cross-Layer Greedy-Based Routing in VANETs: Virtual Multibackbones Approach Applied Computational Intelligence and Soft Computing |
| title | Cross-Layer Greedy-Based Routing in VANETs: Virtual Multibackbones Approach |
| title_full | Cross-Layer Greedy-Based Routing in VANETs: Virtual Multibackbones Approach |
| title_fullStr | Cross-Layer Greedy-Based Routing in VANETs: Virtual Multibackbones Approach |
| title_full_unstemmed | Cross-Layer Greedy-Based Routing in VANETs: Virtual Multibackbones Approach |
| title_short | Cross-Layer Greedy-Based Routing in VANETs: Virtual Multibackbones Approach |
| title_sort | cross layer greedy based routing in vanets virtual multibackbones approach |
| url | http://dx.doi.org/10.1155/2024/5750055 |
| work_keys_str_mv | AT mohamednabil crosslayergreedybasedroutinginvanetsvirtualmultibackbonesapproach AT saidelkafhali crosslayergreedybasedroutinginvanetsvirtualmultibackbonesapproach AT abdelmajidhajami crosslayergreedybasedroutinginvanetsvirtualmultibackbonesapproach AT abdelkrimhaqiq crosslayergreedybasedroutinginvanetsvirtualmultibackbonesapproach |