Parametric Loop Division for 3D Localization in Wireless Sensor Networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Ahmad T
PROVIDER: S-EPMC5539484 | biostudies-other | 2017 Jul
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Signal strength-based positioning in wireless sensor networks is a key technology for seamless, ubiquitous localization, especially in areas where Global Navigation Satellite System (GNSS) signals propagate poorly. To enable wireless local area network (WLAN) location fingerprinting in larger areas while maintaining accuracy, methods to reduce the effort of radio map creation must be consolidated and automatized. Gaussian process regression has been applied to overcome this issue, also with auspicious results, but the fit of the model was never thoroughly assessed. Instead, most studies trained a readily available model, relying on the zero mean and squared exponential covariance function, without further scrutinization. This paper studies the Gaussian process regression model selection for WLAN fingerprinting in indoor and outdoor environments. We train several models for indoor/outdoor- and combined areas; we evaluate them quantitatively and compare them by means of adequate model measures, hence assessing the fit of these models directly. To illuminate the quality of the model fit, the residuals of the proposed model are investigated, as well. Comparative experiments on the positioning performance verify and conclude the model selection. In this way, we show that the standard model is not the most appropriate, discuss alternatives and present our best candidate.
| S-EPMC4610506 | biostudies-literature
Project description:Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.
| S-EPMC4436320 | biostudies-literature
Project description:Object localization plays a key role in many popular applications of Wireless Multimedia Sensor Networks (WMSN) and as a result, it has acquired a significant status for the research community. A significant body of research performs this task without considering node orientation, object geometry and environmental variations. As a result, the localized object does not reflect the real world scenarios. In this paper, a novel object localization scheme for WMSN has been proposed that utilizes range free localization, computer vision, and principle component analysis based algorithms. The proposed approach provides the best possible approximation of distance between a wmsn sink and an object, and the orientation of the object using image based information. Simulation results report 99% efficiency and an error ratio of 0.01 (around 1 ft) when compared to other popular techniques.
| S-EPMC4631602 | biostudies-literature
Project description:Wireless sensor networks (WSNs) are ubiquitous and pervasive, and therefore; highly susceptible to a number of security attacks. Denial of Service (DoS) attack is considered the most dominant and a major threat to WSNs. Moreover, the wormhole attack represents one of the potential forms of the Denial of Service (DoS) attack. Besides, crafting the wormhole attack is comparatively simple; though, its detection is nontrivial. On the contrary, the extant wormhole defense methods need both specialized hardware and strong assumptions to defend against static and dynamic wormhole attack. The ensuing paper introduces a novel scheme to detect wormhole attacks in a geographic routing protocol (DWGRP). The main contribution of this paper is to detect malicious nodes and select the best and the most reliable neighbors based on pairwise key pre-distribution technique and the beacon packet. Moreover, this novel technique is not subject to any specific assumption, requirement, or specialized hardware, such as a precise synchronized clock. The proposed detection method is validated by comparisons with several related techniques in the literature, such as Received Signal Strength (RSS), Authentication of Nodes Scheme (ANS), Wormhole Detection uses Hound Packet (WHOP), and Wormhole Detection with Neighborhood Information (WDI) using the NS-2 simulator. The analysis of the simulations shows promising results with low False Detection Rate (FDR) in the geographic routing protocols.
| S-EPMC4300191 | biostudies-literature
Project description:A new methodology is proposed for the analysis, modeling and forecasting of data collected from a wireless sensor network. Our approach is considered in the framework of a functional data analysis paradigm where observed data is represented in a functional form. To reduce dimensionality, functional principal components analysis is applied to highlight important underlying characteristics and find patterns of variations. The principal scores are modeled with tensor product smooths that allow for smoothing over space and time. The model is then used for simultaneous spatial prediction at unsampled locations and to forecast future observations. We consider soil temperature data from a wireless sensor network of 50 sensor nodes in two different land types (grassland and forest) observed during 60 consecutive days in private property close to Yass, New South Wales, Australia.
| S-EPMC4493908 | biostudies-literature
Project description:The time synchronization protocol is indispensable in various applications of wireless sensor networks, such as scheduling, monitoring, and tracking. Numerous protocols and algorithms have been proposed in recent decades, and many of them provide micro-scale resolutions. However, designing and implementing a time synchronization protocol in a practical wireless network is very challenging compared to implementation in a wired network; this is because its performance can be deteriorated significantly by many factors, including hardware quality, message delay jitter, ambient environment, and network topology. In this study, we measure the performance of the Flooding Time Synchronization Protocol (FTSP) and Gradient Time Synchronization Protocol (GTSP) in terms of practical network conditions, such as message delay jitter, synchronization period, network topology, and packet loss. This study provides insights into the operation and optimization of time synchronization protocols. In addition, the performance evaluation identifies that FTSP is highly affected by message delay jitter due to error accumulation over multi-hops. We demonstrate that the proposed extended version of the FTSP (E-FTSP) alleviates the effect of message delay jitter and enhances the overall performance of FTSP in terms of error, time, and other factors.
| S-EPMC6651869 | biostudies-literature
Project description:Wireless sensor networks (WSNs) are networks formed by organizing and combining tens of thousands of sensor nodes freely through wireless communication technology. WSNs are commonly affected by various attacks, such as identity theft, black holes, wormholes, protocol spoofing, etc. As one of the more severe threats, wormholes create passive attacks that are hard to detect and eliminate. Since WSN is often used in the tactical network field, a planned secure network is essential for military applications with high security. Guard nodes are traffic monitoring nodes used to supervise neighbors' data communication around the tactical networks. Therefore, this work proposes a Quality of Service (QoS) security mechanism to select multiple dual-layer guard nodes at different paths of the WSN based on the path qualities to detect wormholes. The entire network's links are categorized into high, normal, and low priority levels. As such, this study aimed to confirm the security of high priority nodes and links in the tactical network, avoid excessive overhead, and provide random security facilities to all nodes. The proposed measures of the QoS-based security provision, including link cluster formation, guard node selection, authenticated guard node identification, and intrusion detection, ensure economic and efficient network communication with different quality levels.
| S-EPMC10495966 | biostudies-literature
Project description:The Global Positioning System (GPS) is unable to provide precise localization services indoors, which has led to wireless sensor network (WSN) localization technology becoming a hot research issue in the field of indoor location. At present, the ranging technology of wireless sensor networks based on received signal strength has been extensively used in indoor positioning. However, wireless signals have serious multipath effects in indoor environments. In order to reduce the adverse influence of multipath effects on distance estimation between nodes, a multi-channel ranging localization algorithm based on signal diversity is herein proposed. In real indoor environments, the parameters used for multi-channel localization algorithms are generally unknown or time-varying. In order to increase the positioning accuracy of the multi-channel location algorithm in a multipath environment, we propose an optimal multi-channel trilateration positioning algorithm (OMCT) by establishing a novel multi-objective evolutionary model. The presented algorithm utilizes a three-edge constraint to prevent the traditional multi-channel localization algorithm falling into local optima. The results of a large number of practical experiments and numerical simulations show that no matter how the channel number and multipath number change, the positioning error of our presented algorithm is always smaller compared with that of the state-of-the-art algorithm.
| S-EPMC7146489 | biostudies-literature
Project description:Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node) as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network.
| S-EPMC5539798 | biostudies-other
Project description:Wireless sensor networks (WSNs) are widely applied in industrial manufacturing systems. By means of centralized control, the real-time requirement and reliability can be provided by WSNs in industrial production. Furthermore, many approaches reserve resources for situations in which the controller cannot perform centralized resource allocation. The controller assigns these resources as it becomes aware of when and where accidents have occurred. However, the reserved resources are limited, and such incidents are low-probability events. In addition, resource reservation may not be effective since the controller does not know when and where accidents will actually occur. To address this issue, we improve the reliability of scheduling for emergency tasks by proposing a method based on a stealing mechanism. In our method, an emergency task is transmitted by stealing resources allocated to regular flows. The challenges addressed in our work are as follows: (1) emergencies occur only occasionally, but the industrial system must deliver the corresponding flows within their deadlines when they occur; (2) we wish to minimize the impact of emergency flows by reducing the number of stolen flows. The contributions of this work are two-fold: (1) we first define intersections and blocking as new characteristics of flows; and (2) we propose a series of distributed routing algorithms to improve the schedulability and to reduce the impact of emergency flows. We demonstrate that our scheduling algorithm and analysis approach are better than the existing ones by extensive simulations.
| S-EPMC5539495 | biostudies-other