Journal of Communications and Networks最新文献

{"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}

{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2024.000043","DOIUrl":"https://doi.org/10.23919/JCN.2024.000043","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"462-466"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666066","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137534","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}

{"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}

{"title":"An efficient frequency diversity scheme for ultra-reliable communications in two-path fading channels","authors":"Karl-Ludwig Besser;Eduard A. Jorswieck;Justin P. Coon","doi":"10.23919/JCN.2024.000031","DOIUrl":"https://doi.org/10.23919/JCN.2024.000031","url":null,"abstract":"We consider a two-ray ground reflection scenario with unknown distance between transmitter and receiver. By utilizing two frequencies in parallel, we can mitigate possible destructive interference and ensure ultra-reliability with only very limited knowledge at the transmitter. In order to achieve this ultra-reliability, we optimize the frequency spacing such that the worst-case receive power is maximized. Additionally, we provide an algorithm to calculate the optimal frequency spacing. Besides the receive power, we also analyze the achievable rate and outage probability. It is shown that the frequency diversity scheme achieves a significant improvement in terms of reliability over using a single frequency. In particular, we demonstrate the effectiveness of the proposed approach by a numerical simulation of an unmanned aerial vehicle (UAV) flying above flat terrain.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"409-423"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666065","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137472","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}

{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2024.000044","DOIUrl":"https://doi.org/10.23919/JCN.2024.000044","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"467-469"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137536","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}

{"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}

{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2024.000034","DOIUrl":"https://doi.org/10.23919/JCN.2024.000034","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"389-391"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579725","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495197","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}

{"title":"MCPR: Routing using parallel shortest paths","authors":"Ahmet Soran;Murat Yuksel;Mehmet Hadi Gunes","doi":"10.23919/JCN.2024.000026","DOIUrl":"https://doi.org/10.23919/JCN.2024.000026","url":null,"abstract":"Recent trends led to higher data volumes to be transferred and processed over the network. Legacy routing protocols, e.g., OSPF for intra-domain routing, send data from a source to destination on one of the shortest paths. We propose a novel approach to parallelize data transfers by leveraging the multi-core CPUs in the routers. We describe an end-to- end method to optimize data flows on multiple paths. Multicore parallel routing (MCPR) generates new virtual topology substrates from the underlying router topology and performs the shortest path routing on each substrate. Even though calculating the shortest paths could be done with well-known techniques such as OSPF's Dijkstra implementation, finding optimal substrates and setting their link weights to maximize the network throughput over multiple end-to-end paths is still an NP-hard problem. In MCPR, we focus on designing heuristics for substrate generation from a given router topology. Each substrate is a subgraph of the router topology and each link on each substrate is to be assigned a weight to steer the shortest-path routing for maximal network throughput. Heuristics' interim goal is to generate substrates in such a way that the shortest path between a source-destination pair on each substrate minimally overlaps with the shortest paths calculated by the other substrates. Once these substrates are determined, we assign each substrate to a core in the router and employ a multi-path transport protocol, similar to MPTCP, to perform end-to-end data transfers. We designed heuristics that utilize node centrality, edge centrality, or flow patterns. We evaluated the MCPR heuristics on router-level ISP topologies and compared the network throughput against single shortest-path routing under extensive simulation scenarios including heterogeneous core count across the routers and network failures. The evaluations showed that MCPR heuristics can attain network throughput speedups reaching 2.6 while incurring only polynomial control overhead.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"366-382"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579713","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495169","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}

{"title":"Bandit learning based stable matching for decentralized task offloading in dynamic fog computing networks","authors":"Hoa Tran-Dang;Dong-Seong Kim","doi":"10.23919/JCN.2024.000017","DOIUrl":"https://doi.org/10.23919/JCN.2024.000017","url":null,"abstract":"This paper deals with the task offloading problem in the dynamic fog computing networks (FCNs) that involves the task and resource allocations between a set of task nodes (TNs) having task computation needs and a set of helper nodes (HNs) having available computing resources. The problem is associated with the presence of selfishness and rational nodes of these nodes, in which the objective of TNs is to minimize the task completion time by offloading the tasks to the HNs while the HNs tend to maximize their monetization of task offloading resources. To tackle this problem, we use the fairness and stability principle of matching theory to assign the tasks of TNs to the resources of HNs based on their mutual preferences in a decentralized manner. However, the uncertainty of computing resource availability of HNs as well as dynamics of QoS requirements of tasks result in the lack of preferences of TN side that mainly poses a critical challenge to obtain a stable and reliable matching outcome. To address this challenge, we develop the first, to our knowledge, Thompson sampling based multi-armed bandit (MAB) learning to acquire better exploitation and exploration trade-off, therefore allowing TNs to achieve the informed preference relations of HNs quickly. Motivated by the above considerations, this paper aims at design a bandit learning based matching model (BLM) to realize the efficient decentralized task offloading algorithms in the dynamic FCNs. Extensive simulation results demonstrate the potential advantages of the TS based learning over the ε-greedy and UCB based baselines.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"356-365"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579722","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495166","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}

{"title":"Matrixmidface Preformed Orbital Implants for Three-Dimensional Reconstruction of Orbital Floor and Medial Wall Fractures: A Prospective Clinical Study.","authors":"Neha Umakant Chodankar, Vikas Dhupar, Francis Akkara, Vathsalya Vijay","doi":"10.1177/19433875231171749","DOIUrl":"10.1177/19433875231171749","url":null,"abstract":"<p><strong>Study design: </strong>Prospective Interventional study.</p><p><strong>Objective: </strong>To evaluate the efficiency of Matrixmidface preformed Orbital plates for three-dimensional reconstruction of orbital floor and medial wall fractures.</p><p><strong>Methods: </strong>This prospective institutional clinical study was conducted on a group of 14 patients who underwent repair of orbital floor and medial wall fracture defects using Matrixmidface Preformed Orbital plates and open reduction and internal fixation of associated fractures. The following parameters were studied preoperative and postoperative enophthalmos, hypoglobus, orbital volume; correction of diplopia, intraoperative and postoperative complications.</p><p><strong>Results: </strong>All 14 patients were males aged between 19 and 42 years. The most common mode of injury was found to be road traffic accidents (RTAs) followed by self-fall and trauma at workplace. Orbital fractures were associated with other concomitant maxillofacial fractures in 12 patients (85.7%) while 2 patients (14.3%) had pure blowout fractures. Significant improvement of enophthalmos was noted from preoperative period to 1 week, 6 weeks, and 6 months postoperatively (<b><i>P</i> value .02, .01, and .01,</b> respectively). Out of 11 patients with preoperative hypoglobus, 5 patients (45.45%) had persistent hypoglobus in the immediate postoperative period which reduced to 4 patients (36.36%) at 6 weeks postoperatively <b>(p value .00).</b> The postoperative orbital volume of fractured side ranged from 20.3 cm³ to 26.76 cm³ with a mean of 23.50 cm³ ± 1.74. The mean difference between the volumes of the repaired and uninjured sides was found to be .27 cm³ ± .39 (<b><i>P</i> value .02</b>) denoting that the reconstruction of the orbit closely approximated that of the uninjured side.</p><p><strong>Conclusions: </strong>The Matrixmidface Preformed Orbital plate provides exceptional reconstruction of the orbital blowout fracture defects and ensures satisfactory results clinically and radiographically. The plate ensures an approximate recreation of topographical anatomy of the orbit and adequately restores the orbital volume. It provides adequate correction of asymmetry, hypoglobus, enophthalmos and attempts to restore eye movements, without causing any significant postoperative complication.</p>","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"12 1","pages":"104-114"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11107816/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84400096","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}