Long-Term Stable Communication in Centrally Scheduled Low-Power Wireless Networks

With the emergence of the Internet of Things (IoT), more devices are connected than ever before. Most of these communicate wirelessly, forming Wireless Sensor Networks. In recent years, there has been a shift from personal networks, like Smart Home, to industrial networks. Industrial networks monitor pipelines or handle the communication between robots in factories. These new applications form the Industrial Internet of Things (IIoT). Many industrial applications have high requirements for communication, higher than the requirements of common IoT networks. Communications must stick to hard deadlines to avoid harm, and they must be highly reliable as skipping information is not a viable option when communicating critical information. Moreover, communication has to remain reliable over longer periods of time. As many sensor locations do not offer a power source, the devices have to run on battery and thus have to be power efficient. Current systems offer solutions for some of these requirements. However, they especially lack long-term stable communication that can dynamically adapt to changes in the wireless medium.In this thesis, we study the problem of stable and reliable communication in centrally scheduled low-power wireless networks. This communication ought to be stable when it can dynamically adapt to changes in the wireless medium while keeping latency at a minimum. We design and investigate approaches to solve the problem of low to high degrees of interference in the wireless medium. We propose three solutions to overcome interference: MASTER with Sliding Windows brings dynamic numbers of retransmissions to centrally scheduled low-power wireless networks, OVERTAKE allows to skip nodes affected by interference along the path, and AUTOBAHN combines opportunistic routing and synchronous transmissions with the Time-Slotted Channel Hopping (TSCH) MAC protocol to overcome local wide-band interference with the lowest possible latency. We evaluate our approaches in detail on testbed deployments and provide open-source implementations of the protocols to enable others to build their work upon them

Improving the Performance of Wireless LANs

This book quantifies the key factors of WLAN performance and describes methods for improvement. It provides theoretical background and empirical results for the optimum planning and deployment of indoor WLAN systems, explaining the fundamentals while supplying guidelines for design, modeling, and performance evaluation. It discusses environmental effects on WLAN systems, protocol redesign for routing and MAC, and traffic distribution; examines emerging and future network technologies; and includes radio propagation and site measurements, simulations for various network design scenarios, numerous illustrations, practical examples, and learning aids

Resource Allocation in Networked and Distributed Environments

A central challenge in networked and distributed systems is resource management: how can we partition the available resources in the system across competing users, such that individual users are satisfied and certain system-wide objectives of interest are optimized? In this thesis, we deal with many such fundamental and practical resource allocation problems that arise in networked and distributed environments. We invoke two sophisticated paradigms -- linear programming and probabilistic methods -- and develop provably-good approximation algorithms for a diverse collection of applications. Our main contributions are as follows. Assignment problems: An assignment problem involves a collection of objects and locations, and a load value associated with each object-location pair. Our goal is to assign the objects to locations while minimizing various cost functions of the assignment. This setting models many applications in manufacturing, parallel processing, distributed storage, and wireless networks. We present a single algorithm for assignment which generalizes many classical assignment schemes known in the literature. Our scheme is derived through a fusion of linear algebra and randomization. In conjunction with other ideas, it leads to novel guarantees for multi-criteria parallel scheduling, broadcast scheduling, and social network modeling. Precedence constrained scheduling: We consider two precedence constrained scheduling problems, namely sweep scheduling and tree scheduling, which are inspired by emerging applications in high performance computing. Through a careful use of randomization, we devise the first approximation algorithms for these problems with near-optimal performance guarantees. Wireless communication: Wireless networks are prone to interference. This prohibits proximate network nodes from transmitting simultaneously, and introduces fundamental challenges in the design of wireless communication protocols. We develop fresh geometric insights for characterizing wireless interference. We combine our geometric analysis with linear programming and randomization, to derive near-optimal algorithms for latency minimization and throughput capacity estimation in wireless networks. In summary, the innovative use of linear programming and probabilistic techniques for resource allocation, and the novel ways of connecting them with application-specific ideas is the pivotal theme and the focal point of this thesis

An Energy Model Using Sleeping Algorithms for Wireless Sensor Networks under Proactive and Reactive Protocols: A Performance Evaluation

The continuous evolution of the Internet of Things (IoT) makes it possible to connect everyday objects to networks in order to monitor physical and environmental conditions, which is made possible due to wireless sensor networks (WSN) that enable the transfer of data. However, it has also brought about many challenges that need to be addressed, such as excess energy consumption. Accordingly, this paper presents and analyzes wireless network energy models using five different communication protocols: Ad Hoc On-Demand Distance Vector (AODV), Multi-Parent Hierarchical (MPH), Dynamic Source Routing (DSR), Low Energy Adaptive Clustering Hierarchy (LEACH) and Zigbee Tree Routing (ZTR). First, a series of metrics are defined to establish a comparison and determine which protocol exhibits the best energy consumption performance. Then, simulations are performed and the results are compared with real scenarios. The energy analysis is conducted with three proposed sleeping algorithms: Modified Sleeping Crown (MSC), Timer Sleeping Algorithm (TSA), and Local Energy Information (LEI). Thereafter, the proposed algorithms are compared by virtue of two widely used wireless technologies, namely Zigbee and WiFi. Indeed, the results suggest that Zigbee has a better energy performance than WiFi, but less redundancy in the topology links, and this study favors the analysis with the simulation of protocols with different nature. The tested scenario is implemented into a university campus to show a real network running

A novel spatial TDMA scheduler for concurrent transmit/receive wireless mesh networks

The success of wireless mesh networks hinges on their ability to support bandwidth intensive, multi-media applications. A key approach to increasing network capacity is to equip wireless routers with smart antennas. These routers, therefore, are capable of focusing their transmission on specific neighbours whilst causing little interference to other nodes. This, however, assumes there is a link scheduling algorithm that activates links in a way that maximizes network capacity. To this end, we propose a novel link activation algorithm that maximally creates a bipartite graph, which is then used to derive the link activation schedule of each router. We have verified the proposed algorithm on various topologies with increasing node degrees as well as node numbers. From extensive simulation studies, we find that our algorithm outperforms existing algorithms in terms of the number of links activated per slot, superframe length, computation time, route length and end-to-end delay

Device-to-Device Communication in 5G: Towards Efficient Scheduling

5G wireless networks are expected to carry large traffic volumes due to the growth of mobile devices and the increasing demand for high data rates from applications. Device to device communication is one of the suggested technologies to support this increasing load and enhance the capacity of networks. However, the implementation of D2D communication reveals many barriers that include communication scheduling, for which the architecture remains complex and obscure. In this paper, an overview of the available literature on the implementation of networks supporting D2D communication is presented, emphasizing the complexity of the offered solutions. This paper also offers a study of the impact of different device distribution models on the throughput of the devices. The paper introduces the challenges and makes the case for the need to find a more efficient D2D scheduler providing less complexity