Deterministic Secure Positioning in Wireless Sensor Networks

Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location and distance information in order to fake their actual location. In this paper we propose a general distributed deterministic protocol for accurate identification of faking sensors in a WSN. Our scheme does \emph{not} rely on a subset of \emph{trusted} nodes that are not allowed to misbehave and are known to every node in the network. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN. On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most $\lfloor \frac{n}{2} \rfloor-2$ faking sensors. Also, when the time of flight (ToF) technique is used, our protocol manages at most $\lfloor \frac{n}{2} \rfloor - 3$ misbehaving sensors. On the negative side, we prove that no deterministic protocol can identify faking sensors if their number is $\lceil \frac{n}{2}\rceil -1$. Thus our scheme is almost optimal with respect to the number of faking sensors. We discuss application of our technique in the trusted sensor model. More precisely our results can be used to minimize the number of trusted sensors that are needed to defeat faking ones

Deterministic Secure Positioning in Wireless Sensor Networks

Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location and distance information in order to fake their actual location. In this paper we propose a general distributed deterministic protocol for accurate identification of faking sensors in a WSN. Our scheme does \emph{not} rely on a subset of \emph{trusted} nodes that are not allowed to misbehave and are known to every node in the network. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN. On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most $\lfloor \frac{n}{2} \rfloor-2$ faking sensors. Also, when the time of flight (ToF) technique is used, our protocol manages at most $\lfloor \frac{n}{2} \rfloor - 3$ misbehaving sensors. On the negative side, we prove that no deterministic protocol can identify faking sensors if their number is $\lceil \frac{n}{2}\rceil -1$. Thus our scheme is almost optimal with respect to the number of faking sensors. We discuss application of our technique in the trusted sensor model. More precisely our results can be used to minimize the number of trusted sensors that are needed to defeat faking ones

Improving Performance of WSN Based On Hybrid Range Based Approach

Improving the performance of WSN supported hybrid range based approach. WSN is self-possessed minimization error of nodes prepared with limited resources, limited memory and computational abilities. WSNs reliably work in unidentified hubs and numerous situations, it's difficult to trade sensor hubs after deployment, and therefore a fundamental objective is to optimize the sensor nodes' lifetime. A WSN may be a set of a large number of resource-constrained sensor nodes which have abilities for information detection, processing, and short-range radio communication, Analysis localization error minimization based several applications of wireless sensor networks (WSN) need data regarding the geographical location of each detector node. Self-organization and localization capabilities are one in every of the foremost necessary needs in detector networks. It provides a summary of centralized distance-based algorithms for estimating the positions of nodes during very sensing nodes. Secure localization of unknown nodes during a very wireless detector network (WSN) may be a vital analysis subject wireless sensor networks (WSN), a component of enveloping computing, are presently getting used on a large scale to look at period environmental standing, Be that as it may, these sensors work underneath extraordinary vitality imperatives and are planned by remembering an application. Proposed approaches are sensing node location and challenging task, involve assessing sort of various parameters needed by the target application. In study realize drawback not sense positioning of nodes .but proposed approach formula recognizes the optimal location of nodes supported minimize error and best answer in WSN. Localization algorithms mentioned with their benefits and disadvantages. Lastly, a comparative study of localization algorithms supported the performance in WSN. This was often done primarily to offer a summary of the proposed approach known today for reliable data and minimizing the energy consumption in wireless sensor networks

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks

The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes from the universe of arbitrary non-existent fictitious nodes created by the attacker. Similar to failure detectors, we propose to use universe detectors to help nodes determine which universe is real. In this paper, we (i) define several variants of the neighborhood discovery problem under Sybil attack (ii) propose a set of matching universe detectors (iii) demonstrate the necessity of additional topological constraints for the problems to be solvable: node density and communication range; (iv) present SAND -- an algorithm that solves these problems with the help of appropriate universe detectors, this solution demonstrates that the proposed universe detectors are the weakest detectors possible for each problem

Nouveau modèle pour le positionnement des senseurs avec contraintes de localisation

