In this paper we present an algorithm that allows a wireless sensor node to decide with reasonable error tolerance whether the node is within a region of interest or not. The algorithm requires a very limited amount of information exchange with neighboring nodes, making it very energy-efficient for resource-scarce sensor nodes. The sensitivity of event detection using this algorithm can be adjusted using a multiple-scale method. We show preliminary simulation results to demonstrate the effectiveness of the algorithms
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
Culler, D. E. and Srivastava, M. “Overview of sensor networks”, Computer, Vol. 37, no. 8, pp. 41- 48, 2004.
http:/ / ceng.usc.edu/ %7Eanrg/ SensorNetBib.html (SensorNetBib- an online wireless sensor networks bibliography)
Ding, M., Chen, D., Xing, K and Cheng, X. “Localized fault-tolerant event boundary detection in sensor networks” in IEEE INFOCOM, vol. 2, pp. 902 - 913, IEEE, March 13-17, 2005.
Duckham, M., Nittel, S. and Worboys, M. “Monitoring dynamic spatial fields using responsive geosensor networks” in Proceedings of the 13th ACM International Conference on Advanced in Geographic Information Systems (ACM-GIS05), pp. 51- 60, ACM Press, 2005.
Jin, G. and Nittel, S. “NED:An Efficient Noise-Tolerant Event and Event Boundary Detection Algorithm in Wireless Sensor Networks”, Proceedings of the 7th International Conference on Mobile Data Management, 2006.
Krishnamachari, B. and Iyengar, S. S. “Distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks”, IEEE Trans. Computers, vol. 53, no. 3, pp. 241- 250, 2004.
Nowak, R. and Mitra, U. “Boundary estimation in sensor networks: Theory and methods”, in 2nd International Workshop on Information Processing in Sensor Networks (IPSN) (Zhao, F. and Guibas, L.J., eds.), Vol. 2634, pp. 80- 95, Springer Lecture Notes in Computer Science, 2003.
Phani Kumar, A. V. U., Reddy, A. M. and Janakiram, D. “Distributed Collaboration for Event Detection in Wireless Sensor Networks”, MPAC ‘ 05, November 28-December 2, 2005. Grenoble , France
Madden, S., Franklin, M. J., Hellerstein, J. M. and Hong, W. “Tag: a tiny aggregation service for ad-hoc sensor networks”, SIGOPS Oper. Syst. Rev., vol. 36, no. SI, pp. 131- 146, 2002.
Gnawali, O., Greenstein,B., Jang, K-Y., Joki, A., Paek, J., Vieira, M., Estrin, D., Govindan, R., Kohler, E. ”The Tenet Architecture for Tiered Sensor Networks”, SenSys ‘ 06, November 2006.
Xue, W., Luo, Q., Chen, L. and Liu,Y. “Contour Map Matching for Event Detection in Sensor Networks”, Proceedings of SIGMOD 2006, Chicago, Illinois, USA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media B.V.
About this paper
Cite this paper
Easwaran, C.V. (2008). An Efficient In-Network Event Detection Algorithm for Wireless Sensor Nodes. In: Sobh, T., Elleithy, K., Mahmood, A., Karim, M.A. (eds) Novel Algorithms and Techniques In Telecommunications, Automation and Industrial Electronics. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8737-0_57
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8737-0_57
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8736-3
Online ISBN: 978-1-4020-8737-0
eBook Packages: EngineeringEngineering (R0)