Area based Coverage for three Deployment distributions and their Connectivity in Wireless Sensor Networks

Abstract

Extensive use of wireless sensor networks for various applications like surveillance, habitat monitoring, battlefield etc., demand high probability of coverage and connectivity. The first issue deals with how well the sensor network will be able to detect the event by the sensor nodes and secondly, how efficiently the information will be communicated to the gateway node. In many applications, sensors are deployed randomly and their coverage and connectivity plays vital role in characterizing the network behavior. Modeling the randomly deployed sensor network needs heuristics, which is best studied by means of probability distributions. In this paper two algorithms i.e., grid and disc based for area based coverage are used using three deployment distributions and their performance is evaluated. Once full coverage is achieved, then ad hoc on-demand distance vector (AODV) associated clustering for grid based and ID based AODV for disc based connectivity algorithms are run on top of it to transfer the information to gateway node.