2016/05/26 by Ranadheer Musham, Srikant Manas Kala, Musham, Ranadheer +7
Computer Science · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Wireless Networks and Protocols
paper · pdf · doi:10.48550/arxiv.1605.08321
openalex publication_date 2016/05/26 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
In multi-radio multi-channel (MRMC) WMNs, interference alleviation is\naffected through several network design techniques e.g., channel assignment\n(CA), link scheduling, routing etc., intelligent CA schemes being the most\neffective tool for interference mitigation. CA in WMNs is an NP-Hard problem,\nand makes optimality a desired yet elusive goal in real-time deployments which\nare characterized by fast transmission and switching times and minimal\nend-to-end latency. The trade-off between optimal performance and minimal\nresponse times is often achieved through CA schemes that employ heuristics to\npropose efficient solutions. WMN configuration and physical layout are also\ncrucial factors which decide network performance, and it has been demonstrated\nin numerous research works that rectangular/square grid WMNs outperform random\nor unplanned WMN deployments in terms of network capacity, latency, and network\nresilience. In this work, we propose a smart heuristic approach to devise a\nnear-optimal CA algorithm for grid WMNs (NOCAG). We demonstrate the efficacy of\nNOCAG by evaluating its performance against the minimal-interference CA\ngenerated through a rudimentary brute-force technique (BFCA), for the same WMN\nconfiguration. We assess its ability to mitigate interference both,\ntheoretically (through interference estimation metrics) and experimentally (by\nrunning rigorous simulations in NS-3). We demonstrate that the performance of\nNOCAG is almost as good as the BFCA, at a minimal computational overhead of\nO(n) compared to the exponential of BFCA.\n