Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

この論文にアクセスする

この論文をさがす

著者

抄録

In this paper, we propose an efficient and optimally secure sensor network aggregation protocol against multiple corrupted nodes by a random-walk adversary. Our protocol achieves one round-trip communication to satisfy optimal security without the result-checking phase, by conducting aggregation along with the verification, based on the idea of TESLA technique. Furthermore, we show that the congestion complexity, communication complexity and computational cost in our protocol are constant, i.e., O(1).

Wireless Sensor Networks (WSNs) rely on in-network aggregation for efficiency, that is, readings from sensor nodes are aggregated at intermediate nodes to reduce the communication cost. However, the previous optimally secure in-network aggregation protocols against multiple corrupted nodes require two round-trip communications between each node and the base station, including the <i>result-checking phase</i> whose <i>congestion</i> is <i>O</i>(log <i>n</i>) where <i>n</i> is the total number of sensor nodes. In this paper, we propose an efficient and optimally secure sensor network aggregation protocol against multiple corrupted nodes by a <i>random-walk adversary</i>. Our protocol achieves one round-trip communication to satisfy optimal security without the result-checking phase, by conducting aggregation along with the verification, based on the idea of TESLA technique. Furthermore, we show that the congestion complexity, communication complexity and computational cost in our protocol are constant, i.e., <i>O</i>(1).

収録刊行物

  • IEICE transactions on information and systems

    IEICE transactions on information and systems 94(10), 1955-1965, 2011-10-01

    電子情報通信学会

参考文献:  29件中 1-29件 を表示

各種コード

  • NII論文ID(NAID)
    10030193373
  • NII書誌ID(NCID)
    AA10826272
  • 本文言語コード
    ENG
  • 資料種別
    ART
  • ISSN
    09168532
  • データ提供元
    CJP書誌  IR  J-STAGE 
ページトップへ