Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks

Authors:
Steffen Wolf;Peter Merz
Affiliations:
Distributed Algorithms Group, University of Kaiserslautern, Germany;Distributed Algorithms Group, University of Kaiserslautern, Germany
Venue:
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Year:
2009

Citing 10
Cited 1

Power consumption in packet radio networks

Theoretical Computer Science
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Symmetric Connectivity with Minimum Power Consumption in Radio Networks

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics

IEEE Transactions on Mobile Computing
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks

Computers and Operations Research
Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks

Wireless Networks
Power Assignment For Symmetric Communication InWireless Sensor Networks

ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Approximating Minimum-Power k-Connectivity

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Evolutionary local search for the minimum energy broadcast problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Evolutionary local search for designing peer-to-peer overlay topologies based on minimum routing cost spanning trees

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature

A Distributed Range Assignment Protocol

IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new iterated local search to solve this problem by combining filtering techniques with local search. The algorithm is benchmarked using instances with up to 1000 nodes, and results are compared to optimal or best known results as well as other heuristics. For these instances, the proposed algorithm is able to find optimal and near-optimal solutions and outperforms previous heuristics.