Annals of Telecommunications最新文献

{"title":"On the interoperability of verifiable credentials: simple universal verifier (SUV)","authors":"Mustafa Kaiiali,&nbsp;Ioram Schechtman Sette,&nbsp;Ahmad Samer Wazan,&nbsp;David W. Chadwick,&nbsp;Omar Alfandi","doi":"10.1007/s12243-025-01066-4","DOIUrl":"10.1007/s12243-025-01066-4","url":null,"abstract":"<div><p>A digital identity is a digital representation of an individual’s identity. In the era of the Internet, it becomes increasingly important to adopt a digital identity format that is cryptographically secure and privacy-preserving. Indeed, a digital identity has the potential to offer better privacy protection than a physical identity document, where users are forced to disclose more information when presenting their identity documents than what is actually needed. Nevertheless, digital identities have not come without their own set of new challenges. One of the key issues to fully adopting digital identities is the lack of standards—both for the format of digital identities and the protocols for transferring them. This paper discusses the various formats and protocols currently used in the digital identity market. Then it introduces the Simple Universal Verifier (SUV) as an approach to tackle the current lack of interoperability for the verification phase. The SUV has been implemented and used to integrate a Relying Party (RP) with Microsoft and Identiproof Verifiable Credentials platforms and also integrates with the TRAIN trust management infrastructure.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"639 - 657"},"PeriodicalIF":2.2,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145162779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Enhancing the physical layer security in IoT over mixed Rayleigh-Nakagami-m fading channels with untrustworthy relays","authors":"Parmila Devi,&nbsp;Manoranjan R. Bharti","doi":"10.1007/s12243-025-01064-6","DOIUrl":"10.1007/s12243-025-01064-6","url":null,"abstract":"<div><p>The Internet of Things (IoT) enables 5G communication, and it is widely used in many industries owing to its ability to connect a massive number of devices, process data intelligently, and enable remote control. However, the open nature of wireless communications makes information security and privacy critical concerns. In this paper, we investigate the issue of physical layer security (PLS) within a two-hop wireless cooperative network, where communication is facilitated by an untrusted relay. This investigation was performed over mixed Rayleigh-Nakagami-<span>(varvec{m})</span> fading channels in the presence of multiple non-colluding eavesdroppers. To improve the system’s security, we considered the incorporation of cooperative jamming and opportunistic relaying techniques. We formulated explicit equations for both the secrecy capacity and the secrecy outage probability within the system. Finally, by leveraging numerical results, simulations, and comparisons with existing works, we demonstrated the effectiveness of the proposed approach. This demonstration highlights that the suggested method serves as an effective method to enhance the security of IoT data collection processes, particularly in scenarios involving untrustworthy relays and highly risky eavesdropping threats.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"613 - 626"},"PeriodicalIF":2.2,"publicationDate":"2025-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145164829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"CSNet 2023 special issue—the resilient networked systems","authors":"Carol Fung,&nbsp;Augusto Neto,&nbsp;Nur Zincir-Heywood,&nbsp;Changqing Luo","doi":"10.1007/s12243-024-01063-z","DOIUrl":"10.1007/s12243-024-01063-z","url":null,"abstract":"","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 11-12","pages":"707 - 709"},"PeriodicalIF":1.8,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142753948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Carbon footprint of cloud, edge, and Internet of Edges","authors":"Pauline Loygue,&nbsp;Khaldoun Al Agha,&nbsp;Guy Pujolle","doi":"10.1007/s12243-024-01061-1","DOIUrl":"10.1007/s12243-024-01061-1","url":null,"abstract":"<div><p>In this article, we highlight the carbon footprint of data transport on Internet infrastructures by bringing together a series of studies that break down the carbon impact of digital technologies and detail the geography and routing of the Internet. The article also draws a comparison between three types of digital infrastructure where digital services are hosted either in the cloud, at the edge, or in an Internet of Edges. This comparison emphasizes the advantages of establishing shorter data routes to reduce the carbon footprint of digital communications.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 1-2","pages":"153 - 169"},"PeriodicalIF":1.8,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143108578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A new spatial modulation scheme exploiting linear frequency modulation","authors":"Chellali Slimani,&nbsp;Khalida Ghanem,&nbsp;Farid Ghanem,&nbsp;Mourad Nedil","doi":"10.1007/s12243-024-01062-0","DOIUrl":"10.1007/s12243-024-01062-0","url":null,"abstract":"<div><p>In forthcoming 6 G wireless networks, spatial modulation (SM) has established itself as a technique in massive MIMO setups. In this letter, a novel SM architecture embedding linear frequency modulation (LFM) principle is proposed. In the resulting SM-LFM scheme, the data block is split into the signal and the antenna index parts, and prior to its transmission, distinctly assigns a different LFM chirp (up or down) to be mixed up with the SM block, depending on the index of the antenna to be activated. When the antenna index is even, the associated chirp is up, while the down chirp is retained otherwise. Similarly, the proposed SM-LFM receiver part consists of two main parts: the LFM chirp recognizer and the tuned SM detector. In the former, the received signal is fed to the two up and down LFM chirp-correlators, and the chirp selected at the transmitter is retrieved by an energy comparator. The target behind the incorporation of the LFM chirps, between each adjacent antennas-pair, is to mitigate the miss-estimation of the antenna indices at the receiver side. Depending upon the detected chirp, in the tuned SM detector, only the signals (indices and symbols) emanating from even- or odd-indexed antennas are processed. The performance of the resulting scheme is investigated by adopting a channel model, which considers the effects of estimation errors and antenna correlation. Two modified detectors which adapt to the LFM signaling are investigated, namely the iterative maximum ratio combining (i-MRC) and the maximum likelihood (ML) detectors. The improvement provided, by adopting LFM concept in SM, is shown in terms of data reliability and complexity reduction.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"591 - 597"},"PeriodicalIF":2.2,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145161838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Editorial of 6GNet 2023 special issue","authors":"Raouf Boutaba,&nbsp;Guy Pujolle,&nbsp;Amina Boudendir,&nbsp;Abdallah Shami,&nbsp;Daniel Benevides da Costa","doi":"10.1007/s12243-024-01060-2","DOIUrl":"10.1007/s12243-024-01060-2","url":null,"abstract":"","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 9-10","pages":"603 - 604"},"PeriodicalIF":1.8,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"RSSI prediction and optimization of transmission power for improved LoRa communications performance","authors":"L’houssaine Aarif,&nbsp;Mohamed Tabaa,&nbsp;Hanaa Hachimi","doi":"10.1007/s12243-024-01059-9","DOIUrl":"10.1007/s12243-024-01059-9","url":null,"abstract":"<div><p>Optimization of LoRa communications is of paramount importance in boosting the efficiency and reliability of IoT networks, particularly in challenging industrial environments. This approach aims to maximize LoRa communications performance, enabling optimal use of this technology in often complex and rigorous contexts. This work focuses on the use of artificial intelligence models to predict RSSI and optimization of transmission power in LoRa communications. Seven different models, namely decision trees, neural networks, Gaussian processes, random forests, SVM, gradient boosting, and AdaBoost, were evaluated in terms of accuracy and temporal efficiency. The models were trained on external data, including RSSI and SNR from eight nodes, as well as meteorological variables such as temperature, humidity, atmospheric pressure, and rainfall. With an R2 of 0.99112, a high efficiency of 97.2%, and an RMSE of 0.0221, the artificial neural network is remarkably efficient. Despite requiring significantly more time for training than other models, it also stands out for having an extremely low prediction time of 0.5629 s. The accuracy of the Gaussian process model with Ardexponential kernel is favorable, but not as good as that of the neural network (RMSE 0.0233, MAE 0.0165, efficiency 95.72%, R<span>(^{2})</span> 0.9902). However, the training period of this model is shorter (2229 s) than that of the neural network. The random forest model with 3000 trees provides satisfactory results (RMSE 0.0323, efficiency 89.92%,) with a modest training time (115 s) for an acceptable compromise between accuracy and efficiency. Finally, the decision trees model with MinLeafSize=4 improves accuracy while maintaining a low training time of 0.0810 s. In a second part, the paper explores the optimization of transmission power in LoRa communications, using the predicted RSSI and other parameters as inputs to a genetic algorithm. This algorithm aims to minimize transmission power by adjusting the spreading factor and bandwidth specific to each LoRa communication. The results demonstrated the effectiveness of the genetic algorithm, which rapidly converged on the optimum values for SF and BW in a brief runtime of 0.1211 s. This approach achieved significant gains in transmission power, reaching up to 7.49 mW for some transmissions.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 and networking","pages":"501 - 520"},"PeriodicalIF":2.2,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145167352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the (in)efficiency of fuzzing network protocols","authors":"Seyed Behnam Andarzian,&nbsp;Cristian Daniele,&nbsp;Erik Poll","doi":"10.1007/s12243-024-01058-w","DOIUrl":"10.1007/s12243-024-01058-w","url":null,"abstract":"<div><p>Fuzzing is a widely used and effective technique to test software. Unfortunately, certain systems, including network protocols, are more challenging to fuzz than others. An important complication with fuzzing network protocols is that this tends to be a slow process, which is problematic as fuzzing involves many test inputs. This article analyzes the root causes behind the inefficiency of fuzzing network protocols and strategies to avoid them. It extends our earlier work on network protocol fuzzers, which explored some of these strategies, to give a more comprehensive overview of overheads in fuzzing and ways to reduce them.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"659 - 668"},"PeriodicalIF":2.2,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-024-01058-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142221382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Mixed (mathcal {H}_{2})/(mathcal {H}_{infty }) fault detection and control for uncertain delta operator systems with mixed random delays and multiple data packet dropouts","authors":"George Nartey,&nbsp;Duanjin Zhang","doi":"10.1007/s12243-024-01057-x","DOIUrl":"10.1007/s12243-024-01057-x","url":null,"abstract":"<div><p>This paper investigates the fault detection (FD) and control problem in delta operator networked control systems (NCSs) with mixed random delays and multiple data packet dropouts. A novel approach utilizing a unified <span>(varvec{mathcal {H}_{2}})</span>/<span>(varvec{mathcal {H}_{infty }})</span> optimization framework is developed for the system. The <span>(varvec{mathcal {H}_{2}})</span> and <span>(varvec{mathcal {H}_{infty }})</span> indexes are employed to measure the detection and control performances, respectively. Probability density functions (PDFs) are used to accurately analyze packet dropouts, overcoming limitations of the Bernoulli distribution. The random delays are modeled as stochastic Markov processes and transformed into mixed stochastic delays with linearly dependent and randomly generated multiplicative variables. These delay-dependent coefficients are uniformly modeled by multiple mutually correlated Bernoulli processes, whose relevance are formulated by a priori Pearson correlation coefficient matrix using statistical tests. The detector and control parameters are then derived in terms of solving a set of linear matrix inequalities (LMIs). Simulation results demonstrate the effectiveness of the proposed method.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"669 - 685"},"PeriodicalIF":2.2,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141925426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Joint MEC selection and wireless resource allocation in 5G RAN","authors":"Tengteng Ma,&nbsp;Chen Li,&nbsp;Yuanmou Chen,&nbsp;Zehui Li,&nbsp;Zhenyu Zhang,&nbsp;Jing Zhao","doi":"10.1007/s12243-024-01050-4","DOIUrl":"10.1007/s12243-024-01050-4","url":null,"abstract":"<div><p>With the vigorous development of the Internet of Things (IoT), the demand for user equipment (UE) computing capacity is increasing. Multiaccess edge computing (MEC) provides users with high-performance and low-latency services by offloading computational tasks to the nearest MEC server-configured 5G radio access network (RAN). However, these computationally intensive tasks may lead to a sharp increase in the energy consumption of UE and cause downtime. In this paper, to address this challenge, we design an intelligent scheduling and management system (ISMS) to jointly optimize the allocation of MEC resources and wireless communication resources. The resource allocation problem is a mixed-integer nonlinear programming problem (MINLP), an NP-hard problem. The ISMS models this problem as an MDP with a state, action, reward, and policy and adopts a modified deep deterministic policy gradient (mDDPG) algorithm to ensure the weighted minimization of the energy consumption, latency, and cost of users. The simulation results show that the ISMS can effectively reduce the system’s energy consumption, latency, and cost. The proposed algorithm can provide more stable and efficient performance than other algorithms.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 3-4","pages":"311 - 322"},"PeriodicalIF":1.8,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}