Fundamental Protocols to Gather Information in Wireless Sensor Networks*

• BHUVANESWARAN Raghuvel Subramaniam

  School of Computer Science and Engineering, Anna University

• BORDIM Jacir L.

  School og Information Science, Japan Advanced Institute of Technology

• CUI Jiangtao

  Dpartment of Intelligence and Computer Engineering, Nagoya Institute of Technology

• NAKANO Koji

  School og Information Science, Japan Advanced Institute of Technology

抄録

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.

収録刊行物

• IEICE transactions on fundamentals of electronics, communications and computer sciences

  IEICE transactions on fundamentals of electronics, communications and computer sciences 85 (11), 2479-2488, 2002-11-01

  一般社団法人電子情報通信学会

キーワード

• wireless sensor networks
• energy-efficient protocols
• information gathering data gathering

詳細情報

• CRID: 1572543027200694912
• NII論文ID: 110003221043
• NII書誌ID: AA10826239
• ISSN: 09168508
• 本文言語コード: en
• データソース種別:
  • CiNii Articles