Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

Quality of service routing for real-time traffic

Imperial Users onl

A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs

In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing

A quality of service based framework for dynamic, dependable systems

There is currently much UK government and industry interest towards the integration of complex computer-based systems, including those in the military domain. These systems can include both mission critical and safety critical applications, and therefore require the dependable communication of data. Current modular military systems requiring such performance guarantees are mostly based on parameters and system states fixed during design time, thus allowing a predictable estimate of performance. These systems can exhibit a limited degree of reconfiguration, but this is typically within the constraints of a predefined set of configurations. The ability to reconfigure systems more dynamically, could lead to further increased flexibility and adaptability, resulting in the better use of existing assets. Current software architecture models that are capable of providing this flexibility, however, tend to lack support for dependable performance. This thesis explores the benefits for the dependability of future dynamic systems, built on a publish/subscribe model, from using Quality of Service (QoS) methods to map application level data communication requirements to available network resources. Through this, original contributions to knowledge are created, including; the proposal of a QoS framework that specifies a way of defining flexible levels of QoS characteristics and their use in the negotiation of network resources, a simulation based evaluation of the QoS framework and specifically the choice of negotiation algorithm used, and a test-bed based feasibility study. Simulation experimentation conducted comparing different methods of QoS negotiation gives a clear indication that the use of the proposed QoS framework and flexible negotiation algorithm can provide a benefit in terms of system utility, resource utilisation, and system stability. The choice of negotiation algorithm has a particularly strong impact on these system properties. The cost of these benefits comes in terms of the processing power and execution time required to reach a decision on the acceptance of a subscriber. It is suggested, given this cost, that when computational resources are limited, a simpler priority based negotiation algorithm should be used. Where system resources are more abundant, however, the flexible negotiation algorithm proposed within the QoS framework can offer further benefits. Through the implementation of the QoS framework within an existing military avionics software architecture based emulator on a test-bed, both the technical challenges that will need to be overcome and, more importantly, the potential viability for the inclusion of the QoS framework have been demonstrated

MPLS & QoS in Virtual Environments

The rise of high performance computing has seen a shift of services from locally managed Data Centers, to centralized globally redundant Data Centers (Cloud Computing). The scale of operation and churn required for cloud computing has in turn led to the rise of faster and programmable network pathing, via SDN & NFV. Cloud compute resources are accessible to individual researchers, as well as larger organizations. Cloud computing relies heavily on virtualization and abstraction of resources. The interconnect between these resources is more complex than ever, due to the need to seamlessly move from virtual to physical to hybrid networks and resources. MPLS as a technology is robust and has been used as transport for decades with a good track record. QoS has been available within most protocols to ensure service levels are maintained. The integration of MPLS, QoS and virtual environments is a space of increasing interest. It would allow for the seamless movement of traffic from end to end without the need for specialized hardware or vendor lock-in. In this thesis, the performance gains of IP/MPLS networks utilizing QoS on commercially available virtual environments has been investigated and studied. Latency was captured via round trip time metrics and tabulated for voice, video and data, with QoS and congestion as the primary differentiators. The study discusses the approach taken, the common thinking, and finally analyzes the results of a simulation, in order to show that MPLS & QoS benefits are viable in virtualized environments

Preemption control of multi-class loss networks

