Dead Reckoning Localization Technique for Mobile Wireless Sensor Networks

Localization in wireless sensor networks not only provides a node with its geographical location but also a basic requirement for other applications such as geographical routing. Although a rich literature is available for localization in static WSN, not enough work is done for mobile WSNs, owing to the complexity due to node mobility. Most of the existing techniques for localization in mobile WSNs uses Monte-Carlo localization, which is not only time-consuming but also memory intensive. They, consider either the unknown nodes or anchor nodes to be static. In this paper, we propose a technique called Dead Reckoning Localization for mobile WSNs. In the proposed technique all nodes (unknown nodes as well as anchor nodes) are mobile. Localization in DRLMSN is done at discrete time intervals called checkpoints. Unknown nodes are localized for the first time using three anchor nodes. For their subsequent localizations, only two anchor nodes are used. The proposed technique estimates two possible locations of a node Using Bezouts theorem. A dead reckoning approach is used to select one of the two estimated locations. We have evaluated DRLMSN through simulation using Castalia simulator, and is compared with a similar technique called RSS-MCL proposed by Wang and Zhu .Comment: Journal Paper, IET Wireless Sensor Systems, 201

A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

Evaluation and Analysis of Node Localization Power Cost in Ad-Hoc Wireless Sensor Networks with Mobility

One of the key concerns with location-aware Ad-hoc Wireless Sensor Networks (AWSNs) is how sensor nodes determine their position. The inherent power limitations of an AWSN along with the requirement for long network lifetimes makes achieving fast and power-efficient localization vital. This research examines the cost (in terms of power) of network irregularities on communications and localization in an AWSN. The number of data bits transmitted and received are significantly affected by varying levels of mobility, node degree, and network shape. The concurrent localization approach, used by the APS-Euclidean algorithm, has significantly more accurate position estimates with a higher percentage of nodes localized, while requiring 50% less data communications overhead, than the Map-Growing algorithm. Analytical power models capable of estimating the power required to localize are derived. The average amount of data communications required by either of these algorithms in a highly mobile network with a relatively high degree consumes less than 2.0% of the power capacity of an average 560mA-hr battery. This is less than expected and contrary to the common perception that localization algorithms consume a significant amount of a node\u27s power

Improvement of range-free localization technology by a novel DV-hop protocol in wireless sensor networks

International audienceLocalization is a fundamental issue for many applications in wireless sensor networks. Without the need of additional ranging devices, the range-free localization technology is a cost-effective solution for low-cost indoor and outdoor wireless sensor networks. Among range-free algorithms, DV-hop (Distance Vector - hop) has the advantage to localize the mobile nodes which has less than three neighbour anchors. Based on the original DV-hop algorithm, this paper presents two improved algorithms (Checkout DV-hop and Selective 3-Anchor DV-hop). Checkout DV-hop algorithm estimates the mobile node position by using the nearest anchor, while Selective 3-Anchor DV-hop algorithm chooses the best 3 anchors to improve localization accuracy. Then, in order to implement these DV-hop based algorithms in network scenarios, a novel DV-hop localization protocol is proposed. This new protocol is presented in detail in this paper, including the format of data payloads, the improved collision reduction method E-CSMA/CA, as well as parameters used in deciding the end of each DV-hop step. Finally, using our localization protocol, we investigate the performance of typical DV-hop based algorithms in terms of localization accuracy, mobility, synchronization and overhead. Simulation results prove that Selective 3-Anchor DV-hop algorithm offers the best performance compared to Checkout DV-hop and the original DV-hop algorithm

Quarantine region scheme to mitigate spam attacks in wireless sensor networks

The Quarantine Region Scheme (QRS) is introduced to defend against spam attacks in wireless sensor networks where malicious antinodes frequently generate dummy spam messages to be relayed toward the sink. The aim of the attacker is the exhaustion of the sensor node batteries and the extra delay caused by processing the spam messages. Network-wide message authentication may solve this problem with a cost of cryptographic operations to be performed over all messages. QRS is designed to reduce this cost by applying authentication only whenever and wherever necessary. In QRS, the nodes that detect a nearby spam attack assume themselves to be in a quarantine region. This detection is performed by intermittent authentication checks. Once quarantined, a node continuously applies authentication measures until the spam attack ceases. In the QRS scheme, there is a tradeoff between the resilience against spam attacks and the number of authentications. Our experiments show that, in the worst-case scenario that we considered, a not quarantined node catches 80 percent of the spam messages by authenticating only 50 percent of all messages that it processe

