R. H. Goudar

Cluster head selection by randomness with data recovery in WSN

Wireless sensor networks are potentially used in the field of surveillance and monitoring since last few years. In such applications, clustering play an important role in enhancement of the life span and scalability of the network. Each cluster contains a cluster head that controls the whole cluster working, in which various researcher focuses on the good selection of the cluster head that can improve the life of the WSN. Previous works on cluster head selection lacks in data recovery. In this paper we are proposing Cluster Head Selection by Randomness with Data Recovery in WSN (CHSRDR) method for selecting the cluster head inside the cluster with data recovery. The proposed method, CHSRDR, considers the heterogeneity in power and maintains a cluster of vice-heads on the basis of randomness inside the cluster; these vice-heads can work as a head in future, when the main head come to end of power. The headship circulates among the vice-heads of the cluster. We have simulated the method and got the enhancement in throughput.

Coverage lifetime improvement through efficient deployment of sensor nodes in WSN

One of the major issues in WSN is coverage lifetime due to the constraint of Battery power. Prolonging the network lifetime while covering the sufficient area is an important issue in WSN research. In a dense WSN the excessive use of sensors causes some problems such as congestion. Some researchers have applied the notion of extra nodes for connectivity purpose and develop the methodology that broadcast the status(on/off) information of sensor nodes to their one hop neighbors, but these approaches are able to increase the messaging and density of the WSN. In this paper we are providing an analytical method for increasing the lifetime of the WSN by maintaining the disjoint groups of sensors. An individual group can provide the whole area coverage at a time. So we can make only one group active at a time in WSN. The tessellation form after placing a group of sensor is regular rectangle. The analytical and simulation results show that we can increase the coverage lifetime by more than two times of the original lifetime.

Energy Aware Task Allocation with Unequal Clustering in WSN

Extending the lifetime of the wireless sensor network has been aimed by several research efforts. Distributed networks provide a viable solution to increase the lifetime of WSN. It does not assign the heavy task to a single node, which otherwise can result in the loss of connectivity, fast depletion of the battery of the single node and reallocation of the tasks. Task allocation in WSN play a major role in extending the lifetime. This paper propose a method(ETAUC) Energy aware task allocation with unequal clustering in WSN that provide the task allocation among clusters according to their strength of the battery, it helps in balancing the work in network and avoids the condition, in which some clusters finishes quickly and other clusters have plenty of battery power. The proposed method also circumlocutes the reassignment of the task; which has been partially completed by the finished cluster. The wireless sensor networks are deployed in the area of variant environmental features so we have also focused here on providing the relation between the temperature and the battery power of the sensor node. The simulation results shows that our proposed method increase the throughput 32.51%.