Fundamental Protocols to Gather Information in Wireless Sensor Networks(Regular Section)

概要

論文の詳細を見る
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 √n×√n. 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 O(1) 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.
社団法人電子情報通信学会の論文
2002-11-01