Efficient Range-Free Monte-Carlo-Localization for Mobile Wireless Sensor Networks

Das Hauptproblem von Lokalisierungsalgorithmen für WSNs basierend auf Ankerknoten ist die Abhängigkeit von diesen. Mobilität im Netzwerk kann zu Topologien führen, in denen einzelne Knoten oder ganze Teile des Netzwerks temporär von allen Ankerknoten isoliert werden. In diesen Fällen ist keine weitere Lokalisierung möglich. Dies wirkt sich primär auf den Lokalisierungsfehler aus, der in diesen Fällen stark ansteigt. Des weiteren haben Betreiber von Sensornetzwerken Interesse daran, die Anzahl der kosten- und wartungsintensiveren Ankerknoten auf ein Minimum zu reduzieren. Dies verstärkt zusätzlich das Problem von nicht verfügbaren Ankerknoten während des Netzwerkbetriebs. In dieser Arbeit werden zunächst die Vor- und Nachteile der beiden großen Hauptkategorien von Lokalisierungsalgorithmen (range-based und range-free Verfahren) diskutiert und eine Studie eines oft für range-based Lokalisierung genutzten Distanzbestimmungsverfahren mit Hilfe des RSSI vorgestellt. Danach werden zwei neue Varianten für ein bekanntes range-free Lokalisierungsverfahren mit Namen MCL eingeführt. Beide haben zum Ziel das Problem der temporär nicht verfügbaren Ankerknoten zu lösen, bedienen sich dabei aber unterschiedlicher Mittel. SA-MCL nutzt ein dead reckoning Verfahren, um die Positionsschätzung vom letzten bekannten Standort weiter zu führen. Dies geschieht mit Hilfe von zusätzlichen Sensorinformationen, die von einem elektronischen Kompass und einem Beschleunigungsmesser zur Verfügung gestellt werden. PO-MCL hingegen nutzt das Mobilitätsverhalten von einigen Anwendungen in Sensornetzwerken aus, bei denen sich alle Knoten primär auf einer festen Anzahl von Pfaden bewegen, um den Lokalisierungsprozess zu verbessern. Beide Methoden werden durch detaillierte Netzwerksimulationen evaluiert. Im Fall von SA-MCL wird außerdem eine Implementierung auf echter Hardware vorgestellt und eine Feldstudie in einem mobilen Sensornetzwerk durchgeführt. Aus den Ergebnissen ist zu sehen, dass der Lokalisierungsfehler in Situationen mit niedriger Ankerknotendichte im Fall von SA-MCL um bis zu 60% reduziert werden kann, beziehungsweise um bis zu 50% im Fall von PO-MCL.

Localisation in wireless sensor networks for disaster recovery and rescuing in built environments

A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Doctor of PhilosophyProgress in micro-electromechanical systems (MEMS) and radio frequency (RF) technology has fostered the development of wireless sensor networks (WSNs). Different from traditional networks, WSNs are data-centric, self-configuring and self-healing. Although WSNs have been successfully applied in built environments (e.g. security and services in smart homes), their applications and benefits have not been fully explored in areas such as disaster recovery and rescuing. There are issues related to self-localisation as well as practical constraints to be taken into account. The current state-of-the art communication technologies used in disaster scenarios are challenged by various limitations (e.g. the uncertainty of RSS). Localisation in WSNs (location sensing) is a challenging problem, especially in disaster environments and there is a need for technological developments in order to cater to disaster conditions. This research seeks to design and develop novel localisation algorithms using WSNs to overcome the limitations in existing techniques. A novel probabilistic fuzzy logic based range-free localisation algorithm (PFRL) is devised to solve localisation problems for WSNs. Simulation results show that the proposed algorithm performs better than other range free localisation algorithms (namely DVhop localisation, Centroid localisation and Amorphous localisation) in terms of localisation accuracy by 15-30% with various numbers of anchors and degrees of radio propagation irregularity. In disaster scenarios, for example, if WSNs are applied to sense fire hazards in building, wireless sensor nodes will be equipped on different floors. To this end, PFRL has been extended to solve sensor localisation problems in 3D space. Computational results show that the 3D localisation algorithm provides better localisation accuracy when varying the system parameters with different communication/deployment models. PFRL is further developed by applying dynamic distance measurement updates among the moving sensors in a disaster environment. Simulation results indicate that the new method scales very well