This paper considers an intelligent reflecting surface(IRS)-aided wireless powered communication network (WPCN), where devices first harvest energy from a power station (PS) in the downlink (DL) and then transmit information using non-orthogonal multiple access (NOMA) to a data sink in the uplink (UL). However, most existing works on WPCNs adopted the simplified linear energy-harvesting model and also cannot guarantee strict user quality-of-service requirements. To address these issues, we aim to minimize the total transmit energy consumption at the PS by jointly optimizing the resource allocation and IRS phase shifts over time, subject to the minimum throughput requirements of all devices. The formulated problem is decomposed into two subproblems, and solved iteratively in an alternative manner by employing difference of convex functions programming, successive convex approximation, and penalty-based algorithm. Numerical results demonstrate the significant performance gains achieved by the proposed algorithm over benchmark schemes and reveal the benefits of integrating IRS into WPCNs. In particular, employing different IRS phase shifts over UL and DL outperforms the case with static IRS beamforming.
相關內容
ACM/IEEE第23屆模型驅動工程語言和系統國際會議，是模型驅動軟件和系統工程的首要會議系列，由ACM-SIGSOFT和IEEE-TCSE支持組織。自1998年以來，模型涵蓋了建模的各個方面，從語言和方法到工具和應用程序。模特的參加者來自不同的背景，包括研究人員、學者、工程師和工業專業人士。MODELS 2019是一個論壇，參與者可以圍繞建模和模型驅動的軟件和系統交流前沿研究成果和創新實踐經驗。今年的版本將為建模社區提供進一步推進建模基礎的機會，并在網絡物理系統、嵌入式系統、社會技術系統、云計算、大數據、機器學習、安全、開源等新興領域提出建模的創新應用以及可持續性。
官網鏈接： ·
聯邦學習
·
優化器
·
學成
·
Networking
·
To leverage massive distributed data and computation resources, machine learning in the network edge is considered to be a promising technique especially for large-scale model training. Federated learning (FL), as a paradigm of collaborative learning techniques, has obtained increasing research attention with the benefits of communication efficiency and improved data privacy. Due to the lossy communication channels and limited communication resources (e.g., bandwidth and power), it is of interest to investigate fast responding and accurate FL schemes over wireless systems. Hence, we investigate the problem of jointly optimized communication efficiency and resources for FL over wireless Internet of things (IoT) networks. To reduce complexity, we divide the overall optimization problem into two sub-problems, i.e., the client scheduling problem and the resource allocation problem. To reduce the communication costs for FL in wireless IoT networks, a new client scheduling policy is proposed by reusing stale local model parameters. To maximize successful information exchange over networks, a Lagrange multiplier method is first leveraged by decoupling variables including power variables, bandwidth variables and transmission indicators. Then a linear-search based power and bandwidth allocation method is developed. Given appropriate hyper-parameters, we show that the proposed communication-efficient federated learning (CEFL) framework converges at a strong linear rate. Through extensive experiments, it is revealed that the proposed CEFL framework substantially boosts both the communication efficiency and learning performance of both training loss and test accuracy for FL over wireless IoT networks compared to a basic FL approach with uniform resource allocation.
Intelligent reflecting surface (IRS) is a promising solution to build a programmable wireless environment for future communication systems, in which the reflector elements steer the incident signal in fully customizable ways by passive beamforming. In this paper, an IRS-aided secure spatial modulation (SM) is proposed, where the IRS perform passive beamforming and information transfer simultaneously by adjusting the on-off states of the reflecting elements. We formulate an optimization problem to maximize the average secrecy rate (SR) by jointly optimizing the passive beamforming at IRS and the transmit power at transmitter under the consideration that the direct pathes channels from transmitter to receivers are obstructed by obstacles. As the expression of SR is complex, we derive a newly fitting expression (NASR) for the expression of traditional approximate SR (TASR), which has simpler closed-form and more convenient for subsequent optimization. Based on the above two fitting expressions, three beamforming methods, called maximizing NASR via successive convex approximation (Max-NASR-SCA), maximizing NASR via dual ascent (Max-NASR-DA) and maximizing TASR via semi-definite relaxation (Max-TASR-SDR) are proposed to improve the SR performance. Additionally, two transmit power design (TPD) methods are proposed based on the above two approximate SR expressions, called Max-NASR-TPD and Max-TASR-TPD. Simulation results show that the proposed Max-NASR-DA and Max-NASR-SCA IRS beamformers harvest substantial SR performance gains over Max-TASR-SDR. For TPD, the proposed Max-NASR-TPD performs better than Max-TASR-TPD. Particularly, the Max-NASR-TPD has a closed-form solution.
To sustain communication reliability and use the harvested energy effectively, it is crucial to consider energy sharing between energy harvesting tags (EHT) in a multiple access network, which are basic building blocks for the internet of things (IoT) applications. This technique also achieves higher throughput compared with the non-cooperative strategies despite energy losses occurred during energy transfer. We propose an energy cooperative communication strategy for a multiple access network of tags that depends on the harvested battery energy. We develop an optimal transmission policy for EHTs that maximizes the long-term joint average throughput using a Markov decision process (MDP) model. Simulation results show that the proposed energy cooperative policy produces improved performance than traditional policies.
The fifth-generation of mobile radio technologies is expected to be agile, flexible, and scalable while provisioning ultra-reliable and low-latency communication (uRLLC), enhanced mobile broadband (eMBB), and massive machine type communication (mMTC) applications. These are implemented by adopting cloudification, network function virtualization, and network slicing techniques in open-radio access network (O-RAN) architecture where remote radio heads (RRHs) are connected to dis-aggregated virtual base-band units (BBUs), i.e., radio unit (RU), distributed unit (DU), and centralized unit (CU) over front/mid-haul interfaces. However, cost-efficient solutions are required for designing front/mid-haul interfaces and time-wavelength division multiplexed (TWDM) passive optical network (PON) appears as a potential candidate. Therefore, in this paper, we propose a framework for the optimal placement of RUs based on long-term network statistics and connecting them to open access-edge servers for hosting the corresponding DUs and CUs over front/mid-haul interfaces while satisfying the diverse QoS requirements of uRLLC, eMBB, and mMTC slices. In turn, we formulate a two-stage integer programming problem and time-efficient heuristics for users to RU association and flexible deployment of the corresponding DUs and CUs. We evaluate the O-RAN deployment cost and latency requirements with our TWDM-PON-based framework against urban, rural, and industrial areas and show its efficiency over the optical transport network (OTN)-based framework.
In reconfigurable intelligent surface (RIS) aided millimeter-wave (mmWave) communication systems, in order to overcome the limitation of the conventional channel state information (CSI) acquisition techniques, this paper proposes a location information assisted beamforming design without the requirement of the conventional channel training process. First, we establish the geometrical relation between the channel model and the user location, based on which we derive an approximate CSI error bound based on the user location error by means of Taylor approximation, triangle and power mean inequalities, and semidefinite relaxation (SDR). Second, for combating the uncertainty of the location error, we formulate a worst-case robust beamforming optimization problem. To solve the problem efficiently, we develop a novel iterative algorithm by utilizing various optimization tools such as Lagrange multiplier, matrix inversion lemma, SDR, as well as branch-and-bound (BnB). Particularly, the BnB algorithm is modified to acquire the phase shift solution under an arbitrary constraint of possible phase shift values. Finally, we analyse the algorithm complexity, and carry out simulations to validate the theoretical derivation of the CSI error bound and the robustness of the proposed algorithm. Compared with the existing non-robust approach and the robust beamforming techniques based on S-procedure and penalty convex-concave procedure (CCP), our method converges faster and achieves better performance in terms of the worst-case signal-to-noise ratio (SNR) at the receiver.
With its privacy preservation and communication efficiency, federated learning (FL) has emerged as a learning framework that suits beyond 5G and towards 6G systems. This work looks into a future scenario in which there are multiple groups with different learning purposes and participating in different FL processes. We give energy-efficient solutions to demonstrate that this scenario can be realistic. First, to ensure a stable operation of multiple FL processes over wireless channels, we propose to use a massive multiple-input multiple-output network to support the local and global FL training updates, and let the iterations of these FL processes be executed within the same large-scale coherence time. Then, we develop asynchronous and synchronous transmission protocols where these iterations are asynchronously and synchronously executed, respectively, using the downlink unicasting and conventional uplink transmission schemes. Zero-forcing processing is utilized for both uplink and downlink transmissions. Finally, we propose an algorithm that optimally allocates power and computation resources to save energy at both base station and user sides, while guaranteeing a given maximum execution time threshold of each FL iteration. Compared to the baseline schemes, the proposed algorithm significantly reduces the energy consumption, especially when the number of base station antennas is large.
Reconstructing the structure of the soil using non-invasive techniques is a very relevant problem in many scientific fields, like geophysics and archaeology. This can be done, for instance, with the aid of Frequency Domain Electromagnetic (FDEM) induction devices. Inverting FDEM data is a very challenging inverse problem, as the problem is extremely ill-posed, i.e., sensible to the presence of noise in the measured data, and non-linear. Regularization methods substitute the original ill-posed problem with a well-posed one whose solution is an accurate approximation of the desired one. In this paper we develop a regularization method to invert FDEM data. We propose to determine the electrical conductivity of the ground by solving a variational problem. The minimized functional is made up by the sum of two term: the data fitting term ensures that the recovered solution fits the measured data, while the regularization term enforces sparsity on the Laplacian of the solution. The trade-off between the two terms is determined by the regularization parameter. This is achieved by minimizing an $\ell_2 - \ell_q$ functional with $0 < q \leq 2$. Since the functional we wish to minimize is non-convex, we show that the variational problem admits a solution. Moreover, we prove that, if the regularization parameter is tuned accordingly to the amount of noise present in the data, this model induces a regularization method. Some selected numerical examples on synthetic and real data show the good performances of our proposal.
We propose a new secure transmission scheme for uplink multiple-input single-output (MISO) orthogonal-frequency multiplexing (OFDM) systems in the presence of multiple eavesdroppers. Our proposed scheme utilizes the sub-channels orthogonality of OFDM systems to simultaneously transmit data and secret key symbols. The base station, Bob, shares secret key symbols with the legitimate user, Alice, using wiretap coding over a portion of the sub-channels. Concurrently, Alice uses the accumulated secret keys in her secret-key queue to encrypt data symbols using a one time pad (OTP) cipher and transmits them to Bob over the remaining sub-channels. if Alice did not accumulate sufficient keys in her secret-key queue, she employs wiretap coding to secure her data transmissions. We propose fixed and dynamic sub-channel allocation schemes to divide the sub-channels between data and secret keys. We derive the secrecy outage probability (SOP) and the secure throughput for the proposed scheme. We quantify the system's security under practical non-Gaussian transmissions where discrete signal constellation points are transmitted by the legitimate source nodes. Numerical results validate our theoretical findings and quantify the impact of different system design parameters.
We study the problem of optimal power allocation in single-hop multi-antenna ad-hoc wireless networks. A standard technique to solve this problem involves optimizing a tri-convex function under power constraints using a block-coordinate-descent (BCD) based iterative algorithm. This approach, termed WMMSE, tends to be computationally complex and time consuming. Several learning-based approaches have been proposed to speed up the power allocation process. A recent work, UWMMSE, learns an affine transformation of a WMMSE parameter in an unfolded structure to accelerate convergence. In spite of achieving promising results, its application is limited to single-antenna wireless networks. In this work, we present a UWMMSE framework for power allocation in (multiple-input multiple-output) MIMO interference networks. Through an empirical study, we illustrate the superiority of our approach in comparison to WMMSE and also analyze its robustness to changes in channel conditions and network size.
In this paper, we consider an information update system where wireless sensor sends timely updates to the destination over a random blocking terahertz channel with the supply of harvested energy and reliable energy backup. The paper aims to find the optimal information updating policy that minimize the time-average weighted sum of the Age of information(AoI) and the reliable energy costs by formulating an infinite state Markov decision process(MDP). With the derivation of the monotonicity of value function on each component, the optimal information updating policy is proved to have a threshold structure. Based on this special structure, an algorithm for efficiently computing the optimal policy is proposed. Numerical results show that the optimal updating policy proposed outperforms baseline policies.
注冊地址： 北京市海淀區羊坊店路18號2幢3層301-191