Electrical and Electronic Engineering - Research Publications
Permanent URI for this collection
Search Results
1 - 6 of 6
-
ItemChemical Reactions-based Detection Mechanism for Molecular Communications(IEEE, 2020-05)In molecular communications, the direct detection of signaling molecules may be challenging due to the lack of suitable sensors and interference from co-existing substances in the environment. Motivated by examples in nature, we investigate an indirect detection mechanism using chemical reactions between the signaling molecules and a molecular probe to produce an easy-to-measure product at the receiver. The underlying reaction-diffusion equations that describe the concentrations of the reactant and product molecules in the system are non-linear and coupled, and cannot be solved in closed-form. To analyze these molecule concentrations, we develop an efficient iterative algorithm by discretizing the time variable and solving for the space variables in each time step. We also derive insightful closed-form solutions for a special case. The accuracy of the proposed algorithm is verified by particle-based simulations. Our results show that the concentration of the product molecules has a similar characteristic over time as the concentration of the signaling molecules. We analyze the bit error rate (BER) for a threshold detector and highlight that significant improvements in the BER can be achieved by carefully choosing the molecular probe and optimizing the detection threshold.
-
ItemCentralized Scheduling with Sum-Rate optimization in Flexible Half-Duplex Networks(IEEE, 2020-05)In this paper, we focus on maximization of the instantaneous sum-rate in flexible half-duplex networks, where nodes have the flexibility to choose to either transmit, receive or be silent in a given time slot. Since the corresponding optimization problem is NP-hard, we design low-cost algorithms that give sub-optimal solutions with good performance. We first consider two existing approximation techniques to simplify the sum-rate optimization problem: arithmetic-geometric means inequality and another utilising the tight lower bound approximation. We then propose a novel pattern search algorithm that performs close to exhaustive search but with significantly lower complexity. Comparing the performance of the proposed algorithm with respect to existing resource allocation techniques, we observe that our proposed algorithm provides significant sum-rate gains.
-
ItemBinary Power Optimality for Two Link Full-Duplex Network(IEEE, 2020-05)In this paper, we analyse the optimality of binary power allocation in a network that includes full-duplex communication links. Considering a network with four communicating nodes, two of them operating in half-duplex mode and the other two in full-duplex mode, we prove that binary power allocation is optimum for the full-duplex nodes when maximizing the sum rate. We also prove that, for half-duplex nodes binary power allocation is not optimum in general. However, for the two special cases, 1) the low signal-to-noise-plus-interference (SINR) regime and, 2) the approximation by the arithmetic mean-geometric mean inequality, binary power allocation is optimum for the approximated sum rate even for the half-duplex nodes. We further analyse a third special case using a symmetric network for which the optimum power allocation is binary, under a sufficient condition. Numerical examples are included to illustrate the accuracy of the results.
-
ItemTwo-Way Communications via Reconfigurable Intelligent Surface(IEEE, 2020-06-19)The novel reconfigurable intelligent surface (RIS) is an emerging technology which facilitates high spectrum and energy efficiencies in Beyond 5G and 6G wireless communication applications. Against this backdrop, this paper investigates two-way communications via reconfigurable intelligent surfaces (RISs) where two users communicate through a common RIS. We assume that uplink and downlink communication channels between two users and the RIS can be reciprocal. We first obtain the optimal phase adjustment at the RIS. We then derive the exact outage probability and the average throughput in closed-forms for single-element RIS. To evaluate multiple-element RIS, we first introduce a gamma approximation to model a product of Rayleigh random variables, and then derive approximations for the outage probability and the average throughput. For large average signal-to-interference-plus-noise ratio (SINR) \rho, asymptotic analXsis also shows that the outage decreases at the rate (\log(\rho)/\rho) where L is the number of elements, whereas the throughput increases with the rate \log(\rho).
-
ItemResource allocation in dynamic DF relay for swipt network with circuit power consumption(IEEE, 2020-02-27)This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop dynamic decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The circuit power consumption (CPC), which includes power requirements for both decoding and encoding circuits, is considered at the relay. For a rate- dependent linear CPC model, we formulate an optimization problem to decide the optimal throughput, PS ratio, relay transmit power and time ratio for the source to relay transmission. Although the resultant optimization problem is nonconvex, we derive an efficient optimization algorithm, requiring significantly less floating point operations than an interior point method. Finally, we present numerical results which lead to some interesting insights for system design.
-
ItemLimited-feedback distributed relay selection for random spatial wireless networks(IEEE, 2020-02-27)This paper considers a location-based optimal relay selection scheme for a relay-assisted wireless network where available decode-and- forward relays are distributed as a homogeneous Poisson point process. To solve an optimum relay selection problem, a central entity or the source requires information pertaining to all relay locations. Since the task of feeding this information back is impractical, we investigate a threshold-based limited feedback distributed relay selection policy. We show that the total number of relays feeding back is a Poisson distributed random variable. For a given threshold-based limited feedback distributed relay selection policy, we obtain analytical expressions for the average rate and the outage probability over the fading and no-fading communication scenarios. The derived analytical expressions are verified and the performance achieved by the proposed relay selection policy is illustrated through extensive simulations. It is observed that the limited feedback distributed relay selection policy can achieve almost the same performance with the optimum relay selection policy by only utilizing location information from a few number of relays.