无线传感器网络中匿名的聚合节点选举协议

doi:10.11959/j.issn.1000-436x.2015037

通信学报 ›› 2015, Vol. 36 ›› Issue (2): 88-97.doi: 10.11959/j.issn.1000-436x.2015037

无线传感器网络中匿名的聚合节点选举协议

付帅¹,马建峰²,李洪涛¹,姜奇¹

¹ 西安电子科技大学计算机学院，陕西西安 710071
² 通信信息控制和安全技术重点实验室，浙江嘉兴 314033

出版日期:2015-02-25 发布日期:2017-06-27
基金资助:
长江学者和创新团队发展计划基金资助项目;国家自然基金委员会—广东联合基金重点基金资助项目;国家科技部重大专项基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;中央高校基本科研业务基金资助项目;陕西省自然科学基础研究计划基金资助项目

Anonymous aggregator election protocol for wireless sensor networks

Shuai FU¹,Jian-feng MA²,Hong-tao LI¹,GQi JIAN¹

¹ School of Computer Science and Technology,Xidian University,Xi’an 710071,China
² Science and Technology on Communication Information Security Control Laboratory,Jiaxing 314033,China

Online:2015-02-25 Published:2017-06-27
Supported by:
The Program for Changjiang Scholars and Innovative Research Team in University;The Key Program of NSFC-Guangdong Union Foundation;The Major National S＆T Program;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Fundamental Research Funds for the Central Universities;The Natural Science Basic Research Plan in Shannxi Province of China

摘要/Abstract

摘要：

提出一种分簇无线传感器网络中匿名的簇头选举协议。给出了匿名簇头选举的判定规则及成簇模式，并采用基于双线性对的匿名否决协议对选举结果进行验证以保证存在节点成功当选。设计了相应的匿名数据聚合方案，无需泄露节点身份信息即可完成聚合。分析及仿真结果表明，协议同时实现了簇头选举的匿名性、高效性及安全性，可有效抵抗窃听攻击、节点妥协攻击及合谋攻击等恶意行为。

关键词: 无线传感器网络, 分簇, 数据聚合, 匿名否决

Abstract:

An anonymous cluster head election protocol in clustered wireless sensor networks was proposed.The protocol detailed the decision rules and mode of cluster construction while an anonymous veto protocol based on bilinear pairings was adopted to verify election results,ensuring the successful election of cluster heads.A corresponding anonymous data aggregation scheme was designed,through which data aggregation can be accomplished without revealing the identities of aggregators.Extensive analysis and simulation results show that the proposed protocol achieves anonymity,energy efficiency and security of cluster heads election simultaneously and can resist eavesdropping attacks,node compromise attacks and collusion attacks effectively.

Key words: wireless sensor networks, cluster, data aggregation, anonymous veto

付帅,马建峰,李洪涛,姜奇. 无线传感器网络中匿名的聚合节点选举协议[J]. 通信学报, 2015, 36(2): 88-97.

Shuai FU,Jian-feng MA,Hong-tao LI,GQi JIAN. Anonymous aggregator election protocol for wireless sensor networks[J]. Journal on Communications, 2015, 36(2): 88-97.

图/表 12

表1

图1

图2

表2

图3

图4

图5

图6

图7

图8

图9

图10

参考文献 21

