scholarly journals Research on Secure Localization Model Based on Trust Valuation in Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Peng Li ◽  
Xiaotian Yu ◽  
He Xu ◽  
Jiewei Qian ◽  
Lu Dong ◽  
...  

Secure localization has become very important in wireless sensor networks. However, the conventional secure localization algorithms used in wireless sensor networks cannot deal with internal attacks and cannot identify malicious nodes. In this paper, a localization based on trust valuation, which can overcome a various attack types, such as spoofing attacks and Sybil attacks, is presented. The trust valuation is obtained via selection of the property set, which includes estimated distance, localization performance, position information of beacon nodes, and transmission time, and discussion of the threshold in the property set. In addition, the robustness of the proposed model is verified by analysis of attack intensity, localization error, and trust relationship for three typical scenes. The experimental results have shown that the proposed model is superior to the traditional secure localization models in terms of malicious nodes identification and performance improvement.

The fundamental capacity of a sensor system is to accumulate and forward data to the destination. It is crucial to consider the area of gathered data, which is utilized to sort information that can be procured using confinement strategy as a piece of Wireless Sensor Networks (WSNs).Localization is a champion among the most basic progressions since it agreed as an essential part in various applications, e.g., target tracking. If the client can't gain the definite area information, the related applications can't be skillful. The crucial idea in most localization procedures is that some deployed nodes with known positions (e.g., GPS-equipped nodes) transmit signals with their coordinates so as to support other nodes to localize themselves. This paper mainly focuses on the algorithm that has been proposed to securely and robustly decide thelocation of a sensor node. The algorithm works in two phases namely Secure localization phase and Robust Localization phase. By "secure", we imply that malicious nodes should not effectively affect the accuracy of the localized nodes. By “robust”, we indicate that the algorithm works in a 3D environment even in the presence of malicious beacon nodes. The existing methodologies were proposed based on 2D localization; however in this work in addition to security and robustness, exact localization can be determined for 3D areas by utilizing anefficient localization algorithm. Simulation results exhibit that when compared to other existing algorithms, our proposed work performs better in terms of localization error and accuracy.


2008 ◽  
Vol 46 (4) ◽  
pp. 96-101 ◽  
Author(s):  
A. Boukerche ◽  
H.A.B. Oliveira ◽  
E.F. Nakamura ◽  
A.A.F. Loureiro

Author(s):  
Fengrong Han ◽  
Izzeldin Ibrahim Mohamed Abdelaziz ◽  
Xinni Liu ◽  
Kamarul Hawari Ghazali ◽  
Hao Wang

Location information is prerequisite for wireless sensor networks (WSNs) monitoring and control applications, since there is no meaning without position information for collected data. Distance vector hop (DV-Hop) localization algorithm as the typical range-free algorithm that has been widely applied in various applications. Nowadays, the research on range-free localization for WSNs is mostly based on two-dimensional (2D) space. Hence, there are few surveys concentrated on range-free localization in three-dimensional (3D) WSNs. This motivated us to present an extensive overview of enhanced DV-Hop localization algorithms in 3D WSNs. This paper focused on critical challenge between 2D and 3D in localization model, representative range-free 3D localization technique surveys. Moreover, a comprehensive taxonomy of most essential enhanced methods applied in 3D DV-Hop is illustrated. A considerable comparison in term of localization error, computational complexity and node type is given. Future research directions dealing with localization under 3D DV-Hop is also discussed.


Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 165 ◽  
Author(s):  
Qiong Shi ◽  
Li Qin ◽  
Yinghua Ding ◽  
Boli Xie ◽  
Jiajie Zheng ◽  
...  

Secure routing is crucial for wireless sensor networks (WSNs) because they are vulnerable to various attacks. In this paper, we propose a new secure routing protocol for WSNs in the presence of malicious nodes. For each relay node in the route, associated information such as its trust value and status is considered in the protocol. The trust value is defined as the attack probability of the node according to previous packet-forwarding behaviors, and the status is a hybrid metric that combines the residual energy and distance to the sink node. Therefore, the route generated by the protocol is secure against malicious attacks and globally optimal according to the associated information. We used an improved variant of the Dijkstra algorithm to generate the secure route for WSNs in the presence of malicious nodes. Compared with the Reputation-Based Mechanism to Stimulate Cooperation (RBMSC) model in the same simulation environment, the proposed model can maintain a higher delivery ratio, which verifies the effectiveness of the proposed model on the basis of global optimization. Furthermore, compared with the traditional Dijkstra algorithm, the packet loss ratio in the improved Dijkstra algorithm is lower because it can more effectively avoid malicious nodes, thus verifying the effectiveness of the improved algorithm.


