Name
Abstract | ||
|---|---|---|
The main contribution of this work is to propose energy-efficient protocols that compute the sum of n numbers over any commutative and associative binary operator stored in n wireless sensor nodes arranged in a two-dimensional grid of size rootn x rootn. We first present a protocol that computes the sum on a Wireless Sensor Network (WSN) in O(r(2) + (n/r(2))(1/3)) time slots with no sensor node being awake for more than 0(l) time slots, where r is the transmission range of the sensor nodes. We then go on to present a fault-tolerant protocol which computes the sum in the same number of time slots with no sensor node being awake for more than O(log r) time slots. Finally, we show that in a WSN where the sensor nodes are empowered with the ability to dynamically adjust their transmission range r during the execution of the protocol, the sum can be computed in O(log n) time slots and no sensor node needs to awake for more than O(log n) time slots. |
Year | Venue | Keywords |
|---|---|---|
2002 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | wireless sensor networks, energy-efficient protocols, information gathering, data gathering |
DocType | Volume | Issue |
Journal | E85A | 11 |
ISSN | Citations | PageRank |
0916-8508 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raghuvel S. Bhuvaneswaran | 1 | 0 | 0.34 |
| Jacir Luiz Bordim | 2 | 57 | 18.86 |
| JiangTao Cui | 3 | 0 | 0.34 |
| K. Nakano | 4 | 31 | 18.27 |