A Node Localization Verification Model for WSN

Abstract

Abstract. Localization is one of the most important technologies in wireless sensor networks. Range-based localization methods are widely used in many applications. However, traditional RSS-based methods cannot work well in scenarios with unreliable anchors. A reputation scheme based distributed location verification model called UNDA is proposed to solve the unreliable node recognizing issue in such scenarios. UNDA combines direct reputation and third-party reputation to recognize unreliable anchor. Furthermore, a credibilityupdating scheme is presented to make the third-party reputation more accuracy. Extensive simulation experiments indicate that the location verification algorithm has relatively high accuracy as well as low communication overhead, and the convergence of UNDA is rapid. The UNDA can be a used as an underlayer for traditional RSS-based localization algorithms to realize reliable localization.

An Efficient Location Verification Scheme for Static Wireless Sensor Networks

“…Even though the secure localization protects the location estimation process from several attacks, the location estimation can still go wrong in some situations, e.g., compromised sensors report a false location intentionally. Therefore, many researchers have worked on the location verification in WSNs [10,11,12,13,14,15,16,17,18,19,20,21]. Location verification schemes can be categorized as in-region and on-spot verification [15].…”

“…On the other hand, on-spot verification usually verifies whether the claimed location of the sensors is correct [11,12,13,14,15,16,17,18]. This type of verification mainly uses pre-knowledge of the sensor deployment, the hop-distance relationship, graph theory or neighborhoods’ observation to verify the claimed location of sensors.…”

“…There were more recent research works trying to eliminate the fixed anchors or to detect the unreliable anchors and sensors [ 16 , 17 , 18 ]. Perazzo et al suggested the location verification based on verifiable multilateration (VM) [ 11 ] in [ 16 ].…”

“…For example, if the location of a sensor is suspicious, a sensor that is called the verifier collects the necessary information and performs location verification as shown in Figure 1b. This location verification problem can be formulated in many different mathematical ways by reflecting the characteristics of the algorithms [10,11,12,13,14,15,16,17,18,19,20,21]. …”

“…On-spot verification is to verify whether the true location of a sensor is the same as its claimed location, and in-region verification is to verify whether a sensor is within a certain region. In each category, several location verification schemes have been proposed to check the reported location of sensors with special requirements [10,11,12,13,14,15,16,17,18,19,20,21]. The special requirements, such as special hardware, the active participation of neighbors, a dedicated verifier and a trusted third party, impose a burden on the sensors in terms of hardware cost, communication overhead and computation overhead.…”