Role of satellite communications in 5G ecosystem: perspectives and challenges

The next generation of mobile radio communication systems – so-called 5G – will provide some major changes to those generations to date. The ability to cope with huge increases in data traffic at reduced latencies and improved quality of user experience together with a major reduction in energy usage are big challenges. In addition, future systems will need to embody connections to billions of objects – the so-called Internet of Things (IoT) which raises new challenges.Visions of 5G are now available from regions across the world and research is ongoing towards new standards. The consensus is a flatter architecture that adds a dense network of small cells operating in the millimetre wave bands and which are adaptable and software controlled. But what is the place for satellites in such a vision? The chapter examines several potential roles for satellites in 5G including coverage extension, IoT, providing resilience, content caching and multi-cast, and the integrated architecture. Furthermore, the recent advances in satellite communications together with the challenges associated with the use of satellite in the integrated satellite-terrestrial architecture are also discussed

Delay-centric handover in SCTP

The introduction of the Stream Control Transmission Protocol (SCTP) has opened the possibility of a mobile aware transport protocol. The multihoming feature of SCTP negates the need for a solution such as Mobile IP and, as SCTP is a transport layer protocol, it adds no complexity to the network. Utilizing the handover procedure of SCTP, the large bandwidth of WLAN can be exploited whilst in the coverage of a hotspot, and still retain the 3G connection for when the user roams out of the hotspot’s range. All this functionality is provided at the transport layer and is transparent to the end user, something that is still important in non-mobile-aware legacy applications. However, there is one drawback to this scenario - the current handover scheme implemented in SCTP is failure-centric in nature. Handover is only performed in the presence of primary destination address failure. This dissertation proposes a new scheme for performing handover using SCTP. The handover scheme being proposed employs an aggressive polling of all destination addresses within an individual SCTP association in order to determine the round trip delay to each of these addresses. It then performs handover based on these measured path delays. This delay-centric approach does not incur the penalty associated with the current failover-based scheme, namely a number of timeouts before handover is performed. In some cases the proposed scheme can actually preempt the path failure, and perform handover before it occurs. The proposed scheme has been evaluated through simulation, emulation, and within the context of a wireless environment

Software Defined Applications in Cellular and Optical Networks

abstract: Small wireless cells have the potential to overcome bottlenecks in wireless access through the sharing of spectrum resources. A novel access backhaul network architecture based on a Smart Gateway (Sm-GW) between the small cell base stations, e.g., LTE eNBs, and the conventional backhaul gateways, e.g., LTE Servicing/Packet Gateways (S/P-GWs) has been introduced to address the bottleneck. The Sm-GW flexibly schedules uplink transmissions for the eNBs. Based on software defined networking (SDN) a management mechanism that allows multiple operator to flexibly inter-operate via multiple Sm-GWs with a multitude of small cells has been proposed. This dissertation also comprehensively survey the studies that examine the SDN paradigm in optical networks. Along with the PHY functional split improvements, the performance of Distributed Converged Cable Access Platform (DCCAP) in the cable architectures especially for the Remote-PHY and Remote-MACPHY nodes has been evaluated. In the PHY functional split, in addition to the re-use of infrastructure with a common FFT module for multiple technologies, a novel cross functional split interaction to cache the repetitive QAM symbols across time at the remote node to reduce the transmission rate requirement of the fronthaul link has been proposed.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201

Securing the Internet with digital signatures

The security and reliability of the Internet are essential for many functions of a modern society. Currently, the Internet lacks efficient network level security solutions and is vulnerable to various attacks, especially to distributed denial-of-service attacks. Traditional end-to-end security solutions such as IPSec only protect the communication end-points and are not effective if the underlying network infrastructure is attacked and paralyzed. This thesis describes and evaluates Packet Level Authentication (PLA), which is a novel method to secure the network infrastructure and provide availability with public key digital signatures. PLA allows any node in the network to verify independently the authenticity and integrity of every received packet, without previously established relationships with the sender or intermediate nodes that have handled the packet. As a result, various attacks against the network and its users can be more easily detected and mitigated, before they can cause significant damage or disturbance. PLA is compatible with the existing Internet infrastructure, and can be used with complementary end-to-end security solutions, such as IPSec and HIP. While PLA was originally designed for securing current IP networks, it is also suitable for securing future data-oriented networking approaches. PLA has been designed to scale from lightweight wireless devices to Internet core network, which is a challenge since public key cryptography operations are very resource intensive. Nevertheless, this work shows that digital signature algorithms and their hardware implementations developed for PLA are scalable to fast core network routers. Furthermore, the additional energy consumption of cryptographic operations is significantly lower than the energy cost of wireless transmission, making PLA feasible for lightweight wireless devices. Digital signature algorithms used by PLA also offer small key and signature sizes and therefore PLA's bandwidth overhead is relatively low. Strong security mechanisms offered by PLA can also be utilized for various other tasks. This work investigates how PLA can be utilized for controlling incoming connections, secure user authentication and billing, and for providing a strong accountability without an extensive data retention by network service providers

