Bibliographic Details
| Title: |
Joint congestion and contention avoidance in a scalable QoS-aware opportunistic routing in wireless ad-hoc networks. |
| Authors: |
Parsa, Ali1 (AUTHOR), Moghim, Neda1,2 (AUTHOR) n.moghim@eng.ui.ac.ir, Haghani, Sasan3 (AUTHOR) |
| Source: |
PLoS ONE. 8/1/2023, Vol. 18 Issue 8, p1-27. 27p. |
| Subject Terms: |
*AD hoc computer networks, *END-to-end delay, *TRAFFIC flow, *OCCUPANCY rates, *QUALITY of service, *WIRELESS channels, *PHYSICAL training & conditioning |
| Abstract: |
Opportunistic routing (OR) can greatly increase transmission reliability and network throughput in wireless ad-hoc networks by taking advantage of the broadcast nature of the wireless medium. However, network congestion is a barrier in the way of OR's performance improvement, and network congestion control is a challenge in OR algorithms, because only the pure physical channel conditions of the links are considered in forwarding decisions. This paper proposes a new method to control network congestion in OR, considering three types of parameters, namely, the backlogged traffic, the traffic flows' Quality of Service (QoS) level, and the channel occupancy rate. Simulation results show that the proposed algorithm outperforms the state-of-the-art algorithms in the context of OR congestion control in terms of average throughput, end-to-end delay, and Packet Delivery Ratio (PDR). Due to the higher PDR at different traffic loads and different node densities, it can be concluded that the proposed algorithm also improves network scalability, which is very desirable given the recent changes in wireless networks. [ABSTRACT FROM AUTHOR] |
|
Copyright of PLoS ONE is the property of Public Library of Science and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Complete |
|
Full text is not displayed to guests. |
Login for full access.
|
