Annals of Telecommunications最新文献

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 session unlinkability 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.

As the capabilities of cyber adversaries continue to evolve, now in parallel to the explosion of maturing and publicly-available artificial intelligence (AI) technologies, cyber defenders may reasonably wonder when cyber adversaries will begin to also field these AI technologies. In this regard, some promising (read: scary) areas of AI for cyber attack capabilities are search, automated planning, and reinforcement learning. As such, one possible defensive mechanism against future AI-enabled adversaries is that of cyber deception. To that end, in this work, we present and evaluate Mirage, an experimentation system demonstrated in both emulation and simulation forms that allows for the implementation and testing of novel cyber deceptions designed to counter cyber adversaries that use AI search and planning capabilities.

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.

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.

While an increasing number of telecommunications firms are adopting green innovation (GI), research on the conditions under which innovation and collaboration decisions are made is still lacking. This paper proposes a mathematical model integrating innovation level, trust, and knowledge investment dimensions. Innovation and collaboration behaviors are discussed under various scenarios. A simulation is conducted with an evolutionary game theory approach to observe the effect of different parameters on innovation formation. The simulation analysis presents the optimal strategies for each scenario. Research on the green innovation behaviors of telecom operators and the impact of innovation strategies on operations and revenue have reference significance for telecom operators when it comes to selecting favorable innovation strategies, finding suitable partners and forming a relatively stable cooperative relationship in the industrial ecosystem.

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.

The sensor nodes in a wireless sensor network are equipped with a limited amount of energy. It is therefore necessary to ensure that the network’s lifespan is extended through efficient use of energy. Using cluster-based routing in wireless sensor networks is one of the most effective ways to deal with energy issues and improve the lifetime of the network. In this paper, an energy-efficient cluster-based routing protocol named Cluster Routing Protocol for Heterogeneous Network (CPHN) is proposed. The proposed CPHN makes use of the initial and residual energy levels of the nodes to select the most energy-efficient node as the cluster head, allowing the wireless sensor network to last longer. The proposed scheme uses the CH selection probability, residual energy, and initial energy of nodes to select the appropriate node as the CH. The simulation result shows that the proposed protocol outperforms various existing clustering protocols in terms of network lifetime, throughput, and stability period.