中文版 | English
Title

Achieving the Performance Bounds for Sensing and Communications in Perceptive Networks: Optimal Bandwidth Allocation

Author
Corresponding AuthorFan Liu
Publication Years
2022-09-01
DOI
Source Title
ISSN
2162-2337
EISSN
2162-2345
Volume11Issue:9Pages:1835-1839
Abstract

This letter investigates the performance bounds of sensing and communications (S&C) in perceptive networks, where multiple user equipments (UEs) are deployed with both S&C capabilities whose performances are both closely related to the allocated bandwidth. To this end, we develop a novel bandwidth allocation strategy which optimizes the weighted average range resolution for sensing, while guaranteeing the sum-rate among UEs for wireless communications. We first formulate the bandwidth allocation problem into a convex optimization programming, and then develop a highly efficient algorithm to obtain the optimal solution. Through a deeper analysis of the problem structure, we build an initial understanding and provide insights into the performance tradeoff between S&C, which can be achieved by three specifically tailored bandwidth allocation schemes. Numerical results are given to verify the performance of the proposed method, showing that our bandwidth allocation scheme achieves the pareto boundary of S&C performance, with significantly reduced computational complexity.

Keywords
URL[Source Record]
Indexed By
SCI ; EI
Language
English
SUSTech Authorship
Corresponding
Funding Project
National Natural Science Foundation of China[62101234] ; National Key Research and Development Program of China[2021YFB2900200]
WOS Research Area
Computer Science ; Engineering ; Telecommunications
WOS Subject
Computer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications
WOS Accession No
WOS:000852215400017
Publisher
EI Accession Number
20222612278105
EI Keywords
Bandwidth ; Convex Optimization ; Frequency Allocation ; Numerical Methods ; Signal Interference
ESI Classification Code
Information Theory And Signal Processing:716.1 ; Radio Systems And Equipment:716.3 ; Television Systems And Equipment:716.4 ; Numerical Methods:921.6
Data Source
Web of Science
PDF urlhttps://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9796610
Citation statistics
Cited Times [WOS]:3
Document TypeJournal Article
Identifierhttp://kc.sustech.edu.cn/handle/2SGJ60CL/347889
DepartmentDepartment of Electrical and Electronic Engineering
Affiliation
1.China Academy of Information and Communications Technology, Beijing, China
2.Department of Electrical and Electronic Engineering, Southern University of Science and Technology, Shenzhen, China
Corresponding Author AffilicationDepartment of Electrical and Electronic Engineering
Recommended Citation
GB/T 7714
Zhiqin Wang,Kaifeng Han,Xia Shen,et al. Achieving the Performance Bounds for Sensing and Communications in Perceptive Networks: Optimal Bandwidth Allocation[J]. IEEE Wireless Communications Letters,2022,11(9):1835-1839.
APA
Zhiqin Wang,Kaifeng Han,Xia Shen,Weijie Yuan,&Fan Liu.(2022).Achieving the Performance Bounds for Sensing and Communications in Perceptive Networks: Optimal Bandwidth Allocation.IEEE Wireless Communications Letters,11(9),1835-1839.
MLA
Zhiqin Wang,et al."Achieving the Performance Bounds for Sensing and Communications in Perceptive Networks: Optimal Bandwidth Allocation".IEEE Wireless Communications Letters 11.9(2022):1835-1839.
Files in This Item:
There are no files associated with this item.
Related Services
Fulltext link
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Export to Excel
Export to Csv
Altmetrics Score
Google Scholar
Similar articles in Google Scholar
[Zhiqin Wang]'s Articles
[Kaifeng Han]'s Articles
[Xia Shen]'s Articles
Baidu Scholar
Similar articles in Baidu Scholar
[Zhiqin Wang]'s Articles
[Kaifeng Han]'s Articles
[Xia Shen]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhiqin Wang]'s Articles
[Kaifeng Han]'s Articles
[Xia Shen]'s Articles
Terms of Use
No data!
Social Bookmark/Share
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.