IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v12y2020i8p127-d391432.html
   My bibliography  Save this article

Adaptive Allocation Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks

Author

Listed:
  • Walaa Hassan

    (Department of Management Information Systems, College of Applied Studies and Community Service, Imam Abdulrahman Bin Faisal University, P.O. Box 2435, Dammam 31441, Saudi Arabia)

  • Tamer Farag

    (Department of Management Information Systems, College of Applied Studies and Community Service, Imam Abdulrahman Bin Faisal University, P.O. Box 2435, Dammam 31441, Saudi Arabia)

Abstract

The wireless mesh network (WMN) has proven to be a great choice for network communication technology. WMNs are composed of access points (APs) that are installed and communicate with each other through multi-hop wireless networks. One or more of these APs acts as a gateway (GW) to the internet. Hosts of WMNs are stationary or mobile. According to the structure of WMNs, some network features may be affected, such as the overall performance, channel interference, and AP connectivity. In this paper, we propose a new adaptive channel allocation algorithm for a multi-radio multi-channel wireless mesh network. The algorithm is aimed to minimize the number of channel reassignments while maximizing the performance under practical constraints. The algorithm defines a decision function for the channel reassignments. The decision function aims to minimize the traffic around the GW. Whenever the traffic changes in the wireless mesh network, the decision function decides which channel radio reassignment should be done. We demonstrated the effectiveness of our algorithm through extensive simulations using Network Simulator 2 (NS-2).

Suggested Citation

  • Walaa Hassan & Tamer Farag, 2020. "Adaptive Allocation Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks," Future Internet, MDPI, vol. 12(8), pages 1-14, July.
    • Handle: RePEc:gam:jftint:v:12:y:2020:i:8:p:127-:d:391432
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/12/8/127/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/12/8/127/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:12:y:2020:i:8:p:127-:d:391432. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.