Searcharxiv⌕ Search

arXiv subjects

Zygmunt J. Haas

Publications and source records attributed to Zygmunt J. Haas.

At least 19 recordsLinked to original sources

New Approximations of Non-Separable MIMO Channels by Separable Channels for Accurate Ergodic Capacity Analysis

In recent years, owing to the high accuracy in characterizing non-separable channels prevalent in next-generation wireless applications, the classical Weichselberger channel model has gained widespread adoption in multiple-input multiple-output (MIMO) systems. However, its non-separable structure also introduces severe analytical complexity, leading to a lack of tractable mathematical frameworks in the literature and thus raises an urgent need for further research. To address the aforementioned analytical complexity, we first derive the nearest separable (double-correlated Rayleigh) fading model to the Weichselberger model under the Kullback-Leibler divergence (KLD), a problem equivalent to rank-1 nonnegative matrix factorization under the Itakura-Saito (IS) distance criterion. The results of our asymptotic analysis in the high-SNR regime reveal that the KLD-enabled approximation achieves a tighter capacity estimate than the conventional Kronecker model, especially in sparse and non-regular scattering environments. Yet, a key limitation of the KLD-enabled model is its tendency to mischaracterize the channel capacity in the low-SNR regime due to its inability to preserve total channel power. As a more robust alternative, we introduce a novel moment matching method (MMM) aimed at mapping the exact channel statistics to those of a Wishart distribution. Both the KLD-enabled and MMM-enabled separable channel directly enable the use of exact closed-form expressions for the ergodic capacity. Numerical results demonstrate that the MMM-enabled model consistently improves upon the capacity accuracy of the conventional Kronecker model across all SNR regimes.

cs.IT↗

Ground-to-UAV and RIS-assisted UAV-to-Ground Communication Under Channel Aging: Statistical Characterization and Outage Performance

This paper studies the statistical characterization of ground-to-air (G2A) and reconfigurable intelligent surface (RIS)-assisted air-to-ground (A2G) communications in RIS-assisted UAV networks under the impact of channel aging. A comprehensive channel model is presented, which incorporates the time-varying fading, three-dimensional (3D) mobility, Doppler shifts, and the effects of channel aging on array antenna structures. We provide analytical expressions for the G2A signal-to-noise ratio (SNR) probability density function (PDF) and cumulative distribution function (CDF), demonstrating that the G2A SNR follows a mixture of noncentral $χ^2$ distributions. The A2G communication is characterized under RIS arbitrary phase-shift configurations, showing that the A2G SNR can be represented as the product of two correlated noncentral $χ^2$ random variables (RVs). Additionally, we present the PDF and the CDF of the product of two independently distributed noncentral $χ^2$ RVs, which accurately characterize the A2G SNR's distribution. Our paper confirms the effectiveness of RISs in mitigating channel aging effects within the coherence time. Finally, we propose an adaptive spectral efficiency method that ensures consistent system performance and satisfactory outage levels when the UAV and the ground user equipments are in motion.

cs.IT↗

Secure Link State Routing for Mobile Ad Hoc Networks

The secure operation of the routing protocol is one of the major challenges to be met for the proliferation of the Mobile Ad hoc Networking (MANET) paradigm. Nevertheless, security enhancements have been proposed mostly for reactive MANET protocols. The proposed here Secure Link State Routing Protocol (SLSP) provides secure proactive topology discovery, which can be multiply beneficial to the network operation. SLSP can be employed as a stand-alone protocol, or fit naturally into a hybrid routing framework, when combined with a reactive protocol. SLSP is robust against individual attackers, it is capable of adjusting its scope between local and network-wide topology discovery, and it is capable of operating in networks of frequently changing topology and membership.

cs.CR↗

Secure Routing for Mobile Ad hoc Networks

The emergence of the Mobile Ad Hoc Networking (MANET) technology advocates self-organized wireless interconnection of communication devices that would either extend or operate in concert with the wired networking infrastructure or, possibly, evolve to autonomous networks. In either case, the proliferation of MANET-based applications depends on a multitude of factors, with trustworthiness being one of the primary challenges to be met. Despite the existence of well-known security mechanisms, additional vulnerabilities and features pertinent to this new networking paradigm might render such traditional solutions inapplicable. In particular, the absence of a central authorization facility in an open and distributed communication environment is a major challenge, especially due to the need for cooperative network operation. In particular, in MANET, any node may compromise the routing protocol functionality by disrupting the route discovery process. In this paper, we present a route discovery protocol that mitigates the detrimental effects of such malicious behavior, as to provide correct connectivity information. Our protocol guarantees that fabricated, compromised, or replayed route replies would either be rejected or never reach back the querying node. Furthermore, the protocol responsiveness is safeguarded under different types of attacks that exploit the routing protocol itself. The sole requirement of the proposed scheme is the existence of a security association between the node initiating the query and the sought destination. Specifically, no assumption is made regarding the intermediate nodes, which may exhibit arbitrary and malicious behavior. The scheme is robust in the presence of a number of non-colluding nodes, and provides accurate routing information in a timely manner.

cs.CR↗

Statistical Characterization of RIS-assisted UAV Communications in Terrestrial and Non-Terrestrial Networks Under Channel Aging

This paper studies the statistical characterization of ground-to-air (G2A) and reconfigurable intelligent surface (RIS)-assisted air-to-ground (A2G) communications with unmanned aerial vehicles (UAVs) in terrestrial and non-terrestrial networks under the impact of channel aging. We first model the G2A and A2G signal-to-noise ratios (SNRs) as non-central complex Gaussian quadratic random variables (RVs) and derive their exact probability density functions, offering a unique characterization for the A2G SNR as the product of two scaled non-central chi-square RVs. Moreover, we also find that, for a large number of RIS elements, the RIS-assisted A2G channel can be characterized as a single Rician fading channel. Our results reveal the presence of channel hardening in A2G communication under low UAV speeds, where we derive the maximum target spectral efficiency (SE) for a system to maintain a consistent required outage level. Meanwhile, high UAV speeds, exceeding 50 m/s, lead to a significant performance degradation, which cannot be mitigated by increasing the number of RIS elements.

eess.SP↗

Channel Characterization of UAV-RIS-aided Systems with Adaptive Phase-shift Configuration

This letter considers a UAV aiding communication between a ground transmitter and a ground receiver in the presence of co-channel interference. A discrete-time Markov process is adopted to model the complex nature of the Air-to-Ground (A2G) channel, including the occurrence of Line-of-Sight, Non-Line-of-Sight, and blockage events. Moreover, an adaptive phase-shift-enabled Reconfigurable Intelligent Surface (RIS) is deployed to combat A2G blockage events. Novel frameworks based on the shadowed Rician distribution are proposed to derive closed-form expressions for Ground-to-Air/A2G SINR' distributions. Numerical results show that RISs with large numbers of elements, e.g., 256 RIS elements, improve end-to-end Outage Probability (OP) and reduce blockages.

eess.SP↗

Adaptive Decoding Mechanisms for UAV-enabled Double-Uplink Coordinated NOMA

In this paper, we propose a novel adaptive decoding mechanism (ADM) for the unmanned aerial vehicle (UAV)-enabled uplink (UL) non-orthogonal multiple access (NOMA) communications. Specifically, considering a harsh UAV environment, where ground-to-ground links are regularly unavailable, the proposed ADM overcomes the challenging problem of conventional UL-NOMA systems whose performance is sensitive to the transmitter's statistical channel state information and the receiver's decoding order. To evaluate the performance of the ADM, we derive closed-form expressions for the system outage probability (OP) and system throughput. In the performance analysis section, we provide novel expressions for practical air-to-ground and ground-to-air channels, while taking into account the practical implementation of imperfect successive interference cancellation (SIC) in UL-NOMA. Moreover, the obtained expression can be adopted to characterize the OP of various systems under a Mixture of Gamma (MG) distribution-based fading channels. Next, we propose a sub-optimal Gradient Descent-based algorithm to obtain the power allocation coefficients that result in maximum throughput with respect to each location on UAV's trajectory. To determine the significance of the proposed ADM in nonstationary environments, we consider the ground users and the UAV to move according to the Random Waypoint Mobility (RWM) and Reference Point Group Mobility (RPGM) models, respectively. Accurate formulas for the distance distributions are also provided. Numerical solutions demonstrate that the ADM-enhanced NOMA not only outperforms Orthogonal Multiple Access (OMA), but also improves the performance of UAV-enabled UL-NOMA even in mobile environments.

cs.IT↗

Multi-RIS-aided Wireless Systems: Statistical Characterization and Performance Analysis

In this paper, we study the statistical characterization and modeling of distributed multi-reconfigurable intelligent surface (RIS)-aided wireless systems. Specifically, we consider a practical system model where the RISs with different geometric sizes are distributively deployed, and wireless channels associated to different RISs are assumed to be independent but not identically distributed (i.n.i.d.). We propose two purpose-oriented multi-RIS-aided schemes, namely, the exhaustive RIS-aided (ERA) and opportunistic RIS-aided (ORA) schemes. A mathematical framework, which relies on the method of moments, is proposed to statistically characterize the end-to-end (e2e) channels of these schemes. It is shown that either a Gamma distribution or a Log-Normal distribution can be used to approximate the distribution of the magnitude of the e2e channel coefficients in both schemes. With these findings, we evaluate the performance of the two schemes in terms of outage probability (OP) and ergodic capacity (EC), where tight approximate closed-form expressions for the OP and EC are derived. Representative results show that the ERA scheme outperforms the ORA scheme in terms of OP and EC. In addition, under i.n.i.d. fading channels, the reflecting element settings and location settings of RISs have a significant impact on the system performance of both the ERA or ORA schemes.

cs.IT↗

Aerial Reconfigurable Intelligent Surface-Aided Wireless Communication Systems

In this paper, we propose and investigate an aerial reconfigurable intelligent surface (aerial-RIS)-aided wireless communication system. Specifically, considering practical composite fading channels, we characterize the air-to-ground (A2G) links by Namkagami-m small-scale fading and inverse-Gamma large-scale shadowing. To investigate the delay-limited performance of the proposed system, we derive a tight approximate closed-form expression for the end-to-end outage probability (OP). Next, considering a mobile environment, where performance analysis is intractable, we rely on machine learning-based performance prediction to evaluate the performance of the mobile aerial-RIS-aided system. Specifically, taking into account the three-dimensional (3D) spatial movement of the aerial-RIS, we build a deep neural network (DNN) to accurately predict the OP. We show that: (i) fading and shadowing conditions have strong impact on the OP, (ii) as the number of reflecting elements increases, aerial-RIS achieves higher energy efficiency (EE), and (iii) the aerial-RIS-aided system outperforms conventional relaying systems.

cs.IT↗

Multiple Antenna Selection and Successive Signal Detection for SM-based IRS-aided Communication

Intelligent reflecting surface (IRS) is being considered as a prospective candidate for next-generation wireless communication due to its ability to significantly improve coverage and spectral efficiency by controlling the propagation environment. One of the ways IRS increases spectral efficiency is by adjusting phase shifts to perform passive beamforming. In this letter, we integrate the concept of IRS-aided communication to the domain of multi-direction beamforming, whereby multiple receive antennas are selected to convey more information bits than existing spatial modulation (SM) techniques at any specific time. To complement this system, we also propose a successive signal detection (SSD) technique at the receiver. Numerical results show that the proposed design is able to improve the average successful bits transmitted (ASBT) by the system, which outperforms other state-of-the-art methods proposed in the literature.

eess.SP↗

Interference Mitigation Using Dynamic Frequency Re-use for Dense Femtocell Network Architectures

The next generation network aims to efficiently deploy low cost and low power cellular base station in the subscriber's home environment. For the femtocell deployment, frequency allocation among femtocells and macrocell is big concern to mitigate the interference, and to ensure the best use of the expensive spectrum. There are many sources of interference in integrated femtocell/macrocell networks. Lagging in proper management of interference reduces the system capacity, increases the outage probability, and finally users feel bad quality of experience (QoE). The cost effective interference management technique depends on the size of femtocells deployment. In this paper, firstly we present deployable various possible femtocell network scenarios. We propose the dynamic frequency re-use scheme to mitigate interference for femtocell deployment. For highly dense femtocells, we propose the functionalities of self organizing network (SON) based femtocell network architecture. The outage probability of a femtocell user is analyzed in details. The performances of the proposed schemes for various femtocell deployments are performed using numerical analysis.

cs.NI↗

A Privacy Scheme for Monitoring Devices in the Internet of Things

Sufficiently strong security and privacy mechanisms are prerequisite to amass the promising benefits of the IoT technology and to incorporate this technology into our daily lives. This paper introduces a novel approach to privacy in networks, an approach which is especially well matched with the IoT characteristics. Our general approach is based on continually changing the identifying attributes of IoT nodes. In particular, the scheme proposed in this work is based on changing the IoT nodes' IP addresses, and because the changing patterns of the IP addresses appear random to a non-intended observer, an adversary is unable to identify the source or destination of a particular transmission. Thus, packets that carry information generated by a particular node cannot be linked together. The scheme offers additional security benefits, including DoS mitigation, is relatively easy to implement, and requires no changes to the existing networking infrastructure. We discuss the details of the implementation of the scheme and evaluate its performance.

cs.NI↗

Deadline-aware Power Management in Data Centers

We study the dynamic power optimization problem in data centers. We formulate and solve the following offline problem: in which slot which server has to be assigned to which job; and in which slot which server has to be switched ON or OFF so that the total power is optimal for some time horizon. We show that the offline problem is a new version of generalized assignment problem including new constraints issuing from deadline characteristics of jobs and difference of activation energy of servers. We propose an online algorithm that solves the problem heuristically and compare it to randomized routing.

cs.DS↗

Priority based Bandwidth Adaptation for Multi-class Traffic in Wireless Networks

The bandwidth adaptation is the technique that allows the flexibility in bandwidth allocation for a call. Using the bandwidth adaptation technique, the number of call admission in the system can be increased significantly. In this paper we propose a priority based bandwidth adaptation scheme that can release multi-level of bandwidth from the existing calls to accept call requests. The amount of released bandwidth is based on the number of existing bandwidth adaptive calls and the priority of requesting traffic call. This priority scheme does not reduce the bandwidth utilization. Moreover, the proposed bandwidth adaptation strategy provides significantly reduced call blocking probability for the higher priority traffic calls. The performance analyses show the improvement of the proposed scheme.

cs.NI↗

Cost-Effective Frequency Planning for Capacity Enhancement of Femtocellular Networks

Femtocellular networks will co-exist with macrocellular networks, mitigation of the interference between these two network types is a key challenge for successful integration of these two technologies. In particular, there are several interference mechanisms between the femtocellular and the macrocellular networks, and the effects of the resulting interference depend on the density of femtocells and the overlaid macrocells in a particular coverage area. While improper interference management can cause a significant reduction in the system capacity and can increase the outage probability, effective and efficient frequency allocation among femtocells and macrocells can result in a successful co-existence of these two technologies. Furthermore, highly dense femtocellular deployments the ultimate goal of the femtocellular technology will require significant degree of self-organization in lieu of manual configuration. In this paper, we present various femtocellular network deployment scenarios, and we propose a number of frequency-allocation schemes to mitigate the interference and to increases the spectral efficiency of the integrated network. These schemes include: shared frequency band, dedicated frequency band, sub-frequency band, static frequency-reuse, and dynamic frequency-reuse.

cs.NI↗

Call Admission Control based on Adaptive Bandwidth Allocation for Wireless Networks

Provisioning of Quality of Service (QoS) is a key issue in any multi-media system. However, in wireless systems, supporting QoS requirements of different traffic types is more challenging due to the need to minimize two performance metrics - the probability of dropping a handover call and the probability of blocking a new call. Since QoS requirements are not as stringent for non-real-time traffic types, as opposed to real-time traffic, more calls can be accommodated by releasing some bandwidth from the already admitted non-real-time traffic calls. If we require that such a released bandwidth to accept a handover call ought to be larger than the bandwidth to accept a new call, then the resulting probability of dropping a handover call will be smaller than the probability of blocking a new call. In this paper we propose an efficient Call Admission Control (CAC) that relies on adaptive multi-level bandwidth-allocation scheme for non-real-time calls. The scheme allows reduction of the call dropping probability along with increase of the bandwidth utilization. The numerical results show that the proposed scheme is capable of attaining negligible handover call dropping probability without sacrificing bandwidth utilization.

cs.MM↗

A Practical, Secure, and Verifiable Cloud Computing for Mobile Systems

Cloud computing systems, in which clients rent and share computing resources of third party platforms, have gained widespread use in recent years. Furthermore, cloud computing for mobile systems (i.e., systems in which the clients are mobile devices) have too been receiving considerable attention in technical literature. We propose a new method of delegating computations of resource-constrained mobile clients, in which multiple servers interact to construct an encrypted program known as garbled circuit. Next, using garbled inputs from a mobile client, another server executes this garbled circuit and returns the resulting garbled outputs. Our system assures privacy of the mobile client's data, even if the executing server chooses to collude with all but one of the other servers. We adapt the garbled circuit design of Beaver et al. and the secure multiparty computation protocol of Goldreich et al. for the purpose of building a secure cloud computing for mobile systems. Our method incorporates the novel use of the cryptographically secure pseudo random number generator of Blum et al. that enables the mobile client to efficiently retrieve the result of the computation, as well as to verify that the evaluator actually performed the computation. We analyze the server-side and client-side complexity of our system. Using real-world data, we evaluate our system for a privacy preserving search application that locates the nearest bank/ATM from the mobile client. We also measure the time taken to construct and evaluate the garbled circuit for varying number of servers, demonstrating the feasibility of our secure and verifiable cloud computing for mobile systems.

cs.CR↗

Towards Optimal Broadcast in Wireless Networks

Broadcast is a fundamental operation in networks, especially in wireless Mobile Ad Hoc NETworks (MANET). For example, some form of broadcasting is used by all on-demand MANET routing protocols, when there is uncertainty as to the location of the destination node, or for service discovery. Being such a basic operation of the networking protocols, the importance of efficient broadcasting has long been recognized by the networking community. Numerous papers proposed increasingly more efficient implementation of broadcasting, while other studies presented bounds on broadcast performance. In this work, we present a new approach to efficient broadcast in networks with dynamic topologies, such as MANET, and we introduce a new broadcasting algorithm for such networking environments. We evaluate our algorithm, showing that its performance comes remarkably close to the corresponding theoretical performance bounds, even in the presence of packet loss due to, for example, MAC-layer collisions. Furthermore, we compare the performance of the proposed algorithm with other recently proposed schemes, including in various mobility settings.

cs.NI↗