Probabilistic Coverage and Connectivity
being be updated .... for now see http://nsl.cs.sfu.ca/projects/wsn/
In this project, we consider probabilistic sensing and radio communication models in designing protocols for large-scale sensor networks. Probabilistic models are more realistic in capturing the characteristics of actual sensors than the over-simplified regular disk model.
We first develop a probabilistic coverage protocol that employs probabilistic sensing models. It is expected that different sensor types will require different sensing models. Designing, implementing, and testing a different coverage protocol for each sensing model is indeed an extremely costly process. We designed our protocol with limited dependence on the sensing model: Our protocol requires the computation of a single parameter from the adopted sensing model, while everything else remains the same. We showed how this parameter can be derived in general, and we did the calculations for two common sensing models. Our simulations showed that our protocol outperforms all other protocols in the literature in several aspects, including the number of activated sensors and total energy consumed.
People
- Hossein Ahmadi (M.Sc., Graduated Summer 2007)
Publications
- M. Hefeeda, H. Ahmadi, A Probabilistic Coverage Protocol for Wireless Sensor Networks, In Proc. of IEEE International Conference on Network Protocols (ICNP'07), Beijing, China, October 2007. (Acceptance: 15%)
- M. Hefeeda, H. Ahmadi, Network Connectivity under Probabilistic Communication Models in Wireless Sensor Networks, In Proc. of IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS'07), Pisa, Italy, October 2007. (Acceptance: 25%)
Software
- Implementation of the Probabilistic Coverage Protocol (PCP) in NS-2. [readme] [code]
- Implementation of the Probabilistic Coverage Protocol (PCP) in C++. [readme] [code]
