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

Centralized Rate Allocation and Control in 802.11-based Wireless Mesh Networks

Wireless Mesh Networks (WMNs) built with commodity 802.11 radios are a cost-effective means of providing last mile broadband Internet access. Their multihop architecture allows for rapid deployment and organic growth of these networks. 802.11 radios are an important building block in WMNs. These low cost radios are readily available, and can be used globally in license-exempt frequency bands. However, the 802.11 Distributed Coordination Function (DCF) medium access mechanism does not scale well in large multihop networks. This produces suboptimal behavior in many transport protocols, including TCP, the dominant transport protocol in the Internet. In particular, cross-layer interaction between DCF and TCP results in flow level unfairness, including starvation, with backlogged traffic sources. Solutions found in the literature propose distributed source rate control algorithms to alleviate this problem. However, this requires MAC-layer or transport-layer changes on all mesh routers. This is often infeasible in practical deployments. In wireline networks, router-assisted rate control techniques have been proposed for use alongside end-to-end mechanisms. We evaluate the feasibility of establishing similar centralized control via gateway mesh routers in WMNs. We find that commonly used router-assisted flow control schemes designed for wired networks fail in WMNs. This is because they assume that: (1) links can be scheduled independently, and (2) router queue buildups are sufficient for detecting congestion. These abstractions do not hold in a wireless network, rendering wired scheduling algorithms such as Fair Queueing (and its variants) and Active Queue Management (AQM) techniques ineffective as a gateway-enforceable solution in a WMN. We show that only non-work-conserving rate-based scheduling can effectively enforce rate allocation via a single centralized traffic-aggregation point. In this context we propose, design, and evaluate a framework of centralized, measurement-based, feedback-driven mechanisms that can enforce a rate allocation policy objective for adaptive traffic streams in a WMN. In this dissertation we focus on fair rate allocation requirements. Our approach does not require any changes to individual mesh routers. Further, it uses existing data traffic as capacity probes, thus incurring a zero control traffic overhead. We propose two mechanisms based on this approach: aggregate rate control (ARC) and per-flow rate control (PFRC). ARC limits the aggregate capacity of a network to the sum of fair rates for a given set of flows. We show that the resulting rate allocation achieved by DCF is approximately max-min fair. PFRC allows us to exercise finer-grained control over the rate allocation process. We show how it can be used to achieve weighted flow rate fairness. We evaluate the performance of these mechanisms using simulations as well as implementation on a multihop wireless testbed. Our comparative analysis show that our mechanisms improve fairness indices by a factor of 2 to 3 when compared with networks without any rate limiting, and are approximately equivalent to results achieved with distributed source rate limiting mechanisms that require software modifications on all mesh routers

Congestion control in wireless sensor networks

Information-sensing and data-forwarding in Wireless Sensor Networks (WSN) often incurs high traffic demands, especially during event detection and concurrent transmissions. Managing such large amounts of data remains a considerable challenge in resource-limited systems like WSN, which typically observe a many-to-one transmission model. The result is often a state of constant buffer-overload or congestion, preventing desirable performance to the extent of collapsing an entire network. The work herein seeks to circumvent congestion issues and its negative effects in WSN and derivative platforms such as Body Sensor Networks (BSN). The recent proliferation of WSN has emphasized the need for high Quality-of-Service (QoS) in applications involving real-time and remote monitoring systems such as home automation, military surveillance, environmental hazard detection, as well as BSN-based healthcare and assisted-living systems. Nevertheless, nodes in WSN are often resource-starved as data converges and cause congestion at critical points in such networks. Although this has been a primal concern within the WSN field, elementary issues such as fairness and reliability that directly relate to congestion are still under-served. Moreover, hindering loss of important packets, and the need to avoid packet entrapment in certain network areas remain salient avenues of research. Such issues provide the motivation for this thesis, which lead to four research concerns: (i) reduction of high-traffic volumes; (ii) optimization of selective packet discarding; (iii) avoidance of infected areas; and (iv) collision avoidance with packet-size optimization. Addressing these areas would provide for high QoS levels, and pave the way for seamless transmissions in WSN. Accordingly, the first chapter attempts to reduce the amount of network traffic during simultaneous data transmissions, using a rate-limiting technique known as Relaxation Theory (RT). The goal is for substantial reductions in otherwise large data-streams that cause buffer overflows. Experimentation and analysis with Network Simulator 2 (NS-2), show substantial improvement in performance, leading to our belief that RT-MMF can cope with high incoming traffic scenarios and thus, avoid congestion issues. Whilst limiting congestion is a primary objective, this thesis keenly addresses subsequent issues, especially in worst-case scenarios where congestion is inevitable. The second research question aims at minimizing the loss of important packets crucial to data interpretation at end-systems. This is achieved using the integration of selective packet discarding and Multi-Objective Optimization (MOO) function, contributing to the effective resource-usage and optimized system. A scheme was also developed to detour packet transmissions when nodes become infected. Extensive evaluations demonstrate that incoming packets are successfully delivered to their destinations despite the presence of infected nodes. The final research question addresses packet collisions in a shared wireless medium using distributed collision control that takes packet sizes into consideration. Performance evaluation and analysis reveals desirable performance that are resulted from a strong consideration of packet sizes, and the effect of different Bit Error Rates (BERs)