Content Caching and Delivery in Heterogeneous Vehicular Networks

Connected and automated vehicles (CAVs), which enable information exchange and content delivery in real time, are expected to revolutionize current transportation systems for better driving safety, traffic efficiency, and environmental sustainability. However, the emerging CAV applications such as content delivery pose stringent requirements on latency, throughput, reliability, and global connectivity. The current wireless networks face significant challenges to satisfy the requirements due to scarce radio spectrum resources, inflexibility to dynamic traffic demands, and geographic-constrained fixed infrastructure deployment. To empower multifarious CAV content delivery, heterogeneous vehicular networks (HetVNets), which integrate the terrestrial networks with aerial networks formed by unmanned aerial vehicles (UAVs) and space networks constituting of low Earth orbit (LEO) satellites, can guarantee reliable, flexible, cost-effective, and globally seamless service provisioning. In addition, edge caching is a promising solution to facilitate content delivery by caching popular files in the HetVNet access points (APs) to relieve the backhaul traffic with a lower delivery delay. The main technical issues are: 1) to fully reveal the potential of HetVNets for content delivery performance enhancement, content caching scheme design in HetVNets should jointly consider network characteristics, vehicle mobility patterns, content popularity, and APs’ caching capacities; 2) to fully exploit the controllable mobility and agility of UAVs to support dynamic vehicular content demands, the caching scheme and trajectory design for UAVs should be jointly optimized, which has not been well addressed due to their intricate inter-coupling relationships; and 3) for caching-based content delivery in HetVNets, a cooperative content delivery scheme should be designed to enable the cooperation among different network segments with ingenious utilization of heterogeneous network resources. In this thesis, we design the content caching and delivery schemes in the caching-enabled HetVNet to address the three technical issues. First, we study the content caching in HetVNets with fixed terrestrial APs including cellular base stations (CBSs), Wi-Fi roadside units (RSUs), and TV white space (TVWS) stations. To characterize the intermittent network connection caused by limited network coverage and high vehicle mobility, we establish an on-off model with service interruptions to describe the vehicular content delivery process. Content coding then is leveraged to resist the impact of unstable network connections and enhance caching efficiency. By jointly considering file characteristics and network conditions, the content placement is formulated as an integer linear programming (ILP) problem. Adopting the idea of the student admission model, the ILP problem is then transformed into a many-to-one matching problem between content files and HetVNet APs and solved by our proposed stable-matching-based caching scheme. Simulation results demonstrate that the proposed scheme can achieve near-optimal performances in terms of delivery delay and offloading ratio with a low complexity. Second, UAV-aided caching is considered to assist vehicular content delivery in aerial-ground vehicular networks (AGVN) and a joint caching and trajectory optimization (JCTO) problem is investigated to jointly optimize content caching, content delivery, and UAV trajectory. To enable real-time decision-making in highly dynamic vehicular networks, we propose a deep supervised learning scheme to solve the JCTO problem. Specifically, we first devise a clustering-based two-layered (CBTL) algorithm to solve the JCTO problem offline. With a given content caching policy, we design a time-based graph decomposition method to jointly optimize content delivery and UAV trajectory, with which we then leverage the particle swarm optimization algorithm to optimize the content caching. We then design a deep supervised learning architecture of the convolutional neural network (CNN) to make online decisions. With the CNN-based model, a function mapping the input network information to output decisions can be intelligently learnt to make timely inferences. Extensive trace-driven experiments are conducted to demonstrate the efficiency of CBTL in solving the JCTO problem and the superior learning performance with the CNN-based model. Third, we investigate caching-assisted cooperative content delivery in space-air-ground integrated vehicular networks (SAGVNs), where vehicular content requests can be cooperatively served by multiple APs in space, aerial, and terrestrial networks. In specific, a joint optimization problem of vehicle-to-AP association, bandwidth allocation, and content delivery ratio, referred to as the ABC problem, is formulated to minimize the overall content delivery delay while satisfying vehicular quality-of-service (QoS) requirements. To address the tightly-coupled optimization variables, we propose a load- and mobility-aware ABC (LMA-ABC) scheme to solve the joint optimization problem as follows. We first decompose the ABC problem to optimize the content delivery ratio. Then the impact of bandwidth allocation on the achievable delay performance is analyzed, and an effect of diminishing delay performance gain is revealed. Based on the analysis results, the LMA-ABC scheme is designed with the consideration of user fairness, load balancing, and vehicle mobility. Simulation results demonstrate that the proposed LMA-ABC scheme can significantly reduce the cooperative content delivery delay compared to the benchmark schemes. In summary, we have investigated the content caching in terrestrial networks with fixed APs, joint caching and trajectory optimization in the AGVN, and caching-assisted cooperative content delivery in the SAGVN. The proposed schemes and theoretical results should provide useful guidelines for future research in the caching scheme design and efficient utilization of network resources in caching-enabled heterogeneous wireless networks

