Sciweavers

147 search results - page 14 / 30
» Dependable k-coverage algorithms for sensor networks
Sort
View
WICON
2008
13 years 8 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu
CISS
2007
IEEE
14 years 1 months ago
Sensor Location through Linear Programming with Arrival Angle Constraints
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
Camillo Gentile, John Shiu
SUTC
2006
IEEE
14 years 22 days ago
Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data...
Kun-Feng Lin, Chuan-Ming Liu
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 6 months ago
Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
Gesualdo Scutari, Sergio Barbarossa
SIGMOD
2004
ACM
153views Database» more  SIGMOD 2004»
14 years 4 days ago
Spatially-decaying aggregation over a network: model and algorithms
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
Edith Cohen, Haim Kaplan