IDEAS home Printed from https://ideas.repec.org/a/alk/jcsts0/v6y2024i1id6434.html

Advanced Recursive Best-First Search (RBFS) based Routing Protocol for Multi-hop and Multi-Channel Cognitive Wireless Mesh Networks

Author

Listed:
  • Zahid Hassan

    (Student, Dept. of Computer Science and Engineering, Chittagong University of Engineering and Technology, Chattogram and Bangladesh)

  • Asaduzzaman

    (Professor, Dept. of Computer Science and Engineering, Chittagong University of Engineering and Technology, Chattogram and Bangladesh)

Abstract

Cognitive Wireless Mesh Network (CWMN) is an opportunistic network in which radio channels can be assigned according to their availability to establish connections among nodes. After establishing a radio connection among nodes, it is necessary to find an optimal route from the source node to the destination node in the network. If there remain more channels among nodes, the minimum weighted channel should be taken into account to establish expected routes. The graph theoretic approach fails to model the multi-channel cognitive radio networks due to abrupt failure in finding new successful routes as it can’t figure multi-channel networks. In this paper, a multi-edged graph model is being proposed to overcome the problems of cognitive radio networks, such as flooding problems, channel accessing problems etc. A new channel accessing algorithm has been introduced, and optimal routes have been selected using a heuristic algorithm named RBFS. Simulation results are compared with DJKSTRA based routing protocols.

Suggested Citation

  • Zahid Hassan & Asaduzzaman, 2024. "Advanced Recursive Best-First Search (RBFS) based Routing Protocol for Multi-hop and Multi-Channel Cognitive Wireless Mesh Networks," Journal of Computer Science and Technology Studies, Al-Kindi Center for Research and Development, vol. 6(1), pages 01-10, January.
    • Handle: RePEc:alk:jcsts0:v:6:y:2024:i:1:id:6434
    DOI: 10.32996/jcsts.2024.6.1.1
    as

    Download full text from publisher

    File URL: https://al-kindipublisher.com/index.php/jcsts/article/view/6434
    File Function: Abstract page
    Download Restriction: no
    File URL: https://al-kindipublisher.com/index.php/jcsts/article/download/6434/5495
    File Function: Full text
    Download Restriction: no
    File URL: https://libkey.io/10.32996/jcsts.2024.6.1.1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:alk:jcsts0:v:6:y:2024:i:1:id:6434. 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: Al-Kindi Center for Research and Development (email available below). General contact details of provider: https://al-kindipublisher.com/index.php/jcsts .

    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.