research-article

Quality of monitoring of stochastic events by periodic and proportional-share scheduling of sensor coverage

Authors:

David K. Y. Yau,

Chris Y. T. Ma,

Nageswara S. V. Rao,

Mallikarjun ShankarAuthors Info & Claims

ACM Transactions on Sensor Networks (TOSN), Volume 7, Issue 2

Article No.: 18, Pages 1 - 49

https://doi.org/10.1145/1824766.1824774

Published: 08 September 2010 Publication History

Abstract

We analyze the quality of monitoring (QoM) of stochastic events by a periodic sensor which monitors a point of interest (PoI) for q time every p time. We show how the amount of information captured at a PoI is affected by the proportion q/p, the time interval p over which the proportion is achieved, the event type in terms of its stochastic arrival dynamics and staying times and the utility function. The periodic PoI sensor schedule happens in two broad contexts. In the case of static sensors, a sensor monitoring a PoI may be periodically turned off to conserve energy, thereby extending the lifetime of the monitoring until the sensor can be recharged or replaced. In the case of mobile sensors, a sensor may move between the PoIs in a repeating visit schedule. In this case, the PoIs may vary in importance, and the scheduling objective is to distribute the sensor's coverage time in proportion to the importance levels of the PoIs. Based on our QoM analysis, we optimize a class of periodic mobile coverage schedules that can achieve such proportional sharing while maximizing the QoM of the total system.

References

[1]

Batalin, M. A., and Sukhatme, G. S. 2003. Multi-robot dynamic coverage of a planar bounded environment. Tech. rep. CRES-03-011, USC Viterbi.

[2]

Bisnik, N., Abouzeid, A., and Isler, V. 2006. Stochastic event capture using mobile sensors subject to a quality metric. In Proceedings of the International Conference on Mobile Computing and Networking (MobiCom). ACM, New York.

Digital Library

[3]

Brémaud, P. 1999. Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues. Springer-Verlag, Berlin.

[4]

Carlsson, S., Nilsson, B. J., and Ntafos, S. C. 1991. Optimum guard covers and mwatchmen routes for restricted polygons. In Proceedings of the Workshop on Algorithms and Data Structures.

[5]

Carlsson, S., Jonsson, H., and Nilsson, B. J. 1993. Finding the shortest watchman route in a simple polygon. In Proceedings of the International Symposium on Algorithms and Computation (ISAAC).

Digital Library

[6]

Cerny, V. 1985. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Optimiz. Theory Appl. 45, 1.

Digital Library

[7]

Chakraborty, S., Dong, Y., Yau, D. K. Y., and Lui, J. C. S. 2006. On the effectiveness of movement prediction to reduce energy consumption in wireless communication. IEEE Trans. Mobile Comput. 5, 2.

Digital Library

[8]

Cheng, W., Li, M., Liu, K., Liu, Y., Li, X., and Liao, X. 2008. Sweep coverage with mobile sensors. In Proceedings of the International Parallel and Distributed Processing Symposium (IEEE IPDPS). IEEE Computer Society Press, Los Alamitos, CA.

[9]

Cochran, E. 1960. New concepts of the learning curve. J. Indust. Eng. 11, 4, 317--327.

[10]

Costa, P., Frey, D., Migliavacca, M., and Mottola, L. 2006. Towards lightweight information dissemination in inter-vehicular networks. In Proceedings of the ACM International Workshop on Vehicular Internetworking (VANET).

Digital Library

[11]

Crovella, M. E., and Bestavros, A. 1996. Self-similarity in world wide web traffic evidence and possible causes. Trans Netw.

Digital Library

[12]

Dai, F., Wu, J., and Yang, S. 2007. Logarithmic store-carry-forward routing in mobile ad hoc networks. IEEE Trans. Parall. Distrib. Syst. 18, 6.

Digital Library

[13]

Efrat, A., Guibas, L. J., Har-Peled, S., Lin, D. C., Mitchell, J. S. B., and Murali, T. M. 2000. Sweeping simple polygons with a chain of guards. In Proceedings of the Symposium on Discrete Algorithms (SODA). ACM, New York.

Digital Library

[14]

Geman, S., and Geman, D. 1984. Stochastic relaxation, gibbs distributions, and the Bayesian restoration of images,. IEEE Trans. Pattern Anal. Mach. Intell. 6, 6, 721--741.

Digital Library

[15]

Gidas, B. 1985. Nonstationary markov chains and convergence of simulated annealing algorithm. J. Stat. Phys. 39, 1/2, 73--131.

[16]

Gribble, S. D., Manku, G. S., Roselli, D., Brewer, E., Gibson, T. J., and Miller, E. L. 1998. Self-similarity in file systems. In Proceedings of the ACM SIGMETRICS. ACM, New York.

Digital Library

[17]

Guibas, L., Latombe, J., LaValle, S., Lin, D., and Motwani, R. 1999. A visibility-based pursuit-evasion problem. Int. J. Computat. Geom. Appl.

[18]

Gupta, H., Das, S., and Gu, Q. 2003. Connected sensor cover: self organization of wireless sensor networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).

