Nikola Zlatanov

Dr. Nikola Zlatanov


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 September 2015 in IEEE Communications Letters
Verified
Journal Article
Closed access
EBElena Boshkovska
Elena Boshkovska
DNDerrick Wing Kwan Ng
Derrick Wing Kwan Ng
NZNikola Zlatanov
Nikola Zlatanov
RSRobert Schober
Robert Schober
In this letter, we propose a practical non-linear energy harvesting model and design a resource allocation algorithm for simultaneous wireless information and power transfer (SWIPT) systems. The algorithm design is formulated as a non-convex optimization problem for the maximization of the total harvested power at energy harvesting receivers subject to minimum required signal-to-interference-plus-noise ratios (SINRs) at multiple information receivers. We transform the considered non-convex objective function from sum-of-ratios form into an equivalent objective function in subtractive form, which enables the derivation of an efficient iterative resource allocation algorithm. In each iteration, a rank-constrained semidefinite program (SDP) is solved optimally by SDP relaxation. Numerical results unveil a substantial performance gain that can be achieved if the resource allocation design is based on the proposed non-linear energy harvesting model instead of the traditional linear model.

6 February 2017 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
EBElena Boshkovska
Elena Boshkovska
DNDerrick Wing Kwan Ng
Derrick Wing Kwan Ng
NZNikola Zlatanov
Nikola Zlatanov
AKAlexander Kölpin
Alexander Kölpin
RSRobert Schober
Robert Schober
In this paper, we consider a multiple-input multiple-output wireless powered communication network, where multiple users harvest energy from a dedicated power station in order to be able to transmit their information signals to an information receiving station. Employing a practical non-linear energy harvesting (EH) model, we propose a joint time allocation and power control scheme, which takes into account the uncertainty regarding the channel state information (CSI) and provides robustness against imperfect CSI knowledge. In particular, we formulate two non-convex optimization problems for different objectives, namely system sum throughput maximization and the maximization of the minimum individual throughput across all wireless powered users. To overcome the non-convexity, we apply several transformations along with a one-dimensional search to obtain an efficient resource allocation algorithm. Numerical results reveal that a significant performance gain can be achieved when the resource allocation is designed based on the adopted non-linear EH model instead of the conventional linear EH model. Besides, unlike a non-robust baseline scheme designed for perfect CSI, the proposed resource allocation schemes are shown to be robust against imperfect CSI knowledge.

12 October 2012 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
NZNikola Zlatanov
Nikola Zlatanov
RSRobert Schober
Robert Schober
PPPetar Popovski
Petar Popovski
In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the channel state information of the source-relay and the relay-destination link a decision is made whether the source or the relay transmits. In order to avoid data loss at the relay, adaptive link selection requires the relay to be equipped with a buffer such that data can be queued until the relay-destination link is selected for transmission. We study both delay-constrained and delay-unconstrained transmission. For the delay-unconstrained case, we characterize the optimal link selection policy, derive the corresponding throughput, and develop an optimal power allocation scheme. For the delay-constrained case, we propose to starve the buffer of the relay by choosing the decision threshold of the link selection policy smaller than the optimal one and derive a corresponding upper bound on the average delay. Furthermore, we propose a modified link selection protocol which avoids buffer overflow by limiting the queue size. Our analytical and numerical results show that buffer-aided relaying with adaptive link selection achieves significant throughput gains compared to conventional relaying protocols with and without buffers where the relay employs a fixed schedule for reception and transmission.

1 May 2014 in IEEE Communications Magazine
Verified
Journal Article
Closed access
NZNikola Zlatanov
Nikola Zlatanov
AIAissa Ikhlef
Aissa Ikhlef
TIToufiqul Islam
Toufiqul Islam
RSRobert Schober
Robert Schober
Cooperative communication can increase the throughput and/or extend the coverage of wireless networks. However, in conventional cooperative networks, half-duplex relays transmit and receive under a prefixed schedule, which does not allow them to exploit the best receiving and transmitting channels, thus limiting performance. Recently, new protocols have been proposed that circumvent this problem by making use of the additional flexibility offered by relays with buffers. Compared to conventional relaying protocols, these buffer-aided protocols provide significant gains in terms of throughput, diversity, and signal-to-noise ratio. This article outlines several buffer-aided relaying protocols for different network topologies, including one-way single- and multi-relay networks as well as two-way single-relay networks. Moreover, some practical challenges inherent to buffer-aided relaying, such as increased delay and complexity, and topics for future research are discussed.

9 January 2013 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
NZNikola Zlatanov
Nikola Zlatanov
RSRobert Schober
Robert Schober
We consider a simple network consisting of a source, a half-duplex decode-and-forward relay with a buffer, and a destination. We assume that the direct source-destination link is not available and all links undergo fading. We propose two new buffer-aided relaying schemes with different requirements regarding the availability of channel state information at the transmitter (CSIT). In the first scheme, neither the source nor the relay has full CSIT, and consequently, both nodes are forced to transmit with fixed rates. In contrast, in the second scheme, the source does not have full CSIT and transmits with fixed rate but the relay has full CSIT and adapts its transmission rate accordingly. In the absence of delay constraints, for both fixed rate and mixed rate transmission, we derive the throughput-optimal buffer-aided relaying protocols which select either the source or the relay for transmission based on the instantaneous signal-to-noise ratios (SNRs) of the source-relay and relay-destination links. In addition, for the delay constrained case, we develop buffer-aided relaying protocols that achieve a predefined average delay. Compared to conventional relaying protocols, which select the transmitting node according to a predefined schedule independent of the instantaneous link SNRs, the proposed buffer-aided protocols with adaptive link selection achieve large performance gains. In particular, for fixed rate transmission, we show that the proposed protocol achieves a diversity gain of two as long as an average delay of more than three time slots can be afforded. Furthermore, for mixed rate transmission with an average delay of E { T } time slots, a multiplexing gain of r =1-1/ (2 E { T }) is achieved. As a by-product of the considered link-adaptive protocols, we also develop a novel conventional relaying protocol for mixed rate transmission, which yields the same multiplexing gain as the protocol with adaptive link selection. Hence, for mixed rate transmission, for sufficiently large average delays, buffer-aided half-duplex relaying with and without adaptive link selection does not suffer from a multiplexing gain loss compared to full-duplex relaying.

6 October 2016 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
HCHristina Chingoska
Hristina Chingoska
ZHZoran Hadzi-Velkov
Zoran Hadzi-Velkov
INIvana Nikoloska
Ivana Nikoloska
NZNikola Zlatanov
Nikola Zlatanov
In this letter, we propose a non-orthogonal multiple access (NOMA) scheme for the uplink of wireless powered communication networks (WPCNs). In order to tackle the doubly near-far effect in WPCNs, the decoding order of the compound information signal received at the base station (BS) is set to be an inverse of the distances between the energy harvesting users (EHU) and the BS. For the proposed scheme, we derive jointly optimal allocations of the BS transmit power and the durations of the energy harvesting and information transmission phases, such that the rate region is maximized. Compared to NOMA schemes with fixed BS transmit power, the proposed scheme achieves notably higher rates, while maintaining high level of system fairness. Compared to time-division multiple access schemes, our scheme leads to significant rate enhancement of cell-edge EHUs, thus improving system fairness.