Using hypergraph theory to model coexistence management and coordinated spectrum allocation for heterogeneous wireless networks operating in shared spectrum

Electromagnetic waves in the Radio Frequency (RF) spectrum are used to convey wireless transmissions from one radio antenna to another. Spectrum utilisation factor, which refers to how readily a given spectrum can be reused across space and time while maintaining an acceptable level of transmission errors, is used to measure how efficiently a unit of frequency spectrum can be allocated to a specified number of users. The demand for wireless applications is increasing exponentially, hence there is a need for efficient management of the RF spectrum. However, spectrum usage studies have shown that the spectrum is under-utilised in space and time. A regulatory shift from static spectrum assignment to DSA is one way of addressing this. Licence exemption policy has also been advanced in Dynamic Spectrum Access (DSA) systems to spur wireless innovation and universal access to the internet. Furthermore, there is a shift from homogeneous to heterogeneous radio access and usage of the same spectrum band. These three shifts from traditional spectrum management have led to the challenge of coexistence among heterogeneous wireless networks which access the spectrum using DSA techniques. Cognitive radios have the ability for spectrum agility based on spectrum conditions. However, in the presence of multiple heterogeneous networks and without spectrum coordination, there is a challenge related to switching between available channels to minimise interference and maximise spectrum allocation. This thesis therefore focuses on the design of a framework for coexistence management and spectrum coordination, with the objective of maximising spectrum utilisation across geographical space and across time. The amount of geographical coverage in which a frequency can be used is optimised through frequency reuse while ensuring that harmful interference is minimised. The time during which spectrum is occupied is increased through time-sharing of the same spectrum by two or more networks, while ensuring that spectrum is shared by networks that can coexist in the same spectrum and that the total channel load is not excessive to prevent spectrum starvation. Conventionally, a graph is used to model relationships between entities such as interference relationships among networks. However, the concept of an edge in a graph is not sufficient to model relationships that involve more than two entities, such as more than two networks that are able to share the same channel in the time domain, because an edge can only connect two entities. On the other hand, a hypergraph is a generalisation of an undirected graph in which a hyperedge can connect more than two entities. Therefore, this thesis investigates the use of hypergraph theory to model the RF environment and the spectrum allocation scheme. The hypergraph model was applied to an algorithm for spectrum sharing among 100 heterogeneous wireless networks, whose geo-locations were randomly and independently generated in a 50 km by 50 km area. Simulation results for spectrum utilisation performance have shown that the hypergraph-based model allocated channels, on average, to 8% more networks than the graph-based model. The results also show that, for the same RF environment, the hypergraph model requires up to 36% fewer channels to achieve, on average, 100% operational networks, than the graph model. The rate of growth of the running time of the hypergraph-based algorithm with respect to the input size is equal to the square of the input size, like the graph-based algorithm. Thus, the model achieved better performance at no additional time complexity.Electromagnetic waves in the Radio Frequency (RF) spectrum are used to convey wireless transmissions from one radio antenna to another. Spectrum utilisation factor, which refers to how readily a given spectrum can be reused across space and time while maintaining an acceptable level of transmission errors, is used to measure how efficiently a unit of frequency spectrum can be allocated to a specified number of users. The demand for wireless applications is increasing exponentially, hence there is a need for efficient management of the RF spectrum. However, spectrum usage studies have shown that the spectrum is under-utilised in space and time. A regulatory shift from static spectrum assignment to DSA is one way of addressing this. Licence exemption policy has also been advanced in Dynamic Spectrum Access (DSA) systems to spur wireless innovation and universal access to the internet. Furthermore, there is a shift from homogeneous to heterogeneous radio access and usage of the same spectrum band. These three shifts from traditional spectrum management have led to the challenge of coexistence among heterogeneous wireless networks which access the spectrum using DSA techniques. Cognitive radios have the ability for spectrum agility based on spectrum conditions. However, in the presence of multiple heterogeneous networks and without spectrum coordination, there is a challenge related to switching between available channels to minimise interference and maximise spectrum allocation. This thesis therefore focuses on the design of a framework for coexistence management and spectrum coordination, with the objective of maximising spectrum utilisation across geographical space and across time. The amount of geographical coverage in which a frequency can be used is optimised through frequency reuse while ensuring that harmful interference is minimised. The time during which spectrum is occupied is increased through time-sharing of the same spectrum by two or more networks, while ensuring that spectrum is shared by networks that can coexist in the same spectrum and that the total channel load is not excessive to prevent spectrum starvation. Conventionally, a graph is used to model relationships between entities such as interference relationships among networks. However, the concept of an edge in a graph is not sufficient to model relationships that involve more than two entities, such as more than two networks that are able to share the same channel in the time domain, because an edge can only connect two entities. On the other hand, a hypergraph is a generalisation of an undirected graph in which a hyperedge can connect more than two entities. Therefore, this thesis investigates the use of hypergraph theory to model the RF environment and the spectrum allocation scheme. The hypergraph model was applied to an algorithm for spectrum sharing among 100 heterogeneous wireless networks, whose geo-locations were randomly and independently generated in a 50 km by 50 km area. Simulation results for spectrum utilisation performance have shown that the hypergraph-based model allocated channels, on average, to 8% more networks than the graph-based model. The results also show that, for the same RF environment, the hypergraph model requires up to 36% fewer channels to achieve, on average, 100% operational networks, than the graph model. The rate of growth of the running time of the hypergraph-based algorithm with respect to the input size is equal to the square of the input size, like the graph-based algorithm. Thus, the model achieved better performance at no additional time complexity

