Journal of Communications and Networks最新文献_第2页

Intelligent reconstruction algorithm of electromagnetic map based on propagation model 基于传播模型的电磁图智能重建算法

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-10-01 DOI: 10.23919/JCN.2024.000055

Haojin Li;Hongjun Wang;Zhexian Shen;Yingchun Shi

{"title":"Intelligent reconstruction algorithm of electromagnetic map based on propagation model","authors":"Haojin Li;Hongjun Wang;Zhexian Shen;Yingchun Shi","doi":"10.23919/JCN.2024.000055","DOIUrl":"https://doi.org/10.23919/JCN.2024.000055","url":null,"abstract":"In view of the fact that electromagnetic maps can be used to depict the distribution of electromagnetic spectrum in detail, and to support electromagnetic spectrum analysis and management, as well as network design and optimization, this paper studies an intelligent reconstruction algorithm of electromagnetic map based on propagation model in the application field scenario of integrated sensing and communication (ISAC) technology. Firstly, the propagation model is used to model the variogram function, and then the improved particle swarm optimization algorithm is used to solve the expression of the variogram function, and the semi-variovariation values of the points to be estimated and the sampling points are obtained according to the variogram function. Then, the spatial interpolation method combined with the semi-variant value is used to estimate the estimated points, and finally the reconstructed electromagnetic map is obtained. Experimental simulation and comparison prove the effectiveness and advancement of the proposed algorithm.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 5","pages":"533-544"},"PeriodicalIF":2.9,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748590","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Joint PA and FDA beamforming for radar-communications systems 雷达通信系统的联合功率放大器和 FDA 波束成形

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-10-01 DOI: 10.23919/JCN.2024.000049

Freddy Y. P. Feng;Suk Chan Kim;Ziming He;Feng Chen;Chen Lu;Sami Muhaidat

{"title":"Joint PA and FDA beamforming for radar-communications systems","authors":"Freddy Y. P. Feng;Suk Chan Kim;Ziming He;Feng Chen;Chen Lu;Sami Muhaidat","doi":"10.23919/JCN.2024.000049","DOIUrl":"https://doi.org/10.23919/JCN.2024.000049","url":null,"abstract":"Integrated wireless communications and radar detections have so far mainly relied on phased-array (PA) antennas with only considering the beampatterns in angle domain. In this paper, by taking advantage of frequency diverse array (FDA), which can generate beampatterns in angle, range and time domains, we propose a novel finite orthogonal random FDA, whose beampatterns feature periodical pulses in time or range domain. By applying this technology into radar and communications (RadComm) systems, a compact dual-functional structure of joint PA and FDA is designed. With the proposed novel structure, the common information, such as channel status information and direction-of-arrival can be easily shared for both PA communications and FDA radar. Based on the built joint PA and FDA channel models, different beamformer designs are proposed by jointly optimizing the signal-to-interference- noises of the communications and radar. In addition, we robustify the proposed method by considering the case of channel estimation imprecision. Numerical simulations demonstrate the performances of both communications and the radar with the proposed approaches are over than that of the conventional PA RadComm systems.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 5","pages":"554-565"},"PeriodicalIF":2.9,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10748579","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Generalized multi-user sparse superposition transmission for massive machine-type communications 用于大规模机器类通信的通用多用户稀疏叠加传输

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-08-01 DOI: 10.23919/JCN.2024.000029

Ming Hui;Xuewan Zhang;Jingjing Guo

