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.

Autorentext

Zuleyha A. Dagdeviren received the BSc in Comp. Eng. from Izmir Inst. of Tech. in 2010 and her MSc and PhD in Comp. Science from Ege University, Int'l Comp. Inst. in 2012 and 2017.Serdar Korukoglu received his BSc in Indust. Eng., MSc in Applied Statistics and PhD in Comp. Eng. from Ege University in 1978, 1980 and 1984, respectively.