Metaheuristic Optimisation for Radio Interface-Constrained Channel Assignment in a Hybrid Wi-Fi-Dynamic Spectrum Access Wireless Mesh Network

被引:1
|
作者
Zlobinsky, Natasha [1 ]
Johnson, David [1 ]
Mishra, Amit Kumar [1 ]
Lysko, Albert A. [1 ,2 ]
机构
[1] Univ Cape Town, Cape Town, South Africa
[2] CSIR, Pretoria, South Africa
关键词
Channel Assignment; Dynamic Spectrum Access; DSA; Wireless Mesh Networks; WMN; CBRS; Wi-Fi; 6E; TVWS; Genetic Algorithm; Simulated Annealing;
D O I
10.1007/978-3-030-98002-3_4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Channel Assignment (CA) in wireless mesh networks (WMNs) has not been well studied in scenarios where the network uses Dynamic Spectrum Access (DSA). This work aims to fill some of this gap. We compare metaheuristic algorithms for optimising the CA in a WMN that has both Wi-Fi and DSA radios (where DSA could be Television White Spaces or 6 GHz). We also present a novel algorithm used alongside these metaheuristic algorithms to ensure that the CA solutions are feasible. Feasible solutions meet the interface constraint, i.e. only as many channels are allocated to a node as it has radios. The algorithm also allows the topology to be preserved by maintaining links. Many previous studies tried to ensure feasibility and/or topology preservation by using two separate steps. The first step optimised without checking feasibility and the second step fixed infeasible solutions. This second step often negated the benefits of the previous step and degraded performance. Other CA algorithms tend to use simple on/off interference models, instead of models that more realistically reflect the physical layer environment, such as the Signal to Interference plus Noise Ratio (SINR). We present our more realistic SINR-based model and optimisation objective. Simulated Annealing (SA) and Genetic Algorithm (GA) are applied to the problem. Performance is evaluated and verified through simulation. We find that GA outperforms SA, finding higher quality solutions faster, although both metaheuristics are better than random allocations. GA can be used daily to find good CAs in changing conditions.
引用
收藏
页码:56 / 76
页数:21
相关论文
共 6 条
  • [1] Comparison of Metaheuristic Algorithms for Interface-Constrained Channel Assignment in a Hybrid Dynamic Spectrum Access Wi-Fi Infrastructure WMN
    Zlobinsky, Natasha
    Johnson, David L.
    Mishra, Amit Kumar
    Lysko, Albert A.
    [J]. IEEE ACCESS, 2022, 10 : 26654 - 26680
  • [2] Simulated annealing for interface-constrained channel assignment in wireless mesh networks
    Chen, Ying-Yu
    Chen, Chien
    [J]. AD HOC NETWORKS, 2015, 29 : 32 - 44
  • [3] Design and Implementation of a Hybrid Channel-Assignment Protocol for a Multi-Interface Wireless Mesh Network
    Li, Minglu
    Feng, Yunxia
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2010, 59 (06) : 2986 - 2997
  • [4] A MAC protocol for multi-channel multi-interface wireless mesh network using hybrid channel assignment scheme
    Li, Chi-Yu
    Jeng, An-Kai
    Jan, Rong-Hong
    [J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2007, 23 (04) : 1041 - 1055
  • [5] A novel hybrid heuristic-based network parameter optimization for spectral and energy efficiency in dynamic spectrum access on wireless mesh network system
    Swathi, Bankapalli
    Prakash, M. Sunil
    Krishna, B.T.
    Satyanarayana, M.
    [J]. International Journal of Computers and Applications, 1600, 4 (266-279):
  • [6] Dynamic Opportunistic Spectrum Access of Multi-channel Multi-radio Based on Game Theory in Wireless Cognitive Network
    Fang, He
    Xu, Li
    Huang, Chuan
    [J]. 2013 IEEE NINTH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS (MSN 2013), 2013, : 127 - 132