TKP : Three Level Key Pre-distribution with Mobile Sinks for Wireless Sensor Networks

被引:0
作者
Tanuja, R. [1 ]
Arudi, Souparnika P. [1 ]
Manjula, S. H. [1 ]
Venugopal, K. R. [1 ]
Patnaik, L. M. [2 ]
机构
[1] Bangalore Univ, Univ Visvesvaraya, Coll Engn, Dept Comp Sci & Engn, Bangalore, Karnataka, India
[2] Indian Inst Sci, Bangalore, Karnataka, India
来源
2015 IEEE INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, INFORMATICS, COMMUNICATION AND ENERGY SYSTEMS (SPICES) | 2015年
关键词
Key predistribution; Security; Wireless Sensor Networks;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless Sensor Networks are by its nature prone to various forms of security attacks. Authentication and secure communication have become the need of the day. Due to single point failure of a sink node or base station, mobile sinks are better in many wireless sensor networks applications for efficient data collection or aggregation, localized sensor reprogramming and for revoking compromised sensors. The existing sytems that make use of key predistribution schemes for pairwise key establishment between sensor nodes and mobile sinks, deploying mobile sinks for data collection has drawbacks. Here, an attacker can easily obtain many keys by capturing a few nodes and can gain control of the network by deploying a node preloaded with some compromised keys that will be the replica of compromised mobile sink. We propose an efficient three level key predistribution framework that uses any pairwise key predistribution in different levels. The new framework has two set of key pools one set of keys for the mobile sink nodes to access the sensor network and other set of keys for secure communication among the sensor nodes. It reduces the damage caused by mobile sink replication attack and stationary access node replication attack. To further reduce the communication time it uses a shortest distance to make pair between the nodes for comunication. Through results, we show that our security framework has a higher network resilience to a mobile sink replication attack as compared to the polynomial pool-based scheme with less communication time.
引用
收藏
页数:5
相关论文
共 14 条
[1]  
Alsoufi D, 2012, INT J COMPUT SCI ENG
[2]  
[Anonymous], P NETW DISTR SYST SE
[3]  
[Anonymous], 2002, COMPUTER NETWORKS
[4]  
Bechkit Walid, 2013, IEEE T WIRELESS COMM, V12
[5]  
Blundo C., 1993, Advances in Cryptology - CRYPTO '92. 12th Annual International Cryptology Conference Proceedings, P471
[6]  
Choi KJ, 2006, 8th International Conference on Advanced Communication Technology, Vols 1-3, pU1379
[7]   Routing security in wireless ad hoc networks [J].
Deng, HM ;
Li, W ;
Agrawal, DP .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (10) :70-75
[8]  
Douceur J R, 2002, P 1 INT WORKSH PEER, V38
[9]  
LIU D, 2003, P 1 ACM WORKSH SEC A
[10]  
Rasheed Amar, 2012, IEEE T PARALLEL DIST, V23