2014 ◽  
Vol 622 ◽  
pp. 191-198
Author(s):  
Devasagayam Jayashree ◽  
V. Uma Rani ◽  
K. Soma Sundaram

Due to emerging technology Wireless Sensor Network (WSN), it is necessary to monitor the behavior of sensor nodes and establish the secure communication in network. Security is a challenging task in wireless environment. Several encryption mechanisms are available to prevent outsider attacks, but no mechanism available for insider attacks. A trust model is a collection of rules used to establish co-operation or collaboration among nodes as well as monitoring misbehavior of wireless sensor networks. Trust model is necessary to enhance secure localization, communication or routing, aggregation, collaboration among nodes. In this paper, proposed a behavior based distributed trust model for wireless sensor network to effectively deal with self-ish or malicious nodes. Here, take multidimensional trust attributes derived from communications and networks to evaluate the overall trust of sensor nodes. It monitors the behavior of nodes and establishes secure communication among networks.


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Gulshan Kumar ◽  
Mritunjay Kumar Rai ◽  
Hye-jin Kim ◽  
Rahul Saha

Localization is a concerning issue in the applications of wireless sensor networks. Along with the accuracy of the location estimation of the sensor nodes, the security of the estimation is another priority. Wireless sensor networks often face various attacks where the attackers try to manipulate the estimated location or try to provide false beacons. In this paper, we have proposed a methodology that will address this problem of security aspects in localization of the sensor nodes. Moreover, we have considered the network environment with random node deployment and mobility as these two conditions are less addressed in previous research works. Further, our proposed algorithm provides low overhead due to the usage of less control messages in a limited transmission range. In addition, we have also proposed an algorithm to detect the malicious anchor nodes inside the network. The simulated results show that our proposed algorithm is efficient in terms of time consumption, localization accuracy, and localization ratio in the presence of malicious nodes.


2014 ◽  
Vol 530-531 ◽  
pp. 15-18 ◽  
Author(s):  
Lu Gao ◽  
Zhong Min Li

In the applications based on Wireless Sensor Networks (WSNs) , localization is one of the most fundamental and important technologies if the accurate location information cant be determined, these application cant be accomplished. Then main idea in localization algorithms is that every unknown node in WSN can localize itself by position information from the landmarks or other nodes. in the last years localization is still a hot field and some new algorithms are proposed. In this paper, the localization algorithms are classified on the basis of the way to get position information, and a simple analysis is present. the paper are ended by discussing some open issues.


2020 ◽  
pp. 1233-1251
Author(s):  
Rudra Pratap Ojha ◽  
Pramod Kumar Srivastava ◽  
Goutam Sanyal

Network security poses a challenge to wireless sensor networks (WSNs) achieving its true potential. It is hard to tackle due to operational constraints of networks. Worms have become an emergent threat to the wireless networks. The spread of worms in the network is epidemic in nature. This article proposes a novel mathematical model with pre-vaccination and quarantine for study of worm propagation dynamics in WSN that is based on epidemic model. Further, the authors have devised an expression to determine threshold communication radius and node density. The objective of this proposed model is to study the propagation dynamics of worms in wireless sensor networks. Through the model, investigate the stability condition of networks in the presence of malicious codes. The experimental studies indicate that the proposed model outperforms in terms of security and energy efficiency over other existing models. It is a leap toward worm-controlling mechanisms in sensor networks. Finally, the control mechanism and performance of the proposed model is validated through extensive simulation results.


Author(s):  
Ferit Ozan Akgul ◽  
Mohammad Heidari ◽  
Nayef Alsindi ◽  
Kaveh Pahlavan

This chapter discusses localization in WSNs specifically focusing on the physical limitations imposed by the wireless channel. Location awareness and different methods for localization are discussed. Particular attention is given to indoor TOA based ranging and positioning systems. Various aspects of WSN localization are addressed and performance results for cooperative schemes are presented.


Sign in / Sign up

Export Citation Format

Share Document