Sciweavers

6506 search results - page 367 / 1302
» Algorithmic models for sensor networks
Sort
View
JSAC
2008
98views more  JSAC 2008»
15 years 6 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
166
Voted
GLOBECOM
2006
IEEE
16 years 5 days ago
Bounds on the Lifetime of Wireless Sensor Networks Employing Multiple Data Sinks
Abstract—Employing multiple base stations is an attractive approach to enhance the lifetime of wireless sensor networks. In this paper, we address the fundamental question concer...
Amar P. Azad, Ananthanarayanan Chockalingam
163
Voted
ISCC
2006
IEEE
112views Communications» more  ISCC 2006»
16 years 4 days ago
The Precision and Energetic Cost of Snapshot Estimates in Wireless Sensor Networks
— Even for a specific application, the design space of wireless sensor networks is enormous, and traditional disciplinary boundaries are disappearing in the search for efficien...
Paul G. Flikkema
SIGSOFT
2007
ACM
16 years 6 months ago
Program representations for testing wireless sensor network applications
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...
Nguyet T. M. Nguyen, Mary Lou Soffa
FOCS
2008
IEEE
16 years 17 days ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan