基于Elliptic-curve及Hilbert-curve的簇间数据压缩融合加密算法

An Elliptic-curve and Hilbert-curve Based Privacy-preserving Aggregation Algorithm for Cluster Heads

  • 摘要: 现存无线传感器网络(WSN)路由算法融合加密过程通讯开销较大及数据完整性检测不够理想,对此,就簇间通信提出一种基于Elliptic-curve及Hilbert-curve的数据融合加密算法——ECHCPA.通过采用椭圆曲线进行公钥加密,Hilbert-Curve压缩融合,减少同类数据的传输量,最大程度地降低加密压缩算法复杂度,进而降低通讯开销.压缩融合后,通过比较父节点与随机选取检测节点二者的压缩融合数据,实现数据完整性查验.仿真结果表明:与iHDA和SMART相比,ECHCPA通讯开销明显降低,且有较好的数据完整性和数据精度.

     

    Abstract: There are two limitations in the existing WSN data aggregation methods for preserving data privacy:the communication cost is considerably high and the verification of data integrity is still undesirable. To solve these problems, an elliptic-curve and Hilbert-curve based data privacy-preserving algorithm (ECHCPA) is proposed for data caggregation, especially between cluster heads. The sensed data are encrypted using an elliptic curve and Hilbert curve. In this way, the volume of data transmission is reduced so that the space complexity and communication cost can be lowered. To verify data integrity, the aggregation of the encrypted data is processed at both the parent nodes and testing nodes, and it can be tested by comparing the two aggregated results. Simulations show that compared with iHDA and SMART, ECHCPA performs better in lowering communication costs, with good data integrity and data accuracy.

     

/

返回文章
返回