73 research outputs found

    Energy-Efficient Design of Satellite-Terrestrial Computing in 6G Wireless Networks

    Full text link
    In this paper, we investigate the issue of satellite-terrestrial computing in the sixth generation (6G) wireless networks, where multiple terrestrial base stations (BSs) and low earth orbit (LEO) satellites collaboratively provide edge computing services to ground user equipments (GUEs) and space user equipments (SUEs) over the world. In particular, we design a complete process of satellite-terrestrial computing in terms of communication and computing according to the characteristics of 6G wireless networks. In order to minimize the weighted total energy consumption while ensuring delay requirements of computing tasks, an energy-efficient satellite-terrestrial computing algorithm is put forward by jointly optimizing offloading selection, beamforming design and resource allocation. Finally, both theoretical analysis and simulation results confirm fast convergence and superior performance of the proposed algorithm for satellite-terrestrial computing in 6G wireless networks

    Low-Complexity Beam Allocation for Switched-Beam Based Multiuser Massive MIMO Systems

    Get PDF
    This paper addresses the beam allocation problem in a switched-beam based massive multiple-input-multiple-output (MIMO) system working at the millimeter wave (mmWave) frequency band, with the target of maximizing the sum data rate. This beam allocation problem can be formulated as a combinatorial optimization problem under two constraints that each user uses at most one beam for its data transmission and each beam serves at most one user. The brute-force search is a straightforward method to solve this optimization problem. However, for a massive MIMO system with a large number of beams N, the brute-force search results in intractable complexity O(NK), where K is the number of users. In this paper, in order to solve the beam allocation problem with affordable complexity, a suboptimal low-complexity beam allocation (LBA) algorithm is developed based on submodular optimization theory, which has been shown to be a powerful tool for solving combinatorial optimization problems. Simulation results show that our proposed LBA algorithm achieves nearly optimal sum data rate with complexity O(K logN). Furthermore, the average service ratio, i.e., the ratio of the number of users being served to the total number of users, is theoretically analyzed and derived as an explicit function of the ratio N=K

    The Role of Physical Layer Security in Satellite-Based Networks

    Full text link
    In the coming years, 6G will revolutionize the world with a large amount of bandwidth, high data rates, and extensive coverage in remote and rural areas. These goals can only be achieved by integrating terrestrial networks with non-terrestrial networks. On the other hand, these advancements are raising more concerns than other wireless links about malicious attacks on satellite-terrestrial links due to their openness. Over the years, physical layer security (PLS) has emerged as a good candidate to deal with security threats by exploring the randomness of wireless channels. In this direction, this paper reviews how PLS methods are implemented in satellite communications. Firstly, we discuss the ongoing research on satellite-based networks by highlighting the key points in the literature. Then, we revisit the research activities on PLS in satellite-based networks by categorizing the different system architectures. Finally, we highlight research directions and opportunities to leverage the PLS in future satellite-based networks

    Investigating the effect of High Altitude Platform Positioning on Latency and Coverage of 4G Cellular Systems

    Get PDF
    Wireless communication technologies are rapidly being adopted and developed by countries all over the world as a strategy for sustaining a digital economy. This has proven very useful for economic recovery from the crises brought about by the COVID-19 pandemic of the year 2020. The latency and coverage area of a wireless network are two major areas that are always seeking improvement. The High Altitude Platform communication technology can provide improvement in speed and coverage area for 4G cellular systems. This work investigated the effect of positioning High Altitude Platforms on the latency and coverage of 4G cellular Systems. A quantitative approach was used in the methodology of this paper. A HAP model showing a single platform flying in a circular trajectory over Base Transceiver Stations BTSs and serving as a relay mobile station was presented. A detailed simulation algorithm for the HAP and results for the simulation were given. Results showed that using the HAP as a relay mobile station in a network can give a latency reduction of up to 58.9%.  Also, the altitude of the HAP directly affects the angle of reception which was found to improve the coverage

    A Survey on Delay-Aware Resource Control for Wireless Systems --- Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning

    Full text link
    In this tutorial paper, a comprehensive survey is given on several major systematic approaches in dealing with delay-aware control problems, namely the equivalent rate constraint approach, the Lyapunov stability drift approach and the approximate Markov Decision Process (MDP) approach using stochastic learning. These approaches essentially embrace most of the existing literature regarding delay-aware resource control in wireless systems. They have their relative pros and cons in terms of performance, complexity and implementation issues. For each of the approaches, the problem setup, the general solution and the design methodology are discussed. Applications of these approaches to delay-aware resource allocation are illustrated with examples in single-hop wireless networks. Furthermore, recent results regarding delay-aware multi-hop routing designs in general multi-hop networks are elaborated. Finally, the delay performance of the various approaches are compared through simulations using an example of the uplink OFDMA systems.Comment: 58 pages, 8 figures; IEEE Transactions on Information Theory, 201

    On the Delay-Throughput Tradeoff in Distributed Wireless Networks

    Full text link
    This paper deals with the delay-throughput analysis of a single-hop wireless network with nn transmitter/receiver pairs. All channels are assumed to be block Rayleigh fading with shadowing, described by parameters (α,ϖ)(\alpha,\varpi), where α\alpha denotes the probability of shadowing and ϖ\varpi represents the average cross-link gains. The analysis relies on the distributed on-off power allocation strategy (i.e., links with a direct channel gain above a certain threshold transmit at full power and the rest remain silent) for the deterministic and stochastic packet arrival processes. It is also assumed that each transmitter has a buffer size of one packet and dropping occurs once a packet arrives in the buffer while the previous packet has not been served. In the first part of the paper, we define a new notion of performance in the network, called effective throughput, which captures the effect of arrival process in the network throughput, and maximize it for different cases of packet arrival process. It is proved that the effective throughput of the network asymptotically scales as lognα^\frac{\log n}{\hat{\alpha}}, with α^αϖ\hat{\alpha} \triangleq \alpha \varpi, regardless of the packet arrival process. In the second part of the paper, we present the delay characteristics of the underlying network in terms of the packet dropping probability. We derive the sufficient conditions in the asymptotic case of nn \to \infty such that the packet dropping probability tend to zero, while achieving the maximum effective throughput of the network. Finally, we study the trade-off between the effective throughput, delay, and packet dropping probability of the network for different packet arrival processes.Comment: Submitted to IEEE Transactions on Information Theory (34 pages

    Link Scheduling in UAV-Aided Networks

    Get PDF
    Unmanned Aerial Vehicles (UAVs) or drones are a type of low altitude aerial mobile vehicles. They can be integrated into existing networks; e.g., cellular, Internet of Things (IoT) and satellite networks. Moreover, they can leverage existing cellular or Wi-Fi infrastructures to communicate with one another. A popular application of UAVs is to deploy them as mobile base stations and/or relays to assist terrestrial wireless communications. Another application is data collection, whereby they act as mobile sinks for wireless sensor networks or sensor devices operating in IoT networks. Advantageously, UAVs are cost-effective and they are able to establish line-of-sight links, which help improve data rate. A key concern, however, is that the uplink communications to a UAV may be limited, where it is only able to receive from one device at a time. Further, ground devices, such as those in IoT networks, may have limited energy, which limit their transmit power. To this end, there are three promising approaches to address these concerns, including (i) trajectory optimization, (ii) link scheduling, and (iii) equipping UAVs with a Successive Interference Cancellation (SIC) radio. Henceforth, this thesis considers data collection in UAV-aided, TDMA and SICequipped wireless networks. Its main aim is to develop novel link schedulers to schedule uplink communications to a SIC-capable UAV. In particular, it considers two types of networks: (i) one-tier UAV communications networks, where a SIC-enabled rotary-wing UAV collects data from multiple ground devices, and (ii) Space-Air-Ground Integrated Networks (SAGINs), where a SIC-enabled rotary-wing UAV offloads collected data from ground devices to a swarm of CubeSats. A CubeSat then downloads its data to a terrestrial gateway. Compared to one-tier UAV communications networks, SAGINs are able to provide wide coverage and seamless connectivity to ground devices in remote and/or sparsely populated areas

    Power and bandwidth allocation in multibeam satellite systems

    Get PDF
    This thesis proposes a genetic algorithm to allocate the main resources of a multibeam communications satellite: power and bandwidth. The algorithm exposed can reduce the unmet system capacity (USC) by 10% - 15% in comparison with a power-only allocation
    corecore