Digital Library

[19]

Gupta, V., Jeffcoat, D., and Murray, R. 2006. On sensor coverage by mobile sensors. In Proceedings of the IEEE Conference on Decision and Control. IEEE Computer Society Press, Los Alamitos, CA.

[20]

Hajek, B. 1988. Cooling schedules for optimal annealing. Math. Oper. Res. 13, 2, 311--329.

Digital Library

[21]

He, G., and Hou, J. C. 2005. Tracking targets with quality in wireless sensor networks. In Proceedings of IEEE Conference on Network Protocols (ICNP). IEEE Computer Society Press, Los Alamitos, CA.

Digital Library

[22]

He, T., Huang, C., Blum, B. M., Stankovic, J. A., and Abdelzaher, T. 2003. Range-free localization schemes for large scale sensor networks. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom). ACM, New York.

Digital Library

[23]

Holley, R., and Stroock, D. 1988. Simulated annealing via sobolev inequalities. Comm. Math. Phys. 115, 553--569.

[24]

Howard, A., Mataric, M., and Sukhatme, G. 2002. Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem. In Proceedings of the International Symposium on Distributed Autonomus Robotic Systems (DARS).

[25]

Hull, B., Bychkovsky, V., Zhang, Y., Chen, K., Goraczko, M., Miu, A. K., Shih, E., Balakrishnan, H., and Madden, S. 2006. Cartel: A distributed mobile sensor computing system. In Proceedings of ACM SenSys. ACM, New York.

Digital Library

[26]

Jeffay, K., Smith, F. D., Moorthy, A., and Anderson, J. 1998. Proportional share scheduling of operating system services for real-time applications. In Proceedings of the IEEE Real-Time System Symposium (RTSS). IEEE Computer Society Press, Los Alamitos, CA.

Digital Library

[27]

Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. 1983. Optimization by simulated annealing. Science, New Series 220, 4598, 671--680.

[28]

Parekh, A. K., and Gallager, R. G. 1993. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans Network. 1, 3.

Digital Library

[29]

Lapp, R. E., and Andrews, H. L. 1948. Nuclear Radiation Physics. Prentice-Hall. Englewood, Cliffs, NJ.

[30]

Lee, R. W., and Kulesz, J. J. 2006. A risk-based sensor placement methodology. Tech. rep., Computational Sciences and Engineering Division, ORNL.

[31]

Leland, W. E., Taqqu, M. S., Willinger, W., and Wilson, D. V. 1993. On the self-similar nature of ethernet traffic. In Proceedings of the ACM SIGCOMM.

Digital Library

[32]

Liu, B., Brass, P., Dousse, O., Nain, P., and Towsley, D. 2005. Mobility improves coverage of sensor networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, New York.

Digital Library

[33]

Meguerdichian, S., Koushanfar, F., Potkonjak, M., and Srivastava, M. B. 2001. Coverage problems in wireless ad-hoc sensor networks. In Proceedings of ACM/IEEE INFOCOM. IEEE Computer Society Press, Los Alamitos, CA.

[34]

Poduri, S. and Sukhatme, G. S. 2004. Constrained coverage for mobile sensor networks. In Proceedings of the IEEE Conference on Robotics and Automation (ICRA). IEEE Computer Society Press, Los Alamitos, CA.

[35]

Ross, S. M. 1996. Stochastic Processes. Wiley, New York.

[36]

Shah, R. C., Roy, S., Jain, S., and Brunette, W. 2003. Data mules: modeling a three-tier architecture for sparse sensor networks. Tech. rep. IRS-TR-03-001, Intel Research.

[37]

Sundaresan, A., Varshney, P. K., and Rao, N. S. V. 2007. Distributed detection of a nuclear radioactive source using fusion of correlated decisions. In Proceedings of the Conference on Information Fusion (Fusion).

[38]

Waldspurger, C. A., and Weihl, W. E. 1994. Lottery scheduling: Flexible proportional-share resource management. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI).

Digital Library

[39]

Wang, G., Cao, G., and Porta, T. L. 2004. Movement-assisted sensor deployment. In Proceedings of ACM/IEEE INFOCOM. IEEE Computer Society Press, Los Alamitos, CA.

[40]

Wang, W., Srinivasan, V., and Chua, K. C. 2005. Using mobile relays to prolong the lifetime of wireless sensor networks. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom). ACM, New York.

Digital Library

[41]

Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., and Gill, C. 2003. Integrated coverage and connectivity configuration in wireless sensor networks. In Proceedings of ACM SenSys. ACM, New York.

Digital Library

[42]

Zhang, H., and Hou, J. C. 2005. Maintaining sensing coverage and connectivity in large sensor networks. Wirel. Ad-hoc Sensor Netw. 1, 1--2.

[43]

Zhang, X., Kurose, J., Levine, B. N., Towsley, D., and Zhang, H. 2007. Study of a bus-based disruption-tolerant network. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom). ACM, New York.

Digital Library

[44]

Zhao, W., Ammar, M., and Zegura, E. 1994. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, New York.

Digital Library

[45]

