一個於無線感測網路中即時且安全的資料聚合機制之研究

An immediate and secure data aggregation scheme for wireless sensor networks

王家翰(Chia-han Wang)

指導教授 ： 孫宏民

國立清華大學/電機資訊學院/資訊工程學系/碩士(2009年)

摘要

在階層式無線感測網路架構中，可以透過資料聚合的技術降低資料傳輸時的負擔，然而在不安全的網路環境中，資料在匯整的結果可能會遭到攻擊者的竄改。為了解決這些問題,許多學者提出了安全的資料匯整機制，但是，這些匯整機制都不夠有效率，因為這些機制都必須等待匯整結束於基地台後才能開始驗證匯整資料是否遭到竄改。在這篇論文，我們提出了一個安全且能即時驗證的資料匯整機制，此機制能夠偵測並預防攻擊者透過惡意控制的感測器竄改匯整資料。換言之，攻擊者不能透過竄改匯整資料成功的進行任何攻擊，我們將在此論文中證實此機制的安全性。我們的機制只要O(n)的溝通複雜度，此外還能支援網路拓樸變動。當攻擊發生時，此機制可以透過中斷匯整流程的方式來節省能量的消耗。再者，我們的能量消耗能平均的分配到每個無線感測網路的節點。最後將在此論文的實驗以及分析中，我們將證實相較於其他前人提出的機制，此機制有更好的效能。

關鍵字

感應器網路 ； 網路安全 ； 資料匯整

並列摘要

In order to reduce the transmission cost, an effective technique called data aggregation is proposed for hierarchical sensor networks recently. However, aggregation results are possible to modify or alter by adversaries since sensors are easy to compromised in a harsh environment. Several secure data aggregation protocols are proposed to solve this problem. Nevertheless, these protocols are impractical since aggregation results could only be checked until the process finishes at the base station side.
In this paper we present an immediately secure data aggregation approach in hierarchical WSN. Our approach is guaranteed to detect any manipulation of the aggregate by the adversary beyond what is achievable through direct injection of data values at compromised nodes. That is to say, the adversary cannot launch any successful attack from misrepresenting intermediate aggregation computations. A comprehensive analysis are shown to demonstrate that the proposed scheme are secure to against attacks. Our algorithm incurs only O(n) in communication cost, and supports dynamic tree-based topologies.
Moreover, our approach reduces the energy consumption by suspending the aggregation process once the compromised nodes have been be detected. To proof the efficiency of the proposed scheme, we conduct our scheme by simulations and show the performance is better than others. In the proposed scheme, energy consumption is distributed to each sensor in a balanced manner. This property extends lifetime of the deployed WSN.

並列關鍵字

Sensor networks ； Network security ； Data aggregation

參考文獻

[3] H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Security and Privacy, pages 197–215. IEEE Computer Society, 2003.

[5] S. Chatterjea and P. Havinga. A dynamic data aggregation scheme for wireless sensor networks. Proc. Program for Research on Integrated Systems and Circuits.

[7] M. Ding, X. Cheng, and G. Xue. Aggregation tree construction in sensor networks. In 2003 IEEE 58th Vehicular Technology Conference, 2003. VTC 2003- Fall, volume 4, 2003.

[8] J. Domingo-Ferrer. A provably secure additive and multiplicative privacy homomorphism. Lecture Notes in Computer Science, pages 471–483, 2002.

[9] K. Du, J. Wu, and D. Zhou. Chain-based protocols for data broadcasting and gathering in the sensor networks. In Parallel and Distributed Processing Symposium, 2003. Proceedings. International, page 8, 2003.