Sensor Assignment In Virtual Environments Using Constraint Programming
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).
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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