Probabilistic Coverage and Connectivity - Revision history

Aah10 at 00:15, 31 August 2010

2010-08-31T00:15:13Z

Mhefeeda at 07:39, 7 September 2009

2009-09-07T07:39:05Z

Mhefeeda at 07:38, 7 September 2009

2009-09-07T07:38:49Z

Mhefeeda at 18:13, 12 March 2008

2008-03-12T18:13:37Z

Mhefeeda at 18:13, 12 March 2008

2008-03-12T18:13:05Z

Mhefeeda at 18:11, 12 March 2008

2008-03-12T18:11:15Z

Mhefeeda at 00:20, 11 March 2008

2008-03-11T00:20:59Z

Mhefeeda at 23:09, 7 March 2008

2008-03-07T23:09:14Z

Mhefeeda at 16:23, 4 March 2008

2008-03-04T16:23:51Z

New page

being updated ...

@@ Line 17: / Line 17: @@
 == Publications ==
-* M. Hefeeda and H. Ahmadi, Energy-Efficient Protocol for Deterministic and Probabilistic Coverage in Sensor Networks, ''IEEE Transactions on Parallel and Distributed Systems'', Accepted June 2009.
+* M. Hefeeda and H. Ahmadi, [http://www.cs.sfu.ca/~mhefeeda/Papers/tpds10.pdf Energy-Efficient Protocol for Deterministic and Probabilistic Coverage in Sensor Networks], ''IEEE Transactions on Parallel and Distributed Systems'',  21(5), pp. 579--593, May 2010.
 * M. Hefeeda and H. Ahmadi, [http://www.cs.sfu.ca/~mhefeeda/Papers/ahswn09b.pdf An Integrated Protocol for Maintaining Connectivity and Coverage under Probabilistic Models for Wireless Sensor Networks], ''Ad Hoc & Sensor Wireless Networks'',  7(3-4), pp. 295--323, April 2009.

← Older revision		Revision as of 07:39, 7 September 2009
Line 31:		Line 31:

	* Implementation of the Probabilistic Coverage Protocol (PCP) in C++. [[http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim-README readme]] [[http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim.tar.gz code]]		* Implementation of the Probabilistic Coverage Protocol (PCP) in C++. [[http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim-README readme]] [[http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim.tar.gz code]]
−	~~<math>Insert LaTeX formula here</math>~~

@@ Line 1: / Line 1: @@
-Wireless sensor networks have been proposed for many applications such as forest fire detection, area surveillance, and natural habitat monitoring. A common ground for all such applications is that every sensor can detect an event occurring within its sensing range, and sensors collaborate in some way to
+Wireless sensor networks have been proposed for many applications such as forest fire detection, area surveillance, and natural habitat monitoring. A common ground for all such applications is that every sensor can detect an event occurring within its sensing range, and sensors collaborate in some way to deliver events, or information related to these events, to processing centers for possible actions.
 In many of the previous works, the sensing range is assumed to be a uniform disk of radius <math>r_s</math>. The disk model assumes that if an event happens at a distance less than or equal to rs from the sensor location, the sensor will deterministically detect this event. On the other hand, an event occurring at a distance <math> r_s + \epsilon (epsilon > 0)</math> can not be detected at all, even for very small <math>\epsilon</math> values. The disk sensing model is appealing, because it makes coverage maintenance protocols less complicated to design and analyze. However, it is unlikely that physical signals drop abruptly from high, full-strength values to zero, as the disk model assumes. This implies that there might be a chance to detect an event occurring at distances greater than rs.
 By ignoring this extra sensing capacity, the disk model may not fully utilize the sensing capacity of sensors, which may lead to: (i) deploying more sensors than needed and thus incurring higher cost, (ii) activating redundant sensors which increases interference and wastes energy, and ultimately (iii) decreasing the lifetime of the sensor network.
@@ Line 14: / Line 13: @@
 * Hossein Ahmadi (M.Sc., Graduated Summer 2007)
 == Publications ==
 * M. Hefeeda, H. Ahmadi, [http://www.cs.sfu.ca/~mhefeeda/Papers/icnp07.pdf 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, [http://www.cs.sfu.ca/~mhefeeda/Papers/mass07.pdf 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 ==
@@ Line 26: / Line 31: @@
 * Implementation of the Probabilistic Coverage Protocol (PCP) in C++.  [[http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim-README readme]] [[http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim.tar.gz code]]

@@ Line 8: / Line 8: @@
 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.
 == People ==
@@ Line 15: / Line 14: @@
 * Hossein Ahmadi (M.Sc., Graduated Summer 2007)
 == Publications ==

@@ Line 25: / Line 25: @@
 == Software ==
-* Implementation of the Probabilistic Coverage Protocol (PCP) in NS-2.  [[projects/wsn/PCP-NS-README readme]] [[projects/wsn/pcp-ns.tar.gz code]]
+* Implementation of the Probabilistic Coverage Protocol (PCP) in NS-2.  [[http://nsl.cs.sfu.ca/projects/wsn/PCP-NS-README readme]] [[http://nsl.cs.sfu.ca/projects/wsn/pcp-ns.tar.gz code]]
-* Implementation of the Probabilistic Coverage Protocol (PCP) in C++.  [[projects/wsn/PCP-SenSim-README readme]] [[projects/wsn/PCP-SenSim.tar.gz code]]
+* Implementation of the Probabilistic Coverage Protocol (PCP) in C++.  [[http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim-README readme]] [[http://nsl.cs.sfu.ca/projects/wsn/PCP-SenSim.tar.gz code]]

← Older revision		Revision as of 00:20, 11 March 2008
Line 6:		Line 6:
	We first develop a probabilistic coverage protocol that employs probabilistic sensing models.		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.		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 ==
		+
		+	* [http://www.cs.sfu.ca/~mhefeeda/ Mohamed Hefeeda]
		+
		+	* 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]

← Older revision		Revision as of 23:09, 7 March 2008
Line 1:		Line 1:
−	being updated ...	+	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.