Prediction assisted fast handovers for seamless IP mobility

Word processed copy.Includes bibliographical references (leaves 94-98).This research investigates the techniques used to improve the standard Mobile IP handover process and provide proactivity in network mobility management. Numerous fast handover proposals in the literature have recently adopted a cross-layer approach to enhance movement detection functionality and make terminal mobility more seamless. Such fast handover protocols are dependent on an anticipated link-layer trigger or pre-trigger to perform pre-handover service establishment operations. This research identifies the practical difficulties involved in implementing this type of trigger and proposes an alternative solution that integrates the concept of mobility prediction into a reactive fast handover scheme

Design of implicit routing protocols for large scale mobile wireless sensor networks

Strathclyde theses - ask staff. Thesis no. : T13189Most developments in wireless sensor networks (WSNs) routing protocols address static network scenarios. Schemes developed to manage mobility in other mobile networking implementations do not translate effectively to WSNs as the system design parameters are markedly different. Thus this research focuses on the issues of mobility and scalability in order to enable the full potential of WSNs to self-organise and co-operate and in so doing, meet the requirements of a rich mix of applications. In the goal of designing efficient, reliable routing protocols for large scale mobile WSN applications, this work lays the foundation by firstly presenting a strong case supported by extensive simulations, for the use of implicit connections. Then two novel implicit routing protocols - Virtual Grid Paging (VGP) and Virtual Zone Registration and Paging (VZRP) - that treat packet routing from node mobility and network scalability viewpoints are designed and analysed. Implicit routing exploits the connection availability and diversity in the underlying network to provide benefits such as fault tolerance, overhead control and improvement in QoS (Quality of Service) such as delay. Analysis and simulation results show that the proposed protocols guarantee significant improvement, delivering a more reliable, more efficient and better network performance compared with alternatives.Most developments in wireless sensor networks (WSNs) routing protocols address static network scenarios. Schemes developed to manage mobility in other mobile networking implementations do not translate effectively to WSNs as the system design parameters are markedly different. Thus this research focuses on the issues of mobility and scalability in order to enable the full potential of WSNs to self-organise and co-operate and in so doing, meet the requirements of a rich mix of applications. In the goal of designing efficient, reliable routing protocols for large scale mobile WSN applications, this work lays the foundation by firstly presenting a strong case supported by extensive simulations, for the use of implicit connections. Then two novel implicit routing protocols - Virtual Grid Paging (VGP) and Virtual Zone Registration and Paging (VZRP) - that treat packet routing from node mobility and network scalability viewpoints are designed and analysed. Implicit routing exploits the connection availability and diversity in the underlying network to provide benefits such as fault tolerance, overhead control and improvement in QoS (Quality of Service) such as delay. Analysis and simulation results show that the proposed protocols guarantee significant improvement, delivering a more reliable, more efficient and better network performance compared with alternatives

Design and implementation of an on-demand ad-hoc routing algorithm for a positional communication system.

Thesis (M.Sc.Eng.)-University of Natal, Durban, 2003.A mobile ad-hoc network is an autonomous network of mobile devices that are connected via wireless links. In such networks there is no pre-existing infrastructure and nodes are free to move in a random fashion. Due to this mobility mobile ad-hoc networks have dynamic topologies. A host in the network typically has limited bandwidth and energy resources. Routing is a major challenge in the development of such systems and there have been many solutions proposed in the recent past. The aim of this work is to design and implement a routing scheme for a Positional Communication System (PCS). The PCS is a network of mobile handheld pocket PCs connected via wireless interfaces. The system allows voice and data communication between nodes in the network. This dissertation addresses the process of designing a routing protocol for an ad-hoc network. There have been many proposed algorithms that solve the routing problem in a mobile ad-hoc network. It is a difficult task to compare the performance of'these protocols qualitatively as there are many parameters that affect network performance. Various simulation packages for networks of this type exist. One such package is the Network Simulator (NS-2). It is a discrete time event simulator that can be used to model wired and wireless networks. This dissertation presents NS-2 simulations that compare four recently proposed routing algorithms. From this comparison study it is shown that on-demand algorithms perform best in a mobile ad-hoc environment. The dissertation then describes the design of a novel on-demand routing algorithm. The ondemand algorithms proposed thus far use a blind flooding technique during the route discovery process. This method is inefficient and creates excessive routing overhead. The routing protocol proposed in the dissertation implements a query localization technique that significantly reduces the network traffic. The protocol also introduces a load checking metric in addition to the metric used by most on-demand schemes, namely hop count. Simulation results show that such a scheme makes the on-demand routing algorithm more efficient and scalable than existing ones. It is widely believed that prior to implementing a routing protocol in real world systems it is essential that it is tested and validated on a test-bed. The dissertation presents the implementation of an on-demand routing algorithm in a Positional Communication System test-bed, where each handheld PC in the network runs an embedded Linux operating system