arXiv subjects

Ali Emre Pusane

Publications and source records attributed to Ali Emre Pusane.

At least 19 recordsLinked to original sources

arXiv2026

Noise-Domain Non-Orthogonal Multiple Access for Three Users

In this study, we propose a novel three-user noise-domain non-orthogonal multiple access (ND-NOMA) scheme by introducing the correlation as a new dimension besides mean and variance quantities used in two-user ND-NOMA. The new three-user ND-NOMA scheme includes both uplink and downlink scenarios, with detectors designed to decode the information embedded in mean, variance, and correlation. Our theoretical analysis and simulation results under Rician fading channels show that the proposed system is capable of achieving promising bit error rate (BER) performance while preserving the low power and low complexity advantages of ND-NOMA. This new ND-NOMA design enables simultaneous communication among three users using different dimensions, paving the way for scalable multi-user communication in noise-domain systems and in the Internet-of-things (IoT) environments.

cs.IT↗

arXiv2026

A Novel Stripe-based RIS Optimization for UAV Communications and Sensing in Low-Altitude Wireless Networks

Low-altitude wireless networks (LAWN) envision a reconfigurable 3D network capable of supporting mission-critical aerial operations. This paper presents a reconfigurable intelligent surface (RIS)-assisted LAWN to establish a reliable communication with an unmanned aerial vehicle (UAV) across varying wireless channel conditions and signal blockages. A low complexity stripe-based RIS phase shift optimization framework is proposed to simultaneously enhance communication reliability and provide passive sensing capability for UAV tracking under 3D mobility. Unlike high-complexity optimization approaches, the proposed method leverages the inherent structural phase-gradient of the RIS adjacent elements to significantly reduce the search space for calculating and updating the RIS configuration as the UAV moves. The analysis and simulation results demonstrate that the proposed framework outperforms conventional benchmarks in convergence speed and computational efficiency, while maintaining robust, high signal-to-noise-ratio (SNR) connectivity even in the presence of phase estimation errors and low SNR regimes. In addition, the measurement experiments using a real RIS prototype in an outdoor campus environment are performed to demonstrate the practical viability of the proposed approach.

eess.SP↗

arXiv2024

LDPC-Coded Molecular Communications with Increased Diversity

This paper suggests achieving diversity gains while utilizing low-denisty parity check (LDPC) codes in molecular communications. Intersymbol interference (ISI) causes a significant disadvantage in error performance for molecular communications. Even though decoding LDPC codes with soft decoding yields a considerable enhancement in the bit error rate (BER) curves, this can be further improved by utilizing diversity gain. In order to achieve this, two different messenger molecule types are sent to transmit the message codeword and its interleaved version. The molecular communication channel is then modeled, and the error performance of the proposed method is estimated by Monte-Carlo simulations. This approach provides considerable improvement in the error performance in the scenario where few messenger molecules are transmitted per bit.

eess.SP↗

arXiv2024

Half-Space Modeling with Reflecting Surface in Molecular Communication

In Molecular Communications via Diffusion (MCvD), messenger molecules are emitted by a transmitter and propagate randomly through the fluidic environment. In biological systems, the environment can be considered a bounded space, surrounded by various structures such as tissues and organs. The propagation of molecules is affected by these structures, which reflect the molecules upon collision. Deriving the channel response of MCvD systems with an absorbing spherical receiver requires solving the 3-D diffusion equation in the presence of reflecting and absorbing boundary conditions, which is extremely challenging. In this paper, the method of images is brought to molecular communication (MC) realm to find a closed-form solution to the channel response of a single-input single-output (SISO) system near an infinite reflecting surface. We showed that a molecular SISO system in a 3-D half-space with an infinite reflecting surface could be approximated as a molecular single-input multiple-output (SIMO) system in a 3-D space, which consists of two symmetrically located, with respect to the reflecting surface, identical absorbing spherical receivers.

cs.IT↗

arXiv2023

Channel Modeling for Multi-Receiver Molecular Communication Systems

Molecular Communication via Diffusion (MCvD) is a prominent small-scale technology, which roots from the nature. With solid analytical foundations on channel response and advanced modulation techniques, molecular single-input-single-output (SISO) systems are one of the most studied molecular networks in the literature. However, the literature is yet to provide sufficient analytical channel modeling on molecular multiple-output systems with fully absorbing receivers, {one of the common applications in the area. In this paper, a channel model for molecular single-input-multiple-output (SIMO) systems is proposed for estimating the channel response of such systems. With the model's recursive nature, the closed-form solution of the channel response of molecular 2-Rx SIMO systems is analytically derived. A simplified model with lower complexity is also presented at a cost of slightly less accurate channel estimation. The models are extended to the molecular SIMO systems with more than two receivers. The performance of the methods are evaluated for several topologies with different parameters, and the accuracy of the model is verified by comparing to computer-simulated channel estimations in terms of quantitative error metrics such as root-mean-squared error. The performance of the simplified model is verified by the amount of deviation, indicating sufficient channel modeling performance with reduced computational power.

cs.IT↗

arXiv2023

Rapid CNN-Assisted Iterative RIS Element Configuration

Reconfigurable Intelligent Surfaces (RISs) are becoming one of the fundamental building blocks of next-generation wireless communication systems. To that end, RIS phase configuration optimization is an important issue, where finding the most suitable configuration becomes a challenging and resource-consuming task, especially as the number of RIS elements increases. Since exhaustive search is not practical, iterative algorithms are utilized to determine the RIS configuration by sequentially considering all RIS elements, where the best-performing phase shift configuration is obtained for each element. However, each configuration attempt requires receiver performance feedback, leading to higher delay and signaling overhead. Thus, in this paper, a convolutional neural network (CNN) based solution is formulated to rapidly find the phase configurations of the RIS elements. The simulation results for a RIS with $40\times40$ elements imply that the proposed algorithm reduces the number of steps dramatically e.g., from 3200 to 160 for the particular setup. Furthermore, such improvement in complexity is achieved with a slight degradation in performance.

eess.SP↗

arXiv2023

Measurement-based Characterization of Physical Layer Security for RIS-assisted Wireless Systems

There have been recently many studies demonstrating that the performance of wireless communication systems can be significantly improved by a reconfigurable intelligent surface (RIS), which is an attractive technology due to its low power requirement and low complexity. This paper presents a measurement-based characterization of RISs for providing physical layer security, where the transmitter (Alice), the intended user (Bob), and the eavesdropper (Eve) are deployed in an indoor environment. Each user is equipped with a software-defined radio connected to a horn antenna. The phase shifts of reflecting elements are software controlled to collaboratively determine the amount of received signal power at the locations of Bob and Eve in such a way that the secrecy capacity is aimed to be maximized. An iterative method is utilized to configure a Greenerwave RIS prototype consisting of 76 passive reflecting elements. Computer simulation and measurement results demonstrate that an RIS can be an effective tool to significantly increase the secrecy capacity between Bob and Eve.

eess.SP↗

arXiv2021

Molecular Index Modulation using Convolutional Neural Networks

As the potential of molecular communication via diffusion (MCvD) systems at nano-scale communication increases, designing molecular schemes robust to the inevitable effects of molecular interference has become of vital importance. There are numerous molecular approaches in literature aiming to mitigate the effects of interference, namely inter-symbol interference. Moreover, for molecular multiple-input-multiple-output systems, interference among antennas, namely inter-link interference, becomes of significance. Inspired by the state-of-the-art performances of machine learning algorithms on making decisions, we propose a novel approach of a convolutional neural network (CNN)-based architecture. The proposed approach is for a uniquely-designed molecular multiple-input-single-output topology in order to alleviate the damaging effects of molecular interference. In this study, we compare the performance of the proposed network with that of an index modulation approach and a symbol-by-symbol maximum likelihood estimation and show that the proposed method yields better performance.

cs.ET↗

arXiv2021

An Adaptive Multi-Agent Physical Layer Security Framework for Cognitive Cyber-Physical Systems

Being capable of sensing and behavioral adaptation in line with their changing environments, cognitive cyber-physical systems (CCPSs) are the new form of applications in future wireless networks. With the advancement of the machine learning algorithms, the transmission scheme providing the best performance can be utilized to sustain a reliable network of CCPS agents equipped with self-decision mechanisms, where the interactions between each agent are modeled in terms of service quality, security, and cost dimensions. In this work, first, we provide network utility as a reliability metric, which is a weighted sum of the individual utility values of the CCPS agents. The individual utilities are calculated by mixing the quality of service (QoS), security, and cost dimensions with the proportions determined by the individualized user requirements. By changing the proportions, the CCPS network can be tuned for different applications of next-generation wireless networks. Then, we propose a secure transmission policy selection (STPS) mechanism that maximizes the network utility by using the Markov-decision process (MDP). In STPS, the CCPS network jointly selects the best performing physical layer security policy and the parameters of the selected secure transmission policy to adapt to the changing environmental effects. The proposed STPS is realized by reinforcement learning (RL), considering its real-time decision mechanism where agents can decide automatically the best utility providing policy in an altering environment.

eess.SY↗

arXiv2020

Simulation Study and Analysis of Diffusive Molecular Communications with an Apertured Plane

Molecular communication via diffusion (MCvD) is a method of achieving nano- and micro-scale connectivity by utilizing the free diffusion mechanism of information molecules. The randomness in diffusive propagation is the main cause of inter-symbol interference (ISI) and the limiting factor of high data rate MCvD applications. In this paper, an apertured plane is considered between the transmitter and the receiver of an MCvD link. Either after being artificially placed or occurring naturally, surfaces or volumes that resemble an apertured plane only allow a fraction of the molecules to pass. Contrary to intuition, it is observed that such topology may improve communication performance, given the molecules that can pass through the aperture are the ones that take more directed paths towards the receiver. Furthermore, through both computer simulations and a theoretical signal evaluation metric named signal-to-interference and noise amplitude ratio (SINAR), it is found that the size of the aperture imposes a trade-off between the received signal power and the ISI combating capability of an MCvD system, hinting to an optimal aperture size that minimizes the bit error rate (BER). It is observed that the trend of BER is accurately mirrored by SINAR, suggesting the proposed metric's applicability to optimization tasks in MCvD systems, including finding the optimal aperture size of an apertured plane. In addition, computer simulations and SINAR show that said optimal aperture size is affected by the location of the aperture and the bit rate. Lastly, the paper analyzes the effects of radial and angular offsets in the placement of the apertured plane, and finds that a reduction in BER is still in effect up to certain offset values. Overall, our results imply that apertured plane-like surfaces may actually help communication efficiency, even though they reduce the received signal power.

cs.ET↗

arXiv2019

Index Modulation for Molecular Communication via Diffusion Systems

Molecular communication via diffusion (MCvD) is a molecular communication method that utilizes the free diffusion of carrier molecules to transfer information at the nano-scale. Due to the random propagation of carrier molecules, inter-symbol interference (ISI) is a major issue in an MCvD system. Alongside ISI, inter-link interference (ILI) is also an issue that increases the total interference for MCvD-based multiple-input-multiple-output (MIMO) approaches. Inspired by the antenna index modulation (IM) concept in traditional communication systems, this paper introduces novel IM-based transmission schemes for MCvD systems. In the paper, molecular space shift keying (MSSK) is proposed as a novel modulation for molecular MIMO systems, and it is found that this method combats ISI and ILI considerably better than existing MIMO approaches. For nano-machines that have access to two different molecules, the direct extension of MSSK, quadrature molecular space shift keying (QMSSK) is also proposed. QMSSK is found to combat ISI considerably well whilst not performing well against ILI-caused errors. In order to combat ILI more effectively, another dual-molecule-based novel modulation scheme called the molecular spatial modulation (MSM) is proposed. Combined with the Gray mapping imposed on the antenna indices, MSM is observed to yield reliable error rates for molecular MIMO systems.

cs.ET↗

arXiv2019

Practical Polar Code Construction Using Generalised Generator Matrices

Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2x2 generator matrix, polarises the channels, i.e., a portion of the channel capacities approach 1, while the remaining channel capacities approach 0. Due to the specific size of this original generator matrix, polar codes can only have code lengths equal to the powers of 2, resulting in inefficiency for codes of practical lengths. In this paper, the performance of finite-length polar codes over the binary erasure channel is analysed. A normalised polarisation distance measure is defined and polar codes from different generator matrices showing different amount of polarisation are compared using this measure. Encoding structures for these generalised polar codes are proposed and polarisation performances in both asymptotical and finite-length cases are investigated for generator matrices of size 3x3 and 4x4. A generalised decoder is also proposed for this generator matrix and its erasure rate is compared with that of the original generator matrix. It is shown that polar codes that have performance similar to the original construction can be constructed and used for a variety of code lengths, not necessarily equal to powers of 2, using generalised generator matrices.

cs.IT↗

arXiv2018

Analytical Derivation of the Impulse Response for the Bounded 2-D Diffusion Channel

This paper focuses on the derivation of the distribution of diffused particles absorbed by an agent in a bounded environment. In particular, we analogously consider to derive the impulse response of a molecular communication channel in 2-D and 3-D environment. In 2-D, the channel involves a point transmitter that releases molecules to a circular absorbing receiver that absorbs incoming molecules in an environment surrounded by a circular reflecting boundary. Considering this setup, the joint distribution of the molecules on the circular absorbing receiver with respect to time and angle is derived. Using this distribution, the channel characteristics are examined. Furthermore, we also extend this channel model to 3-D using a cylindrical receiver and investigate the channel properties. We also propose how to obtain an analytical solution for the unbounded 2-D channel from our derived solutions, as no analytical derivation for this channel is present in the literature.

cs.ET↗

arXiv2018

A General Analytical Approximation to Impulse Response of 3-D Microfluidic Channels in Molecular Communication

In this paper, the impulse response for a 3-D microfluidic channel in the presence of Poiseuille flow is obtained by solving the diffusion equation in radial coordinates. Using the radial distribution, the axial distribution is then approximated accordingly. Since Poiseuille flow velocity changes with radial position, molecules have different axial properties for different radial distributions. We, therefore, present a piecewise function for the axial distribution of the molecules in the channel considering this radial distribution. Finally, we lay evidence for our theoretical derivations for impulse response of the microfluidic channel and radial distribution of molecules through comparing them using various Monte Carlo simulations.

cs.ET↗

arXiv2018

Impulse Response of the Channel with a Spherical Absorbing Receiver and a Spherical Reflecting Boundary

In this letter, we derive the impulse response of the channel with a spherical absorbing receiver, a spherical reflecting boundary, and a point transmitter in molecular communication domain. By exploring the channel characteristics and drawing comparisons with the unbounded case, we show the consequences of having the boundary on channel properties such as peak time, peak amplitude, and total fraction of molecules to hit the receiver. Finally, we calculate the bit error rate for both bounded and unbounded channels and emphasize the significance of incorporating the boundary on understanding the realistic behavior of a channel.

cs.ET↗

arXiv2018

A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes

Channel coding aims to minimize errors that occur during the transmission of digital information from one place to another. Low-density parity-check (LDPC) codes can detect and correct transmission errors if one encodes the original information by adding redundant bits. In practice, heuristic iterative decoding algorithms are used to decode the received vector. However, these algorithms may fail to decode if the received vector contains multiple errors. We consider decoding the received vector with minimum error as an integer programming problem and propose a branch-and-price method for its solution. We improve the performance of our method by introducing heuristic feasible solutions and adding valid cuts to the mathematical formulation. Computational results reveal that our branch-price-and-cut algorithm significantly improves solvability of the problem compared to a commercial solver in high channel error rates. Our proposed algorithm can find higher quality solutions than commonly used iterative decoding heuristics.

cs.IT↗

arXiv2017

Molecular Signal Modeling of a Partially Counting Absorbing Spherical Receiver

To communicate at the nanoscale, researchers have proposed molecular communication as an energy-efficient solution. The drawback to this solution is that the histogram of the molecules' hitting times, which constitute the molecular signal at the receiver, has a heavy tail. Reducing the effects of this heavy tail, inter-symbol interference (ISI), has been the focus of most prior research. In this paper, a novel way of decreasing the ISI by defining a counting region on the spherical receiver's surface facing towards the transmitter node is proposed. The beneficial effect comes from the fact that the molecules received from the back lobe of the receiver are more likely to be coming through longer paths that contribute to ISI. In order to justify this idea, the joint distribution of the arrival molecules with respect to angle and time is derived. Using this distribution, the channel model function is approximated for the proposed system, i.e., the partially counting absorbing spherical receiver. After validating the channel model function, the characteristics of the molecular signal are investigated and improved performance is presented. Moreover, the optimal counting region in terms of bit error rate is found analytically.

cs.ET↗

arXiv2017

A Branch-and-Cut Algorithm to Design LDPC Codes without Small Cycles in Communication Systems

In a digital communication system, information is sent from one place to another over a noisy communication channel using binary symbols (bits). Original information is encoded by adding redundant bits, which are then used by low--density parity--check (LDPC) codes to detect and correct errors that may have been introduced during transmission. Error correction capability of an LDPC code is severely degraded due to harmful structures such as small cycles in its bipartite graph representation known as Tanner graph (TG). We introduce an integer programming formulation to generate a TG for a given smallest cycle length. We propose a branch-and-cut algorithm for its solution and investigate structural properties of the problem to derive valid inequalities and variable fixing rules. We introduce a heuristic to obtain feasible solutions of the problem. Our computational experiments show that our algorithm can generate LDPC codes without small cycles in acceptable amount of time for practically relevant code lengths.

cs.IT↗