Opportunistic Spectrum Utilization for Vehicular Communication Networks

Recently, vehicular networks (VANETs), has become the key technology of the next-generation intelligent transportation systems (ITS). By incorporating wireless communication and networking capabilities into automobiles, information can be efficiently and reliably disseminated among vehicles, road side units, and infrastructure, which enables a number of novel applications enhancing the road safety and providing the drivers/passengers with an information-rich environment. With the development of mobile Internet, people want to enjoy the Internet access in vehicles just as anywhere else. This fact, along with the soaring number of connected vehicles and the emerging data-craving applications and services, has led to a problem of spectrum scarcity, as the current spectrum bands for VANETs are difficult to accommodate the increasing mobile data demands. In this thesis, we aim to solve this problem by utilizing extra spectrum bands, which are not originally allocated for vehicular communications. In this case, the spectrum usage is based on an opportunistic manner, where the spectrum is not available if the primary system is active, or the vehicle is outside the service coverage due to the high mobility. We will analyze the features of such opportunistic spectrum, and design efficient protocols to utilize the spectrum for VANETs. Firstly, the application of cognitive radio technologies in VANETs, termed CR-VANETs, is proposed and analyzed. In CR-VANETs, the channel availability is severely affected by the street patterns and the mobility features of vehicles. Therefore, we theoretically analyze the channel availability in urban scenario, and obtain its statistics. Based on the knowledge of channel availability, an efficient channel access scheme for CR-VANETs is then designed and evaluated. Secondly, using WiFi to deliver mobile data, named WiFi offloading, is employed to deliver the mobile data on the road, in order to relieve the burden of the cellular networks, and provide vehicular users with a cost-effective data pipe. Using queueing theory, we analyze the offloading performance with respect to the vehicle mobility model and the users' QoS preferences. Thirdly, we employ device-to-device (D2D) communications in VANETs to further improve the spectrum efficiency. In a vehicular D2D (V-D2D) underlaying cellular network, proximate vehicles can directly communicate with each other with a relatively small transmit power, rather than traversing the base station. Therefore, many current transmissions can co-exist on one spectrum resource block. By utilizing the spatial diversity, the spectrum utilization is greatly enhanced. We study the performance of the V-D2D underlaying cellular network, considering the vehicle mobility and the street pattern. We also investigate the impact of the preference of D2D/cellular mode on the interference and network throughput, and obtain the theoretical results. In summary, the analysis and schemes developed in this thesis are useful to understand the future VANETs with heterogeneous access technologies, and provide important guidelines for designing and deploying such networks

Design and optimisation of a low cost Cognitive Mesh Network

Wireless Mesh Networks (WMNs) have been touted as the most promising wireless technology in providing high-bandwidth Internet access to rural, remote and under-served areas, with relatively lower investment cost as compared to traditional access networks. WMNs structurally comprise of mesh routers and mesh clients. Furthermore, WMNs have an envisaged ability to provide a heterogeneous network system that integrates wireless technologies such as IEEE 802.22 WRAN, IEEE 802.16 WiMAX, IEEE 802.11 Wi-Fi, Blue-tooth etc. The recent proliferation of new devices on the market such as smart phones and, tablets, and the growing number of resource hungry applications has placed a serious strain on spectrum availability which gives rise to the spectrum scarcity problem. The spectrum scarcity problem essentially results in increased spectrum prices that hamper the growth and efficient performance of WMNs as well as subsequent transformation of WMN into the envisaged next generation networks. Recent developments in TV white space communications technology and the emergence of Cognitive radio devices that facilitate Dynamic Spectrum Access (DSA) have provided an opportunity to mitigate the spectrum scarcity problem. To solve the scarcity problem, this thesis reconsiders the classical Network Engineering (NE) and Traffic Engineering (TE) problems to objectively design a low cost Cognitive Mesh network that promotes efficient resources utilization and thereby achieve better Quality of Service (QoS) levels

