GPS based Multi-hop Communication with Localization in Subterranean Wireless Sensor Networks

AbstractOur research work proposes Multi-hop Communication with Localization (MCL), a strategy to localize and route information to nodes present in such areas by determining angles and distances of consecutive nodes hop by hop towards the Base Station. Based on the application area, Subterranean Wireless Sensor Networks are specifically designed to detect underground abnormal conditions and reported to the base station. Many protocols use distance between the nodes as one of the criteria for multi-hop communication in the network. It is found to be necessary to know the location of the nodes and the distance between the nodes in many power optimization protocols. But the query of how to attain the distance or the location arises in the same. The main objective here is to design a technique to both localize and transmit data efficiently in subterranean areas. Initially there is a group of nodes deployed in the underground areas all of which bond to a sink that is further connected to the Base Station. It is possible to locate all the nodes through GPS which can be used as a reference in the worst case scenario by the Base Station. The sink node has a Node Transmission Area (NTA) within which a node can be directly recognized by the sink node otherwise it finds the target node through the intermediate nodes. Our empirical work proves the computational method on attaining the performance

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

Multi-hop localization in cluttered environments

Range-based localization is a widely used technique for position estimation where distances are measured to anchors, nodes with known positions, and the position is analytically estimated. It offers the benefits of providing high localization accuracy and involving simple operation over multiple deployments. Examples are the Global Positioning System (GPS) and network-based cellular handset localization. Range-based localization is promising for a range of applications, such as robot deployment in emergency scenarios or monitoring industrial processes. However, the presence of clutter in some of these environments leads to a severe degradation of the localization accuracy due to non-line-of-sight (NLOS) signal propagation. Moreover, current literature in NLOS-mitigation techniques requires that the NLOS distances constitute only a minority of the total number of distances to anchors. The key ideas proposed in the dissertation are: 1) multi-hop localization offers significant advantages over single-hop localization in NLOS-prone environments; and 2) it is possible to further reduce position errors by carefully placing intermediate nodes among the clutter to minimize multi-hop distances between the anchors and the unlocalized node. We demonstrate that shortest path distance (SPD) based multi-hop localization algorithms, namely DV-Distance and MDS-MAP, perform the best among other competing techniques in NLOS-prone settings. However, with random node placement, these algorithms require large node densities to produce high localization accuracy. To tackle this, we show that the strategic placement of a relatively small number of nodes in the clutter can offer significant benefits. We propose two algorithms for node placement: first, the Optimal Placement for DV-Distance (OPDV) focuses on obtaining the optimal positions of the nodes for a known clutter topology; and second, the Adaptive Placement for DV-Distance (APDV) offers a distributed control technique that carefully moves nodes in the monitored area to achieve localization accuracies close to those achieved by OPDV. We evaluate both algorithms via extensive simulations, as well as demonstrate the APDV algorithm on a real robotic hardware platform. We finally demonstrate how the characteristics of the clutter topology influence single-hop and multi-hop distance errors, which in turn, impact the performance of the proposed algorithms.</p