Sciweavers

184 search results - page 13 / 37
» Restricted Strip Covering and the Sensor Cover Problem
Sort
View
CCCG
2007
13 years 9 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
TPDS
2008
161views more  TPDS 2008»
13 years 7 months ago
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...
You-Chiun Wang, Yu-Chee Tseng
ALGOSENSORS
2007
Springer
13 years 11 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
JNSM
2008
93views more  JNSM 2008»
13 years 7 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
MOBICOM
2006
ACM
14 years 1 months ago
Stochastic event capture using mobile sensors subject to a quality metric
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
Nabhendra Bisnik, Alhussein A. Abouzeid, Volkan Is...