Cognitive Radio Oriented Wireless Networks. 11th International Conference, CROWNCOM 2016, Grenoble, France, May 30 - June 1, 2016, Proceedings

Research Article

Distributed Topology Control with SINR Based Interference for Multihop Wireless Networks

Download
211 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-40352-6_20,
        author={Maryam Riaz and Seiamak Vahid and Klaus Moessner},
        title={Distributed Topology Control with SINR Based Interference for Multihop Wireless Networks},
        proceedings={Cognitive Radio Oriented Wireless Networks. 11th International Conference, CROWNCOM 2016, Grenoble, France, May 30 - June 1, 2016, Proceedings},
        proceedings_a={CROWNCOM},
        year={2016},
        month={6},
        keywords={Topology control Scheduling SINR Approximation Distributed},
        doi={10.1007/978-3-319-40352-6_20}
    }
    
  • Maryam Riaz
    Seiamak Vahid
    Klaus Moessner
    Year: 2016
    Distributed Topology Control with SINR Based Interference for Multihop Wireless Networks
    CROWNCOM
    Springer
    DOI: 10.1007/978-3-319-40352-6_20
Maryam Riaz1,*, Seiamak Vahid1, Klaus Moessner1
  • 1: University of Surrey
*Contact email: m.riaz@surrey.ac.uk

Abstract

In this paper, a distributed approach to topology control (TC) is proposed where the network topology is established considering interference and routing constraints. This optimization problem however involves link scheduling and power assignment under SINR constraint, which is an NP hard problem. Opting for heuristics rather than exact approach, the proposed algorithms in the literature, either cannot guarantee the quality of the solution, or approximate the interference (protocol interference model) rather than using realistic SINR models. There is also lack of distributed exact/approximation approaches which can reduce complexity and provide practical solutions. Here, we propose a distributed approximation algorithm using column generation (CG) with knapsack transformation on the SINR constraint. Particle Swarm Optimization (PSO) is integrated with CG, to provide robust initial feasible patterns. The results show that, DCG-PSO with knapsack transformation increase the solvable instances three fold in terms of number of nodes, in comparison to the state-of-art approaches. The links are scheduled with less power, shorter scheduling lengths and reduces the computation time at lower penalty cost.