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

Cellular Underwater Wireless Optical CDMA Network: Potentials and Challenges

Underwater wireless optical communications is an emerging solution to the expanding demand for broadband links in oceans and seas. In this paper, a cellular underwater wireless optical code division multiple-access (UW-OCDMA) network is proposed to provide broadband links for commercial and military applications. The optical orthogonal codes (OOC) are employed as signature codes of underwater mobile users. Fundamental key aspects of the network such as its backhaul architecture, its potential applications and its design challenges are presented. In particular, the proposed network is used as infrastructure of centralized, decentralized and relay-assisted underwater sensor networks for high-speed real-time monitoring. Furthermore, a promising underwater localization and positioning scheme based on this cellular network is presented. Finally, probable design challenges such as cell edge coverage, blockage avoidance, power control and increasing the network capacity are addressed.Comment: 11 pages, 10 figure

Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-M&N schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust

Locating nodes in mobile sensor networks more accurately and faster

2007-2008 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

Cooperative localization in mobile networks using nonparametric variants of belief propagation

Of the many state-of-the-art methods for cooperative localization in wireless sensor networks (WSN), only very few adapt well to mobile networks. The main problems of the well-known algorithms, based on nonparametric belief propagation (NBP), are the high communication cost and inefficient sampling techniques. Moreover, they either do not use smoothing or just apply it o ine. Therefore, in this article, we propose more flexible and effcient variants of NBP for cooperative localization in mobile networks. In particular, we provide: i) an optional 1-lag smoothing done almost in real-time, ii) a novel low-cost communication protocol based on package approximation and censoring, iii) higher robustness of the standard mixture importance sampling (MIS) technique, and iv) a higher amount of information in the importance densities by using the population Monte Carlo (PMC) approach, or an auxiliary variable. Through extensive simulations, we confirmed that all the proposed techniques outperform the standard NBP method

Wireless Sensor Networks for Underwater Localization: A Survey

Autonomous Underwater Vehicles (AUVs) have widely deployed in marine investigation and ocean exploration in recent years. As the fundamental information, their position information is not only for data validity but also for many real-world applications. Therefore, it is critical for the AUV to have the underwater localization capability. This report is mainly devoted to outline the recent advance- ment of Wireless Sensor Networks (WSN) based underwater localization. Several classic architectures designed for Underwater Acoustic Sensor Network (UASN) are brie y introduced. Acoustic propa- gation and channel models are described and several ranging techniques are then explained. Many state-of-the-art underwater localization algorithms are introduced, followed by the outline of some existing underwater localization systems