Sciweavers

373 search results - page 68 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 10 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
SENSYS
2006
ACM
14 years 1 months ago
Lazy cross-link removal for geographic routing
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
IPSN
2007
Springer
14 years 2 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
SAC
2005
ACM
14 years 1 months ago
Indexing continuously changing data with mean-variance tree
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
Yuni Xia, Sunil Prabhakar, Shan Lei, Reynold Cheng...
EWSN
2004
Springer
14 years 7 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig