Skip to main content
SpringerLink
Log in

Node Placement Optimization

  • Chapter
  • First Online:
Coverage Control in Sensor Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

In the point coverage problem, the subject to be covered is a set of discrete space points. These points can be some particular space points to represent the sensor field (e.g., the vertices of a grid) or are used to model some physical targets in the sensor field (e.g., the missile launchers in a battlefield). In order to cover these points, sensor nodes can be deterministically placed or randomly deployed in the sensor field. In a random network deployment, it is possible that some nodes cannot cover even a single target point. On the other hand, if the sensor field is friendly reachable and the network size is not too large, deterministic node placement is to place the nodes only at the desired locations so that each sensor node can cover at least one target. The objective of a deterministic node placement can be summarized as to answer the following question:

Where are the optimal locations (among the available locations) to place sensor nodes so that the number of nodes (or the network cost) can be minimized and the point coverage requirements can be satisfied?

The problem of placing the least number of sensors to cover all target points is a variant of the canonical set-covering problem and is discussed in the first part of this chapter. The second part of this chapter introduces some variants of the optimal node placement problem with different coverage requirements.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altinel, K., Aras, N., Güney, E., Ersoy, C.: Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Computer Networks (Elsevier) 52(12), 2419–2431 (2008)

    Article  MATH  Google Scholar 

  2. Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers 51(12), 1448–1453 (2002)

    Article  MathSciNet  Google Scholar 

  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd Edition. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  4. Dhillon, S.S., Chakrabarty, K.: Sensor placement for effective coverage and surveillance in distributed sensor networks. In: IEEE Wireless Communications and Networking Conference (WCNC), pp. 1609–1614 (2003)

    Google Scholar 

  5. Dhillon, S.S., Chakrabarty, K., Iyengar, S.: Sensor placement for grid coverage under imprecise detections. In: IEEE International Conference on Information Fusion, pp. 1581–1587 (2002)

    Google Scholar 

  6. Fang, Z., Wang, J.: Convex combination approximation for the min-cost WSN point coverage problem. In: The 3rd International Conference on Wireless Algorithms, Systems, and Applications (WASA), also in LNCS, vol. 5258, pp. 188–199 (2008)

    Google Scholar 

  7. Hörster, E., Lienhart, R.: On the optimal placement of multiple visual sensors. In: ACM the 4th International Workshop on Video Surveillance and Sensor Networks (VSSN), pp. 111–120 (2006)

    Google Scholar 

  8. ILOG Inc., I.: Using the CPLEX callable library. http://cplex.ilog.com (2009)

  9. Ke, W.C., Liu, B.H., Tsai, M.J.: Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is NP-complete. IEEE Transactions on Computers 56(5), 710–715 (2007)

    Article  MathSciNet  Google Scholar 

  10. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  11. Lin, F.Y.S., Chiu, P.L.: Energy-efficient sensor network design subject to complete coverage and discrimination constraints. In: IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON) (2005)

    Google Scholar 

  12. Lin, F.Y.S., Chiu, P.L.: A near-optimal sensor placement algorithm to achieve complete coverage-discrimination in sensor networks. IEEE Communications Letters 9(1), 43–45 (2005)

    Google Scholar 

  13. Lin, F.Y.S., Chiu, P.L.: A simulated annealing algorithm for energy-efficient sensor network design. In: International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pp. 183–189 (2005)

    Google Scholar 

  14. Patel, M., Chandrasekaran, R., Venkatesan, S.: Energy efficient sensor, relay and base station placements for coverage, connectivity and routing. In: IEEE International Performance, Computing and Communications Conference (IPCCC), pp. 581–586 (2005)

    Google Scholar 

  15. Sen, A., Das, N., Zhou, L., Shen, B.H., Murthy, S., Bhattacharya, P.: Coverage problem for sensors embedded in temperature sensitive environments. In: IEEE the 4th Annual Communications Society on Sensor and Ad Hoc Communications and Networks (SECON), pp. 1–10 (2007)

    Google Scholar 

  16. Seo, J.H., Kim, Y.H., Ryou, H.B., Cha, S.H., Jo, M.: Optimal sensor deployment for wireless surveillance sensor networks by a hybrid steady-state genetic algorithm. IEICE Transactions on Communications E91-B, 3534–3543 (2008)

    Article  Google Scholar 

  17. Stolkin, R., Florescu, I.: Probability of detection and optimal sensor placement for threshold based detection systems. IEEE Sensor Journal 9(1), 57–60 (2009)

    Article  Google Scholar 

  18. Stolkin, R., Vickers, L., Nickerson, J.V.: Using environment models to optimize sensor placement. IEEE Sensor Journal 7(3), 319–320 (2007)

    Article  Google Scholar 

  19. Wang, B.: Sensor placement for complete information coverage in distributed sensor networks. Journal of Circuits, Systems, and Computers (World Scientific) 17(4), 627–636 (2008)

    Article  Google Scholar 

  20. Wang, J., Zhong, N.: Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization 11(3), 291–304 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  21. Wu, Q., Rao, N.S., Du, X., Iyengar, S.S., Vaishnavi, V.K.: On efficient deployment of sensor on planar grid. Computer Communications (Elsevier) 30(14–15), 2721–2734 (2007)

    Article  Google Scholar 

  22. Xu, X., Sahni, S.: Approximation algorithms for sensor deployment. IEEE Transactions on Computers 56(12), 1681–1695 (2007)

    Article  MathSciNet  Google Scholar 

  23. Xu, Y., Yao, X.: A GA approach to the optimal placement of sensors in wireless sensor networks with obstacles and preferences. In: IEEE 3rd Consumer Communications and Networking Conference (CCNC), pp. 127–131 (2006)

    Google Scholar 

  24. Zhang, J., Yan, T., Son, S.H.: Deployment strategies for differentiated detection in wireless sensor networks. In: IEEE the 3rd Communications Society on Sensor and Ad Hoc Communications and Networks (SECON), pp. 316–325 (2006)

    Google Scholar 

  25. Zhao, C., Yu, Z., Chen, P.: Optimal deployment of nodes based on genetic algorithm in heterogeneous sensor networks. In: IEEE International Conference on Wireless Communications, Networking and Mobile Computing (WiCom), pp. 2743–2746 (2007)

    Google Scholar 

  26. Zou, Y., Chakrabarty, K.: Uncertainty-aware and coverage-oriented deployment for sensor networks. Journal of Parallel and Distributed Computing 64(7), 788–798 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Intelligent Systems Centre, Nanyang Technological University, 50 Nanyang Drive Research Techno Plaza, Level 7, Singapore, 637553, Singapore

    Dr. Bang Wang

Authors
  1. Dr. Bang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bang Wang .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London

About this chapter

Cite this chapter

Wang, B. (2010). Node Placement Optimization. In: Coverage Control in Sensor Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84996-059-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-84996-059-5_4

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84996-058-8

  • Online ISBN: 978-1-84996-059-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation