Issues of Topology control (TC) have captured more attentions in Wireless Sensor Networks (WSN). While WSN applications are normally optimized by the underlying network topology. Now a day’s WSNs is one of the most interesting areas of research and are universally being used and deployed or implements to monitor the surrounding physical environments. A number of approaches have been invested in wireless sensor networking, such as topology directed routing, sensor coverage based TC and network connectivity based TC. Many schemes have proved to be able to provide a better network monitoring and communication performance with prolonged system lifetime. In this survey paper, it provides a view of the studies in the area of WSN with different topology issues. By summarizing previous achievements and analyzing existed problems, we provide some idea within this field and also point out some research direction for the future.

Clustering in Mobile Ad-hoc Networks (MANETs) has become a crucial research issue in modern days, because clustering can improve system performance of MANETs. As MANETs have limited battery power supply, cluster formation is costly in terms of power depletion of nodes in the cluster. This is due to the huge amount of messages transmission required during cluster formation and further data transfer. In this paper, an extensive literature survey of MANET clustering algorithm was done and lastly we proposed an algorithm for cluster head selection and cluster maintenance. The proposed algorithm uses self-organizing principle for binding a node with a cluster, which can reduce the explicit message passing in cluster maintenance. Thus, there is no need of extra message passing during further cluster maintenance. Unlike most usual methods, a cluster head in our proposed algorithm acts only as an identifying tag for cluster entity, further it performs as a typical node when it is acting as head. It does not perform any cluster maintenance function or hierarchical routing and hence is not a bottleneck to the functioning of the cluster.

Now a day’s, it has been a great idea of research on using Wireless Sensor Networks (WSNs) to assist in the initial deployment of sensor nodes. Hole problem in WSNs is the most fundamental Problem in WSNs. Hole means a communication gap in WSNs. Finding an optimal sensor deployment strategy that would minimize the cost, reduce the node failure and also reduce the communication overhead. Then it provides a maximum degree of area coverage with lower cost of deployment of sensor nodes, best possible communication and maintaining the network connectivity. However, it increases the quality of service in WSNs that is extremely challenging. In this article, we present various types of holes, a comparative study of various types of holes and various types of coverage holes. At the end, we proposed an Algorithm to detect hole. In this paper, we aim to give the solution of hole problems of area coverage in WSNs.