• DocumentCode
    3090209
  • Title

    Joint Interface Placement and Channel Assignment in Multi-channel Wireless Mesh Networks

  • Author

    Wu, Wenjia ; Luo, Junzhou ; Yang, Ming ; Yang, Laurence T.

  • Author_Institution
    Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
  • fYear
    2012
  • fDate
    10-13 July 2012
  • Firstpage
    395
  • Lastpage
    402
  • Abstract
    In multi-channel wireless mesh networks (WMNs), it is significantly important to achieve efficient channel utilization. The channel assignment problem, which investigates how to seek a proper mapping between available channels and network interface cards (NICs) on mesh routers (MRs), is attracting more and more attention from the research community. However, most proposed channel assignment approaches assume that NICs are evenly placed on the MRs, and its amount is also pre-determined. Due to the non-uniform distribution of WMN traffic, the equal interface placement will inevitably cause that the bottleneck MRs suffer from NIC shortage, and MRs with less load only have a low utilization of NICs. Hence, in order to improve network performance and reduce network cost, interface placement should be considered carefully in the process of planning a WMN. In this paper, we investigate the joint interface placement and channel assignment problem, i.e., how to appropriately place NICs on MRs and assign channels to them. We first formulate the problem as a mixed integer linear programming (MILP) model, which aims to minimize the total number of NICs while satisfying logical link, link bandwidth, link interference and traffic demand constraints. Then, we propose an MILP-based heuristic algorithm, using iterated local search to obtain sub-optimal solutions efficiently. Finally, we conduct simulation experiments to compare the heuristic solutions with the optimal solutions, and the results show that our proposed heuristic algorithm can achieve good sub-optimal solutions. Moreover, the simulation results also demonstrate that the algorithm can be well applied in large-scale WMNs where the optimal solutions cannot be obtained, and can perform well under different traffic demands.
  • Keywords
    integer programming; iterative methods; linear programming; network interfaces; search problems; telecommunication network planning; telecommunication network routing; telecommunication traffic; wireless channels; wireless mesh networks; MILP-based heuristic algorithm; NIC; WMN planning; WMN traffic nonuniform distribution; bottleneck MR; channel assignment problem; iterated local search; joint interface placement; large-scale WMN; link bandwidth; link interference; logical link; mesh routers; mixed integer linear programming model; multichannel wireless mesh networks; network cost reduction; network interface cards; suboptimal solutions; traffic demand constraints; Bandwidth; Heuristic algorithms; Interference; Joints; Logic gates; Optimization; Wireless communication; Channel Assignment; Interface Placement; Iterated Local Search; Mixed Integer Linear Programming; Wireless Mesh Networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing with Applications (ISPA), 2012 IEEE 10th International Symposium on
  • Conference_Location
    Leganes
  • Print_ISBN
    978-1-4673-1631-6
  • Type

    conf

  • DOI
    10.1109/ISPA.2012.58
  • Filename
    6280318