1	YICK J , MUKHERJEE B , GHOSAL D . Wireless sensor networks survey[J]. Computer Networks, 2008,52(12):2292-2330.
2	郭江鸿，马建峰 . 安全透明的无线传感器网络数据汇聚方案[J]. 通信学报， 2012,33(10):51-59. GUO J H , MA J F . Secure and transparent data aggregation for wireless sensor networks[J]. Journal on Communications, 2012,33(10):51-59.
3	杨军，张德运，张云翼等. 基于分簇的无线传感器网络数据汇聚传送协议[J]. 软件学报, 2010,21(5):1127-1137. YANG J , ZHANG D Y , ZHANG Y Y , et al. Cluster-based data aggregation and transmission protocol for wireless sensor networks[J]. Journal of Software, 2010,21(5):1127-1137.
4	XUE K P , MA C S , HONG P L , et al. A temporal-credential-based mutual authentication and key agreement scheme for wireless sensor networks[J]. Journal of Network and Computer Applications, 2013,36(1):316-323.
5	WANG S S , YAN K Q , WANG S C , et al. An integrated intrusion detection system for cluster-based wireless sensor networks[J]. Expert Systems with Applications, 2011,38(12):15234-15243.
6	PANTAZIS N A , NIKOLIDAKIS S A , VERGADOS D D . Energy-efficient routing protocols in wireless sensor networks:a survey[J]. IEEE Communications Surveys ＆Tutorials, 2013,15(2):551-591.
7	GUERMAZI A , ABID M . An efficient key distribution scheme to secure data-centric routing protocols in hierarchical wireless sensor networks[J]. Procedia Computer Science, 2011,5:208-215.
8	ZHANG P F , XIAO G X , TAN H P . Clustering algorithms for maximizing the lifetime of wireless sensor networks with energy-harvesting sensors[J]. Computer Networks, 2013,57(14):2689-2704.
9	KACIMI R , DHAOU R , BEYLOT A L . Load balancing techniques for lifetime maximizing in wireless sensor networks[J]. Ad Hoc Networks, 2013,11(8):2172-2186.
10	DARABKH K A , ISMAIL S S , Al-SHURMAN M , et al. Performance evaluation of selective and adaptive heads clustering algorithms over wireless sensor networks[J]. Journal of Network and Computer Applications, 2012,35(6):2068-2080.
11	DUTTA R , BARUA R , SARKAR P . Pairing-Based Cryptographic Protocols:A Survey[R]. Cryptology Eprint Archive,Report 2004,064,2004
12	BONEH D , FRANKLIN M . Identity based encryption from the weil pairing[J]. SIAM Journal of Computing, 2003,32(3):586-615.
13	王圣宝 . 基于双线性配对的加密方案及密钥协商协议[D]. 上海: 上海交通大学, 2008. WANG S B . Research on Cryptosystems and Key Agreement Protocols from Bilinear Pairings[D]. Shanghai: Shanghai Jiaotong University, 2008.
14	CHANG D , CHO K , CHOI N , et al. A probabilistic and opportunistic flooding algorithm in wireless sensor networks[J]. Computer Communications, 2012,35(4):500-506.
15	GAREY M R , JOHNSON D S . Computers and Intractability:A Guide to the Theory of NP-Completeness[M]. New York:W H Freeman＆Co, 1979.
16	ZHENG C , SUN S X , HUANG T Y . Constructing distributed connected dominating sets in wireless ad hoc and sensor networks[J]. Journal of Software, 2011,22(5):1053-1066.
17	YIN B , SHI H C , SHANG Y . An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks[J]. Journal of Parallel and Distributed Computing, 2011,71(1):27-39.
18	ZOU F , WANG Y X , XU X H , et al. New approximations for minimum weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs[J]. Theoretical Computer Science, 2011,412(3):198-208.
19	高文宇 . 基于最小生成树的连通支配集求解算法[J]. 计算机应用, 2009,29(6):1490-1493. GAO W Y . Novel connected dominating set algorithm based on minimum spanning tree[J]. Journal of Computer Applications, 2009,29(6):1490-1493.
20	FRANCILLON A , CASTELLUECIA C . TinyRNG:a cryptographic random number generator for wireless sensors network nodes[A]. Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile,Ad Hoc,and Wireless Networks (WiOpt ’07)[C]. Limassol, 2007.1-17.
21	杨浩淼, 孙世新, 李洪伟 . 双线性 Diffie-Hellman 问题研究[J]. 四川大学学报 (工程科学版), 2006,38(2):137-140. YANG H M , SUN S X , LI H W . Research on bilinear Diffie-Hellman problem[J]. Journal of Sichuan University (Engineering Science Edition), 2006,38(2):137-140.

参数	参数值
节点数	100
网络规模	100 m×100 m
基站位置	95
数据分组长度/byte	500
节点初始能量/J	0.25
无线收发电路能耗/(nJ·bit^?1)	50
自由空间模型放大器能耗/(pJ·bit^?1·m^?2)	10
多路径衰减模型放大器能耗/(pJ·bit^?1·m^?1)	0.001 3
融合单位长度数据能耗/(nJ·bit^?1)	5
最大通信距离/m	15

