3,166 research outputs found

    HetHetNets: Heterogeneous Traffic Distribution in Heterogeneous Wireless Cellular Networks

    Full text link
    A recent approach in modeling and analysis of the supply and demand in heterogeneous wireless cellular networks has been the use of two independent Poisson point processes (PPPs) for the locations of base stations (BSs) and user equipments (UEs). This popular approach has two major shortcomings. First, although the PPP model may be a fitting one for the BS locations, it is less adequate for the UE locations mainly due to the fact that the model is not adjustable (tunable) to represent the severity of the heterogeneity (non-uniformity) in the UE locations. Besides, the independence assumption between the two PPPs does not capture the often-observed correlation between the UE and BS locations. This paper presents a novel heterogeneous spatial traffic modeling which allows statistical adjustment. Simple and non-parameterized, yet sufficiently accurate, measures for capturing the traffic characteristics in space are introduced. Only two statistical parameters related to the UE distribution, namely, the coefficient of variation (the normalized second-moment), of an appropriately defined inter-UE distance measure, and correlation coefficient (the normalized cross-moment) between UE and BS locations, are adjusted to control the degree of heterogeneity and the bias towards the BS locations, respectively. This model is used in heterogeneous wireless cellular networks (HetNets) to demonstrate the impact of heterogeneous and BS-correlated traffic on the network performance. This network is called HetHetNet since it has two types of heterogeneity: heterogeneity in the infrastructure (supply), and heterogeneity in the spatial traffic distribution (demand).Comment: JSA

    Spatial networks with wireless applications

    Get PDF
    Many networks have nodes located in physical space, with links more common between closely spaced pairs of nodes. For example, the nodes could be wireless devices and links communication channels in a wireless mesh network. We describe recent work involving such networks, considering effects due to the geometry (convex,non-convex, and fractal), node distribution, distance-dependent link probability, mobility, directivity and interference.Comment: Review article- an amended version with a new title from the origina

    Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

    Full text link
    Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

    Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks

    Get PDF
    We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic gradient view simplifies and generalizes previously proposed solutions, and is applicable to new complex scenarios, for example adaptive coverage involving heterogeneous agents. Finally, our algorithms often take the form of simple distributed rules that could be implemented on resource-limited platforms

    Advanced Technologies Enabling Unlicensed Spectrum Utilization in Cellular Networks

    Get PDF
    As the rapid progress and pleasant experience of Internet-based services, there is an increasing demand for high data rate in wireless communications systems. Unlicensed spectrum utilization in Long Term Evolution (LTE) networks is a promising technique to meet the massive traffic demand. There are two effective methods to use unlicensed bands for delivering LTE traffic. One is offloading LTE traffic toWi-Fi. An alternative method is LTE-unlicensed (LTE-U), which aims to directly use LTE protocols and infrastructures over the unlicensed spectrum. It has also been pointed out that addressing the above two methods simultaneously could further improve the system performance. However, how to avoid severe performance degradation of the Wi-Fi network is a challenging issue of utilizing unlicensed spectrum in LTE networks. Specifically, first, the inter-system spectrum sharing, or, more specifically, the coexistence of LTE andWi-Fi in the same unlicensed spectrum is the major challenge of implementing LTE-U. Second, to use the LTE and Wi-Fi integration approach, mobile operators have to manage two disparate networks in licensed and unlicensed spectrum. Third, optimization for joint data offloading to Wi-Fi and LTE-U in multi- cell scenarios poses more challenges because inter-cell interference must be addressed. This thesis focuses on solving problems related to these challenges. First, the effect of bursty traffic in an LTE and Wi-Fi aggregation (LWA)-enabled network has been investigated. To enhance resource efficiency, the Wi-Fi access point (AP) is designed to operate in both the native mode and the LWA mode simultaneously. Specifically, the LWA-modeWi-Fi AP cooperates with the LTE base station (BS) to transmit bearers to the LWA user, which aggregates packets from both LTE and Wi-Fi. The native-mode Wi-Fi AP transmits Wi-Fi packets to those native Wi-Fi users that are not with LWA capability. This thesis proposes a priority-based Wi-Fi transmission scheme with congestion control and studied the throughput of the native Wi-Fi network, as well as the LWA user delay when the native Wi-Fi user is under heavy traffic conditions. The results provide fundamental insights in the throughput and delay behavior of the considered network. Second, the above work has been extended to larger topologies. A stochastic geometry model has been used to model and analyze the performance of an MPTCP Proxy-based LWA network with intra-tier and cross-tier dependence. Under the considered network model and the activation conditions of LWA-mode Wi-Fi, this thesis has obtained three approximations for the density of active LWA-mode Wi-Fi APs through different approaches. Tractable analysis is provided for the downlink (DL) performance evaluation of large-scale LWA networks. The impact of different parameters on the network performance have been analyzed, validating the significant gain of using LWA in terms of boosted data rate and improved spectrum reuse. Third, this thesis also takes a significant step of analyzing joint multi-cell LTE-U and Wi-Fi network, while taking into account different LTE-U and Wi-Fi inter-working schemes. In particular, two technologies enabling data offloading from LTE to Wi-Fi are considered, including LWA and Wi-Fi offloading in the context of the power gain-based user offloading scheme. The LTE cells in this work are subject to load-coupling due to inter-cell interference. New system frameworks for maximizing the demand scaling factor for all users in both Wi-Fi and multi-cell LTE networks have been proposed. The potential of networks is explored in achieving optimal capacity with arbitrary topologies, accounting for both resource limits and inter-cell interference. Theoretical analyses have been proposed for the proposed optimization problems, resulting in algorithms that achieve global optimality. Numerical results show the algorithms’ effectiveness and benefits of joint use of data offloading and the direct use of LTE over the unlicensed band. All the derived results in this thesis have been validated by Monte Carlo simulations in Matlab, and the conclusions observed from the results can provide guidelines for the future unlicensed spectrum utilization in LTE networks

    Ultra-Wideband Technology: Characteristcs, Applications and Challenges

    Full text link
    Ultra-wideband (UWB) technology is a wireless communication technology designed for short-range applications. It is characterized by its ability to generate and transmit radio-frequency energy over an extensive frequency range. This paper provides an overview of UWB technology including its definition, two representative schemes and some key characteristics distinguished from other types of communication. Besides, this paper also analyses some widely used applications of UWB technology and highlights some of the challenges associated with implementing UWB in real-world scenarios. Furthermore, this paper expands upon UWB technology to encompass terahertz technology, providing an overview of the current status of terahertz communication, and conducting an analysis of the advantages, challenges, and certain corresponding solutions pertaining to ultra-wideband THz communication

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

    Get PDF
    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
    • …
    corecore