Publications

No abstract is provided for this article.

This paper presents the derivation for per-tier outage probability of a randomly deployed femtocell network over an existing macrocell network. The channel characteristics of macro user and femto user are addressed by considering different propagation modeling for outdoor and indoor links. Location based outage probability analysis and capacity of the system with outage constraints are used to analyze the system performance. To obtain the simplified expressions, approximations of ratios of Rayleigh random variables (RVs), Rayleigh to log normal RVs and their weighted summations, are derived with the verifications using simulations.

In this letter, we study an attack that leverages a reconfigurable intelligent surface (RIS) to induce harmful interference toward multiple users in massive multiple-input multiple-output (mMIMO) systems during the data transmission phase. We propose an efficient and flexible weighted-sum projected gradient-based algorithm for the attacker to optimize the RIS reflection coefficients without knowing legitimate user channels. To counter such a threat, we propose two reception strategies. Simulation results demonstrate that our malicious algorithm outperforms baseline strategies while offering adaptability for targeting specific users. At the same time, our results show that our mitigation strategies are effective even if only an imperfect estimate of the cascade RIS channel is available.

Intelligent reflecting surfaces (IRSs) are a promising technology for future-generation wireless networks by extending coverage region to blind spots and increasing mmWave propagation paths in non-line of sight environments. User association (UA) in dense millimeter wave (mmWave) networks is vital to characterizing connections among base stations (BSs) and mobile users for load balancing, interference management, and maximizing network utility. However, it has yet to be examined thoroughly in a multi-IRS-aided network. This paper presents a new UA scheme that takes cell interference into account for a multi-cell mmWave cellular network aided with multiple IRSs. We formulate a network spectral efficiency maximization problem by jointly optimizing active beamforming (AB) at the BSs, passive beamforming (PB) at the IRSs, and user-BS association with consideration of the impact of IRSs. We then propose a computationally efficient iterative algorithm based on alternating optimization (AO) to resolve this intractable mixed-integer non-convex problem. A fractional programming technique is used to optimize active beamforming at the BSs and passive beamforming at the IRSs, and a penalization method combined with successive convex programming is applied for UA optimization, which is shown to reach the optimal solution. Simulation results show significant performance improvements obtained by the proposed algorithm, providing higher spectral efficiency compared to several benchmark algorithms, while having a low computational complexity.

This work proposes an analytical framework to study how relay selection strategies perform in half- and full-duplex deployments by combining renewal theory and stochastic geometry. Specifically, we assume that the network nodes -- operating in either half- or full-duplex mode -- are scattered according to a two-dimensional homogeneous Poisson point process to compute the relay selection cost by using a semi-Markov process. Our results show: ($i$) fixed relay outperforms the reactive option in either cases, ($ii$) the performance of both reactive and fixed relay strategies depends on the self-interference attenuation in full-duplex scenarios, evincing when they outperform the half-duplex option, and ($iii$) the reactive relay selection suffers from selecting relays at hop basis, while the fixed relay selection benefits most from the full-duplex communication.

The conflicting problems of growing mobile service demand and underutilization of dedicated spectrum has given rise to a paradigm where mobile network operators (MNOs) share their infrastructure among themselves in order to lower their operational costs, while at the same time increase the usage of their existing network resources. We model and analyze such an infrastructure sharing system considering a single buyer MNO and multiple seller MNOs. Assuming that the locations of the BSs can be modeled as a homogeneous Poisson point process, we find the downlink signal-to-interference-plus-noise ratio (SINR) coverage probability for a user served by the buyer MNO in an infrastructure sharing environment. We analyze the trade-off between increasing the transmit power of a BS and the intensity of BSs owned by the buyer MNO required to achieve a given quality-of-service (QoS) in terms of the SINR coverage probability. Also, for a seller MNO, we analyze the power consumption of the network per unit area (i.e., areal power consumption) which is shown to be a piecewise continuous function of BS intensity, composed of a linear and a convex function. Accordingly, the BS intensity of the seller MNO can be optimized to minimize the areal power consumption while achieving a minimum QoS for the buyer MNO. We then use these results to formulate a single-buyer multiple-seller BS infrastructure market. The buyer MNO is concerned with finding which seller MNO to purchase from and what fraction of BSs to purchase. On the sellers' side, the problem of pricing and determining the fraction of infrastructure to be sold is formulated as a Cournot oligopoly market. We prove that the iterative update of each seller's best response always converges to the Nash Equilibrium.

Cooperative content delivery using multiple air interfaces (CCDMI) is a powerful solution to mitigate congestion in cellular networks. In CCDMI, the operator distributes content to selected users that further distribute it locally among its nearby users. However, a user that is capable of contributing to CCDMI might act selfishly and refuse to participate. Although the operator can encourage user participation by offering incentives, it has incomplete information about the users' willingness to participate. In order to overcome this problem of adverse selection in CCDMI, we propose two contract-based methods under information asymmetry. In both methods, the operator designs a performance-based contract set for the users that are capable of local content distribution. Using a mathematical analysis, we show that the optimal contract under information asymmetry achieves close to optimal utility for the users and the operator, compared with the information symmetry case. Moreover, the users with high willingness to participate get positive utility and the users with low willingness get zero utility. Hence, by assigning contracts, the operator can motivate user participation, despite the information asymmetry between them. Our results verify that the proposed methods improve the system performance in terms of the utility of the operator and the users.

Radio frequency (RF) wireless energy transfer (WET) is a key technology that may allow seamlessly powering future massive low-energy Internet of Things (IoT) networks. To enable efficient massive WET, channel state information (CSI)-limited/free multi-antenna transmit schemes have been recently proposed in the literature. The idea is to reduce/null the energy costs to be paid by energy harvesting (EH) IoT nodes from participating in large-scale time/power-consuming CSI training, but still enable some transmit spatial gains. In this paper, we take another step forward by proposing a novel CSI-free rotary antenna beamforming (RAB) WET scheme that outperforms all state-of-the-art CSI-free schemes in a scenario where a power beacon (PB) equipped with a uniform linear array (ULA) powers a large set of surrounding EH IoT devices. RAB uses a properly designed CSI-free beamformer combined with a continuous or periodic rotation of the ULA at the PB to provide average EH gains that scale as $0.85\sqrt{M}$, where $M$ is the number of PB's antenna elements. Moreover, a rotation-specific power control mechanism was proposed to i) fairly optimize the WET process if devices' positioning information is available, and/or ii) to avoid hazards to human health in terms of specific absorption rate (SAR). We show that RAB performance even approaches quickly (or surpasses, for scenarios with sufficiently large number of EH devices, or when using the proposed power control) the performance of a traditional full-CSI based transmit scheme, and it is also less sensitive to SAR constraints. Finally, we discuss important practicalities related to RAB such as its robustness against non line-of-sight conditions compared to other CSI-free WET schemes, and its generalizability to scenarios where the PB uses other than a ULA topology.

Transmit antenna selection (TAS) in wiretap channels has arisen as a simple promising scheme to improve physical layer security. However, up to now, TAS schemes have aimed at maximising the instantaneous signal‐to‐noise ratio of the legitimate receiver, which by its essence is a sub‐optimal strategy from a secrecy point of view. In this paper, unlike previous works, we propose a novel TAS scheme for multiple‐input multiple‐output wiretap channels by exploiting full channel state information. The proposed scheme achieves higher secrecy performance by selecting an antenna that maximises the secrecy rate. In our analysis, we assume that the receiver (Rx) and the eavesdropper employ either selection combining (SC) or maximal‐ratio combining (MRC) to combine the received signals, and this results in four different receiver combining arrangements. By considering Nakagami‐ m fading, secrecy performance is analysed. Specifically, closed‐form expressions for the secrecy outage probability are derived, which can be used as a quality of service metric. Moreover, an asymptotic analysis is carried out and the respective diversity/array gains are obtained. The ergodic secrecy rate is also investigated for the case of multiple‐input single‐output wiretap channels. Insightful discussions are attained from our analysis. For instance, it is shown that the performance gain of MRC over SC at the Rx does not depend on the number of antennas and combining scheme at the eavesdropper. More interestingly, we observe that such a performance gain is independent of the TAS scheme used at the transmitter (Tx). On the other hand, it is shown that the secrecy gap between SC and MRC at the eavesdropper is independent of the number of antennas at the Tx, but it depends on the number of antennas at the Rx. Finally, it is demonstrated that the diversity gain is the same for all antenna configurations. Copyright © 2016 John Wiley & Sons, Ltd.