RÉSUMÉ Les réseaux de capteurs sans fil continuent de constituer sans doute un développement technologique majeur. Le problème de la planification s'inscrit dans un objectif global d'amélioration des performances. Le problème de planification doit permettre d’optimiser l'emplacement des capteurs relativement à des critères afin d’obtenir une certaine qualité de service par exemple en terme de couverture et de connectivité. L’objectif de ce mémoire est de proposer une stratégie de planification des réseaux de capteurs sans fil. Cette stratégie va permettre de garantir une couverture et une connectivité accrue. L’approche commence par proposer un formalisme combinatoire du problème d’optimisation avec des contraintes qui permettent d’exprimer les objectifs de localisation, de couverture et de connectivité. L'espace de recherche est discret et le choix parmi les sites potentiels est directement lié aux caractéristiques de l'environnement du déploiement. Ainsi, on suppose qu’on connait les données concernant les coordonnées des positions probables pour mobiles et des sites potentiels, la portée du signal émis, la sensibilité de réception aussi bien des mobiles que des capteurs à installer, le nombre minimal des signaux pour la localisation et le nombre maximal de sauts permis pour le routage entre capteurs. Une heuristique initiale de type glouton et une autre basée sur la recherche avec tabous permettront d’approcher la solution optimale. Cette solution va être comparée à une borne inférieure définie à partir d’une relaxation de certaines contraintes du modèle. Les simulations réalisées ont permis de démonter la validité de l’approche de planification. Cependant certaines limitations surgissent surtout pour la modélisation de la propagation radio. En effet, nous proposons une amélioration qui se traduit par l’intégration des mesures ou des estimations pour le niveau d’interférence des signaux propagés aussi bien des mobiles que des capteurs. À notre avis, cette approche va essentiellement garantir une localisation exacte des mobiles ainsi qu’une meilleure connectivité des noeuds du réseau de capteurs sans fil.----------ABSTRACT Wireless sensor networks continue to be without doubts a major research area. The objective of the wireless sensors network planning problem is to locate the sensors while respecting a set of performance constraints. In this work we consider coverage and connectivity constraints. Moreover we impose that each mobile station be located by the sensors (i.e. location constraints). The purpose of this work is to propose a planning strategy of wireless sensor networks. It will ensure full coverage and increased connectivity. The approach begins by proposing a formalism of combinatorial optimization model with coverage, location and connectivity constraints. The search space is discrete and the choice of potential sites is directly related to the environment of deployment characteristics. Thus, we assume known the coordinates of positions for mobile stations and potential sites, the characteristics of radio propagation, the receiver sensitivity for mobiles as well as for sensors to be installed, the minimum number of signals for the location, the maximum hops allowed for routing between sensors. An initial greedy heuristic is proposed as well as search metaheuristic. Solutions found are compared to a lower bound obtained by a relaxed version of the model. The simulations show the validity of the planning approach. However, some limitations arise especially for the modeling of radio propagation. Indeed, we propose an improvement which is reflected in the integration of measures or estimates for the level of interference signals. From our perspective, this approach will essentially guarantee an exact location of mobiles and a better connectivity of the nodes of wireless sensor network

Deterministic secure positioning in wireless sensor networks

Abstract. Position verification problem is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location information in order to fake their actual position. In this paper we propose the first deterministic distributed protocol for accurate identification of faking sensors in a WSN. Our scheme does not rely on a subset of trusted nodes that cooperate and are not allowed to misbehave. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN. On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most ⌊ n 2 ⌋−2faking sensors. When the time of flight (ToF) technique is used, our protocol manages at most ⌊ n ⌋−3 misbehaving sensors. On the negative side, we 2 prove that no deterministic protocol can identify faking sensors if their number is ⌈ n ⌉−1. Thus, our scheme is almost optimal with respect to 2 the number of faking sensors. We discuss application of our technique in the trusted sensor model. More specifically, our results can be used to minimize the number of trusted sensors that are needed to defeat faking ones