Nikolaos Kouvelas

dblp:218/9677 · also Nikos Kouvelas · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
7since 2021 · last 2025
0000-0002-9917-3918ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 7 · 2 first-author · 6 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2025 SFMAC: Bleeps that enable high-density LoRaWANs
abstract
LoRaWANs, a widely accepted IoT connectivity solution, adopt a simple (ALOHA-like) MAC layer, enabling low-power communication at the cost of scalability due to packet collisions. Hence, current studies on LoRaWAN conclude that the network does not support dense deployments. Several alternative MACs are proposed but they stumble upon well-known limitations: time division eliminates the asynchrony of LoRa nodes but requires feedback from the gateways; carrier-sensing-based protocols are heavily constrained by the reduced sensing ranges of the devices, thus creating a large number of hidden terminals, leading to collisions.To enhance LoRaWAN to cater to both low- and high-density deployments, in this paper, we propose Spreading Factor MAC (SFMAC), a novel, practical, distributed, and energy-efficient MAC protocol. SFMAC, a channel-sensing-based MAC, takes an unconventional approach to eliminate hidden terminals – by operating with pairs of SFs, wherein the higher SF is used for channel sensing and the lower for data transmission. Bleeps are transmitted in the higher SF as they can be sensed at longer ranges. SFMAC does not require any change in hardware or the LoRaWAN protocol. We demonstrate that the fundamental trade-off made by SFMAC – utilizing two SFs per data transmission instead of using all for data – works extremely well due to the elimination of hidden terminals. Through real-world experiments on 30 SX1261 devices and data-driven ns-3 simulations, we showcase that SFMAC increases goodput and channel utilization by manifolds over state-of-the-art protocols such as p-CARMA, np-CECADA, and LMAC.
Teresa Blanco Abad, Vijay S. Rao, Nikolaos Kouvelas, R. Venkatesha Prasad, R. Kumar 0001, Sujay Narayana
MASS3
2024 On the Feasibility of Phase-based BLE Ranging for Accurate Pedestrian Tracking
abstract
Indoor localization based on Bluetooth Low Energy (BLE) is traditionally implemented by matching Received Signal Strength (RSS) fingerprints of nearby BLE nodes. Depending on the node density, pure RSS-based BLE localization only provides room-level or zone-level accuracies. For pedestrian tracking, BLE-based RSS fingerprinting is often fused with Pedestrian Dead Reckoning (PDR) using Inertial Measurement Units (IMU), which can provide up to $1-2 \mathrm{~m}$ accuracy. Recently, a phase-based BLE ranging method has been developed, which can accurately measure the distance between two BLE devices. Initial experiments on a moving platform showed promising results for accurate localization. In this work, the feasibility of this technology for pedestrian tracking is evaluated. On-body phase-based BLE and IMU measurements are performed in an industrial lab environment with four BLE anchors. A hybrid Particle Filter (PF) algorithm is designed, which fuses phase-based BLE ranging, PDR, and a range correction algorithm. Our proposed PF algorithm achieves a median and p75 error of $0.70 \mathbf{m}$ and $1.03 \mathbf{~ m}$ respectively, which outperforms traditional RSS-based (hybrid) BLE localization algoritms.
Cedric De Cock, Emmeric Tanghe, Chris Marshall, Nikolaos Kouvelas, David Plets
IPIN4
2022 RF Information Harvesting for Medium Access in Event-driven Batteryless Sensing
abstract
We present radio-frequency (RF) information harvesting, a chan-nel sensing technique that takes advantage of the energy in the wireless medium to detect channel activity at essentially no en-ergy cost. RF information harvesting is essential for event-driven wireless sensing applications using battery-less devices that har-vest tiny amounts of energy from impromptu events, such as op-erating a switch, and then transmit the event notification to a one-hop gateway. As multiple such devices may concurrently de-tect events, coordinating access to the channel is key. RF infor-mation harvesting allows devices to break the symmetry between concurrently-transmitting devices based on the harvested energy from the ongoing transmissions. To demonstrate the benefits of RF information harvesting, we integrate it in a tailor-made ultra low-power hardware MAC protocol we call Radio Frequency-Distance Packet Queuing (RF-DiPaQ). We build a hardware/software proto-type of RF-DiPaQ and use an established Markov framework to study its performance at scale. Comparing RF-DiPaQ against sta-ple contention-based MAC protocols, we show that it outperforms pure Aloha and 1-CSMA by factors of 3.55 and 1.21 respectively in throughput, while it saturates at more than double the offered load compared to 1-CSMA. As traffic increases, the energy saving of RF-DiPaQ against CSMA protocols increases, consuming 36% less energy than np-CSMA at typical offered loads.
N. H. Hokke, Suryansh Sharma, R. Venkatesha Prasad, Luca Mottola, Sujay Narayana, Vijay S. Rao, Nikolaos Kouvelas
IPSN7
2022 Divide and Code: Efficient and Real-time Data Recovery from Corrupted LoRa Frames
abstract
Due to power limitations and coexistence in ISM bands, up to 50% of the Long Range (LoRa)-frames are corrupted at low signal strengths (≈ -115dBm) and the built-in redundancy schemes in LoRa-Wide Area Network (LoRaWAN) cannot correct the corrupted bytes. To address this, higher Spreading Factors (SF) are used resulting in wasted energy, increased traffic load, and highly compromised effective data rate. Our on-field experiments showed a high correlation in the corruption of close-by frames. We propose a novel Divide & Code (DC) scheme for LoRaWANs as an alternative to using higher SF. DC pre-encodes LoRa payloads using lightweight and memoryless encoding. After receiving a corrupted frame, DC uses a combination of most probable patterns of errors, Time Thresholds (TT), and splitting of payloads into subgroups for batch processing to recover frames effectively and maintain low complexity and timely operation. By implementing DC on our LoRa-testbed, we show it outperforms vanilla-LoRaWAN and Reed-Solomon codes in decoding and energy consumption. Our schemes decode up to 80.5% of corrupted payloads on SF10 by trying only 0.03% of all patterns of error combinations. TT keeps processing times below 2 ms with only minor reductions in the decoding ratio of corrupted payloads. Finally, we showcase that introducing 30% redundancy with DC results in minimum energy consumption and high decoding ratio at low SNRs.
Niloofar Yazdani, Nikolaos Kouvelas, Daniel Enrique Lucani, R. Venkatesha Prasad
SECON2
2022 DaRe: Data Recovery Through Application Layer Coding for LoRaWAN
abstract
Long-range wide-area network (LoRaWAN) is an energy-efficient and inexpensive networking technology that is rapidly being adopted for many Internet-of-Things applications. In this study, we perform extensive measurements on a new LoRaWAN deployment to characterise the spatio-temporal properties of the LoRaWAN channel. Our experiments reveal that LoRaWAN frames are mostly lost due to the channel effects, which are adverse when the end-devices are mobile. The frame losses are up to 70 percent, which can be bursty for both mobile and stationary scenarios. Frame losses result in data losses since the frames are transmitted only once in the basic configuration. To reduce data losses in LoRaWAN, we design a novel coding scheme for data recovery called DaRe that works on the application layer. DaRe combines techniques from convolutional and fountain codes. By implementing DaRe, we show that 99 percent of the data can be recovered with a code rate of 1/2 when the frame loss is up to 40 percent. Compared to the repetition coding scheme, DaRe provides 21 percent higher data recovery and can save up to 42 percent of the energy consumed on a transmission for 10-byte data units. We also show that DaRe provides better resilience to bursty frame losses.
Paul J. Marcelis, Nikolaos Kouvelas, Vijay S. Rao, R. Venkatesha Prasad
IEEE Trans. Mob. Comput.2
2021 Energy Efficient Data Recovery from Corrupted LoRa Frames
abstract
High frame-corruption is widely observed in Long Range Wide Area Networks (LoRaWAN) due to the coexistence with other networks in ISM bands and an Aloha-like MAC layer. LoRa's Forward Error Correction (FEC) mechanism is often insufficient to retrieve corrupted data. In fact, real-life measurements show that at least one-fourth of received transmissions are corrupted. When more frames are dropped, LoRa nodes usually switch over to higher spreading factors (SF), thus increasing transmission times and increasing the required energy. This paper introduces ReDCoS, a novel coding technique at the application layer that improves recovery of corrupted LoRa frames, thus reducing the overall transmission time and energy invested by LoRa nodes by several-fold. ReDCoS utilizes lightweight coding techniques to pre-encode the transmitted data. Therefore, the inbuilt Cyclic Redundancy Check (CRC) that follows is computed based on an already encoded data. At the receiver, we use both the CRC and the coded data to recover data from a corrupted frame beyond the built-in Error Correcting Code (ECC). We compare the performance of ReDCoS to (i) the standard FEC of vanilla-LoRaWAN, and to (ii) Reed Solomon (RS) coding applied as ECC to the data of LoRaWAN. The results indicated a 54x and 13.5x improvement of decoding ratio, respectively, when 20 data symbols were sent. Furthermore, we evaluated ReDCoS on-field using LoRa SX1261 transceivers showing that it outperformed RS-coding by factor of at least 2x (and up to 6x) in terms of the decoding ratio while consuming 38.5% less energy per correctly received transmission.
Niloofar Yazdani, Nikolaos Kouvelas, R. Venkatesha Prasad, Daniel Enrique Lucani
GLOBECOM2
2021 np-CECADA: Enhancing Ubiquitous Connectivity of LoRa Networks
abstract
Long Range Wide Area Networks (LoRaWAN) offer ubiquitous communications for The Internet of Things (IoT). However, there are many challenges in rolling out LoRaWAN - mainly scalability, energy efficiency, Packet Reception Ratio (PRR), and keeping the channel access as simple as unslotted ALOHA. To this end, we design non-persistent Capture Effect Channel Activity Detection Algorithm (np-CECADA), which is a novel, distributed protocol for the MAC layer of LoRaWAN. It utilizes Channel Activity Detection (CAD), which is a built-in imperfect mechanism for channel sensing and minimal feedback from the gateways. In np-CECADA each device independently adapts backoff times based on the traffic in its vicinity and the transmission power based on the heuristically inferred probability of capturing the channel. To achieve this, first, we carried out an extensive on-field evaluation to measure the effectiveness of CAD and capture effect in LoRa. Using them we designed np CECADA and developed $ns-3$ modules. Packet Reception Ratio of np-CECADA is $ 15.74\times$ and $ 5.13\times$ higher than vanilla LoRaWAN and p-CARMA, respectively. Channel utilization is $ 11.24\times$ higher compared to LMAC. Further, on a testbed of 30 LoRa devices np-CECADA outperforms LoRaWAN up to 5 times.
Nikolaos Kouvelas, R. Venkatesha Prasad, Niloofar Yazdani, Daniel Enrique Lucani
MASS1
2020 p-CARMA: Politely Scaling LoRaWAN
Nikolaos Kouvelas, Vijay S. Rao, R. Venkatesha Prasad, Gauri Tawde, Koen Langendoen
EWSN1
2020 Efficient Power Sharing at the Edge by Building a Tangible Micro-Grid - the Texas Case
abstract
Information and Communication Technology (ICT) is now touching various aspects of our lives. The electricity grid with the help of ICT is transformed into Smart Grid (SG) which is highly efficient and responsive. It promotes two-way energy and information flow between energy distributors and consumers. Many consumers are becoming prosumers by also producing energy. The trend is to form small communities of consumers and prosumers leading to Micro-grids (MG) to manage energy locally. MGs are parts of SG that decentralize the energy flow by allocating the produced energy within the community. Energy allocation amongst them needs to solve issues viz., (i) how to balance supply/demand within micro-grids; (ii) how allocating energy to a user affects his/her community. To address these issues we propose six Energy Allocation Strategies (EASs) for MGs - ranging from simple to optimal. We maximize the usage of the energy generated by prosumers within MG. We form household-groups sharing similar characteristics to apply EASs by analyzing thoroughly energy and socioeconomic data of households. We propose four metrics to evaluate EASs. We test our EASs on the data from 443 households over a year. By prioritizing specific households, we increase the number of fully served households up to 81% compared to random sharing.
Nikolaos Kouvelas, R. Venkatesha Prasad, Akshay Uttama Nambi
ICC1