Annals of Telecommunications最新文献_第5页

AutoRoC-DBSCAN: automatic tuning of DBSCAN to detect malicious DNS tunnels AutoRoC-DBSCAN：自动调整 DBSCAN 以检测恶意 DNS 隧道

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-03-22 DOI: 10.1007/s12243-024-01025-5

Thi Quynh Nguyen, Romain Laborde, Abdelmalek Benzekri, Arnaud Oglaza, Mehdi Mounsif

引用次数: 0

A deeper look at Ariadne: a privacy-preserving network layer protocol 深入了解阿里阿德涅：保护隐私的网络层协议

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-03-13 DOI: 10.1007/s12243-024-01017-5

Antoine Fressancourt, Luigi Iannone, Mael Kerichard

{"title":"A deeper look at Ariadne: a privacy-preserving network layer protocol","authors":"Antoine Fressancourt, Luigi Iannone, Mael Kerichard","doi":"10.1007/s12243-024-01017-5","DOIUrl":"10.1007/s12243-024-01017-5","url":null,"abstract":"<div><p>We present a deeper analysis of Ariadne, a privacy-preserving network layer communication protocol that we introduced in Fressancourt and Iannone (2023). Ariadne uses a source routing approach to avoid relying on trusted third parties. In Ariadne, a source node willing to send anonymized network traffic to a destination uses a path consisting in nodes with which it has pre-shared symmetric keys. Temporary keys derived from those pre-shared keys are used to protect the communication’s privacy using onion routing techniques, ensuring <i>session unlinkability</i> for packets following the same path. Ariadne enhances previous approaches to preserve communication privacy by introducing two novelties. First, the source route is encoded in a fixed size, sequentially encrypted vector of routing information elements, in which the elements’ positions in the vector are pseudo-randomly permuted. Second, the temporary keys used to process the packets on the path are referenced using mutually known encrypted patterns. This avoids the use of an explicit key reference that could be used to de-anonymize the communications. This article enriches our previous presentation of Ariadne Fressancourt and Iannone (2023) with a set of formal proofs of its security properties. Besides, a performance evaluation of Ariadne’s Rust implementation is presented to assess the ability of our protocol to protect privacy at the network layer in real-world use cases.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 11-12","pages":"745 - 762"},"PeriodicalIF":1.8,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140116886","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}

引用次数: 0

Mirage: cyber deception against autonomous cyber attacks in emulation and simulation 幻影：在仿真和模拟中对抗自主网络攻击的网络欺骗行为

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-03-13 DOI: 10.1007/s12243-024-01018-4

Michael Kouremetis, Dean Lawrence, Ron Alford, Zoe Cheuvront, David Davila, Benjamin Geyer, Trevor Haigh, Ethan Michalak, Rachel Murphy, Gianpaolo Russo

引用次数: 0

Efficient representation of disoccluded regions in 3D video coding 在 3D 视频编码中高效表示不包括的区域

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-03-12 DOI: 10.1007/s12243-024-01019-3

Muhammad Shahid Farid, Badi uz Zaman Babar, Muhammad Hassan Khan

{"title":"Efficient representation of disoccluded regions in 3D video coding","authors":"Muhammad Shahid Farid, Badi uz Zaman Babar, Muhammad Hassan Khan","doi":"10.1007/s12243-024-01019-3","DOIUrl":"10.1007/s12243-024-01019-3","url":null,"abstract":"<div><p>Three-dimensional (3D) video technology has gained immense admiration in recent times due to its numerous applications, particularly in the television and cinema industry. Three-dimensional television (3DTV) and free-viewpoint television (FTV) are two well-known applications that provide the end-user with a real-world and high-quality 3D display. In both applications, multiple views captured from different viewpoints are rendered simultaneously to offer depth sensation to the viewer. A large number of views are needed to enable FTV. However, transmitting this massive amount of data is challenging due to bandwidth limitations. Multiview video-plus-depth (MVD) is the most popular format where in addition to color images, corresponding depth information is also available which represents the scene geometry. The MVD format with the help of depth image-based rendering (DIBR) enables the generation of views at novel viewpoints. In this paper, we introduce a panorama-based representation of MVD data with an efficient keyframe-based disocclusions handling technique. The panorama view for a stereo pair with depth is constructed from the left view and the novel appearing region of the right view which is not visible from the left viewpoint. The disocclusions that appear in the right view when obtained from the DIBR of the left view are collected in a special frame named as keyframe. On the decoder side, the left view is available with a simple crop of panorama view. The right view is obtained through DIBR of the left view combined with the appearing region from the panorama view. The disocclusions in this warped view are filled from the keyframe. The panorama view with additional keyframes and the corresponding depth map are compressed using the standard HEVC codec. The experimental evaluations performed on standard MVD sequences showed that the proposed scheme achieves excellent video quality while saving considerable bit rate compared to HEVC simulcast.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 1-2","pages":"123 - 137"},"PeriodicalIF":1.8,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140116948","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}

引用次数: 0

Evaluating pending interest table performance under the collusive interest flooding attack in named data networks 评估命名数据网络中串通兴趣泛滥攻击下的待定兴趣表性能

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-02-29 DOI: 10.1007/s12243-024-01016-6

