Conference Paper

A novel secure localization scheme against collaborative collusion in wireless sensor networks

Dept. of Inf. & Commun. Syst., Hohai Univ., Changzhou, China
DOI: 10.1109/IWCMC.2011.5982551 Conference: Wireless Communications and Mobile Computing Conference (IWCMC), 2011 7th International
Source: IEEE Xplore


To solve the secure localization problems, a number of secure localization schemes have been developed at present. However, most of these techniques cannot survive collusion attacks where a majority of malicious nodes launch colluding attacks. In this paper, we introduce a new collusion attack model called Collaborative Collusion Attack Model (CCAM) and propose a novel scheme called Two-Step Format Detection (TSFD) that is well suited to WSN which is a resource constrained environment. The TSFD has reasonable and acceptable communication cost and algorithm complexity. Through simulations, we compare the performance of TSFD with other secure localization schemes and show that TSFD has more efficient and resilient performance.

Download full-text


Available from: Guangjie Han, Mar 29, 2015
12 Reads
  • Source
    • "Many secure localization schemes have been proposed [27]. They can be classified into two categories: SNA and SIV. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Secure localization of unknown nodes in a Wireless Sensor Network (WSN) is an important research subject. When WSNs are deployed in hostile environments, many attacks happen, e.g., wormhole, sinkhole and sybil attacks. Two issues about unknown nodes' secure localization need to be considered. First, the attackers may disguise as or attack the unknown and anchor nodes to interfere with localization process. Second, the attackers may forge, modify or replay localization information to make the estimated positions incorrect. Currently, researchers have proposed many techniques, e.g., SeRLoc, HiRLoc and ROPE, to solve the two issues. In this paper we describe the common attacks against localization, and survey research state of secure localization.
    Journal of Communications 09/2011; 6(6):460-470. DOI:10.4304/jcm.6.6.460-470
  • Source
    • "Many secure localization schemes have been proposed [27]. They can be classified into two categories: SNA and SIV. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Ad hoc wireless sensor networks (WSNs) have attracted a great deal of attention in recent years for their broad potential in both military and civilian operations. The proper operations of many WSNs rely on the knowledge of physical sensor locations. However, most existing localization algorithms developed for WSNs are vulnerable to attacks in hostile environments. As a result, adversaries can easily subvert the normal functionalities of location-dependent WSNs by exploiting the weakness of localization algorithms. In this paper, we first present a general secure localization scheme to protect localization from adversarial attacks. We then propose a mobility-assisted secure localization framework for WSNs.
    Military Communications Conference, 2005. MILCOM 2005. IEEE; 11/2005
  • [Show abstract] [Hide abstract]
    ABSTRACT: Recent advances in wireless sensor networks (WSNs) technologies have brought significant convenience for location-based services. And the problem of enabling nodes of WSNs to determine their locations in a hostile environment has become more and more important in WSNs applications. In this article, we propose a novel Dempster–Shafer based secure localization algorithm to diminish the effect of the unreliable beacons that provide false localization information in the WSNs. First, the framework of trust evaluation is established on the basis of evidence theory. According to the characteristics of time and space of beacons, we set up the basic probability assignment (BPA) values and BPA evidences of beacons. Then, an improved Dempster–Shafer method is utilized to resolve the conflicts among the BPA evidences and to integrate the trust values of beacons. The max_mass function is used to decide which beacon is attacked, and then, we eliminate the attacked beacons before the localization stage. Finally, we employ the weighted Taylor-series least squares method to estimate the normal nodes coordinates. Simulation results demonstrate that our proposed algorithm is robust and effective. Copyright © 2013 John Wiley & Sons, Ltd.
    Security and Communication Networks 11/2014; 7(11). DOI:10.1002/sec.909 · 0.72 Impact Factor