Weighted Dominating Set Algorithms for Wireless Sensor Networks

Dominating set is one of the graph theoretical structures and has many important applications such as clustering intrusion detection and backbone formation in wireless sensor networks; placement of gateways in wireless mesh networks; summarizing multiple documents and selecting queries for information retrieval on the internet. Finding the minimum weighted connected dominating set is an NP-Hard problem. Hence approximation algorithms and meta-heuristic algorithms can give effective results in polynomial time. In this book different meta-heuristic algorithms are studied for the minimum weighted connected dominating set problem.