5793 search results - page 810 / 1159 » Individual communication complexity |
183
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
180
click to vote
MDM
2009
Springer
16 years 1 months ago
2009
Springer
—This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm. Our objectives are to explore a given geographic region by detecting spatio-temporal ev...
171
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— A self-healing key distribution scheme enables a large group of users (sensor nodes) to establish a session key dynamically over an unreliable, or lossy wireless network. The m...
219
click to vote
IPSN
2007
Springer
16 years 29 days ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
176
click to vote
SIGUCCS
2006
ACM
16 years 23 days ago
2006
ACM
Figuring out the best way to communicate with and serve students is one of the paramount challenges facing library and technology organizations today, including Bucknell Universit...