Deployment optimization of multi-hop wireless networks based on substitution graph

DOI10.1016/j.ins.2017.03.011zbMath1429.68192OpenAlexW2592094477MaRDI QIDQ2293167

Zhen Zhang, Yang Li, Zhu-Song Liu, Shu-qiang Huang, Yong-Hui Li

Publication date: 7 February 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2017.03.011

zbMATH Keywords

multi-hop wireless networksgateway deploymentmax-min hopsubstitution principlevertex k-centre

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Fractality of multiple colored substitution networks ⋮ Hybrid small cell base station deployment in heterogeneous cellular networks with wireless power transfer

Cites Work

• Approximate robust optimization for the connected facility location problem
• Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
• Solving mesh router nodes placement problem in wireless mesh networks by tabu search algorithm
• To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
• Network connectivity assessment and improvement through relay node deployment
• Optimization deployment of wireless sensor networks based on culture-ant colony algorithm
• Unit disk graph recognition is NP-hard
• Gateway selection and routing in wireless mesh networks
• Dynamic router node placement in wireless mesh networks: a PSO approach with constriction coefficient and its convergence analysis
• An adaptive variable neighborhood search for solving the multi-objective node placement problem
• On the Complexity of Some Common Geometric Location Problems
• On the computational complexity of centers locating in a graph

This page was built for publication: Deployment optimization of multi-hop wireless networks based on substitution graph