[1]	胡柏吉, 张晓娟, 李元诚, 赖荣鑫. 支持多功能的V2G网络隐私保护数据聚合方案[J]. 通信学报, 2023, 44(4): 187-200.
[2]	赵越, 李赞, 李冰, 郝本建. TDoA定位盲区分析与节点部署策略研究[J]. 通信学报, 2023, 44(1): 1-13.
[3]	周锋, 张宝胜, 张文博. 基于水声扩频信号的空时分簇DoA估计算法[J]. 通信学报, 2022, 43(8): 100-108.
[4]	李翠然, 王雪洁, 谢健骊, 吕安琪. 基于改进PSO的铁路监测线性无线传感器网络路由算法[J]. 通信学报, 2022, 43(5): 155-165.
[5]	杜秀娟, 王丽娟, 刘静萍, 金龙. 基于归零神经动力学的水下无线传感器网络节点测距定位方法[J]. 通信学报, 2022, 43(10): 177-185.
[6]	孙爱晶, 李世昌, 张艺才. 基于PSO优化模糊C均值的WSN分簇路由算法[J]. 通信学报, 2021, 42(3): 91-99.
[7]	杨莲新,吴丹,袁峰,乐超,富勤学. 基于D2D多播通信的合作内容下载机制[J]. 通信学报, 2020, 41(11): 64-73.
[8]	王天荆,李秀琴,白光伟,沈航. 无线传感器网络中基于自适应网格的多目标定位算法[J]. 通信学报, 2019, 40(7): 197-207.
[9]	郝晓辰,姚宁,解力霞,王姣姣,王立元. 联合功率与信道的WSN生命期优化博弈算法[J]. 通信学报, 2019, 40(4): 62-70.
[10]	刘琳岚,高声荣,舒坚. 基于随机森林的链路质量预测[J]. 通信学报, 2019, 40(4): 202-211.
[11]	武小年,张楚芸,张润莲,孙亚平. WSN中基于改进粒子群优化算法的分簇路由协议[J]. 通信学报, 2019, 40(12): 114-123.
[12]	刘浩然,赵赫瑶,邓玉静,王星淇,尹荣荣. 基于非合作博弈的无线传感器网络覆盖控制算法[J]. 通信学报, 2019, 40(1): 71-78.
[13]	乐燕芬,汤卓,盛存宝,施伟斌. 基于多分布密度位置指纹的高效室内定位算法研究[J]. 通信学报, 2019, 40(1): 172-179.
[14]	舒坚,刘满兰,尚亚青,陈宇斌,刘琳岚. 基于高斯过程回归的链路质量预测模型[J]. 通信学报, 2018, 39(7): 148-156.
[15]	郝晓辰,王立元,刘金硕,解力霞,张文焕. WSN中基于双群体差分进化的资源分配优化算法[J]. 通信学报, 2018, 39(4): 68-75.

无线传感器网络中匿名的聚合节点选举协议

Anonymous aggregator election protocol for wireless sensor networks

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 12

参考文献 21

相关文章 15

Metrics

推荐阅读 0

匿名簇头选举成簇算法
1) 启动计时器 t₁，时长为T
2) 启动计时器 t₂，时长为T
3) 设定二进制随机值μ=rand{0,1}
4) 设定簇头节点的ID ：CHID=?1
5) while t₁未超时 do
6) if (μ=1) and (CHID=?1) //μ在第一轮为真且已当选
7) then广播簇头声明消息
8) CHID值为发送者自身ID
9) else if
10) 接收簇头声明消息
11) then 广播虚拟消息
12) else // t₁超时
13) 广播虚拟消息
14) end if
15) end if
16) end while
17)while t₂未超时 do
18) if(μ=1) and (CHID=?1) then
19) 广播虚拟消息
20) CHID为节点自身ID
21) else if
22) 接收簇头声明消息 then
23) 广播虚拟消息
24) else // t₂超时
25) 广播虚拟消息
26) end if
27) end if
28)end while