Anonymous aggregator election protocol for wireless sensor networks

Shuai FU; Jian-feng MA; Hong-tao LI; GQi JIAN

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

您当前的位置：

首页 >

文章列表页 >

Anonymous aggregator election protocol for wireless sensor networks

Academic papers | 更新时间：2024-06-05

- Anonymous aggregator election protocol for wireless sensor networks
- Journal on Communications Vol. 36, Issue 2, Pages: 88-97(2015)
- 作者机构：
  
  1. 西安电子科技大学计算机学院，陕西西安 710071
  2. 通信信息控制和安全技术重点实验室，浙江嘉兴 314033
- 作者简介：
- 基金信息：
  
  The Program for Changjiang Scholars and Innovative Research Team in University(IRT1078);The Key Program of NSFC-Guangdong Union Foundation(U1135002);The Major National Science and Technology Program(2011ZX03005-002);The National Natural Science Foundation of China(61272541);The National Natural Science Foundation of China(61202389);The Fundamental Research Funds for the Central Universities(JY10000903001);The Natural Science Basic Research Plan in Shaanxi Province of China(2012JQ8043)
- DOI：10.11959/j.issn.1000-436x.2015037
  CLC： TP393.08
- Online First：2015-02，
  
  Published：25 February 2015
- 稿件说明：
移动端阅览
Shuai FU, Jian-feng MA, Hong-tao LI, et al. Anonymous aggregator election protocol for wireless sensor networks[J]. Journal on Communications, 2015, 36(2): 88-97.
DOI：

Shuai FU, Jian-feng MA, Hong-tao LI, et al. Anonymous aggregator election protocol for wireless sensor networks[J]. Journal on Communications, 2015, 36(2): 88-97. DOI： 10.11959/j.issn.1000-436x.2015037.

摘要

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

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.

关键词

Keywords

references

YICK J , MUKHERJEE B , GHOSAL D . Wireless sensor networks survey [J ] . Computer Networks , 2008 , 52 ( 12 ): 2292 - 2330 .

郭江鸿，马建峰 . 安全透明的无线传感器网络数据汇聚方案 [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 .

杨军，张德运，张云翼等 . 基于分簇的无线传感器网络数据汇聚传送协议 [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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

DUTTA R , BARUA R , SARKAR P . Pairing-Based Cryptographic Protocols:A Survey [R ] . Cryptology Eprint Archive ,Report 2004 , 064 , 2004

BONEH D , FRANKLIN M . Identity based encryption from the weil pairing [J ] . SIAM Journal of Computing , 2003 , 32 ( 3 ): 586 - 615 .

王圣宝 . 基于双线性配对的加密方案及密钥协商协议 [D ] . 上海 : 上海交通大学 , 2008 .

WANG S B . Research on Cryptosystems and Key Agreement Protocols from Bilinear Pairings [D ] . Shanghai : Shanghai Jiaotong University , 2008 .

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 .

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 .

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 .

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 .

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 .

高文宇 . 基于最小生成树的连通支配集求解算法 [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 .

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 .

杨浩淼 , 孙世新 , 李洪伟 . 双线性 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 .

Views

2014

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Geographic based maximum lifetime routing in data aggregated wireless sensor networks with multiple base stations

Selective aggregation scheme for multi-dimensional data with type-based verification

Efficient unpaired data validation and aggregation protocol in industrial Internet of things

Multi-function supported privacy protection data aggregation scheme for V2G network

Coverage control algorithm for wireless sensor networks based on non-cooperative game

Related Author

TANG Wei

GUO Wei

NIU Kun

SHI Miao

PENG Changgen

XU Dequan

CAI Fei

MA Rong

Related Institution

National Key Laboratory of Science and Technology on Communications,University of Electronic Science and Technology of China

School of Computer Science and Technology, Guizhou University

State Key Laboratory of Public Big Data, Ministry of Education

College of Computer Science, Guiyang University

Information Center of Guizhou Light Industry Polytechnic University

AI问答

⁰