Robust Node Localization for Wireless Sensor Networks PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Robust Node Localization for Wireless Sensor Networks PDF full book. Access full book title Robust Node Localization for Wireless Sensor Networks by Radu Stoleru. Download full books in PDF and EPUB format.
Author: Radu Stoleru
Publisher:
ISBN: 9780549208488
Category :
Languages : en
Pages : 344
Get Book Here
Book Description
Wireless Sensor Network (WSN) systems have been used in many promising applications including military surveillance, habitat monitoring and wildlife tracking. While many middleware services to support these applications have been designed and implemented successfully, node localization - finding the position of a sensor node - remains one of the most difficult research challenges to be solved.
Author: Radu Stoleru
Publisher:
ISBN: 9780549208488
Category :
Languages : en
Pages : 344
Get Book Here
Book Description
Wireless Sensor Network (WSN) systems have been used in many promising applications including military surveillance, habitat monitoring and wildlife tracking. While many middleware services to support these applications have been designed and implemented successfully, node localization - finding the position of a sensor node - remains one of the most difficult research challenges to be solved.
Author: Radha Poovendran
Publisher: Springer Science & Business Media
ISBN: 0387462767
Category : Technology & Engineering
Languages : en
Pages : 396
Get Book Here
Book Description
This book presents the latest research results in the area of secure localization for both wireless mobile ad hoc networks and wireless sensor networks. It is suitable as a text for computer science courses in wireless systems and security. It includes implementation studies with mica2 mote sensors. Due to the open spectrum nature of wireless communication, it is subject to attacks and intrusions. Hence the wireless network synchronization needs to be both robust and secure. Furthermore, issues such as energy constraints and mobility make the localization process even more challenging. The book will also interest developers of secure wireless systems.
Author: Xue Zhang
Publisher: Springer Nature
ISBN: 3031016831
Category : Technology & Engineering
Languages : en
Pages : 58
Get Book Here
Book Description
In sensor network applications, measured data are often meaningful only when the location is accurately known. In this booklet, we study research problems associated with node localization in wireless sensor networks. We describe sensor network localization problems in terms of a detection and estimation framework and we emphasize specifically a cooperative process where sensors with known locations are used to localize nodes at unknown locations. In this class of problems, even if the location of a node is known, the wireless links and transmission modalities between two nodes may be unknown. In this case, sensor nodes are used to detect the location and estimate pertinent data transmission activities between nodes. In addition to the broader problem of sensor localization, this booklet studies also specific localization measurements such as time of arrival (TOA), received signal strength (RSS), and direction of arrival (DOA). The sequential localization algorithm, which uses a subset of sensor nodes to estimate nearby sensor nodes' locations is discussed in detail. Extensive bibliography is given for those readers who want to delve further into specific topics.
Author: Seyed Alireza Motevallian
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
In the localization of wireless sensor networks it has been observed that there are network topologies on which any localization technique may produce large positional errors even if the distance measurements are perfect. This has motivated researchers to study the conditions which ensure the unique localizability of a network. One common issue in sensor networks is the high possibility of node failures which may cause a previously localizable network to become non-localizable. To address this, in the first part of thesis, we propose some level of robustness by introducing the notion of a p-node robustly localizable network: a localizable network which retains its localizability upon the loss of any set of p-1 nodes. We characterize such networks, using graph theory, by deriving a set of necessary and (distinct) sufficient conditions for the network graph. We also propose several approaches to restore the p-node robust localizability of the network after its topology is changed. It is well-known that, even with perfect distance measurements, there are networks which cannot be localized in polynomial time. This motivates us to seek some efficiency properties for network localization beyond mere localizability. Hence, we focus on two common criteria of computational efficiency and distributedness and study network topologies which can be localized with low computational complexity and in a distributed fashion. In this light, in the second part of thesis, we focus on bilaterative networks, a superset of trilaterative networks. Bilaterative networks are localizable with simple calculations and in a sequential and distributed manner. However, the localization algorithms which can localize bilaterative networks may not finish in polynomial time with respect to the node count. Our contribution in this context is to analyse the computational complexity of bilaterative localization techniques. By constructing a random graphical model of the network, we show that with a probability close to 1 a bilaterative localization technique will finish in polynomial time on almost any random network without exponential-size memory requirements. The focus of the last part of thesis is on the distributed map-stitching techniques. These techniques generally work in three steps aiming to reduce the localization computational complexity; (1) splitting the network into small subnetworks; (2) localizing each subnetwork locally; (3) stitching the local maps together. A pair of subnetworks is stitchable if they satisfy certain constraints. To the best of our knowledge, in existing map-stitching techniques, two subnetworks are declared as stitchable if they share at least 3 nodes. However, from the graph-theoretical studies related to localizability, there are also other configurations with fewer number of common nodes than 3 (including zero) where the union of the two subnetworks is localizable. We propose a novel stitching technique that can serve all stitchable configurations not been addressed so far. This considerably expands the class of networks which can be localized in a distributed manner. Based on this technique, we propose a new localization algorithm which outperforms all the existing distributed localization algorithms in terms of the number of localized nodes while keeping the positional error at a comparable level.
Author: Mao, Guoqiang
Publisher: IGI Global
ISBN: 1605663972
Category : Computers
Languages : en
Pages : 526
Get Book Here
Book Description
Wireless localization techniques are an area that has attracted interest from both industry and academia, with self-localization capability providing a highly desirable characteristic of wireless sensor networks. Localization Algorithms and Strategies for Wireless Sensor Networks encompasses the significant and fast growing area of wireless localization techniques. This book provides comprehensive and up-to-date coverage of topics and fundamental theories underpinning measurement techniques and localization algorithms. A useful compilation for academicians, researchers, and practitioners, this Premier Reference Source contains relevant references and the latest studies emerging out of the wireless sensor network field.
Author: Mark Terwilliger (Computer scientist)
Publisher:
ISBN:
Category : Sensor networks
Languages : en
Pages : 0
Get Book Here
Book Description
With the proliferation of wireless sensor networks, providing location-aware technology and services to new applications have become important for developers. Localization is the problem of determining the positions of nodes in an ad hoc network. With the constrained resources of network sensors, providing robust localization services remains a fundamental research challenge facing the entire sensor network development community. The initial localization problem that we addressed was to design and develop a working system that could locate equipment, such as a laptop or video projector. Ferret, the localization system developed, uses two different ranging techniques to help locate an object to within one meter. Our next goal was to identify the locations of all nodes in a sensor network given the locations of a small subset of nodes. The system we developed, LESS or Localization using Evolution Strategies in Sensomets, provides substantial energy savings over existing techniques while providing comparable accuracy. We then introduce an efficient location discovery algorithm that bounds the localization error. Our algorithm, based on finding the smallest circle enclosing the intersection of n disks, runs in O(n ) time. We extend our work to the problem of finding the smallest disk that includes the set of points common to n disks and excluded from the interiors of m other disks. Many localization techniques say that a node can either be localized or it cannot. We present a location discovery algorithm that provides, for every node in the network, a position estimate, as well as an associated error bound and confidence level. We provide a versatile framework that allows users to perform localization queries based on the required accuracy and certainty. Ensuring coverage of a wireless sensor network is critical in many applications. Most schemes that analyze and implement coverage assume that sensor locations are known. For large sensor networks, errors occur when estimating node positions. Based on the errors that arise from the localization process, we present coverage algorithms that associate a confidence level with the coverage. We introduce a system that handles user coverage queries based on the coverage and certainty a situation requires.
Author: Nikhil Bhagwat
Publisher:
ISBN:
Category : Computer architecture
Languages : en
Pages : 100
Get Book Here
Book Description
Localization of a wireless device or a sensor node has been a problem of great importance in recent years. Location services are becoming an essential part of the traditional wireless networks as well as the wireless sensor networks. Indoor localization in particular has been an issue of interest in recent studies since GPS is not suitable for indoor environments. The main issue in target node location estimation is the distance estimates affected by the non-line-of-sight (NLOS) signal measurements. In any practical setting, the NLOS errors are inevitable and need to be mitigated in order to achieve acceptable accuracy. In this work, first a theoretical analysis of effect of bias on the localization accuracy is performed. Then, a novel technique is presented which reduces the adverse effects of bias by utilizing the topological diversity provided by the unique beacon combinations from the power set of N(>3) beacons. The proposed approach consists of two complementary weighted average methods combined to provide a high level of robustness. The simulation and empirical results show that the presented technique is effective independent of the bias distribution. Thus it can be implemented on top of variety of existing localization methods in wireless networks to mitigate the adverse effects of NLOS propagation and achieve high accuracy in a practical scenario.
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 29
Get Book Here
Book Description
Many distributed monitoring applications of Wireless Sensor Networks (WSNs) require the location information of a sensor node. In this article, we address the problem of enabling nodes of Wireless Sensor Networks to determine their location in an untrusted environment, known as the secure localization problem. We propose a novel range-independent localization algorithm called SeRLoc that is well suited to a resource constrained environment such as a WSN. SeRLoc is a distributed algorithm based on a two-tier network architecture that allows sensors to passively determine their location without interacting with other sensors. We show that SeRLoc is robust against known attacks on WSNs such as the wormhole attack, the Sybil attack, and compromise of network entities and analytically compute the probability of success for each attack. We also compare the performance of SeRLoc with state-of-the-art range-independent localization schemes and show that SeRLoc has better performance.
Author: Ioanis Nikolaidis
Publisher: Springer Science & Business Media
ISBN: 3642147844
Category : Business & Economics
Languages : en
Pages : 229
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 9th International Conference on Ad-Hoc, Mobile, and Wireless Networks, ADHOC-NOW 2010, held in Edmonton, Canada, in August 2010. The 16 revised full papers were carefully reviewed and selected from 43 submissions. The accepted papers cover topics in routing/broadcasting/multicasting protocols; energy efficiency; sensor coverage; scheduling algorithms; localization; mobility modeling; data collection and processing; and vehicular networks.
Author: Haseebulla M. Khan
Publisher:
ISBN:
Category : Cell phones
Languages : en
Pages : 198
Get Book Here
Book Description
