Short-Packet Communications in Multi-Hop Networks with WET: Performance Analysis and Deep Learning-Aided Optimization
- Authors
- Nguyen, T.; Nguyen, V.; Da, Costa D.B.; Huynh-The, T.; Hu, R.Q.; An, B.
- Issue Date
- 1-Jan-2023
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Deep learning; energy harvesting; finite blocklength; multi-hop networks; nonconvex optimization; Optimization; Real-time systems; Relays; Spread spectrum communication; Throughput; Ultra reliable low latency communication; Wireless communication
- Citation
- IEEE Transactions on Wireless Communications, v.22, no.1, pp.1 - 1
- Journal Title
- IEEE Transactions on Wireless Communications
- Volume
- 22
- Number
- 1
- Start Page
- 1
- End Page
- 1
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/30371
- DOI
- 10.1109/TWC.2022.3195234
- ISSN
- 1536-1276
- Abstract
- In this paper, we study short-packet communications in multi-hop networks with wireless energy transfer, where relay nodes harvest energy from power beacons to transmit short packets to multiple destinations. It is proposed a novel cooperative beamforming relay selection (CRS) scheme which incorporates partial relay selection and distributed multiuser beamforming to achieve a high-reliable transmission in two consecutive hops. A closed-form expression for the average block error rate (BLER) of the CRS scheme is derived, based on which an asymptotic analysis is also carried out. To achieve optimal channel uses allocation, we formulate a fairness end-to-end throughput maximization problem which is generally NP-hard due to the non-concavity of the objective function and mixed-integer constraints. To solve this challenging problem efficiently, we first relax channel uses to be continuous and transform the relaxed problem into an equivalent non-convex one, but with a more tractable form. We then develop a low-complexity iterative algorithm relying on inner approximation framework to convexify non-convex parts that converges to at least a locally optimal solution. Towards real-time settings, we design an efficient deep convolutional neural network (CNN) with multiscale-accumulation connections to achieve the sub-optimal solution of the relaxed problem via real-time inference processes. Numerical results are presented to verify the analytical derivations and to demonstrate performance improvements of the CRS scheme over the benchmark ones in terms of BLER, reliability, latency, and throughput in various settings. Moreover, the designed CNN provides the lowest root-mean-square error compared to the state-of-the-art deep learning approaches while the CNN-aided optimization framework estimates accurately the optimal channel uses allocation with low execution time. IEEE
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Software and Communications Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.