Sciweavers

373 search results - page 55 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
INFOCOM
2007
IEEE
14 years 2 months ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...
MOBIDE
2005
ACM
14 years 1 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
TON
2010
171views more  TON 2010»
13 years 2 months ago
Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...
Yan Wu, Zhoujia Mao, Sonia Fahmy, Ness B. Shroff