Doctor of Philosophy

dissertationIn wireless sensor networks, knowing the location of the wireless sensors is critical in many remote sensing and location-based applications, from asset tracking, and structural monitoring to geographical routing. For a majority of these applications, received signal strength (RSS)-based localization algorithms are a cost effective and viable solution. However, RSS measurements vary unpredictably because of fading, the shadowing caused by presence of walls and obstacles in the path, and non-isotropic antenna gain patterns, which affect the performance of the RSS-based localization algorithms. This dissertation aims to provide efficient models for the measured RSS and use the lessons learned from these models to develop and evaluate efficient localization algorithms. The first contribution of this dissertation is to model the correlation in shadowing across link pairs. We propose a non-site specific statistical joint path loss model between a set of static nodes. Radio links that are geographically proximate often experience similar environmental shadowing effects and thus have correlated shadowing. Using a large number of multi-hop network measurements in an ensemble of indoor and outdoor environments, we show statistically significant correlations among shadowing experienced on different links in the network. Finally, we analyze multihop paths in three and four node networks using both correlated and independent shadowing models and show that independent shadowing models can underestimate the probability of route failure by a factor of two or greater. Second, we study a special class of algorithms, called kernel-based localization algorithms, that use kernel methods as a tool for learning correlation between the RSS measurements. Kernel methods simplify RSS-based localization algorithms by providing a means to learn the complicated relationship between RSS measurements and position. We present a common mathematical framework for kernel-based localization algorithms to study and compare the performance of four different kernel-based localization algorithms from the literature. We show via simulations and an extensive measurement data set that kernel-based localization algorithms can perform better than model-based algorithms. Results show that kernel methods can achieve an RMSE up to 55% lower than a model-based algorithm. Finally, we propose a novel distance estimator for estimating the distance between two nodes a and b using indirect link measurements, which are the measurements made between a and k, for k ? b and b and k, for k ? a. Traditionally, distance estimators use only direct link measurement, which is the pairwise measurement between the nodes a and b. The results show that the estimator that uses indirect link measurements enables better distance estimation than the estimator that uses direct link measurements

On the Fundamentals of Stochastic Spatial Modeling and Analysis of Wireless Networks and its Impact to Channel Losses

With the rapid evolution of wireless networking, it becomes vital to ensure transmission reliability, enhanced connectivity, and efficient resource utilization. One possible pathway for gaining insight into these critical requirements would be to explore the spatial geometry of the network. However, tractably characterizing the actual position of nodes for large wireless networks (LWNs) is technically unfeasible. Thus, stochastical spatial modeling is commonly considered for emulating the random pattern of mobile users. As a result, the concept of random geometry is gaining attention in the field of cellular systems in order to analytically extract hidden features and properties useful for assessing the performance of networks. Meanwhile, the large-scale fading between interacting nodes is the most fundamental element in radio communications, responsible for weakening the propagation, and thus worsening the service quality. Given the importance of channel losses in general, and the inevitability of random networks in real-life situations, it was then natural to merge these two paradigms together in order to obtain an improved stochastical model for the large-scale fading. Therefore, in exact closed-form notation, we generically derived the large-scale fading distributions between a reference base-station and an arbitrary node for uni-cellular (UCN), multi-cellular (MCN), and Gaussian random network models. In fact, we for the first time provided explicit formulations that considered at once: the lattice profile, the users’ random geometry, the spatial intensity, the effect of the far-field phenomenon, the path-loss behavior, and the stochastic impact of channel scatters. Overall, the results can be useful for analyzing and designing LWNs through the evaluation of performance indicators. Moreover, we conceptualized a straightforward and flexible approach for random spatial inhomogeneity by proposing the area-specific deployment (ASD) principle, which takes into account the clustering tendency of users. In fact, the ASD method has the advantage of achieving a more realistic deployment based on limited planning inputs, while still preserving the stochastic character of users’ position. We then applied this inhomogeneous technique to different circumstances, and thus developed three spatial-level network simulator algorithms for: controlled/uncontrolled UCN, and MCN deployments

Trading of cloud of things resources

Cloud Computing and Internet of Things (IoT) continue to emerge as revolutionary paradigms to support wide range of real world scenarios. They promise benefits for increasing number of applications, including health, smart cities, smart homes, smart logistics, video surveillance, energy and environmental monitoring. Independent deployments of each technology have issues that can be resolved partially or fully by integrating Cloud and IoT. This integration forms a new paradigm that is called Cloud of Things (CoT)supporting Everything as a Service (XaaS) service model. Despite the issues integration resolves, the integrated services will suffer from issues that Cloud and IoT offerings previously encountered. This includes interoperability, ambiguous SLAs, QoS, elasticity and reliability concerns. This paper argues that commoditising CoT resources will help resolving these issues. This paper aims to; 1) review the state-of-the-art in CoT literature 2) propose a conceptual model for CoT marketplace and its basic trading processes

Collaborative, Intelligent, and Adaptive Systems for the Low-Power Internet of Things

With the emergence of the Internet of Things (IoT), more and more devices are getting equipped with communication capabilities, often via wireless radios. Their deployments pave the way for new and mission-critical applications: cars will communicate with nearby vehicles to coordinate at intersections; industrial wireless closed-loop systems will improve operational safety in factories; while swarms of drones will coordinate to plan collision-free trajectories. To achieve these goals, IoT devices will need to communicate, coordinate, and collaborate over the wireless medium. However, these envisioned applications necessitate new characteristics that current solutions and protocols cannot fulfill: IoT devices require consistency guarantees from their communication and demand for adaptive behavior in complex and dynamic environments.In this thesis, we design, implement, and evaluate systems and mechanisms to enable safe coordination and adaptivity for the smallest IoT devices. To ensure consistent coordination, we bring fault-tolerant consensus to low-power wireless communication and introduce Wireless Paxos, a flavor of the Paxos algorithm specifically tailored to low-power IoT. We then present STARC, a wireless coordination mechanism for intersection management combining commit semantics with synchronous transmissions. To enable adaptivity in the wireless networking stack, we introduce Dimmer and eAFH. Dimmer combines Reinforcement Learning and Multi-Armed Bandits to adapt its communication parameters and counteract the adverse effects of wireless interference at runtime while optimizing energy consumption in normal conditions. eAFH provides dynamic channel management in Bluetooth Low Energy by excluding and dynamically re-including channels in scenarios with mobility. Finally, we demonstrate with BlueSeer that a device can classify its environment, i.e., recognize whether it is located in a home, office, street, or transport, solely from received Bluetooth Low Energy signals fed into an embedded machine learning model. BlueSeer therefore increases the intelligence of the smallest IoT devices, allowing them to adapt their behaviors to their current surroundings

The role of communication systems in smart grids: Architectures, technical solutions and research challenges

The purpose of this survey is to present a critical overview of smart grid concepts, with a special focus on the role that communication, networking and middleware technologies will have in the transformation of existing electric power systems into smart grids. First of all we elaborate on the key technological, economical and societal drivers for the development of smart grids. By adopting a data-centric perspective we present a conceptual model of communication systems for smart grids, and we identify functional components, technologies, network topologies and communication services that are needed to support smart grid communications. Then, we introduce the fundamental research challenges in this field including communication reliability and timeliness, QoS support, data management services, and autonomic behaviors. Finally, we discuss the main solutions proposed in the literature for each of them, and we identify possible future research directions