Diego Canizio Lopes, André Nasserala, Ian Vilar Bastos, Igor Monteiro Moraes

引用次数: 0

Orthogonal beamforming technique for massive MIMO systems 大规模多输入多输出系统的正交波束成形技术

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-02-21 DOI: 10.1007/s12243-024-01013-9

Marwa Abdelfatah, Abdelhalim Zekry, Shaimaa ElSayed

{"title":"Orthogonal beamforming technique for massive MIMO systems","authors":"Marwa Abdelfatah, Abdelhalim Zekry, Shaimaa ElSayed","doi":"10.1007/s12243-024-01013-9","DOIUrl":"10.1007/s12243-024-01013-9","url":null,"abstract":"<div><p>Beamforming represents a pivotal technology in massive multiple-input multiple-output (MIMO) systems, as it facilitates the regulation of transmission and reception operations. Beamforming techniques’ categorization is based either on their hardware architecture or implementation strategy. This paper proposes an orthogonal beamforming technology founded on a specific implementation method that utilizes predetermined orthogonal beams to serve users. The suggested approach incorporates numerous orthogonal beams relying on a substantial number of antennas at the base station. The primary objective of this approach is to enhance the performance of massive MIMO systems by augmenting spectral efficiency and accommodating more users. The proposed beamforming approach is well suited for millimeter frequency bands. The purpose of this paper is to explore the suggested orthogonal beamforming technology. The concept of this approach is described at first and then followed by an evaluation of its efficacy for a single user through the allocation of orthogonal beams. The suggested approach is also examined in the context of multiuser systems, and the results are compared with the adaptive ZF beamforming technique. Furthermore, the paper presents solutions to the issues that may arise in multiuser systems, for example, ensuring that each orthogonal beam is assigned to only one user. The simulations conducted in this study demonstrate that the suggested approach outperforms the ZF technique in terms of both the spectral efficiency and the number of serviced users. Specifically, the suggested approach can enhance SE by approximately 40.6% over the ZF technique, and it can support up to double the number of users when compared to the ZF approach.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 1-2","pages":"79 - 97"},"PeriodicalIF":1.8,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-024-01013-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139920383","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}

引用次数: 0

Game theoretical analysis of green technology innovation partnerships: equipment manufacturers and network operators 绿色技术创新伙伴关系的博弈论分析：设备制造商和网络运营商

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-02-21 DOI: 10.1007/s12243-024-01012-w

Luona Song, Yinglei Teng, Yeyuan Feng, Merveille Nicolas, Jian Zhang

引用次数: 0

Troubleshooting distributed network emulation 分布式网络模拟故障排除

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-02-19 DOI: 10.1007/s12243-024-01010-y

Houssam ElBouanani, Chadi Barakat, Walid Dabbous, Thierry Turletti

引用次数: 0

Pilot power optimization in scalable user-centric HC-RANs for future IoT and IIoT applications 面向未来物联网和 IIoT 应用的可扩展、以用户为中心的 HC-RAN 中的试点功率优化

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-02-16 DOI: 10.1007/s12243-024-01014-8

Hareesh Ayanampudi, Ravindra Dhuli

{"title":"Pilot power optimization in scalable user-centric HC-RANs for future IoT and IIoT applications","authors":"Hareesh Ayanampudi, Ravindra Dhuli","doi":"10.1007/s12243-024-01014-8","DOIUrl":"10.1007/s12243-024-01014-8","url":null,"abstract":"<div><p>In this paper, a scalable user-centric HC-RAN is taken into consideration, where each remote radio head (RRH) serves user equipments (UEs) over the same time/frequency resources by using time division duplex (TDD) mode. Network scalability results in the front-haul load and computational complexity at the baseband unit (BBU) pool remaining constant irrespective of the number of UEs in the network. During the channel estimation phase, each RRH will acquire the channel state information (CSI) based on the received pilot signals from the UEs. With the available CSI, each RRH will decode/precode the desired UE information in uplink and downlink, respectively. However, in ultra-dense networks, pilot contamination is a major limitation that hugely impacts the system’s performance. To address this, we proposed an uplink pilot power optimization algorithm by considering the inter-user interference due to pilot sharing and RRH selection. In this algorithm, the pilot power coefficients are designed in such a way as to decrease the mean square error (MSE) of the channel estimates. To achieve this, we used the successive convex approximation method. Moreover, we derived a closed-form expression for achievable spectral efficiency (SE) per UE, which will be valid for any pilot/data power optimization and RRH selection scheme. The results show that the proposed algorithm significantly improves the system performance in the channel estimation phase and will be more suitable for urban environments.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 1-2","pages":"99 - 107"},"PeriodicalIF":1.8,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139755092","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}

引用次数: 0

Energy-efficient cluster-based routing protocol for heterogeneous wireless sensor network 基于集群的异构无线传感器网络节能路由协议

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-02-13 DOI: 10.1007/s12243-024-01015-7

Piyush Rawat, Gopal Singh Rawat, Harish Rawat, Siddhartha Chauhan

引用次数: 0