Skip to main content

Introduction to Distributed Sensor Networks

  • Chapter
  • First Online:
Mathematical Theories of Distributed Sensor Networks

Abstract

Currently, detection and tracking systems use a large number of different types of sensors. Because of the relatively low cost of sensors, many duplicate sensors of the same type are used to insure increased fault tolerance. The common practice is to assign each sensor of sensor cluster to handle on specific task. For example, while tracking multiple target, one sensor cluster is assigned to track one target only and any information it may collect about other targets is not utilized.

Some portion of this chapter has been reprinted with permission from “Distributed Sensor Networks-Introduction to the Special Section,” Iyengar et al. [1]

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For every pair of points \(X,Y\in \mathbb {R}^3\), \(\overline{XY}\) denotes the line segment connecting \(X\) and \(Y\).

  2. 2.

    Euclidean distance between points \(X\in \mathcal {S}\) and \(Y\in \mathcal {S}\) is denoted by \(||X-Y||\) and defined as the length of line segment \(\overline{XY}\): \(||X-Y||=|\overline{XY}|\).

  3. 3.

    Line segment \(\overline{AB}^{\perp }\) is perpendicular bisecting line segment of \(\overline{AB}\), if and only if \(\overline{AB}^{\perp } \perp \overline{AB}\), \(\overline{AB}\) bisects \(\overline{AB}^{\perp }\), and \(\overline{AB}^{\perp }\) bisects \(\overline{AB}\).

  4. 4.

    The maximum Euclidean distance between the sensor location and the target which is sensed by the sensor.

  5. 5.

    The maximum Euclidean distance between two adjacent sensor nodes.

References

  1. S.S. Iyengar, R.L. Kashyap, R.N. Madan, Distributed sensor networks-introduction to the special section, IEEE Trans. Syst. Man Cybern. 21(5), (1991)

    Google Scholar 

  2. R.R. Brooks, S.S. Iyengar, Multi-sensor fusion: fundamentals and applications with software. (Prentice Hall PTR, 1998)

    Google Scholar 

  3. R.F. Sprouil, D. Cohen, High level protocols in Proceedings of IEEE, special issue on packet communication networks, Nov 1978

    Google Scholar 

  4. D.B. Reid, An algorithm for tracking multiple targets, IEEE Trans. Autom. Contr. AC-24 (1979)

    Google Scholar 

  5. S. Mori, C.Y. Chong, R.P. Wishner, E. Tse, Multi-target multi-sensor tracing problems: a general bayesian approach, in Proceedings of American Control Conference. (San Francisco, CA, 1983)

    Google Scholar 

  6. C.Y. Chong, S. Mori, Hierarchical multi-target tracking and classification—a Baysian approach, in Proceedings of American Control Conference. (San Diego, CA, 1984)

    Google Scholar 

  7. C.Y. Chong, E. Tse, S. Mori, Distributed estimation in networks, in Proceedings of American Control Conference. (San Francisco, CA, 1983)

    Google Scholar 

  8. C.Y. Chong, et al., Distributed hypothesis testing in distributed sensor networks, Artificial Intelligence & DS, Tech. Rep TP-1048-02, July 1984

    Google Scholar 

  9. J. O’Rourke, Art gallery theorems and algorithms. (Oxford University Press, 1987)

    Google Scholar 

  10. E.H. Callaway, Wireless Sensor Networks: Architectures and Protocols. (Auerbach Publications, New York, 2003)

    Google Scholar 

  11. H. Karl, A. Willig, Protocols and Architectures for Wireless Sensor Networks. (Wiley, New York, 2005)

    Google Scholar 

  12. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey. Comput. Netw. 38, 393–422 (2002)

    Google Scholar 

  13. A. Rahman, A. El Saddik, W. Gueaieb, Wireless Sensor Network Transport Layer: State of the Art, vol. 21, Sensors, Lecture Notes in Electrical Engineering. (Springer, Berlin, 2008), pp. 221–245

    Google Scholar 

  14. S. Kumar, T.H. Lai, and A. Arora, Barrier coverage with wireless sensor networks, in Proceedings of the 11th Annual International Conference on Mobile Computing and Networking. (Cologne, Germany, 2005), pp. 284–298

    Google Scholar 

  15. D.W. Gage, Command control for many-robot systems in Proceedings of Nineteenth Annual AUVS Technical Symposium, 1992, pp. 22–24

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sitharama S. Iyengar .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Iyengar, S.S., Boroojeni, K.G., Balakrishnan, N. (2014). Introduction to Distributed Sensor Networks. In: Mathematical Theories of Distributed Sensor Networks. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8420-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-8420-3_1

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-8419-7

  • Online ISBN: 978-1-4419-8420-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics