Skip to main content
Springer Nature Link
Log in

Directional Sensor Placement with Optimal Sensing Range, Field of View and Orientation

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper introduces a new wireless sensor network planning problem referred to as the Optimal Sensor Configuration (OSC) problem. In this problem, the goal is to find an optimal subset of locations where directional sensors and base stations are installed in order to minimize the total network cost while satisfying the requirements of coverage and connectivity. This goal is achieved by appropriately choosing the base station type and configuring each sensor to be installed in the sensor field. The optimal configuration of each sensor is determined by three parameters which are sensing range, field of view and orientation. The paper also gives an integer linear programming formulation of the OSC problem. The viability and effectiveness of the proposed formulation are illustrated through numerical results.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Soro S, Heinzelman WB (2005) On the coverage problem in video-based wireless sensor networks. In: Proc. international conference on broadband networks. IEEE, pp 932–939

  2. Adriaens J, Megerian S, Potkonjak M (2006) Optimal worst-case coverage of directional field-of-view sensor networks. In: Proc. international conference on sensor and ad hoc communications and networks. IEEE, pp 336–345

  3. Ai J, Abouzeid AA (2006) Coverage by directional sensors in randomly deployed wireless sensor networks. J Comb Optim 11(1):21–41

    Article  MATH  MathSciNet  Google Scholar 

  4. Chvatál V (1975) A combinatorial theorem in plane geometry. J Comb Theory Ser B 18:39–41

    Article  MATH  Google Scholar 

  5. Fisk S (1975) A short proof of Chavtál’s watchman theorem. J Comb Theory Ser B 24:374

    Article  MathSciNet  Google Scholar 

  6. Marengonia M, Draperb BA, Hansona A, Sitaramana R (2000) A system to place observers on a polyhedral terrain in polynomial time. J Image Vis Comput 18:773–780

    Article  Google Scholar 

  7. Horster E, Lienhart R (2006) Approximating optimal visual sensor placement. In: Proc. international conference on multimedia and expo. IEEE, pp 1257–1260

  8. Horster E, Lienhart R (2006) On the optimal placement of multiple visual sensors. In: Proc. international workshop on video surveillance and sensor networks. ACM, New York, pp 111–120

    Chapter  Google Scholar 

  9. Zhao J, Cheung S-CS (2007) Multi-camera surveillance with visual tagging and generic camera placement. In: Proc. international conference on distributed smart cameras. ACM/IEEE, New York, pp 259–266

    Chapter  Google Scholar 

  10. Chakrabarty K, Sitharama S, Qi H, Cho E (2002) Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans Comput 51(12):1448–1453

    Article  MathSciNet  Google Scholar 

  11. Sahni S, Xu X (2005) Algorithms for wireless sensor networks. In: International journal of distributed sensor networks, vol 1, no 1. Taylor and Francis, London, pp 35–56

    Google Scholar 

  12. Wang J, Zhong N (2006) Efficient point coverage in wireless sensor networks. J Comb Optim 11(3):291–304

    Article  MATH  MathSciNet  Google Scholar 

  13. Berkelaar M, Notebaert P, Eikland K, Solve LP (2005) Linear programming code, ver 5.5. Eindhoven University of Technology, The Netherlands

    Google Scholar 

  14. Xu X, Sahni S (2007,) Approximation algorithms for sensor deployment. IEEE Trans Comput 56(12):1681–1695

    Article  MathSciNet  Google Scholar 

  15. Han X, Cao X, Lloyd EL, Shen C-C (2008) Deploying directional sensor networks with guaranteed connectivity and coverage. In: Proc. sensor, mesh and ad hoc communications and networks. IEEE, pp 153–160

  16. Cheng W, Li S, Liao X, Changxiang S, Chen H (2007) Maximal coverage scheduling in randomly deployed directional sensor networks. In: Proc. international conference on parallel processing workshops. IEEE, pp 68–73

  17. Cai Y, Lou W, Li M, Li X-Y (2007) Target-oriented scheduling in directional sensor networks. In: Proc. international conference on computer communications. IEEE, Piscataway, pp 1550–1558

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, K1S 5B6, Canada

    Yahya Esmail Osais, Marc St-Hilaire & Fei R. Yu

Authors
  1. Yahya Esmail Osais
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Marc St-Hilaire
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Fei R. Yu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yahya Esmail Osais.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Osais, Y.E., St-Hilaire, M. & Yu, F.R. Directional Sensor Placement with Optimal Sensing Range, Field of View and Orientation. Mobile Netw Appl 15, 216–225 (2010). https://doi.org/10.1007/s11036-009-0179-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-009-0179-0

Keywords