This thesis addresses the analysis and optimization of preemption in multi-class loss networks. Preemption, admission control and rate adaptation, are control mechanisms that enable loss network operators to provide quality of service (QoS) guarantees for admitted calls. This research includes two parts: i) performance characterization of a two parallel link loss network servicing multiple classes of calls under a speci c preemption and admission policy, and ii) preemption and admission control policy analysis for a single loss link servicing two classes of calls.In Part I, we consider a two parallel link multi-class loss network, where a call may preempt, if necessary, any calls with lower priorities and may in turn be preempted by any calls with higher priorities. The preemption policy permits both preemption from a preferred link to a backup link if possible, and eviction from either link if necessary. Our contributions in this part include: i) characterizing the rates of each class causing preemption of active lower priority calls, and therates of each class being preempted by an arriving higher priority call in Erlang-B functions when all classes share a common service rate; ii) simple expressions of these preemption rates through uniform asymptotic approximation; and iii) asymptotic approximation of these preemption rates using nearly completely decomposable (NCD) Markov chain techniques when classes have individual service rates.After analyzing the performance of a typical policy, we would also like to study various policies. In Part II, we analyze di erent preemption and admission control policies for a two-class loss link where per-class revenue is earned per unit time for each active call, and an instantaneous preemption cost is incurred whenever the preemption mechanism is employed. Our contributions in this part include: i) showing that under reasonable reward models, if we always preempt when the link is full, then it is better not to preempt at non-full states; ii) a su cient condition under which the average revenue of optimal preemption policy without admission control exceeds that of optimal admission control policy without preemption, which are established via policy improvement theorems fromstochastic dynamic programming.Ph.D., Computer Engineering -- Drexel University, 201

Mobile Networks

The growth in the use of mobile networks has come mainly with the third generation systems and voice traffic. With the current third generation and the arrival of the 4G, the number of mobile users in the world will exceed the number of landlines users. Audio and video streaming have had a significant increase, parallel to the requirements of bandwidth and quality of service demanded by those applications. Mobile networks require that the applications and protocols that have worked successfully in fixed networks can be used with the same level of quality in mobile scenarios. Until the third generation of mobile networks, the need to ensure reliable handovers was still an important issue. On the eve of a new generation of access networks (4G) and increased connectivity between networks of different characteristics commonly called hybrid (satellite, ad-hoc, sensors, wired, WIMAX, LAN, etc.), it is necessary to transfer mechanisms of mobility to future generations of networks. In order to achieve this, it is essential to carry out a comprehensive evaluation of the performance of current protocols and the diverse topologies to suit the new mobility conditions

The Next Generation Intelligent Transportation System: Connected, Safe and Green

Modern Intelligent Transportation Systems (ITSs) employ communication technologies in order to ameliorate the passenger's commuting experience. Vehicular Networking lies at the core of inaugurating an efficient transportation system and aims at transforming vehicles into smart mobile entities that are able to sense their surroundings, collect information about the environment and communicate with each other as well as with Roadside Units (RSUs) deployed alongside roadways. As such, the novel communication paradigm of vehicular networking gave birth to an ITS that embraces a wide variety of applications including but not limited to: traffic management, passenger and road safety, environment monitoring and road surveillance, hot-spot guidance, Drive Thru Internet access, remote region connectivity, and so forth. Furthermore, with the rapid development of computation and communication technologies, the Internet of Vehicles (IoV) promises huge commercial interest and research value, thereby attracting a significant industrial and academic attention. This thesis studies and analyses fundamentally challenging problems in the context of vehicular environments and proposes new techniques targeting the improvement of the performance of ITSs envisioned to play a remarkable role in the IoV era. Unlike existing wireless mobile networks, vehicular networks possess unique characteristics, including high node mobility and a rapidly-changing topology, which should be carefully accounted for. Four major problems from the pool of existing vehicular networking persisting challenges will be addressed in this thesis, namely: a) establishing a connectivity path in a highly dynamic Vehicular Ad Hoc Network, b) examining the performance of Vehicle-to-Infrastructure communication Medium Access Control schemes, c) addressing the scheduling problem of a vehicular networking scenario encompassing an energy-limited RSU by exploiting machine learning techniques, particularly reinforcement learning, to train an agent to make appropriate decisions and develop a scheduling policy that prolongs the network's operational status and allows for acceptable Quality-of-Service levels and d) overcoming the limitations of reinforcement learning techniques in high-dimensional input scenarios by exploiting recent advances in deep learning in an effort to satisfy the driver's well-being as well as his demand for continuous connectivity in a green, balanced, connected and efficient vehicular network. These problems will be extensively studied throughout this thesis, followed by discussions that highlight open research directions worth further investigations