针对现有隐私保护数据聚集算法依赖某种网络拓扑结构和加解密次数过多的问题,本文提出了一种基于同心圆路线的隐私保护数据聚集算法PCIDA (Privacy-preserving and Concentric-circle Itinerary-based Data Aggregation algorithm).PCIDA沿着设计好的理想路线执行数据聚集,使得算法不依赖网络拓扑结构.PCIDA利用安全通道保证数据的隐私性,避免了数据聚集过程中的加解密运算.PCIDA沿着同心圆并行处理,使得算法数据处理延迟较小.理论分析和实验结果显示,PCIDA在较低通信量和能耗的情况下获得较高的数据隐私性和聚集精确度.%To solve the problems that the existing privacy-preserving data aggregation relies on a network infrastructure,and data privacy is achieved by excessive encryption process,this paper proposes a privacy-preserving and concentric-circle itinerary-based data aggregation algorithm (PCIDA).Based on a well-designed ideal itinerary for data aggregation,PCIDA is not susceptible to network topology structure.In addition,PCIDA uses secure channel to ensure data privacy with no encryption/decryption operations during data aggregation.PCIDA performs data aggregation in parallel along with well-designed concentric-circle itineraries to achieve small delivery delay.Theoretical analysis and experimental results show that PCIDA enjoys low communication overhead and energy consumption,yet high safety and accuracy.
展开▼