Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks
With the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WAN...
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/2051796 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849434571292016640 |
|---|---|
| author | Noor Mast Muhammad Altaf Khan M. Irfan Uddin Syed Atif Ali Shah Atif Khan Mahmoud Ahmad Al-Khasawneh Marwan Mahmoud |
| author_facet | Noor Mast Muhammad Altaf Khan M. Irfan Uddin Syed Atif Ali Shah Atif Khan Mahmoud Ahmad Al-Khasawneh Marwan Mahmoud |
| author_sort | Noor Mast |
| collection | DOAJ |
| description | With the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WANETs. To handle this problem, this paper presents a routing protocol named CCBR (Channel Contention Based Routing). CCBR tries to determine a least contended path between the endpoints to increase packet delivery ratio and to reduce packet delay and normalized routing overhead. Moreover, throughout the active data section, each intermediate node computes its channel contention value. If an intermediate node detects an increase in channel contention, it notifies the source node. Then the source node determines another least contended route for transmission. The advantages of CCBR are verified in our NS2-based performance study, and the results show that CCBR outperforms ad hoc on-demand distance vector (AODV) in terms of packet delivery ratio, end-to-end delay, and routing overhead by 4% to 9%. |
| format | Article |
| id | doaj-art-e982ad3a7fd04718a33be124a3c22f3c |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-e982ad3a7fd04718a33be124a3c22f3c2025-08-20T03:26:35ZengWileyComplexity1076-27871099-05262021-01-01202110.1155/2021/20517962051796Channel Contention-Based Routing Protocol for Wireless Ad Hoc NetworksNoor Mast0Muhammad Altaf Khan1M. Irfan Uddin2Syed Atif Ali Shah3Atif Khan4Mahmoud Ahmad Al-Khasawneh5Marwan Mahmoud6Institute of Computing, Kohat University of Science and Technology, Kohat, PakistanInstitute of Computing, Kohat University of Science and Technology, Kohat, PakistanInstitute of Computing, Kohat University of Science and Technology, Kohat, PakistanFaculty of Engineering and Information Technology, Northern University, Nowshera, PakistanDepartment of Computer Science, Islamia College Peshawar, Peshawar 25120, PakistanFaculty of Computer & Information Technology, Al-Madinah International University, Kuala Lumpur, MalaysiaFaculty of Applied Studies, King Abdulaziz University, Jeddah, Saudi ArabiaWith the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WANETs. To handle this problem, this paper presents a routing protocol named CCBR (Channel Contention Based Routing). CCBR tries to determine a least contended path between the endpoints to increase packet delivery ratio and to reduce packet delay and normalized routing overhead. Moreover, throughout the active data section, each intermediate node computes its channel contention value. If an intermediate node detects an increase in channel contention, it notifies the source node. Then the source node determines another least contended route for transmission. The advantages of CCBR are verified in our NS2-based performance study, and the results show that CCBR outperforms ad hoc on-demand distance vector (AODV) in terms of packet delivery ratio, end-to-end delay, and routing overhead by 4% to 9%.http://dx.doi.org/10.1155/2021/2051796 |
| spellingShingle | Noor Mast Muhammad Altaf Khan M. Irfan Uddin Syed Atif Ali Shah Atif Khan Mahmoud Ahmad Al-Khasawneh Marwan Mahmoud Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks Complexity |
| title | Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks |
| title_full | Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks |
| title_fullStr | Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks |
| title_full_unstemmed | Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks |
| title_short | Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks |
| title_sort | channel contention based routing protocol for wireless ad hoc networks |
| url | http://dx.doi.org/10.1155/2021/2051796 |
| work_keys_str_mv | AT noormast channelcontentionbasedroutingprotocolforwirelessadhocnetworks AT muhammadaltafkhan channelcontentionbasedroutingprotocolforwirelessadhocnetworks AT mirfanuddin channelcontentionbasedroutingprotocolforwirelessadhocnetworks AT syedatifalishah channelcontentionbasedroutingprotocolforwirelessadhocnetworks AT atifkhan channelcontentionbasedroutingprotocolforwirelessadhocnetworks AT mahmoudahmadalkhasawneh channelcontentionbasedroutingprotocolforwirelessadhocnetworks AT marwanmahmoud channelcontentionbasedroutingprotocolforwirelessadhocnetworks |