No abstract is provided for this article.

Current spectrum-sharing frameworks struggle with adaptability, often being either static or insufficiently dynamic. They primarily emphasize temporal sharing while overlooking spatial and spectral dimensions. We propose an adaptive, AI-driven spectrum-sharing framework within the O-RAN architecture, integrating discriminative and generative AI (GenAI) to forecast spectrum needs across multiple timescales and spatial granularities. A marketplace model, managed by an authorized spectrum broker, enables operators to trade spectrum dynamically, balancing static assignments with real-time trading. GenAI enhances traffic prediction, spectrum estimation, and allocation, optimizing utilization while reducing costs. This modular, flexible approach fosters operator collaboration, maximizing efficiency and revenue. A key research challenge is refining allocation granularity and spatio-temporal dynamics beyond existing models.

URLLC is a key design aim in 5G and a mandatory prerequisite in the future uncountable number of industrial applications. In this regard, cooperative relaying and diversity sources in time and frequency domains are introduced as URLLC enablers to support higher reliability and lower latency. The objective of this work is to study two URLLC performance metrics namely, probability of time underflow where the aggregated transmission time is below the time threshold, and reliability which refers to successfully delivering the message within the time window. We examine the impact of cooperative relaying and exploiting time and frequency diversities on the aforementioned performance metrics. We provide the approximated upper bound of the probability of time underflow under time and frequency diversities. In addition, we indicate the maximum achievable reliability as a function of the time threshold for a given probability of time underflow. The performance advantage of cooperative diversity compared to the single transmission to meet URLLC requirements is also highlighted.

In this paper, we introduce the concept of spot beamfocusing (SBF) in the Fresnel zone through extremely large-scale programmable metasurfaces (ELPMs) as a key enabling technology for 6G networks. A smart SBF scheme aims to adaptively concentrate the aperture's radiating power exactly at a desired focal point (DFP) in the 3D space utilizing some Machine Learning (ML) method. This offers numerous advantages for next-generation networks including efficient wireless power transfer (WPT), interference mitigation, reduced RF pollution, and improved information security. SBF necessitates ELPMs with precise channel state information (CSI) for all ELPM elements. However, obtaining exact CSI for ELPMs is not feasible in all environments; we alleviate this by proposing an adaptive novel CSI-independent ML scheme based on the TD3 deep-reinforcement-learning (DRL) method. While the proposed ML-based scheme is well-suited for relatively small-size arrays, the computational complexity is unaffordable for ELPMs. To overcome this limitation, we introduce a modular highly scalable structure composed of multiple sub-arrays, each equipped with a TD3-DRL optimizer. This setup enables collaborative optimization of the radiated power at the DFP, significantly reducing computational complexity while enhancing learning speed. The proposed structures benefits in terms of 3D spot-like power distribution, convergence rate, and scalability are validated through simulation results.

We investigate the spectral efficiency of full-duplex small cell wireless systems, in which a full-duplex capable base station (BS) is designed to send/receive data to/from multiple halfduplex users on the same system resources. The major hurdle for designing such systems is due to the self-interference at the BS and co-channel interference among users. Hence, we consider a joint beamformer design to maximize the spectral efficiency subject to certain power constraints. The design problem is first formulated as a rank-constrained optimization one, and the rank relaxation method is then applied. However the relaxed problem is still nonconvex, and thus optimal solutions are hard to find. Herein, we propose two provably convergent algorithms to obtain suboptimal solutions. Based on the concept of the difference of convex functions programming, we approximate the design problem by a determinant maximization program in each iteration of the first algorithm. The second method is built upon the sequential parametric convex approximation method, which allows us to transform the relaxed problem into a semidefinite program in each iteration. Extensive numerical experiments under small cell setups illustrate that the full-duplex system with the proposed algorithms can achieve a large gain over the half-duplex one.