STCP: A New Transport Protocol for High-Speed Networks

Transmission Control Protocol (TCP) is the dominant transport protocol today and likely to be adopted in future high‐speed and optical networks. A number of literature works have been done to modify or tune the Additive Increase Multiplicative Decrease (AIMD) principle in TCP to enhance the network performance. In this work, to efficiently take advantage of the available high bandwidth from the high‐speed and optical infrastructures, we propose a Stratified TCP (STCP) employing parallel virtual transmission layers in high‐speed networks. In this technique, the AIMD principle of TCP is modified to make more aggressive and efficient probing of the available link bandwidth, which in turn increases the performance. Simulation results show that STCP offers a considerable improvement in performance when compared with other TCP variants such as the conventional TCP protocol and Layered TCP (LTCP)

Neighbor Discovery Proxy-Gateway for 6LoWPAN-based Wireless Sensor Networks

El propósito de este trabajo es el estudio de métodos para la interconexión de redes personales inalámbricas de área local de bajo consumo y redes de computadores tradicionales. En particular, este proyecto analiza los protocolos de red involucrados así como las posibles formas de interoperabilidad entre ellos, teniendo como meta la integración de redes inalámbricas de sensores IEEE 802.15.4 basadas en 6LoWPAN (una capa de adaptación que hace posible el transporte de paquetes IPv6 sobre IEEE 802.15.4) en redes Ethernet ya existentes, sin necesidad de cambios en la infraestructura de red. Dicha integración permitiría el desarrollo y expansión de aplicaciones de usuario utilizando la tradicional pila de protocolos TCP/IP en sistemas compuestos por dispositivos empotrados de bajo coste y bajo consumo. Para probar la viabilidad de los métodos desarrollados, se diseña, implementa y evalúa un sistema empotrado cuya función es llevar a cabo las tareas de integración descritas

Techniques for Decentralized and Dynamic Resource Allocation