Zou, Y. and Chakrabarty, K. 2003. Sensor deployment and target localization based on virtual forces. In Proceedings of ACM/IEEE INFOCOM. IEEE Computer Society Press, Los Alamitos, CA.

Cited By

Lin CSun YYang WLin CSun YYang W(2024)Novel Theory and Method in WRSNsWireless Rechargeable Sensor Networks for Internet of Things10.1007/978-981-97-9543-7_7(237-305)Online publication date: 7-Oct-2024
https://doi.org/10.1007/978-981-97-9543-7_7
Yao BGao HZhang YWang JLi J(2023)Maximum AoI Minimization for Target Monitoring in Battery-Free Wireless Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2022.316197522:8(4754-4772)Online publication date: 1-Aug-2023
https://doi.org/10.1109/TMC.2022.3161975
Sun YLin CDai HWang PWang LWu GZhang Q(2022)Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNsIEEE/ACM Transactions on Networking10.1109/TNET.2021.312213030:2(557-571)Online publication date: Apr-2022
https://doi.org/10.1109/TNET.2021.3122130
Show More Cited By

Index Terms

Quality of monitoring of stochastic events by periodic and proportional-share scheduling of sensor coverage

Recommendations

Quality of monitoring of stochastic events by periodic & proportional-share scheduling of sensor coverage
CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference

We analyze the quality of monitoring (QoM) of stochastic events by a periodic sensor which monitors a point of interest (PoI) for q time every p time. We show how the amount of information captured at a PoI is affected by the proportion q/p, the time ...
Coverage enhancement by using the mobility of mobile sensor nodes

Coverage is a fundamental problem in sensor networks. Sensor coverage, which reflects how well a sensor network is monitored by sensors, is an important measure for the quality of service (QoS) that a sensor network can provide. In mobile sensor ...
Sensor scheduling for p-percent coverage in wireless sensor networks

We study sensor scheduling problems of p-percent coverage in this paper and propose two scheduling algorithms to prolong network lifetime due to the fact that for some applications full coverage is not necessary and different subareas of the monitored ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Sensor Networks

ACM Transactions on Sensor Networks Volume 7, Issue 2

August 2010

297 pages

ISSN:1550-4859

EISSN:1550-4867

DOI:10.1145/1824766

Issue’s Table of Contents

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 08 September 2010

Accepted: 01 February 2010

Revised: 01 September 2009

Received: 01 January 2009

Published in TOSN Volume 7, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
514
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lin CSun YYang WLin CSun YYang W(2024)Novel Theory and Method in WRSNsWireless Rechargeable Sensor Networks for Internet of Things10.1007/978-981-97-9543-7_7(237-305)Online publication date: 7-Oct-2024
https://doi.org/10.1007/978-981-97-9543-7_7
Yao BGao HZhang YWang JLi J(2023)Maximum AoI Minimization for Target Monitoring in Battery-Free Wireless Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2022.316197522:8(4754-4772)Online publication date: 1-Aug-2023
https://doi.org/10.1109/TMC.2022.3161975
Sun YLin CDai HWang PWang LWu GZhang Q(2022)Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNsIEEE/ACM Transactions on Networking10.1109/TNET.2021.312213030:2(557-571)Online publication date: Apr-2022
https://doi.org/10.1109/TNET.2021.3122130
He SShi KLiu CGuo BChen JShi Z(2022)Collaborative Sensing in Internet of Things: A Comprehensive SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2022.318713824:3(1435-1474)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1109/COMST.2022.3187138
Fraternali FBalaji BAgarwal YGupta R(2020)ACESACM Transactions on Sensor Networks10.1145/340419116:4(1-31)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3404191
Dai HMa QWu XChen GYau DTang SLi XTian C(2020)CHASE: Charging and Scheduling Scheme for Stochastic Event Capture in Wireless Rechargeable Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2018.288738119:1(44-59)Online publication date: 1-Jan-2020
https://doi.org/10.1109/TMC.2018.2887381
Sun YLin CDai HLin QWang LWu G(2020)Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNs2020 IEEE 28th International Conference on Network Protocols (ICNP)10.1109/ICNP49622.2020.9259399(1-11)Online publication date: 13-Oct-2020
https://doi.org/10.1109/ICNP49622.2020.9259399
Zeng DGu LPan SGuo SZeng DGu LPan SGuo S(2019)Software Defined SensingSoftware Defined Systems10.1007/978-3-030-32942-6_2(17-35)Online publication date: 26-Nov-2019
https://doi.org/10.1007/978-3-030-32942-6_2
Gao XChen ZWu FChen G(2017)Energy Efficient Algorithms for $k$ -Sink Minimum Movement Target Coverage Problem in Mobile Sensor NetworkIEEE/ACM Transactions on Networking10.1109/TNET.2017.275692525:6(3616-3627)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1109/TNET.2017.2756925
Chen SGao ZNahrstedt K(2016)F.Live: Towards interactive live broadcast FTV experienceIEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications10.1109/INFOCOM.2016.7524618(1-9)Online publication date: Apr-2016
https://doi.org/10.1109/INFOCOM.2016.7524618
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents