Searcharxiv⌕ Search

arXiv subjects

Halim Yanikomeroglu

Publications and source records attributed to Halim Yanikomeroglu.

At least 199 records · Page 11Linked to original sources

Group Authentication for Drone Swarms

In parallel with the advances of aerial networks, the use of drones is quickly included in daily activities. According to the characteristics of the operations to be carried out using the drones, the need for simultaneous use of one or more drones has arisen. The use of a drone swarm is preferred rather than the use of a single drone to complete activities such as secure crowd monitoring systems, cargo delivery. Due to the limited airtime of the drones, new members may be included in the swarm, or there may be a unification of two or more drone swarms when needed. Authentication of the new drone that will take its place in the drone swarm and the rapid mutual-verification of two different swarms of drones are some of the security issues in the swarm structures. In this study, group authentication-based solutions have been put forward to solve the identified security issues. The proposed methods and 5G new radio (NR) authentication methods were compared in terms of time and a significant time difference was obtained. According to the 5G NR standard, it takes 22 ms for a user equipment (UE) to be verified by unified data management (UDM), while in the proposed method, this time varies according to the threshold value of the polynomial used and it is substantially lower than 22 ms for most threshold values.

cs.CR↗

When to Crossover from Earth to Space for Lower Latency Data Communications?

For data communications over long distances, optical wireless satellite networks (OWSNs) can offer lower latency than optical fiber terrestrial networks (OFTNs). However, when is it beneficial to switch or crossover from an OFTN to an OWSN for lower latency data communications? In this work, we introduce a crossover function that enables to find the crossover distance, i.e., a distance between two points on the surface of the Earth beyond which switching or crossing over from an OFTN to an OWSN for data communications between these points is useful in terms of latency. Numerical results reveal that a higher refractive index of optical fiber (or $i$) in an OFTN and a lower altitude of satellites (or $h$) in an OWSN result in a shorter crossover distance. To account for the variation in the end-to-end propagation distance that occurs over the OWSN, we examine the crossover function in four different scenarios. Numerical results indicate that the crossover distance varies with the end-to-end propagation distance over an OWSN and is different for different scenarios. We calculate the average crossover distance over all scenarios for different $h$ and $i$ and use it to evaluate the simulation results. Furthermore, for a comparative analysis of OFTNs and OWSNs in terms of latency, we study three different OFTNs having different refractive indices and three different OWSNs having different satellite altitudes in three different scenarios for long-distance inter-continental data communications, including connections between New York and Dublin, Sao Paulo and London, and Toronto and Sydney.

eess.SP↗

Toward a Smart Resource Allocation Policy via Artificial Intelligence in 6G Networks: Centralized or Decentralized?

In this paper, we design a new smart softwaredefined radio access network (RAN) architecture with important properties like flexibility and traffic awareness for sixth generation (6G) wireless networks. In particular, we consider a hierarchical resource allocation framework for the proposed smart soft-RAN model, where the software-defined network (SDN) controller is the first and foremost layer of the framework. This unit dynamically monitors the network to select a network operation type on the basis of distributed or centralized resource allocation architectures to perform decision-making intelligently. In this paper, our aim is to make the network more scalable and more flexible in terms of achievable data rate, overhead, and complexity indicators. To this end, we introduce a new metric, throughput overhead complexity (TOC), for the proposed machine learning-based algorithm, which makes a trade-off between these performance indicators. In particular, the decision making based on TOC is solved via deep reinforcement learning (DRL), which determines an appropriate resource allocation policy. Furthermore, for the selected algorithm, we employ the soft actor-critic method, which is more accurate, scalable, and robust than other learning methods. Simulation results demonstrate that the proposed smart network achieves better performance in terms of TOC compared to fixed centralized or distributed resource management schemes that lack dynamism. Moreover, our proposed algorithm outperforms conventional learning methods employed in other state-of-the-art network designs.

eess.SP↗

Caching and Computation Offloading in High Altitude Platform Station (HAPS) Assisted Intelligent Transportation Systems

Edge intelligence, a new paradigm to accelerate artificial intelligence (AI) applications by leveraging computing resources on the network edge, can be used to improve intelligent transportation systems (ITS). However, due to physical limitations and energy-supply constraints, the computing powers of edge equipment are usually limited. High altitude platform station (HAPS) computing can be considered as a promising extension of edge computing. HAPS is deployed in the stratosphere to provide wide coverage and strong computational capabilities. It is suitable to coordinate terrestrial resources and store the fundamental data associated with ITS-based applications. In this work, three computing layers,i.e., vehicles, terrestrial network edges, and HAPS, are integrated to build a computation framework for ITS, where the HAPS data library stores the fundamental data needed for the applications. In addition, the caching technique is introduced for network edges to store some of the fundamental data from the HAPS so that large propagation delays can be reduced. We aim to minimize the delay of the system by optimizing computation offloading and caching decisions as well as bandwidth and computing resource allocations. The simulation results highlight the benefits of HAPS computing for mitigating delays and the significance of caching at network edges.

eess.SY↗

Distributed Online Anomaly Detection for Virtualized Network Slicing Environment

As the network slicing is one of the critical enablers in communication networks, one anomalous physical node (PN) or physical link (PL) in substrate networks that carries multiple virtual network elements can cause significant performance degradation of multiple network slices. To recover the substrate networks from anomaly within a short time, rapid and accurate identification of whether or not the anomaly exists in PNs and PLs is vital. Online anomaly detection methods that can analyze system data in real-time are preferred. Besides, as virtual nodes and links mapped to PNs and PLs are scattered in multiple slices, the distributed detection modes are required to adapt to the virtualized environment. According to those requirements, in this paper, we first propose a distributed online PN anomaly detection algorithm based on a decentralized one-class support vector machine (OCSVM), which is realized through analyzing real-time measurements of virtual nodes mapped to PNs in a distributed manner. Specifically, to decouple the OCSVM objective function, we transform the original problem to a group of decentralized quadratic programming problems by introducing the consensus constraints. The alternating direction method of multipliers is adopted to achieve the solution for the distributed online PN anomaly detection. Next, by utilizing the correlation of measurements between neighbor virtual nodes, another distributed online PL anomaly detection algorithm based on the canonical correlation analysis is proposed. The network only needs to store covariance matrices and mean vectors of current data to calculate the canonical correlation vectors for real-time PL anomaly analysis. The simulation results on both synthetic and real-world network datasets show the effectiveness and robustness of the proposed distributed online anomaly detection algorithms.

cs.NI↗

NOMA Computation Over Multi-Access Channels for Multimodal Sensing

An improved mean squared error (MSE) minimization solution based on eigenvector decomposition approach is conceived for wideband non-orthogonal multiple-access based computation over multi-access channel (NOMA-CoMAC) framework. This work aims at further developing NOMA-CoMAC for next-generation multimodal sensor networks, where a multimodal sensor monitors several environmental parameters such as temperature, pollution, humidity, or pressure. We demonstrate that our proposed scheme achieves an MSE value approximately 0.7 lower at E_b/N_o = 1 dB in comparison to that for the average sum-channel based method. Moreover, the MSE performance gain of our proposed solution increases even more for larger values of subcarriers and sensor nodes due to the benefit of the diversity gain. This, in return, suggests that our proposed scheme is eminently suitable for multimodal sensor networks.

eess.SP↗

Low-Density Spreading Design Based on an Algebraic Scheme for NOMA Systems

NOMA) technique based on an algebraic design is studied. We propose an improved low-density spreading (LDS) sequence design based on projective geometry. In terms of its bit error rate (BER) performance, our proposed improved LDS code set outperforms the existing LDS designs over the frequency nonselective Rayleigh fading and additive white Gaussian noise (AWGN) channels. We demonstrated that achieving the best BER depends on the minimum distance.

cs.IT↗

Cooperation in Space: HAPS-Aided Optical Inter-Satellite Connectivity with Opportunistic Scheduling

Issues with tracking, precision pointing, and Doppler shift are the major sources of performance loss in laser inter-satellite communication that can severely decrease the coverage and overall performance of satellite constellations. As a solution to these problems, we propose a cooperation strategy in which a high altitude platform station (HAPS) staying at a quasi-stationary position contributes to the inter-satellite connectivity. In this setup, the HAPS node uses two different scheduling approaches: one that relies on the zenith angle; the other on instantaneous signal-to-noise ratio. To quantify the performance of the proposed scheme, overall outage probabilities for the two scheduling methods are obtained. In addition, guidelines for the design of practical inter-satellite networks are provided.

eess.SP↗

Low-Complexity Resource Allocation for Dense Cellular Vehicle-to-Everything (C-V2X) Communications

Vehicular communications are the key enabler of traffic reduction and road safety improvement referred to as cellular vehicle-to-everything (C-V2X) communications. Considering the numerous transmitting entities in next generation cellular networks, most existing resource allocation algorithms are impractical or non-effective to ensure reliable C-V2X communications which lead to safe intelligent transportation systems. We study a centralized framework to develop a low-complexity, scalable, and practical resource allocation scheme for dense C-V2X communications. The NP-hard sum-rate maximization resource allocation problem is formulated as a mixed-integer non-linear non-convex optimization problem considering both cellular vehicular links (CVLs) and non-cellular VLs (NCVLs) quality-of-service (QoS) constraints. By assuming that multiple NCVLs can simultaneously reuse a single cellular link (CL), we propose two low-complexity sub-optimal matching-based algorithms in four steps. The first two steps provide a channel gain-based CVL priority and CL assignment followed by an innovative scalable min-max channel-gain-based CVL-NCVL matching. We propose an analytically proven closed-form fast feasibility check theorem as the third step. The objective function is transformed into a difference of convex (DC) form and the power allocation problem is solved optimally using majorization-minimization (MaMi) method and interior point methods as the last step. Numerical results verify that our schemes are scalable and effective for dense C-V2X communications. The low-complexity and practicality of the proposed schemes for dense cellular networks is also shown. Furthermore, it is shown that the proposed schemes outperform other methods up to %6 in terms of overall sum-rate in dense scenarios and have a near optimal performance.

cs.IT↗

A Weather-Dependent Hybrid RF/FSO Satellite Communication for Improved Power Efficiency

Recent studies have shown that satellite communication (SatCom) will have a fundamental role in the next generation non-terrestrial networks (NTN). In SatCom, radio-frequency (RF) or free-space optical (FSO) communications can be used depending on the communication environment. Motivated by the complementary nature of RF and FSO communication, we propose a hybrid RF/FSO transmission strategy for SatCom, where the satellite selects RF or FSO links depending on the weather conditions obtained from the context-aware sensor. To quantify the performance of the proposed network, we derive the outage probability expressions by considering different weather conditions. Moreover, asymptotic analysis is conducted to obtain the diversity order. Furthermore, we investigate the impact of non-zero boresight pointing errors and illustrate the benefits of the aperture averaging to mitigate the effect of misalignment and atmospheric turbulence. Finally, we suggest effective design guidelines that can be useful for system designers. The results have shown that the proposed strategy performs better than the dual-mode conventional hybrid RF/FSO communication in terms of outage probability offering some power gain.

eess.SP↗

HAPS Selection for Hybrid RF/FSO Satellite Networks

Non-terrestrial networks have been attracting much interest from the industry and academia. Satellites and high altitude platform station (HAPS) systems are expected to be the key enablers of next-generation wireless networks. In this paper, we introduce a novel downlink satellite communication (SatCom) model where free-space optical (FSO) communication is adopted between a satellite and a HAPS node. A hybrid FSO/radio-frequency (RF) transmission model is used between the HAPS node and ground station (GS). In the first phase of transmission, the satellite selects the HAPS node that provides the highest signal-to-noise ratio (SNR). In the second phase, the selected HAPS decodes and forwards the signal to the GS. To evaluate the performance of the proposed system, outage probability expressions are derived for exponentiated Weibull (EW) and shadowed-Rician fading models while considering the atmospheric turbulence, stratospheric attenuation, and attenuation due to scattering, path loss, and pointing errors. Additionally, asymptotic analysis is carried out and diversity gain is provided. Furthermore, the impact of aperture averaging technique, temperature, and wind speed are investigated. We also provide some important guidelines that can be helpful for the design of practical HAPS-aided SatCom. Finally, the results show that the use of HAPS improves the system performance and that the proposed model performs better than all other existing models.

eess.SP↗

UAV-based Crowd Surveillance in Post COVID-19 Era

To cope with the current pandemic situation and reinstate pseudo-normal daily life, several measures have been deployed and maintained, such as mask wearing, social distancing, hands sanitizing, etc. Since outdoor cultural events, concerts, and picnics, are gradually allowed, a close monitoring of the crowd activity is needed to avoid undesired contact and disease transmission. In this context, intelligent unmanned aerial vehicles (UAVs) can be occasionally deployed to ensure the surveillance of these activities, that health restriction measures are applied, and to trigger alerts when the latter are not respected. Consequently, we propose in this paper a complete UAV framework for intelligent monitoring of post COVID-19 outdoor activities. Specifically, we propose a three steps approach. In the first step, captured images by a UAV are analyzed using machine learning to detect and locate individuals. The second step consists of a novel coordinates mapping approach to evaluate distances among individuals, then cluster them, while the third step provides an energy-efficient and/or reliable UAV trajectory to inspect clusters for restrictions violation such as mask wearing. Obtained results provide the following insights: 1) Efficient detection of individuals depends on the angle from which the image was captured, 2) coordinates mapping is very sensitive to the estimation error in individuals' bounding boxes, and 3) UAV trajectory design algorithm 2-Opt is recommended for practical real-time deployments due to its low-complexity and near-optimal performance.

cs.CV↗

Optimization of Quantized Phase Shifts for Reconfigurable Smart Surfaces Assisted Communications

Reconfigurable Smart Surface (RSS) is assumed to be a key enabler for future wireless communication systems due to its ability to control the wireless propagation environment and, thus, enhance communications quality. Although optimal and continuous phase-shift configuration can be analytically obtained, practical RSS systems are prone to both channel estimation errors, discrete control, and curse of dimensionality. This leads to relaying on a finite number of phase-shift configurations that is expected to degrade the system's performances. In this paper, we tackle the problem of quantized RSS phase-shift configuration, aiming to maximize the data rate of an orthogonal frequency division multiplexing (OFDM) point-to-point RSS-assisted communication. Due to the complexity of optimally solving the formulated problem, we propose here a sub-optimal greedy algorithm to solve it. Simulation results illustrate the performance superiority of the proposed algorithm compared to baseline approaches. Finally, the impact of several parameters ,e.g., quantization resolution and RSS placement, is investigated.

eess.SP↗

A Novel Low Complexity Faster-than-Nyquist (FTN) Signaling Detector for Ultra High-Order QAM

Faster-than-Nyquist (FTN) signaling is a promising non-orthogonal pulse modulation technique that can improve the spectral efficiency (SE) of next generation communication systems at the expense of higher detection complexity to remove the introduced inter-symbol interference (ISI). In this paper, we investigate the detection problem of ultra high-order quadrature-amplitude modulation (QAM) FTN signaling where we exploit a mathematical programming technique based on the alternating directions multiplier method (ADMM). The proposed ADMM sequence estimation (ADMMSE) FTN signaling detector demonstrates an excellent trade-off between performance and computational effort enabling successful detection and SE gains for QAM modulation orders as high as 64K (65,536). The complexity of the proposed ADMMSE detector is polynomial in the length of the transmit symbols sequence and its sensitivity to the modulation order increases only logarithmically. Simulation results show that for 16-QAM, the proposed ADMMSE FTN signaling detector achieves comparable SE gains to the generalized approach semidefinite relaxation-based sequence estimation (GASDRSE) FTN signaling detector, but at an experimentally evaluated much lower computational time. Simulation results additionally show SE gains for modulation orders starting from 4-QAM, or quadrature phase shift keying (QPSK), up to and including 64K-QAM when compared to conventional Nyquist signaling. The very low computational effort required makes the proposed ADMMSE detector a practically promising FTN signaling detector for both low order and ultra high-order QAM FTN signaling systems.

cs.IT↗

Optimal Power Allocation in Downlink Multicarrier NOMA Systems: Theory and Fast Algorithms

In this work, we address the problem of finding globally optimal power allocation strategies to maximize the users sum-rate (SR) as well as system energy efficiency (EE) in the downlink of single-cell multicarrier non-orthogonal multiple access (MC-NOMA) systems. Each NOMA cluster includes a set of users in which the well-known superposition coding (SC) combined with successive interference cancellation (SIC) technique is applied among them. By obtaining the closed-form expression of intra-cluster power allocation, we show that MC-NOMA can be equivalently transformed to a virtual orthogonal multiple access (OMA) system, where the effective channel gain of these virtual OMA users is obtained in closed-form. Then, the SR and EE maximization problems are solved by using very fast water-filling and Dinkelbach algorithms, respectively. The equivalent transformation of MC-NOMA to the virtual OMA system brings new theoretical insights, which are discussed throughout the paper. The extensions of our analysis to other scenarios, such as considering users rate fairness, admission control, long-term performance, and a number of future next-generation multiple access (NGMA) schemes enabling recent advanced technologies, e.g., reconfigurable intelligent surfaces are discussed. Extensive numerical results are provided to show the performance gaps between single-carrier NOMA (SC-NOMA), OMA-NOMA, and OMA.

cs.IT↗

Joint Power Control, Channel Assignment and Cell Association in Heterogeneous Cellular Networks

Heterogeneous network (HetNet) is a promising concept for increasing capacity and alleviating spectrum scarcity. In HetNets, however, channel assignment and transmit power control affect the distribution of users among base stations. We present a novel scheme to maximize the uplink sum rate in two-tier HetNets with one macrocell and several femtocells, where the transmit power of each user is bounded and at least one channel is assigned to each user. We divide the problem into two sub-problems: one for channel assignment and one for transmit power control and solve them by iteratively alternating between the two. Our scheme is convergent and yields a transmission rate above 6 bps/Hz for almost 50% of users as compared to the same for 10% of users in SINR-based schemes. When users are in cell boundaries, the average transmission rate for fractional frequency reuse is up to 20% more compared to the conventional full frequency reuse. This is due to reduced transmit power resulting in less interference.

cs.IT↗

LEO Satellites in 5G and Beyond Networks: A Review from a Standardization Perspective

Low Earth Orbit (LEO) Satellite Network (SatNet) with their mega-constellations are expected to play a key role in providing ubiquitous Internet and communications services in the future. LEO SatNets will provide wide-area coverage and support service availability, continuity, and scalability. To support the integration of SatNets and terrestrial Fifth Generation (5G)networks and beyond, the satellite communication industry has become increasingly involved with the 3rd Generation Partnership Project (3GPP) standardization activities for 5G. In this work, we review the 3GPP standardization activities for the integration of SatNets in 5G and beyond. The 3GPP use cases of SatNets are highlighted and potential requirements to realize them are summarized as well. The impacted areas of New Radio(NR) are discussed with some potential solutions. The foreseen requirements for the management and orchestration of SatNets within 5G are described. Future standardization directions are discussed to support the full integration of SatNets in SixthGeneration (6G) with the goal of ubiquitous global connectivity.

cs.NI↗

Phasing Parameter Analysis for Satellite Collision Avoidance in Starlink and Kuiper Constellations

The phasing parameter F determines the relative phasing between satellites in different orbital planes and thereby affects the relative position of the satellites in a constellation. The collisions between satellites within the constellation can be avoided if the minimum distance among them is large. From among the possible values of F in a constellation, a value of F is desired that leads to the maximum value of the minimum distance between satellites. We investigate F for two biggest upcoming satellite constellations including Starlink Phase 1 Version 3 and Kuiper Shell 2. No existing work or FCC filing provides a value of F that is suitable for these two constellations. We look for the best value of F in these constellations that provides the maximum value of the minimum distance to ensure intra-constellation avoidance of collisions between satellites. To this end, we simulate each constellation for each value of F to find its best value based on ranking. Out of the 22 and 36 possible values of F for Starlink Phase 1 Version 3 and Kuiper Shell 2, respectively, it is observed that the best value of F with highest ranking is 17 and 11 that leads to the largest minimum distance between satellites of 61.83 km and 55.89 km in these constellations, respectively.

astro-ph.EP↗