Sciweavers

373 search results - page 12 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
MDM
2009
Springer
192views Communications» more  MDM 2009»
14 years 2 months ago
Thresholded Range Aggregation in Sensor Networks
— The recent advances in wireless sensor technologies (e.g., Mica, Telos motes) enable the economic deployment of lightweight sensors for capturing data from their surrounding en...
Zhifeng Lin, Man Lung Yiu, Nikos Mamoulis
INFOCOM
2007
IEEE
14 years 2 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer
GIS
2005
ACM
14 years 9 months ago
Spatial queries in sensor networks
Recent advances in low-power sensing devices coupled with the widespread availability of wireless ad-hoc networks have fueled the development of sensor networks. These are typical...
Amir Soheili, Vana Kalogeraki, Dimitrios Gunopulos
ADHOCNOW
2007
Springer
14 years 2 months ago
Routing in Wireless Networks with Position Trees
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
Edgar Chávez, Nathalie Mitton, Hécto...