Range based sensor node localization in the presence of unknown clock skews

We deal with the positioning problem based on two-way time-of-arrival (TW-TOA) measurements in asynchronous wireless sensor networks. The optimal estimator for this problem poses a difficult global optimization problem. To avoid the drawbacks in solving the optimal estimator, we use approximations and derive linear models, which facilitate efficient solutions. In particular, we employ the least squares method and solve a general trust region subproblem to find a coarse estimate. To further refine the estimate, we linearize the measurements and obtain a linear model which can be solved using regularized least squares. Simulation results illustrate that the proposed approaches asymptotically attain the Cramér-Rao lower bound. © 2013 IEEE

Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation

Sensor networks potentially feature large numbers of nodes that can sense their environment over time, communicate with each other over a wireless network, and process information. They differ from data networks in that the network as a whole may be designed for a specific application. We study the theoretical foundations of such large scale sensor networks, addressing four fundamental issues- connectivity, capacity, clocks and function computation. To begin with, a sensor network must be connected so that information can indeed be exchanged between nodes. The connectivity graph of an ad-hoc network is modeled as a random graph and the critical range for asymptotic connectivity is determined, as well as the critical number of neighbors that a node needs to connect to. Next, given connectivity, we address the issue of how much data can be transported over the sensor network. We present fundamental bounds on capacity under several models, as well as architectural implications for how wireless communication should be organized. Temporal information is important both for the applications of sensor networks as well as their operation.We present fundamental bounds on the synchronizability of clocks in networks, and also present and analyze algorithms for clock synchronization. Finally we turn to the issue of gathering relevant information, that sensor networks are designed to do. One needs to study optimal strategies for in-network aggregation of data, in order to reliably compute a composite function of sensor measurements, as well as the complexity of doing so. We address the issue of how such computation can be performed efficiently in a sensor network and the algorithms for doing so, for some classes of functions.Comment: 10 pages, 3 figures, Submitted to the Proceedings of the IEE

Time of Flight and Fingerprinting Based Methods for Wireless Rogue Device Detection

Existing network detection techniques rely on SSIDs, network patterns or MAC addresses of genuine wireless devices to identify malicious attacks on the network. However, these device characteristics can be manipulated posing a security threat to information integrity, lowering detection accuracy, and weakening device protection. This research study focuses on empirical analysis to elaborate the relationship between received signal strength (RSSI) and distance; investigates methods to detect rogue devices and access points on Wi-Fi networks using network traffic analysis and fingerprint identification methods. In this paper, we conducted three experiments to evaluate the performance of RSSI and clock skews as features to detect rogue devices for indoor and outdoor locations. Results from the experiments suggest different devices connected to the same access point can be detected (p \u3c 0.05) using RSSI values. However, the magnitude of the difference was not consistent as devices were placed further from the same access point. Therefore, an optimal distance for maximizing the detection rate requires further examination. The random forest classifier provided the best performance with a mean accuracy of 79% across all distances. Our experiment on clock skew shows improved accuracy in using beacon timestamps to detect rogue APs on the network

TW-TOA based positioning in the presence of clock imperfections

This manuscript studies the positioning problem based on two-way time-of-arrival (TW-TOA) measurements in semi-asynchronous wireless sensor networks in which the clock of a target node is unsynchronized with the reference time. Since the optimal estimator for this problem involves difficult nonconvex optimization, two suboptimal estimators are proposed based on the squared-range least squares and the least absolute mean of residual errors. We formulated the former approach as an extended general trust region subproblem (EGTR) and propose a simple technique to solve it approximately. The latter approach is formulated as a difference of convex functions programming (DCP), which can be solved using a concave–convex procedure. Simulation results illustrate the high performance of the proposed techniques, especially for the DCP approach

A framework for evaluating countermeasures against sybil attacks in wireless sensor networks

Although Wireless Sensor Networks (WSNs) have found a niche in numerous applications, they are constrained by numerous factors. One of these important factors is security in WSNs. There are various types of security attacks that WSNs are susceptible to. The focus of this study is centred on Sybil attacks, a denial of service attack. In this type of attack, rogue nodes impersonate valid nodes by falsely claiming to possess authentic identities, thereby rendering numerous core WSN operations ineffective. The diverse nature of existing solutions poses a difficult problem for system engineers wanting to employ a best fit countermeasure. This problem is the largely unanswered question posed to all system engineers and developers alike whose goal is to design/develop a secure WSN. Resolving this dilemma proves to be quite a fascinating task, since there are numerous factors to consider and more especially one cannot assume that every application is affected by all identified factors. A framework methodology presented in this study addresses the abovementioned challenges by evaluating countermeasure effectiveness based on theoretical and practical security factors. Furthermore, a process is outlined to determine the application’s engineering requirements and the framework also suggests what security components the system engineer ought to incorporate into the application, depending on the application’s risk profile. The framework then numerically aligns these considerations, ensuring an accurate and fairly unbiased best fit countermeasure selection. Although the framework concentrates on Sybil countermeasures, the methodology can be applied to other classes of countermeasures since it answers the question of how to objectively study and compare security mechanisms that are both diverse and intended for different application environments. The report documents the design and development of a comparative framework that can be used to evaluate countermeasures against Sybil attacks in wireless sensor networks based on various criteria that will be discussed in detail. This report looks briefly at the aims and description of the research. Following this, a literature survey on the body of knowledge concerning WSN security and a discussion on the proposed methodology of a specific design approach are given. Assumptions and a short list of factors that were considered are then described. Metrics, the taxonomy for WSN countermeasures, the framework and a formal model are developed. Risk analysis and the best fit methodology are also discussed. Finally, the results and recommendations are shown for the research, after which the document is concluded.Dissertation (MEng)--University of Pretoria, 2011.Electrical, Electronic and Computer Engineeringunrestricte