Solving Semantic Problems in Chaff and Winnowing Problem by Using Cryptography

In this paper, we use Genetic Algorithms to find the Minimum Dominating Set (MDS) of Unit Disk Graphs (UDG). UDGs are used for modelling Ad-Hoc networks and finding MDS in such graphs is a promising approach to clustering the wireless Ad-Hoc networks. The MDS problem is proved to be NP-complete. The simulation results show that the proposed algorithm outperforms the existing algorithms for finding MDS in terms of the DS size.