|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9846
|
| タイトル: | Efficient and Optimally Secure In-Network Aggregation in Wireless Sensor Networks |
| 著者: | Miyaji, Atsuko
Omote, Kazumasa |
| キーワード: | Wireless Sensor Networks
Data Aggregation |
| 発行日: | 2011 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 6513/2011 |
| 開始ページ: | 135 |
| 終了ページ: | 149 |
| DOI: | 10.1007/978-3-642-17955-6 |
| 抄録: | In many wireless sensor network applications, the data collectionsink (base station) needs to find the aggregated statistics of thenetwork. 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 andthe base station, including the result-checking phase whose congestion is O(log n) where n 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 weak 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 is constant. This means that our protocol suits large-scale wireless sensor networks. |
| Rights: | This is the author-created version of Springer, Atsuko Miyaji, Kazumasa Omote, Lecture Notes in Computer Science, 6513/2011, 2011, 135-149. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-17955-6 |
| URI: | http://hdl.handle.net/10119/9846 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 16554-1.pdf | | 141Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