Channel parameter tuning in a hybrid Wi-Fi-Dynamic Spectrum Access Wireless Mesh Network

This work addresses Channel Assignment in a multi-radio multi-channel (MRMC) Wireless Mesh Network (WMN) using both Wi-Fi and Dynamic Spectrum Access (DSA) spectrum bands and standards. This scenario poses new challenges because nodes are spread out geographically so may have differing allowed channels and experience different levels of external interference in different channels. A solution must meet two conflicting requirements simultaneously: 1) avoid or minimise interference within the network and from external interference sources, and 2) maintain connectivity within the network. These two requirements must be met while staying within the link constraints and the radio interface constraints, such as only assigning as many channels to a node as it has radios. This work's original contribution to the field is a unified framework for channel optimisation and assignment in a WMN that uses both DSA and traditional Wi-Fi channels for interconnectivity. This contribution is realised by providing and analysing the performance of near-optimal Channel Assignment (CA) solutions using metaheuristic algorithms for the MRMC WMNs using DSA bands. We have created a simulation framework for evaluating the algorithms. The performance of Simulated Annealing, Genetic Algorithm, Differential Evolution, and Particle Swarm Optimisation algorithms have been analysed and compared for the CA optimisation problem. We introduce a novel algorithm, used alongside the metaheuristic optimisation algorithms, to generate feasible candidate CA solutions. Unlike previous studies, this sensing and CA work takes into account the requirement to use a Geolocation Spectrum Database (GLSD) to get the allowed channels, in addition to using spectrum sensing to identify and estimate the cumulative severity of both internal and external interference sources. External interference may be caused by other secondary users (SUs) in the vicinity or by primary transmitters of the DSA band whose emissions leak into adjacent channels, next-toadjacent, or even into further channels. We use signal-to-interference-plus-noise ratio (SINR) as the optimisation objective. This incorporates any possible source or type of interference and makes our method agnostic to the protocol or technology of the interfering devices while ensuring that the received signal level is high enough for connectivity to be maintained on as many links as possible. To support our assertion that SINR is a reasonable criterion on which to base the optimisation, we have carried out extensive outdoor measurements in both line-of-sight and wooded conditions in the television white space (TVWS) DSA band and the 5 GHz Wi-Fi band. These measurements show that SINR is useful as a performance measure, especially when the interference experienced on a link is high. Our statistical analysis shows that SINR effectively differentiates the performance of different channels and that SINR is well correlated with throughput and is thus a good predictor of end-user experience, despite varying conditions. We also identify and analyse the idle times created by Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) contention-based Medium Access Control (MAC) operations and propose the use of these idle times for spectrum sensing to measure the SINR on possible channels. This means we can perform spectrum sensing with zero spectrum sensing delay experienced by the end user. Unlike previous work, this spectrum sensing is transparent and can be performed without causing any disruption to the normal data transmission of the network. We conduct Markov chain analysis to find the expected length of time of a sensing window. We also derive an efficient minimum variance unbiased estimator of the interference plus noise and show how the SINR can be found using this estimate. Our estimation is more granular, accurate, and appropriate to the problem of Secondary User (SU)-SU coexistence than the binary hypothesis testing methods that are most common in the literature. Furthermore, we construct confidence intervals based on the probability density function derived for the observations. This leads to finding and showing the relationships between the number of sampling windows and sampling time, the interference power, and the achievable confidence interval width. While our results coincide with (and thus are confirmed by) some key previous recommendations, ours are more precise, granular, and accurate and allow for application to a wider range of operating conditions. Finally, we present alterations to the IEEE 802.11k protocol to enable the reporting of spectrum sensing results to the fusion or gateway node and algorithms for distributing the Channel Assignment once computed. We analyse the convergence rate of the proposed procedures and find that high network availability can be maintained despite the temporary loss of connectivity caused by the channel switching procedure. This dissertation consolidates the different activities required to improve the channel parameter settings of a multi-radio multi-channel DSA-WMN. The work facilitates the extension of Internet connectivity to the unconnected or unreliably connected in rural or peri-urban areas in a more cost-effective way, enabling more meaningful and affordable access technologies. It also empowers smaller players to construct better community networks for sharing local content. This technology can have knock-on effects of improved socio-economic conditions for the communities that use it

