A Cluster Head Selection Algorithms in Wireless Network Based on Maximal Weighted Independent Set

This paper presents a cluster head selection algorithm in wireless network, which is based on an optimal algorithm to find a maximum weighted independent set (MWIS) in planar graph. It is analysed that the wireless AD hoc networks and the application of the maximum weighted independent set. To prove the validity and practicability of MWIS, we compare MWIS algorithm with minimum ID clustering algorithm and maximum degree clustering algorithm by using a topological subgraph.