• Title of article

    Coverage and Connectivity Probabilities in WSN with Heterogeneous Capability Nodes

  • Author/Authors

    G.N. Purohit، نويسنده , , Seema Verma، نويسنده , , Megha Sharma، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2010
  • Pages
    8
  • From page
    28
  • To page
    35
  • 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, aftercollecting information from the environment, sensors need to transmit aggregated data to gateways or information collection nodes. It isimportant to ensure that every sensor can communicate with the gateways. This leads to the need for sufficient connectivity in addition tooptimal 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 thatboth the coverage and connectivity of the system are maintained. In particular, we are interested in maintaining connected WSNs that effectivelycover 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 steadystate
  • Keywords
    sensing nodes , heterogeneous , connectivity , Probability , coverage
  • Journal title
    International Journal of Advanced Research in Computer Science
  • Serial Year
    2010
  • Journal title
    International Journal of Advanced Research in Computer Science
  • Record number

    668365