abstract: This thesis investigates three different resource allocation problems, aiming to achieve two common goals: i) adaptivity to a fast-changing environment, ii) distribution of the computation tasks to achieve a favorable solution. The motivation for this work relies on the modern-era proliferation of sensors and devices, in the Data Acquisition Systems (DAS) layer of the Internet of Things (IoT) architecture. To avoid congestion and enable low-latency services, limits have to be imposed on the amount of decisions that can be centralized (i.e. solved in the ``cloud") and/or amount of control information that devices can exchange. This has been the motivation to develop i) a lightweight PHY Layer protocol for time synchronization and scheduling in Wireless Sensor Networks (WSNs), ii) an adaptive receiver that enables Sub-Nyquist sampling, for efficient spectrum sensing at high frequencies, and iii) an SDN-scheme for resource-sharing across different technologies and operators, to harmoniously and holistically respond to fluctuations in demands at the eNodeB' s layer. The proposed solution for time synchronization and scheduling is a new protocol, called PulseSS, which is completely event-driven and is inspired by biological networks. The results on convergence and accuracy for locally connected networks, presented in this thesis, constitute the theoretical foundation for the protocol in terms of performance guarantee. The derived limits provided guidelines for ad-hoc solutions in the actual implementation of the protocol. The proposed receiver for Compressive Spectrum Sensing (CSS) aims at tackling the noise folding phenomenon, e.g., the accumulation of noise from different sub-bands that are folded, prior to sampling and baseband processing, when an analog front-end aliasing mixer is utilized. The sensing phase design has been conducted via a utility maximization approach, thus the scheme derived has been called Cognitive Utility Maximization Multiple Access (CUMMA). The framework described in the last part of the thesis is inspired by stochastic network optimization tools and dynamics. While convergence of the proposed approach remains an open problem, the numerical results here presented suggest the capability of the algorithm to handle traffic fluctuations across operators, while respecting different time and economic constraints. The scheme has been named Decomposition of Infrastructure-based Dynamic Resource Allocation (DIDRA).Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201

Networking Media Abstraction, Device Discovery, and Routing for the Pervasive Middleware PalCom

PalCom is a pervasive middleware that can be used to assemble services provided by networked devices into configurations, called assemblies, for specific use cases by the user. In this dissertation, we present the development of a networking media abstraction framework for PalCom that abstracts different network interfaces in a PalCom device to upper layers of PalCom. The media abstraction framework is documented in paper I. Over the media abstraction layer, we define a device discovery mechanism that enables a PalCom device to discover other devices on its local networks, where it has network interfaces, as well as across interconnected networks. The device discovery mechanism is documented in paper II. On top of the device discovery layer, we implemented support for distance vector routing that enables routing data among discovered devices via the least cost routes. The routing layer is documented in paper III. In the last phase of our work, we refined our device discovery mechanism for PalCom to include a distributed synchronization algorithm that two PalCom nodes can utilize to re-sync their exchanged views of the network to overcome possible loss of device discovery and undiscovery notifications over unreliable channels. The synchronization algorithm is documented in paper IV

Routing Strategies for Capacity Enhancement in Multi-hop Wireless Ad Hoc Networks

This thesis examines a Distributed Interference Impact Probing (DIIP) strategy for Wireless Ad hoc Networks (WANETs), using a novel cross-layer Minimum Impact Routing (MIR) protocol. Perfonnance is judged in tenns of interference reduction ratio, efficiency, and system and user capacity, which are calculated based on the measurement of Disturbed Nodes (DN). A large number of routing algorithms have been proposed with distinctive features aimed to overcome WANET's fundamental challenges, such as routing over a dynamic topology, scheduling broadcast signals using dynamic Media Access Control (MAC), and constraints on network scalability. However, the scalability problem ofWANET cannot simply adapt the frequency reuse mechanism designed for traditional stationary cellular networks due to the relay burden, and there is no single comprehensive algorithm proposed for it. DIIP enhances system and user capacity using a cross layer routing algorithm, MIR, using feedback from DIIP to balance transmit power in order to control hop length, which consequently changes the number of relays along the path. This maximizes the number of simultaneous transmitting nodes, and minimizes the interference impact, i.e. measured in tenns of 'disturbed nodes'. The perfonnance of MIR is examined compared with simple shortest-path routing. A WANET simulation model is configured to simulate both routing algorithms under multiple scenarios. The analysis has shown that once the transmitting range of a node changes, the total number of disturbed nodes along a path changes accordingly, hence the system and user capacity varies with interference impact variation. By carefully selecting a suitable link length, the neighbouring node density can be adjusted to reduce the total number of DN, and thereby allowing a higher spatial reuse ratio. In this case the system capacity can increase significantly as the number of nodes increases. In contrast, if the link length is chosen regardless ofthe negative impact of interference, capacity decreases. In addition, MIR diverts traffic from congested areas, such as the central part of a network or bottleneck points

Congestion and medium access control in 6LoWPAN WSN

In computer networks, congestion is a condition in which one or more egressinterfaces are offered more packets than are forwarded at any given instant [1]. In wireless sensor networks, congestion can cause a number of problems including packet loss, lower throughput and poor energy efficiency. These problems can potentially result in a reduced deployment lifetime and underperforming applications. Moreover, idle radio listening is a major source of energy consumption therefore low-power wireless devices must keep their radio transceivers off to maximise their battery lifetime. In order to minimise energy consumption and thus maximise the lifetime of wireless sensor networks, the research community has made significant efforts towards power saving medium access control protocols with Radio Duty Cycling. However, careful study of previous work reveals that radio duty cycle schemes are often neglected during the design and evaluation of congestion control algorithms. This thesis argues that the presence (or lack) of radio duty cycle can drastically influence the performance of congestion control mechanisms. To investigate if previous findings regarding congestion control are still applicable in IPv6 over low power wireless personal area and duty cycling networks; some of the most commonly used congestion detection algorithms are evaluated through simulations. The research aims to develop duty cycle aware congestion control schemes for IPv6 over low power wireless personal area networks. The proposed schemes must be able to maximise the networks goodput, while minimising packet loss, energy consumption and packet delay. Two congestion control schemes, namely DCCC6 (Duty Cycle-Aware Congestion Control for 6LoWPAN Networks) and CADC (Congestion Aware Duty Cycle MAC) are proposed to realise this claim. DCCC6 performs congestion detection based on a dynamic buffer. When congestion occurs, parent nodes will inform the nodes contributing to congestion and rates will be readjusted based on a new rate adaptation scheme aiming for local fairness. The child notification procedure is decided by DCCC6 and will be different when the network is duty cycling. When the network is duty cycling the child notification will be made through unicast frames. On the contrary broadcast frames will be used for congestion notification when the network is not duty cycling. Simulation and test-bed experiments have shown that DCCC6 achieved higher goodput and lower packet loss than previous works. Moreover, simulations show that DCCC6 maintained low energy consumption, with average delay times while it achieved a high degree of fairness. CADC, uses a new mechanism for duty cycle adaptation that reacts quickly to changing traffic loads and patterns. CADC is the first dynamic duty cycle pro- tocol implemented in Contiki Operating system (OS) as well as one of the first schemes designed based on the arbitrary traffic characteristics of IPv6 wireless sensor networks. Furthermore, CADC is designed as a stand alone medium access control scheme and thus it can easily be transfered to any wireless sensor network architecture. Additionally, CADC does not require any time synchronisation algorithms to operate at the nodes and does not use any additional packets for the exchange of information between the nodes (For example no overhead). In this research, 10000 simulation experiments and 700 test-bed experiments have been conducted for the evaluation of CADC. These experiments demonstrate that CADC can successfully adapt its cycle based on traffic patterns in every traffic scenario. Moreover, CADC consistently achieved the lowest energy consumption, very low packet delay times and packet loss, while its goodput performance was better than other dynamic duty cycle protocols and similar to the highest goodput observed among static duty cycle configurations

Software-Defined Lighting.

For much of the past century, indoor lighting has been based on incandescent or gas-discharge technology. But, with LED lighting experiencing a 20x/decade increase in flux density, 10x/decade decrease in cost, and linear improvements in luminous efficiency, solid-state lighting is finally cost-competitive with the status quo. As a result, LED lighting is projected to reach over 70% market penetration by 2030. This dissertation claims that solid-state lighting’s real potential has been barely explored, that now is the time to explore it, and that new lighting platforms and applications can drive lighting far beyond its roots as an illumination technology. Scaling laws make solid-state lighting competitive with conventional lighting, but two key features make solid-state lighting an enabler for many new applications: the high switching speeds possible using LEDs and the color palettes realizable with Red-Green-Blue-White (RGBW) multi-chip assemblies. For this dissertation, we have explored the post-illumination potential of LED lighting in applications as diverse as visible light communications, indoor positioning, smart dust time synchronization, and embedded device configuration, with an eventual eye toward supporting all of them using a shared lighting infrastructure under a unified system architecture that provides software-control over lighting. To explore the space of software-defined lighting (SDL), we design a compact, flexible, and networked SDL platform to allow researchers to rapidly test new ideas. Using this platform, we demonstrate the viability of several applications, including multi-luminaire synchronized communication to a photodiode receiver, communication to mobile phone cameras, and indoor positioning using unmodified mobile phones. We show that all these applications and many other potential applications can be simultaneously supported by a single lighting infrastructure under software control.PhDElectrical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/111482/1/samkuo_1.pd

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

Position-based routing algorithms for three-dimensional ad hoc networks

In position-based routing algorithms, the nodes use the geographical information to make routing decisions. Recent research in this field addresses such routing algorithms in two-dimensional (2 D ) space. However, in real applications, the nodes may be distributed in three-dimensional (3 D ) space. Transition from 2 D to 3 D is not always easy, since many problems in 3 D are significantly harder than their 2 D counterparts. This dissertation focuses on providing a reliable and efficient position-based routing algorithms with the associated pre-processing algorithms for various 3 D ad hoc networks. In the first part of this thesis, we propose a generalization of the Yao graph where the cones used are adaptively centered on the nearest set of neighbors for each node, thus creating a directed or undirected spanning subgraph of a given unit disk graph (UDG). We show that these locally constructed spanning subgraphs are strongly connected, have bounded out-degree, are t -spanners with bounded stretch factor, contain the Euclidean minimum spanning tree as a subgraph, and are orientation-invariant. Then we propose the first local, constant time algorithm that constructs an independent dominating set and connected dominating set of a Unit Disk Graph in a 3 D environment. We present a truncated octahedral tiling system of the space to assign to each node a class number depending on the position of the node within the tiling system. Then, based on the tiling system, we present our local algorithms for constructing the dominating sets. The new algorithms have a constant time complexity and have approximation bounds that are completely independent of the size of the network. In the second part of this thesis, we implement 3 D versions of many current 2 D position-based routing algorithms in addition to creating many new algorithms that are specially designed for a 3 D environment. We show experimentally that these new routing algorithms can achieve nearly guaranteed delivery while discovering routes significantly closer in length to a shortest path. Because many existing position-based routing algorithms for ad hoc and sensor networks use the maximum transmission power of the nodes to discover neighbors, which is a very power-consuming process. We propose several localized power-aware 3 D position-based routing algorithms that increase the lifetime of a network by maximizing the average lifetime of its nodes. These new algorithms use the idea of replacing the constant transmission power of a node with an adjusted transmission power during two stages. The simulation results show a significant improvement in the overall network lifetime over the current power-aware routing algorithm