Sciweavers

229 search results - page 12 / 46
» A Distributed Greedy Algorithm for Connected Sensor Cover in...
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
GLOBECOM
2007
IEEE
13 years 11 months ago
Efficient Self Protection Algorithms for Static Wireless Sensor Networks
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection needs to b...
Yu Wang 0003, Xiang-Yang Li, Qian Zhang
LCN
2005
IEEE
14 years 1 months ago
Approximate Coverage in Wireless Sensor Networks
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
Yuzhen Liu, Weifa Liang
ICDCS
2006
IEEE
14 years 1 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
JOIN
2007
133views more  JOIN 2007»
13 years 7 months ago
The Coverage Problem in Three-Dimensional Wireless Sensor Networks
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
Chi-Fu Huang, Yu-Chee Tseng, Li-Chu Lo