Sciweavers

955 search results - page 13 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 3 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
JNW
2006
148views more  JNW 2006»
14 years 9 months ago
An Energy Efficient Approach to Dynamic Coverage in Wireless Sensor Networks
Tracking of mobile targets is an important application of sensor networks. This is a non-trivial problem as the increased accuracy of tracking results in an overall reduction in th...
Mohamed Khalil Watfa, Sesh Commuri
78
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
Robust Location Detection in Emergency Sensor Networks
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
Saikat Ray, Rachanee Ungrangsi, Francesco De Pelle...
JCO
2007
80views more  JCO 2007»
14 years 9 months ago
The wireless network jamming problem
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
Clayton W. Commander, Panos M. Pardalos, Valeriy R...
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 3 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey