Network Optimization in WSN's

摘要

Recently wireless sensor network (WSN) is very popular for monitoring the remote or hostile environments. One major challenge in WSN is to build energy efficient network with total coverage & connectivity. The WSN consist of a large number of tiny nodes having sensing, computation & communication capability. The deployment of sensor nodes is the first step in establishing a sensor network. The large number of sensor nodes are deployed randomly & must be in the form of cluster, as a location of each particular node cannot be fully guaranteed a priori so that nodes must completely cover the target area. To build energy efficient network with the stochastically placed nodes, it is necessary to activate only vital number of nodes at any particular moment. In this paper we introduce a heuristic that will find out the mutually exclusive set called disjoint complete set of sensor nodes, where the member of each set together will completely cover the target area and work by turns. As the more number of sensor covers can be found the sensorsnetwork lifetime can be prolonged.