Journal of Communications and Networks最新文献

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

{"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":"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":0.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}

{"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":"Hybrid approaches to PAPR, BER, and PSD optimization in 6G OTFS: Implications for healthcare","authors":"Arun Kumar;Sumit Chakravarthy;Nishant Gaur;Aziz Nanthaamornphong","doi":"10.23919/JCN.2024.000027","DOIUrl":"https://doi.org/10.23919/JCN.2024.000027","url":null,"abstract":"The envisioned smart hospital framework leveraging the sixth-generation (6G) technology aims to enhance healthcare services by ensuring reliable communication across various wireless channel conditions, including both line-of-sight and obstructed paths. However, the traditional orthogonal frequency division multiplexing (OFDM) approach, used in 4G and 5G, struggles with the high Doppler shifts associated with dynamic environments, presenting challenges for burgeoning smart hospital demands. To address this, orthogonal time frequency space (OTFS) modulation is proposed. The OTFS operates effectively across both stationary and highly mobile channels by manipulating delay and Doppler domains. Nevertheless, a high peak-to-average power ratio (PAPR) remains a critical challenge for OTFS implementation within 6G smart hospitals. Elevated PAPR levels can reduce power amplifier efficiency, causing them to operate outside their ideal linear range and impairing battery performance. They also contribute to signal distortion, increased interference, and suboptimal spectrum utilization, which can undermine wireless communication and data integrity. To mitigate the PAPR issue in OTFS, this work introduces a hybrid algorithm that integrates the benefits of the Riemann matrix optimal phase element-based partial transmission sequence (PTS) and selective mapping (SLM), along with A and μ-law complementary algorithms. This study compares the performance of the proposed hybrid algorithm with traditional PAPR reduction techniques by evaluating metrics such as PAPR, bit error rate (BER), and power spectrum density (PSD) within the Rician and Rayleigh fading channels. Simulation outcomes indicate that the hybrid algorithm achieves superior PAPR, BER, and PSD performance with only a marginal increase in complexity when compared with the established methods.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"308-320"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579720","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495097","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.000032","DOIUrl":"https://doi.org/10.23919/JCN.2024.000032","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"384-388"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579709","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495198","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":"Network- and application-aware adaptive congestion control algorithm","authors":"Ramyashree Venkatesh Bhat;Jetmir Haxhibeqiri;Ingrid Moerman;Jeroen Hoebeke","doi":"10.23919/JCN.2023.000052","DOIUrl":"https://doi.org/10.23919/JCN.2023.000052","url":null,"abstract":"More and more traffic is migrating to private networks in use in various professional environments. With this, there comes a growing diversity in applications, each of them requiring different quality of service. This poses challenges to properly managing such networks, which can span both wired and wireless segments. To tackle the issue of network management and application demands in such networks, we introduce a network- and application-aware adaptive congestion control algorithm, which provides congestion-free service differentiation to the flows in wireless networks in a decentralized manner. The designed algorithm operates based on the real-time network information obtained from in-band network telemetry and aggregated flow information from intermediate nodes. The algorithm performs three times better than the existing CUBIC congestion control algorithm and twice better in a multi-flow architecture. The designed algorithm is the first step towards adaptive transport and application layer protocols which are the future of private professional networks.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"344-355"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579716","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495168","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}