ACM Home Page
Please provide us with feedback. Feedback
Stochastic event capture using mobile sensors subject to a quality metric
Full text PdfPdf (345 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 12th annual international conference on Mobile computing and networking table of contents
Los Angeles, CA, USA
SESSION: Sensor networks I table of contents
Pages: 98 - 109  
Year of Publication: 2006
ISBN:1-59593-286-0
Authors
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 106,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1161089.1161102
What is a DOI?

ABSTRACT

Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocity, mobility pattern, number of mobile sensors deployed and the dynamics of the phenomenon being sensed. The gains attained by mobile sensors over static sensors and the optimal motion strategies for mobile sensors are not well understood. In this paper we consider the problem of event capture using mobile sensors. The events of interest arrive at certain points in the sensor field and fade away according to arrival and departure time distributions. An event is said to be captured if it is sensed by one of the mobile sensors before it fades away. For this scenario we analyze how the quality of coverage scales with the velocity, path and number of mobile sensors. We characterize the cases where the deployment of mobile sensors has no advantage over static sensors and find the optimal velocity pattern that a mobile sensor should adopt.We also present algorithms for two motion planning problems: (i) for a single sensor, what is the minimum speed and sensor trajectory required to satisfy a bound on event loss probability and (ii) for sensors with fixed speed, what is the minimum number of sensors required to satisfy a bound on event loss probability. When events occur only along a line or a closed curve our algorithms return optimal velocity for the minimum velocity problem. For the minimum sensor problem, the number of sensors used is within a factor two of the optimal solution. For the case where the events occur at arbitrary points on a plane we present heuristic algorithms for the above motion planning problems and bound their performance with respect to the optimal. The results of this paper have wide range of applications in areas like surveillance, wildlife monitoring, hybrid sensor networks and under-water sensor networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
James San Jacinto Mountain Reserve. http://www.jamesreserve.edu.
 
2
I. F. Akyildiz, D. Pompili, and T. Melodia. Underwater acoustic sensor networks: research challenges. Ad Hoc Networks, 3(3):257--279, 2005.
 
3
M. Batalin, W. Kaiser, R. Pon, G. S. Sukhatme, G. Pottie, Y. Yu, J. Gordon, M. H. Rahimi, and D. Estrin. Task allocation for event-aware spatiotemporal sampling of environmental variables. In IROS, pages 1846--1853, 2005.
 
4
M. Batalin and G. S. Sukhatme. Sensor network-mediated multi-robot task allocation. In The Third International Naval Research Laboratory Multi-Robot Systems Workshop, pages 27--38, Mar 2005.
5
 
6
S. Bergbreiter and K. Pister. Cotsbots: An off-the-shelf platform for distributed robotics. In IROS, pages 1632--1637, 2003.
 
7
N. Bisnik, A. Abouzeid, and V. Isler. Event capture problem in mobile sensor networks. Technical Report, ECSE Dept., RPI. Available at http://www.ecse.rpi.edu/abouzeid/mobileCoverage.pdf.
8
 
9
 
10
11
 
12
R. G. Gallager. Discrete Stochastic Processes, chapter 3, pages 63--64. Kluwer Academic Publishers, first edition, 1995.
 
13
 
14
A. Howard, M. Mataric, and G. Sukhatme. Mobile sensor network deployment using potential fields: A distributed. In DARS, June 2002.
15
16
17
 
18
H. T. Kung and D. Vlah. Efficient location tracking using sensor networks. In WCNC, 2003.
 
19
 
20
S. M. LaValle. Planning Algorithms. Cambridge University Press (also available at http://msl.cs.uiuc.edu/planning/).
 
21
22
23
 
24
M. B. McMickell, B. Goodwine, and L. A. Montestruque. Micabot: a robotic platform for large-scale distributed robotics. In ICRA, pages 1600--1605, 2003.
 
25
 
26
S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In INFOCOM, pages 1380--1387, 2001.
27
28
 
29
S. Shakkottai, R. Srikant, and N. B. Shroff. Unreliable sensor grids: Coverage, connectivity and diameter. In INFOCOM, 2003.
 
30
G. T. Sibley, M. H. Rahimi, and G. S. Sukhatme. Robomote: A tiny mobile robot platform for large-scale ad-hoc sensor networks. In ICRA, pages 1143--1148, 2002.
31
32
33
 
34
G. Wang, G. Cao, and T. L. Porta. Movement-assisted sensor deployment. In INFOCOM, 2004.
35
36
 
37
H. Yang and B. Sikdar. A protocol for tracking mobile targets using sensor network. In WSNA, 2003.
 
38
 
39
Y. Zou and K. Chakrabarty. Sensor deployment and target localization based on virtual forces. In INFOCOM, 2003.


Collaborative Colleagues:
Nabhendra Bisnik: colleagues
Alhussein Abouzeid: colleagues
Volkan Isler: colleagues