{"title":"Generalized multi-user sparse superposition transmission for massive machine-type communications","authors":"Ming Hui;Xuewan Zhang;Jingjing Guo","doi":"10.23919/JCN.2024.000029","DOIUrl":"https://doi.org/10.23919/JCN.2024.000029","url":null,"abstract":"To fulfill the connectivity demands in massive machine-type communications (mMTC), this paper investigates a generalized multi-user sparse superposition transmission (GMUSST) technology based on position index modulation. Due to the high computation complexity of maximum likelihood (ML) multi-user detection, a low complexity multi-path successive interference cancellation (MSIC) multi-user detector is introduced to achieve near-ML detector's block error ratio (BLER) performance. Furthermore, considering that each user is only concerned with their own transmitted signal in the downlink GMUSST system, we propose a minimum mean square error-based SIC (MMSE-SIC) detector, which can directly extract the user's transmission signal from the received superimposed signal of multiple users and is verified compared with MSIC detector. Simulation results show that the GMUSST can achieve better transmission reliability than the existing polar coded sparse code multiple access (PC-SCMA) in the short packet communication scenarios. Especially with the hybrid automatic repeat request mechanism, GMUSST requires fewer retransmissions to achieve the same BLER performance compared to PC-SCMA.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"433-444"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666071","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Information for authors 作者须知

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-08-01 DOI: 10.23919/JCN.2024.000043

引用次数: 0

A full-duplex technology based on the Doppler effect 基于多普勒效应的全双工技术

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-08-01 DOI: 10.23919/JCN.2024.000038

Hao Feng;Meng Ma;Yuping Zhao

引用次数: 0

Degree-degree correlated low-density parity-check codes and their extensions 度相关低密度奇偶校验码及其扩展

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-08-01 DOI: 10.23919/JCN.2024.000030

Hsiao-Wen Yu;Cheng-En Lee;Ruhui Zhang;Cheng-Shang Chang;Duan-Shin Lee

{"title":"Degree-degree correlated low-density parity-check codes and their extensions","authors":"Hsiao-Wen Yu;Cheng-En Lee;Ruhui Zhang;Cheng-Shang Chang;Duan-Shin Lee","doi":"10.23919/JCN.2024.000030","DOIUrl":"https://doi.org/10.23919/JCN.2024.000030","url":null,"abstract":"Most existing work on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assumes that the degree distributions of the two ends of a randomly selected edge are independent. In this paper, we go one step further by considering ensembles of LDPC codes with degree-degree correlations. We propose two methods to construct such an ensemble of degree-degree correlated LDPC codes and derive a system of density evolution equations for these codes over a binary erasure channel (BEC). By conducting extensive numerical experiments, we demonstrate how the degree-degree correlation affects the performance of LDPC codes. Our numerical results suggest that LDPC codes with negative degree-degree correlation could enhance the maximum tolerable erasure probability. Moreover, increasing the negative degree-degree correlation could facilitate better unequal error protection (UEP) design. In the final part of our extension efforts, we extend degree-degree correlated LDPC codes to multi-edge type LDPC codes and leverage these to construct convolutional LDPC codes.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"1-15"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666064","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An efficient frequency diversity scheme for ultra-reliable communications in two-path fading channels 双径衰减信道中超可靠通信的高效频率分集方案

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-08-01 DOI: 10.23919/JCN.2024.000031

Karl-Ludwig Besser;Eduard A. Jorswieck;Justin P. Coon

引用次数: 0

Open access publishing agreement 开放存取出版协议

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-08-01 DOI: 10.23919/JCN.2024.000044

引用次数: 0

On the performance of uplink power-domain NOMA with imperfect CSI and SIC in 6G networks 论 6G 网络中具有不完美 CSI 和 SIC 的上行功率域 NOMA 性能

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-08-01 DOI: 10.23919/JCN.2024.000039

Volkan Özduran;Mohammadali Mohammadi;Nikolaos Nomikos;Imran Shafique Ansari;Panagiotis Trakadas

{"title":"On the performance of uplink power-domain NOMA with imperfect CSI and SIC in 6G networks","authors":"Volkan Özduran;Mohammadali Mohammadi;Nikolaos Nomikos;Imran Shafique Ansari;Panagiotis Trakadas","doi":"10.23919/JCN.2024.000039","DOIUrl":"https://doi.org/10.23919/JCN.2024.000039","url":null,"abstract":"Sixth generation (6G) networks must adopt spectral-efficient communication techniques to ensure massive connectivity for coexisting humans and machines. However, the impact of various practical issues must be analyzed and addressed, including imperfect channel state information (CSI), stemming by the channel estimation error (CEE) and feedback delay (F-D) with time-variant channels. This paper focuses on these issues in the context of uplink networks, relying on power-domain nonorthogonal multiple access (NOMA). Moreover, the degrading effect of imperfect successive interference cancellation (SIC), when randomly deployed multiple mobile terminals communicate with a single base station (BS) is considered. The system performance is measured by means of outage probability, error probability, ergodic rate, throughput, energy efficiency, and spectral efficiency. Analytical, asymptotic, and computer simulation results demonstrate that CEE causes system coding gain losses for low signal-to-noise ratio (SNR) while the disruptive effects of CEE become negligible in the high SNR. Results also show that F-D does not degrade the system performance in the low SNR but it causes system coding gain losses for high SNR. Also, imperfect SIC does not have any detrimental effect on the system performance for low SNR but results in reduced coding gain for high SNR.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"445-460"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666068","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Asymptotically optimal delay-aware scheduling in queueing systems 队列系统中渐进最优的延迟感知调度

IF 2.9 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-06-06 DOI: 10.23919/JCN.2021.000039

Saad Kriouile;Mohamad Assaad;Maialen Larranaga

{"title":"Asymptotically optimal delay-aware scheduling in queueing systems","authors":"Saad Kriouile;Mohamad Assaad;Maialen Larranaga","doi":"10.23919/JCN.2021.000039","DOIUrl":"https://doi.org/10.23919/JCN.2021.000039","url":null,"abstract":"In this paper, we investigate a delay-aware channel allocation problem where the number of channels is less than that of users. Due to the proliferation of delay sensitive applications, the objective of our problem is chosen to be the minimization of the total average queuing delay of the network in question. First, we show that our problem falls in the framework of restless bandit problems (RBP), for which obtaining the optimal solution is known to be out of reach. To circumvent this difficulty, we tackle the problem by adopting a Whittle index approach. To that extent, we employ a Lagrangian relaxation for the original problem and prove it to be decomposable into multiple one-dimensional independent subproblems. Afterwards, we provide structural results on the optimal policy of each of the subproblems. More specifically, we prove that a threshold policy is able to achieve the optimal operating point of the considered subproblem. Armed with that, we show the indexability of the subproblems and characterize the Whittle's indices which are the basis of our proposed heuristic. We then provide a rigorous mathematical proof that our policy is optimal in the infinitely many users regime. Finally, we provide numerical results that showcase the remarkable good performance of our proposed policy and that corroborate the theoretical findings.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"321-343"},"PeriodicalIF":2.9,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551315","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0