skip to main content

Explore Research Products in the NSF-PAR

Title: Integrated Access and Backhauling with Energy Harvesting and Dynamic Sleeping in HetNets
Due to the dense deployment of a small base station (SBS), wired backhauling is not always available, nor it is efficient. Therefore mmWaves are introduced to serve as backhauling links that offer high backhauling throughput and low CAPEX. However, mmWaves suffer from a high attenuation rate as the distance between SBSs and a macro base station (MBS) increases, which can severely degrade the system performance. Therefore, it is more efficient to use some SBSs to aggregate from different SBSs to MBS. On the other hand, densely deployed SBSs with wireless backhauling can cause high energy consumption in the system. In this work, we present a new network model in which SBSs are able to harvest energy from a renewable source and utilize it for backhauling and their associate UEs. A mathematical Optimization problem is formulated to solve UEs association, dynamic sleeping, backhauling, and transmission power. Moreover, due to the complexity of the formulated problem, a heuristic algorithm is introduced. Namely, a heuristic backhauling and dynamic sleeping (HBDS) algorithm is introduced to decomposes the formulated problem into two parts and solve it iteratively. Finally, computer simulation results that demonstrate the model’s performance are presented for comparison between optimal solution and HBDS, which shows that HBDS has better computation efficiency with minimum performance difference.  more » « less
Award ID(s):
1827211
NSF-PAR ID:
10297154
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
IEEE International Conference on Communications
Page Range / eLocation ID:
1 to 6
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ( , IEEE International Conference on Communications (ICC 2022).)
    Abstract—Virtual Network Functions (VNFs) are software implementation of middleboxes (MBs) (e.g., firewalls and proxy servers) that provide performance and security guarantees for virtual machine (VM) cloud applications. In this paper, we study a new VM flow migration problem for dynamic VNF-enabled cloud data centers (VDCs). The goal is to migrate the VM flows in the dynamic VDCs to minimize the total network traffic while load-balancing VNFs with limited processing capabilities. We refer to the problem as FMDV: flow migration in dynamic VDCs. We propose an optimal and efficient minimum cost flow-based flow migration algorithm and two benefit-based efficient heuristic algorithms to solve the FMDV. Via extensive simulations, we show that our algorithms are effective in mitigating dynamic cloud traffic while achieving load balance among VNFs. In particular, all our algorithms reduce dynamic network traffic in all cases and our optimal algorithm always achieves the best traffic-mitigation effect, reducing the network traffic by up to 28% compared to the case without flow migration. 
    more » « less
  2. ; ; ( , Transportation Science)
    The “asymmetry” between spatiotemporally varying passenger demand and fixed-capacity transportation supply has been a long-standing problem in urban mass transportation (UMT) systems around the world. The emerging modular autonomous vehicle (MAV) technology offers us an opportunity to close the substantial gap between passenger demand and vehicle capacity through station-wise docking and undocking operations. However, there still lacks an appropriate approach that can solve the operational design problem for UMT corridor systems with MAVs efficiently. To bridge this methodological gap, this paper proposes a continuum approximation (CA) model that can offer near-optimal solutions to the operational design for MAV-based transit corridors very efficiently. We investigate the theoretical properties of the optimal solutions to the investigated problem in a certain (yet not uncommon) case. These theoretical properties allow us to estimate the seat demand of each time neighborhood with the arrival demand curves, which recover the “local impact” property of the investigated problem. With the property, a CA model is properly formulated to decompose the original problem into a finite number of subproblems that can be analytically solved. A discretization heuristic is then proposed to convert the analytical solution from the CA model to feasible solutions to the original problem. With two sets of numerical experiments, we show that the proposed CA model can achieve near-optimal solutions (with gaps less than 4% for most cases) to the investigated problem in almost no time (less than 10 ms) for large-scale instances with a wide range of parameter settings (a commercial solver may even not obtain a feasible solution in several hours). The theoretical properties are verified, and managerial insights regarding how input parameters affect system performance are provided through these numerical results. Additionally, results also reveal that, although the CA model does not incorporate vehicle repositioning decisions, the timetabling decisions obtained by solving the CA model can be easily applied to obtain near-optimal repositioning decisions (with gaps less than 5% in most instances) very efficiently (within 10 ms). Thus, the proposed CA model provides a foundation for developing solution approaches for other problems (e.g., MAV repositioning) with more complex system operation constraints whose exact optimal solution can hardly be found with discrete modeling methods. 
    more » « less
  3. ; ( , IEEE Transactions on Reliability)
    The problem of allocating limited resources to maintain components of a multicomponent system, known as selective maintenance, is naturally formulated as a high-dimensional Markov decision process (MDP). Unfortunately, these problems are difficult to solve exactly for realistically sized systems. With this motivation, we contribute an approximate dynamic programming (ADP) algorithm for solving the selective maintenance problem for a series–parallel system with binary-state components. To the best of our knowledge, this paper describes the first application of ADP to maintain multicomponent systems. Our ADP is compared, using a numerical example from the literature, against exact solutions to the corresponding MDP. We then summarize the results of a more comprehensive set of experiments that demonstrate the ADP’s favorable performance on larger instances in comparison to both the exact (but computationally intensive) MDP approach and the heuristic (but computationally faster) one-step-lookahead approach. Finally, we demonstrate that the ADP is capable of solving an extension of the basic selective maintenance problem in which maintenance resources are permitted to be shared across stages. 
    more » « less
  4. ; ; ; ( , International Conference on Computer Communications and Networks)
    null (Ed.)
    Recently, there has been a flurry of research on the use of Reconfigurable Intelligent Surfaces (RIS) in wireless networks to create dynamic radio environments. In this paper, we investigate the use of an RIS panel to improve bi-directional communications. Assuming that the RIS will be located on the facade of a building, we propose to connect it to a solar panel that harvests energy to be used to power the RIS panel’s smart controller and reflecting elements. Therefore, we present a novel framework to optimally decide the transmit power of each user and the number of elements that will be used to reflect the signal of any two communicating pair in the system (user-user or base station-user). An optimization problem is formulated to jointly minimize a scalarized function of the energy of the communicating pair and the RIS panel and to find the optimal number of reflecting elements used by each user. Although the formulated problem is a mixed-integer nonlinear problem, the optimal solution is found by linearizing the non-linear constraints. Besides, a more efficient close to the optimal solution is found using Bender decomposition. Simulation results show that the proposed model is capable of delivering the minimum rate of each user even if line-of-sight communication is not achievable. 
    more » « less
  5. ( , IEEE Vehicular Technology Conference)
    High Altitude Platform Station (HAPS) has the potential to provide global wireless connectivity and data services such as high-speed wireless backhaul, industrial Internet of things (IoT), and public safety for large areas not served by terrestrial networks. A unified HAPS design is desired to support various use cases and a wide range of requirements. In this paper, we present two architecture designs of the HAPS system: i) repeater based HAPS, and ii) base station based HAPS, which are both viable technical solutions. The energy efficiency is analyzed and compared between the two architectures using consumption factor theory. The system performance of these two architectures is evaluated through Monte Carlo simulations and is characterized in metrics of spectral efficiency using LTE band 1 for both single-cell and multi-cell cases. Both designs can provide good downlink spectral efficiency and coverage, while the uplink coverage is significantly limited by UE transmit power and antenna gain. Using directional antennas at the UEs can improve the system performance for both downlink and uplink. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email