Sciweavers

279 search results - page 28 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
GLIDER: gradient landmark-based distributed routing for sensor networks
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silv...
GLOBECOM
2006
IEEE
14 years 1 months ago
Honeycomb Architecture for Energy Conservation in Wireless Sensor Networks
— Reducing energy consumption has been a recent focus of wireless sensor network research. Topology control explores the potential that a dense network has for energy savings. On...
Ren Ping Liu, Glynn Rogers, Sihui Zhou
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 11 days ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
IAT
2009
IEEE
14 years 2 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
WICON
2008
13 years 9 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