Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Proceedings of the 11th annual international conference on Mobile computing and networking
Long distance wireless mesh network planning: problem formulation and solution
Proceedings of the 16th international conference on World Wide Web
MOPSO: a proposal for multiple objective particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Managing Wireless Mesh Networks - Analysis and Proposals
WIMOB '07 Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Optimization models and methods for planning wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
The few studies carried out so far on planning Wireless Mesh Networks (WMNs) tend all to be monoobjective optimization models. We propose a different approach to address the planning of WMN problem that reflects as much as possible the real-life problem. Basically, an optimal (or rather a good and realistic) planning solution has to be simultaneously cheap (minimizing the deployment cost) and efficient (maximizing the throughput). To achieve this, we devise a novel generic multi-objective optimization model where the two objectives of network cost deployment and network throughput are simultaneously optimized under obvious network constraints. We then derive two instance models differing mainly in how the second objective is defined: maximizing the culmination of the flows over the entire network or minimizing the aggregation of network interferences. Obviously, a new network metric is proposed to handle this task. A comparative experimental study with different key-parameter settings on the two instance models is conducted to help network planner decide which planning optimization model to choose given their specific requirements and/or scenarios.