Skip to main content

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 219))

  • 912 Accesses

Abstract

A distributed algorithm based on sensing region pixels (ABSRP) is discussed aiming at the problems of low efficiency to find redundant nodes in wireless sensor network (WSN). To find the redundant nodes, node sensing region is converted into a series of pixels. Comparative experiments to existing algorithm show that this algorithm will affect the initial cover set slightly, and the redundant nodes can be selected out effectively.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

References

  1. Antoine G, Jean C, David S-R et.al (2008) Localized sensor area coverage with low communication overhead. IEEE Transaction mobile computing 7(5):661–672

    Google Scholar 

  2. Mainwaring A, Culler D, Polastre J, Szewczyk R, Anderson J (2002) Wireless sensor networks for habitat monitoring. In: Proceedings of international workshop on wireless sensor networks and applications, ACM vol 11/2, pp 88–97

    Google Scholar 

  3. Hai L, Wan P, Yi C-W, Xiaohua J, Makki S, Pissinou N (2005) Maximal lifetime scheduling in sensor surveillance networks.In: Proceedings of INFOCOM 05 4(3):2482–2491

    Google Scholar 

  4. Goldsmith A, Wicker S (2002) Design challenges for energy-constrained ad hoc wireless networks. Wirel Commun IEEE 9(4):8–27

    Google Scholar 

  5. Thai MT, Wang F, Du H, Jia X (2008) Coverage problems in wireless sensor networks: designs and analysis. Int J Sens Netw 3(3):191–200

    Google Scholar 

  6. Tian D, Georganas ND (2002) A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of ACM Workshop on wireless sensor networks and applications, vol 8/3. ACM Press, New York, pp 124–128

    Google Scholar 

  7. Yang T, YF Lin, H-C Huang (2011) Research on coverage optimization algorithm in WSN. Comput Eng 37(1):119–121

    Google Scholar 

  8. Huang C-F, Tseng Y-C (2004) A survey of solutions to the coverage problems in wireless sensor networks. J Int Technol Special Issue Wirel Ad Hoc Sens Netw 12(3):2356–2359

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gang Hong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this paper

Cite this paper

Hong, G., Pan, Xq. (2013). Research on Minimum Coverage Algorithm in Wiriness Sensor Network. In: Zhong, Z. (eds) Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012. Lecture Notes in Electrical Engineering, vol 219. Springer, London. https://doi.org/10.1007/978-1-4471-4853-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4853-1_13

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4852-4

  • Online ISBN: 978-1-4471-4853-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics