Sensor Assignment In Virtual Environments Using Constraint Programming

  • Diego Pizzocaro
  • Stuart Chalmers
  • Alun Preece
Conference paper

Abstract

This paper describes a method for assignment and deployment of sensors in a virtual environment using constraint programming. We extend an existing model (multiple knapsack problem) to implement this assignment and placement, according to a given set of requirements (modelled as a utility extension).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. [1]
    Diane J. Cook, Piotr Gmytrasiewicz, and Lawrence B. Holder. Decision-theoretic cooperative sensor planning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(10):1013–1023, 1996.Google Scholar
  2. [2]
    J. Lu, L. Bao, and T. Suda. Coverage-aware sensor engagement in dense sensor networks. Journal of Embedded Computing (JEC), Special Issue on Embedded System Optimization, 2007.Google Scholar
  3. [3]
    H. Rowaihy, S. Eswaran, P. Johnson, T. Brown, A. Barnoy, and T. F. La Porta D. Verma. A survey of sensor selection schemes in wireless sensor networks. In SPIE Unattended Ground, Sea, and Air Sensor Technologies and Applications IX, Orlando, FL, 2007.Google Scholar
  4. [4]
    Kuei-Ping Shih, Yen-Da Chen, Chun-Wei Chiang, and Bo-Jun Liu. A distributed active sensor selection scheme for wireless sensor networks. In ISCC ’06: Proceedings of the 11th IEEE Symposium on Computers and Communications, pages 923–928, Washington, DC, USA, 2006. IEEE Computer Society.Google Scholar

Copyright information

© Springer-Verlag London Limited 2008

Authors and Affiliations

  • Diego Pizzocaro
    • 1
  • Stuart Chalmers
    • 1
  • Alun Preece
    • 1
  1. 1.University of Aberdeen Computing ScienceUK

Personalised recommendations