SGOR: Secure and scalable geographic opportunistic routing with received signal strength in WSNs

被引:22
作者
Lyu, Chen [1 ,2 ]
Gu, Dawu [1 ]
Zhang, Xiaomei [1 ]
Sun, Shifeng [1 ]
Zhang, Yuanyuan [1 ]
Pande, Amit [2 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
[2] Univ Calif Davis, Dept Comp Sci, Davis, CA 95616 USA
基金
中国国家自然科学基金;
关键词
Wireless sensor networks; Location verification; Geographic routing; Opportunistic forwarding; WIRELESS; PROTOCOL; LOCALIZATION; ATTACKS;
D O I
10.1016/j.comcom.2015.01.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless sensor networks (WSNs) are inherently susceptible to attacks as malicious nodes can disrupt the communication from any other node to the sink. To address a wide range of attacks, we propose a novel and comprehensive approach called Secure and Scalable Geographic Opportunistic Routing with received signal strength (SGOR), satisfying the requirements of both security and scalability in WSNs. Unlike most of previous secure protocols relying on infrastructure like anchor nodes, a distributed location verification algorithm is presented to utilize the received signal strength to address the location spoofing attack. As one of opportunistic geographic routings, SGOR provides the property of robustness by taking full advantage of the broadcast nature of wireless channels, and scalability for being inherited from geographic routing. Moreover, an ambient-sensitive trust model is proposed to defend against more kinds of attackers in SGOR. The theoretical results are given to demonstrate the effectiveness and robustness of SGOR to survive more severe attacks. In extensive simulations, we compare SGOR with four other representative protocols. The results show that SGOR achieves about two times higher packet delivery rate with acceptable overhead, particularly in large and highly hostile networks. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:37 / 51
页数:15
相关论文
共 49 条
[1]  
[Anonymous], 2010, PROC IEEE GLOBAL TEL
[2]  
[Anonymous], 2008, P IEEE INFOCOM 2008
[3]  
[Anonymous], AD HOC NETW, DOI DOI 10.1016/S1570-8705(03)00008-8
[4]  
Awerbuch B, 2008, ACM T INFORM SYST SE, V10, DOI [10.1145/1284680.1341892, 10.1145/1284680.1284686]
[5]   ExOR: Opportunistic multi-hop routing for wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2005, 35 (04) :133-143
[6]   Enhancing RSSI-Based Tracking Accuracy in Wireless Sensor Networks [J].
Blumrosen, Gaddi ;
Hod, Bracha ;
Anker, Tal ;
Dolev, Danny ;
Rubinsky, Boris .
ACM TRANSACTIONS ON SENSOR NETWORKS, 2013, 9 (03)
[7]   Secure localization algorithms for wireless sensor networks [J].
Boukerche, Azzedine ;
Oliveira, Horacio A. B. F. ;
Nakamura, Eduardo F. ;
Loureiro, Antonio A. F. .
IEEE COMMUNICATIONS MAGAZINE, 2008, 46 (04) :96-101
[8]   Trading structure for randomness in wireless opportunistic routing [J].
Chachulski, Szymon ;
Jennings, Michael ;
Katti, Sachin ;
Katabi, Dina .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) :169-180
[9]   Selection of a forwarding area for contention-based geographic forwarding in wireless multi-hop networks [J].
Chen, Dazhi ;
Deng, Jing ;
Varshney, Pramod K. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2007, 56 (05) :3111-3122
[10]  
Demirbas Murat., 2006, Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks, P564