Redundancy Elimination with Coverage Preserving algorithm in Wireless Sensor Network

Shobha Biradar, P M Mallikarjuna Shastry

Abstract


In Wireless Sensor Network, the sensor nodes are deployed using random or deterministic deployment methods. Many applications prefer random deployment for deploying the sensor nodes. Random deployment is the main cause of redundancy. Detection and elimination of redundant sensor nodes while preserving coverage is very important issue after the sensor nodes are deployed randomly in the region of interest. The redundancy elimination with coverage preserving algorithm is proposed in this paper and the results are presented. The proposed algorithm determines redundant sensor nodes and also the sensor nodes which provide the least coverage of region of interest. If two sensor nodes cover same area or if the Euclidian distance between two nodes is less than 25% of sensing range of a sensor node, the sensor which is not located at optimal position will be deactivated, so that, it reduces the number of optimal nodes required to cover complete region of interest. This in turn increases the lifetime of the network. The simulation results illustrate that the proposed algorithm preserves 100% coverage or region of interest by removing redundant nodes and also the nodes which provide the least coverage of region of interest. It also reduces the number of optimal nodes required to provide 100% coverage of region of interest.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


International Journal of Communication Networks and Information Security (IJCNIS)          ISSN: 2076-0930 (Print)           ISSN: 2073-607X (Online)