Coverage and Connectivity Probabilities in WSN with Heterogeneous Capability Nodes

Main Article Content

Megha Sharma
G.N. Purohit, Seema Verma

Abstract

A sensor network provides flexible communication network, which can be deployed rapidly over wide and/or inaccessible areas.
However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. In a WSN, after
collecting information from the environment, sensors need to transmit aggregated data to gateways or information collection nodes. It is
important to ensure that every sensor can communicate with the gateways. This leads to the need for sufficient connectivity in addition to
optimal coverage. In this paper we consider a heterogeneous sensor network that addresses the problem of coverage and connectivity together,
however, in the earlier studies the case of homogeneous sensors was considered. A combination of sensors of higher capabilities
(communicating, sensing) and lower capabilities gives better results compared to deployment of only homogeneous sensors. It is ensured that
both the coverage and connectivity of the system are maintained. In particular, we are interested in maintaining connected WSNs that effectively
cover the Region of Interest (R.O.I). Our sensors can be in alert or sleeping mode. We compute the probabilities for the sensor to stay in the off,
sense/receive, and transmit state ensuring coverage and connectivity in the network. We develop the Markov model and its solution for steady
state.

 

Keywords: sensing nodes; heterogeneous; coverage; connectivity; probability

Downloads

Download data is not yet available.

Article Details

Section
Articles