Abstract
This paper targets the detection of the reach of events in sensor networks with faulty sensors. Typical applications include the detection of the transportation front line of a contamination and estimation of the region in forest fire. We propose an algorithm for detection the boundary of such events. Our algorithm is purely localized and thus is suitable for large scale of sensor networks. The computational overhead is low since the detection algorithm is based on a simple clustering technique which only simple numerical operations are involved. Simulation results show that our algorithm can clearly detect the event boundary when as many as 20% sensors become faulty. Therefore, our algorithm achieves a great improvement over the previous algorithms. In addition, our proposed detection algorithm can accept any kind of scalar values as inputs. It can be applied as long as the “events” can be modeled by numerical numbers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
10 emerging technologies that will change the world. Technology Review 106(1), 33–49 (February 2003)
Barnet, V., Lewis, T.: Outliers in Statistical Data. John Wiley and Sons. Inc., Chichester (1994)
Chen, D., Cheng, X., Ding, M.: Localized Event Detection in Sensor Networks (manuscript, 2004)
Ding, M., Chen, D., Xing, K., Cheng, X.: Localized Fault-Tolerant Event Boundary Detection in Sensor Networks. In: IEEE INFOCOM 2005 (2005)
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Heidemann, J.: System architecture directions for networked sensors. In: Proc. 9th International Conference on Architectural Suuport for Programming Languages and Operating Systems (November 2000)
Li, C.R., Liang, C.K.: A Localized Fault Detection Algorithm in Sensor Networks. In: IASTED International Conference on Wireless Sensor Networks WSN 2006, Canada (July 2006)
Li, D., Wong, K.D., Hu, Y.H., Sayeed, A.M.: Detection, Classification and Tracking of Targets. IEEE Signal Processing Magazine 19, 17–29 (2002)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a tiny aggregation service for ad-hoc sensor networks. In: OSDI (December 2002)
Marti, S., Giuli, T.J., Lai, K., Baker, M.: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In: ACM MOBICOM 2000, Boston, MA, August 2000, pp. 255–265 (2000)
Monma, C., Paterson, M., Suri, S., Yao, F.: Computing Euclidean maximum spanning trees. Algorithmica 5, 407–419 (1990)
Palpanas, T., Papadopoulos, D., Kalogeraki, V., Gunopulos, D.: Distributed Deviation Detection in Sensor Networks. SIGMOD Record 32(4), 77–82 (2003)
Staddon, J., Balfanz, D., Durfee, G.: Efficient Tracing of Failed Nodes in Sensor Networks. In: ACM WSNA 2002, Atlanta, GA, pp. 122–130 (September 2002)
Tanachaiwiwat, S., Dave, P., Bhindwale, R., Helmy, A.: Secure Locations: Routing on Trust and Isolating Compromised Sensors in Location-Aware Sensor Networks. In: ACM SenSys 2003, Los Angeles, California, pp. 324–325 (2003)
West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, CR., Liang, CK. (2008). A Fault-Tolerant Event Boundary Detection Algorithm in Sensor Networks. In: Vazão, T., Freire, M.M., Chong, I. (eds) Information Networking. Towards Ubiquitous Networking and Services. ICOIN 2007. Lecture Notes in Computer Science, vol 5200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89524-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-89524-4_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89523-7
Online ISBN: 978-3-540-89524-4
eBook Packages: Computer ScienceComputer Science (R0)