Towards realisation of spectrum sharing of cognitive radio networks

Cognitive radio networks (CRN) have emerged as a promising solution to spectrum shortcoming, thanks to Professor Mitola who coined Cognitive Radios. To enable efficient communications, CRNs need to avoid interference to both Primary (licensee) Users (PUs), and among themselves (called self-coexistence). In this thesis, we focus on self-coexistence issues. Very briefly, the problems are categorised into intentional and unintentional interference. Firstly, unintentional interference includes: 1) CRNs administration; 2) Overcrowded CRNs Situation; 3) Missed spectrum detection; 4) Inter-cell Interference (ICI); and 5) Inability to model Secondary Users’ (SUs) activity. In intentional interference there is Primary User Emulation Attack (PUEA). To administer CRN operations (Prob. 1), in our first contribution, we proposed CogMnet, which aims to manage the spectrum sharing of centralised networks. CogMnet divides the country into locations. It then dedicates a real-time database for each location to record CRNs’ utilisations in real time, where each database includes three storage units: Networks locations storage unit; Real-time storage unit; and Historical storage unit. To tackle Prob. 2, our second contribution is CRNAC, a network admission control algorithm that aims to calculate the maximum number of CRNs allowed in any location. CRNAC has been tested and evaluated using MATLAB. To prevent research problems 3, 4, and to tackle research problem (5), our third contribution is RCNC, a new design for an infrastructure-based CRN core. The architecture of RCNC consists of two engines: Monitor and Coordinator Engine (MNCE) and Modified Cognitive Engine (MCE). Comprehensive simulation scenarios using ICS Designer (by ATDI) have validated some of RCNC’s components. In the last contribution, to deter PUEA (the intentional interference type), we developed a PUEA Deterrent (PUED) algorithm capable of detecting PUEAs commission details. PUED must be implemented by a PUEA Identifier Component in the MNCE in RCNC after every spectrum handing off. Therefore, PUED works like a CCTV system. According to criminology, robust CCTV systems have shown a significant prevention of clear visible theft, reducing crime rates by 80%. Therefore, we believe that our algorithm will do the same. Extensive simulations using a Vienna simulator showed the effectiveness of the PUED algorithm in terms of improving CRNs’ performance

Cognitive radio networks : quality of service considerations and enhancements

The explosive growth of wireless and mobile networks, such as the Internet of Things and 5G, has led to a massive number of devices that primarily use wireless channels within a limited range of the radio frequency spectrum (RFS). The use of RFS is heavily regulated, both nationally and internationally, and is divided into licensed and unlicensed bands. While many of the licensed wireless bands are underutilised, useable unlicensed bands are usually overcrowded, making the efficient use of RFS one of the critical challenges faced by future wireless communication technologies. The cognitive radio (CR) concept is proposed as a promising solution for the underutilisation of useful RFS bands. Fundamentally, CR technology is based on determining the unoccupied licensed RFS bands, called spectrum white spaces or holes, and accessing them to achieve better RFS utilisation and transmission propagation. The holes are the frequencies unused by the licensed user, or primary user (PU). Based on spectrum sensing, a CR node, or secondary user (SU), senses the surrounding spectrum periodically to detect any potential PU transmission in the current channel and to identify the available spectrum holes. Under current RFS regulations, SUs may use spectrum holes as long as their transmissions do not interfere with those of the PU. However, effective spectrum sensing can introduce overheads to a CR node operation. Such overheads affect the quality of service (QoS) of the running applications. Reducing the sensing impact on the QoS is one of the key challenges to adopting CR technology, and more studies of QoS issues related to implementing CR features are needed. This thesis aims to address these QoS issues in CR while considered the enhancement of RFS utilisation. This study concentrates on the spectrum sensing function, among other CR functions, because of its major impact on QoS and spectrum utilisation. Several spectrum sensing methods are reviewed to identify potential research gaps in analysing and addressing related QoS implications. It has been found that none of the well-known sensing techniques is suitable for all the diverse QoS requirements and RFS conditions: in fact, higher accuracy sensing methods cause a significant QoS degradation, as illustrated by several simulations in this work. For instance, QoS degradation caused by high-accuracy sensing has not yet been addressed in the IEEE 802.11e QoS mechanism used in the proposed CR standard, IEEE 802.11af (or White-Fi). This study finds that most of the strategies proposed to conduct sensing are based on a fixed sensing method that is not adaptable to the changeable nature of QoS requirements. In contrast, this work confirms the necessity of using various sensing techniques and parameters during a CR node operation for better performance