Athanasios S. Lioumpas

Athanasios S. Lioumpas

Auto-generated profile, based on publicly available information

Athanasios S. Lioumpas

Department of Digital Systems, University of Piraeus, Greece

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
20 August 2007 in IEEE Communications Letters
Verified
Journal Article
Closed access
George K. KaragiannidisGeorge K. Karagiannidis
George K. Karagiannidis
ALAthanasios S. Lioumpas
Athanasios S. Lioumpas
We present a novel, simple and tight approximation for the Gaussian Q-function and its integer powers. Compared to other known closed-form approximations, an accuracy improvement is achieved over the whole range of positive arguments. The results can be efficiently applied in the evaluation of the symbol error probability (SEP) of digital modulations in the presence of additive white Gaussian noise (AWGN) and the average SEP (ASEP) over fading channels. As an example we evaluate in closed-form the ASEP of differentially encoded QPSK in Nakagami-m fading.

7 July 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
STSotiris A. Tegos
Sotiris A. Tegos
Panagiotis DiamantoulakisPanagiotis Diamantoulakis
Panagiotis Diamantoulakis
ALAthanasios S. Lioumpas
Athanasios S. Lioumpas
Panagiotis SarigiannidisPanagiotis Sarigiannidis
Panagiotis Sarigiannidis
George K. KaragiannidisGeorge K. Karagiannidis
George K. Karagiannidis
Random access (RA) has recently been revisited and considered as a key technology for the medium access control layer of the Internet of Things applications. Compared to other RA protocols, slotted ALOHA (SA) has the advantages of low complexity and elimination of partially overlapping transmissions, reducing the number of collisions, however it may suffer from congestion as the traffic load and the number of devices increase. To this end, two RA protocols based on SA and uplink non-orthogonal multiple access are proposed and applied to wireless sensor networks and wireless powered sensor networks. More specifically, to reduce the number of collisions and increase the throughput of SA, while maintaining low complexity, two detection techniques are used to mitigate the interference, when two sources transmit information at the same time slot, namely successive interference cancellation (SIC) with optimal decoding order policy and joint decoding (JD). To evaluate the performance of the proposed protocols, the outage probability of SIC and JD is derived, which is used to express the average throughput attained by each protocol in closed-form. Finally, both the analytical results and simulations verify that the proposed protocols substantially increase the throughput and the number of connected devices compared to SA.

4 September 2012 in IEEE Vehicular Technology Magazine
Verified
Journal Article
Closed access
AGAntonis G. Gotsis
Antonis G. Gotsis
ALAthanasios S. Lioumpas
Athanasios S. Lioumpas
AAAngeliki Alexiou
Angeliki Alexiou
Machine-to-machine (M2M) communications over cellular networks pose significant challenges as a result of the large number of devices, small data transmissions, and vast applications range. Current solutions based on general packet radio service (GPRS) access proved to be inadequate for supporting the M2M ecosystem. Therefore, advanced cellular network releases, such as long-term evolution (LTE) and LTE-Advanced (LTE-A), should efficiently cater to M2M communications. However, the increase in signaling overhead and diverse quality-of-service (QoS) requirements calls for the development of novel flexible scheduling algorithms. In this article, we present the challenges in facilitating M2M scheduling over existing and future cellular infrastructures, review the related proposals, provide some initial solutions, and identify new perspectives, which pave the way for efficient and smooth migration to M2M-enabled broadband cellular systems.

1 December 2011
Verified
Conference Paper
Closed access
ALAthanasios S. Lioumpas
Athanasios S. Lioumpas
AAAngeliki Alexiou
Angeliki Alexiou
Cellular systems are expected to play a fundamental role in the future Machine-to-Machine (M2M) networks, which could inherit crucial benefits from the former, such as ubiquitous coverage and global internetworking. However, unique features of M2M communications, such as the larger number of connected devices and the diversity of applications, require specific enhancements to these cellular systems. Because of the nature of most of M2M applications, a large number of uplink transmissions is expected, rendering uplink scheduling as an essential issue towards supporting M2M communications via cellular networks. We propose two scheduling schemes for the uplink of LTE-based cellular systems, which take into account both the channel conditions and the maximum allowed delay of each device requesting to be served. In contrast to other scheduling algorithms no classes of devices are formed, but the exact delay constraint of each device is considered, approaching the requirements of M2M communications in a more realistic way. This way, the number of effectively served requests increases, while it becomes possible to exploit the exact delay constraints in order to put the devices in sleep modes, until next transmissions. It is also shown that dividing the devices into a limited number of QoS classes deteriorates the system's performance.

1 July 2010 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
DMDiomidis S. Michalopoulos
Diomidis S. Michalopoulos
ALAthanasios S. Lioumpas
Athanasios S. Lioumpas
George K. KaragiannidisGeorge K. Karagiannidis
George K. Karagiannidis
RSRobert Schober
Robert Schober
In selective cooperative relaying only a single relay out of the set of available relays is activated, hence the available power and bandwidth resources are efficiently utilized. However, implementing selective cooperative relaying in time-varying channels may cause frequent relay switchings that deteriorate the overall performance. In this paper, we study the rate at which a relay switching occurs in selective cooperative relaying applications in time-varying fading channels. In particular, we derive closed-form expressions for the relay switching rate (measured in Hz) for opportunistic relaying (OR) and distributed switch and stay combining (DSSC). Additionally, expressions for the average relay activation time for both of the considered schemes are also provided, reflecting the average time that a selected relay remains active until a switching occurs. Numerical results manifest that DSSC yields considerably lower relay switching rates than OR, along with larger average relay activation times, rendering it a better candidate for implementation of relay selection in fast fading environments.

11 March 2013 in Transactions on Emerging Telecommunications Technologies
Verified
Journal Article
Closed access
PDF file
AGAntonis G. Gotsis
Antonis G. Gotsis
ALAthanasios S. Lioumpas
Athanasios S. Lioumpas
AAAngeliki Alexiou
Angeliki Alexiou