Victor Cionca
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Victor Cionca has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Dirk Pesch
School of Computer Science & IT, University College Cork, T12 K8AF Cork, Ireland
13 shared publications - Thomas Newe
Department of Electronics and Computer Engineering, University of Limerick, Castletroy, Limerick, Ireland
9 shared publications - Donna O'Shea
Department of Electronics & Computer Engineering, University of Limerick (UL), Limerick, Ireland
8 shared publications - Khaled Qorany AbdelFadeel
School of Computer Science and IT, University College Cork, T12R5CP Cork, Ireland
4 shared publications Vasile Dadarlat
Facultatea de Calculatoare, Universitatea Tehnica Cluj-Napoca, Romania
4 shared publicationsDylan Smyth
3 shared publications
Latest Publications
- 14 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 19 (6) , 7656-7666
Joint Optimization of OFDM and Channel Coding for URLLC in Industrial Channels
Industrial communications have very tight requirements of reliability and latency, which are challenging to achieve at highly dynamic industrial radio channels. Redundancy in the modulation and coding can improve reliability but incurs excess latency. Minimizing latency subject to reliability constraint for a given channel state opens up the scope for static and runtime optimization. In this paper we explore joint optimal configuration of Orthogonal Frequency Division Multiplexing (OFDM) and channel coding, using polar, Low Density Parity Check (LDPC) and convolutional codes to minimize the transmission time subject to a maximum acceptable packet error rate, for three realistic channels reported by National Institute of Standards and Technology, using channel impulse response measurements, as well as perfect and imperfect channel estimation. The results show that the use of strong channel codes can significantly reduce transmission time, by up to 24% compared to convolutional codes, with LDPC achieving fastest transmission. For transmission times of 10-20 $\mu$ s the contribution of the Cyclic Prefix (CP) is significant, up to 30% for convolutional codes. Stronger channel codes allow reduced CP, even considering the added redundancy such as Cyclic Redundancy Check (CRC), resulting in overall lower transmission time. The decoding time also introduces significant overheads, up to 50% of transmission time for polar codes. The paper also investigates the impact of channel estimation errors, which adversely impact Ultra-Reliable Low-Latency performance: lower bound errors violate the reliability constraint and higher bound errors introduce excess transmission times.
- 14 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 19 (6) , 7656-7666
Joint Optimization of OFDM and Channel Coding for URLLC in Industrial Channels
Industrial communications have very tight requirements of reliability and latency, which are challenging to achieve at highly dynamic industrial radio channels. Redundancy in the modulation and coding can improve reliability but incurs excess latency. Minimizing latency subject to reliability constraint for a given channel state opens up the scope for static and runtime optimization. In this paper we explore joint optimal configuration of Orthogonal Frequency Division Multiplexing (OFDM) and channel coding, using polar, Low Density Parity Check (LDPC) and convolutional codes to minimize the transmission time subject to a maximum acceptable packet error rate, for three realistic channels reported by National Institute of Standards and Technology, using channel impulse response measurements, as well as perfect and imperfect channel estimation. The results show that the use of strong channel codes can significantly reduce transmission time, by up to 24% compared to convolutional codes, with LDPC achieving fastest transmission. For transmission times of 10-20 $\mu$ s the contribution of the Cyclic Prefix (CP) is significant, up to 30% for convolutional codes. Stronger channel codes allow reduced CP, even considering the added redundancy such as Cyclic Redundancy Check (CRC), resulting in overall lower transmission time. The decoding time also introduces significant overheads, up to 50% of transmission time for polar codes. The paper also investigates the impact of channel estimation errors, which adversely impact Ultra-Reliable Low-Latency performance: lower bound errors violate the reliability constraint and higher bound errors introduce excess transmission times.
- 16 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (2) , 916-926
Virtual Network Embedding for Wireless Sensor Networks Time-Efficient QoS/QoI-Aware Approach
A recent trend in Wireless Sensor Networks (WSN) is Network Virtualization to support on-demand sharing of sensing functionality. The efficient allocation of WSN resources to sensing requests is obtained using Virtual Network Embedding (VNE). This must take into account Quality of Service -QoS (e.g. reliability), Quality of Information -QoI (e.g sensing accuracy), and deal with wireless interference. With increased computational complexity due to the added constraints, finding an optimal solution can be prohibitive at scale. We developed an offline embedding algorithm that searches through all possible embeddings, which allowed us to explore the trade-off between solution quality and search time. We identify a defined set of initial processing steps that lead to high quality solutions (within 10% of best solution) in bounded time. We evaluated the algorithm under high stress (large networks with long paths, high data rates, beyond typical WSN configuration) to understand its limitations and the limitations imposed by the underlying WSN substrate.
- 16 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (2) , 916-926
Virtual Network Embedding for Wireless Sensor Networks Time-Efficient QoS/QoI-Aware Approach
A recent trend in Wireless Sensor Networks (WSN) is Network Virtualization to support on-demand sharing of sensing functionality. The efficient allocation of WSN resources to sensing requests is obtained using Virtual Network Embedding (VNE). This must take into account Quality of Service -QoS (e.g. reliability), Quality of Information -QoI (e.g sensing accuracy), and deal with wireless interference. With increased computational complexity due to the added constraints, finding an optimal solution can be prohibitive at scale. We developed an offline embedding algorithm that searches through all possible embeddings, which allowed us to explore the trade-off between solution quality and search time. We identify a defined set of initial processing steps that lead to high quality solutions (within 10% of best solution) in bounded time. We evaluated the algorithm under high stress (large networks with long paths, high data rates, beyond typical WSN configuration) to understand its limitations and the limitations imposed by the underlying WSN substrate.
- 28 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (1) , 669-683
$FREE$ —Fine-Grained Scheduling for Reliable and Energy-Efficient Data Collection in LoRaWAN
LoRaWAN promises to provide wide-area network access to low-cost devices that can operate for up to 10 years on a single 1000mAh battery. This makes LoRaWAN particularly suited to data collection applications (e.g. monitoring applications), where device lifetime is a key performance metric. However, when supporting a large number of devices, LoRaWAN suffers from a scalability issue due to the high collision probability of its Aloha-based MAC layer. The performance worsens further when using acknowledged transmissions due to the duty cycle restriction at the gateway. For this, we propose FREE, a fine-grained scheduling scheme for reliable and energy-efficient data collection in LoRaWAN. FREE takes advantage of applications that do not have hard delay requirements on data delivery by supporting synchronized bulk data transmission. This means data is buffered for transmission in scheduled time slots instead of transmitted straight away. FREE allocates spreading factors, transmission powers, frequency channels, time slots, and schedules slots in frames for LoRaWAN end-devices. As a result, FREE overcomes the scalability problem of LoRaWAN by eliminating collisions and grouping acknowledgments. We evaluate the performance of FREE versus different legacy LoRaWAN configurations. The numerical results show that FREE scales well and achieves almost 100% data delivery and the device lifetime is estimated to over 10 years independent of traffic type and network size. Comparing to poor scalability, low data delivery and device lifetime of fewer than 2 years for acknowledged data traffic in the standard LoRaWAN configurations.
- 28 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (1) , 669-683
$FREE$ —Fine-Grained Scheduling for Reliable and Energy-Efficient Data Collection in LoRaWAN
LoRaWAN promises to provide wide-area network access to low-cost devices that can operate for up to 10 years on a single 1000mAh battery. This makes LoRaWAN particularly suited to data collection applications (e.g. monitoring applications), where device lifetime is a key performance metric. However, when supporting a large number of devices, LoRaWAN suffers from a scalability issue due to the high collision probability of its Aloha-based MAC layer. The performance worsens further when using acknowledged transmissions due to the duty cycle restriction at the gateway. For this, we propose FREE, a fine-grained scheduling scheme for reliable and energy-efficient data collection in LoRaWAN. FREE takes advantage of applications that do not have hard delay requirements on data delivery by supporting synchronized bulk data transmission. This means data is buffered for transmission in scheduled time slots instead of transmitted straight away. FREE allocates spreading factors, transmission powers, frequency channels, time slots, and schedules slots in frames for LoRaWAN end-devices. As a result, FREE overcomes the scalability problem of LoRaWAN by eliminating collisions and grouping acknowledgments. We evaluate the performance of FREE versus different legacy LoRaWAN configurations. The numerical results show that FREE scales well and achieves almost 100% data delivery and the device lifetime is estimated to over 10 years independent of traffic type and network size. Comparing to poor scalability, low data delivery and device lifetime of fewer than 2 years for acknowledged data traffic in the standard LoRaWAN configurations.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-138
How To Conduct LoRaWAN Site Surveys
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-138
How To Conduct LoRaWAN Site Surveys
- 1 June 2019
- Published by Elsevier in Computer Networks
- Vol. 156, 9-19
Attacking distributed software-defined networks by leveraging network state consistency
- 1 June 2019
- Published by Elsevier in Computer Networks
- Vol. 156, 9-19
Attacking distributed software-defined networks by leveraging network state consistency
- 22 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 5 (6) , 5132-5140
MAllEC: Fast and Optimal Scheduling of Energy Consumption for Energy Harvesting Devices
Energy consumption scheduling algorithms allow energy harvesting IoT devices to maximise the amount of harvested energy that they consume, while maintaining uninterrupted, indefinite, operation. The existing works in the area show a trade-off between solution quality and computational complexity. At one end fast but suboptimal algorithms can lead to energy waste and power outages. At the other, optimal algorithms are computationally prohibitive for the constrained hardware of the IoT. This paper argues that the trade-off can be avoided, and presents the MAllEC energy consumption scheduler that Maximises the Allowed Energy Consumption while minimising energy waste and power outages, with linear time complexity. MAllEC is compared against the state of the art through simulations using long term (14 years) traces of solar irradiance, and shown to consistently achieve the minimum energy waste and power outage. The linear time complexity of MAllEC is measured on constrained IoT hardware (8bit Tmote Sky) to be low enough so that MAllEC can be executed unintrusively. The paper provides proof of MAllEC’s optimality and shows that, in an application with dynamic, adjustable packet rate, MAllEC can maintain indefinite, uninterruptible, operation at an average rate of almost 100 packets per minute, where a 3Ah battery powered device, at the same rate, would deplete after less than 200 days.
- 22 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 5 (6) , 5132-5140
MAllEC: Fast and Optimal Scheduling of Energy Consumption for Energy Harvesting Devices
Energy consumption scheduling algorithms allow energy harvesting IoT devices to maximise the amount of harvested energy that they consume, while maintaining uninterrupted, indefinite, operation. The existing works in the area show a trade-off between solution quality and computational complexity. At one end fast but suboptimal algorithms can lead to energy waste and power outages. At the other, optimal algorithms are computationally prohibitive for the constrained hardware of the IoT. This paper argues that the trade-off can be avoided, and presents the MAllEC energy consumption scheduler that Maximises the Allowed Energy Consumption while minimising energy waste and power outages, with linear time complexity. MAllEC is compared against the state of the art through simulations using long term (14 years) traces of solar irradiance, and shown to consistently achieve the minimum energy waste and power outage. The linear time complexity of MAllEC is measured on constrained IoT hardware (8bit Tmote Sky) to be low enough so that MAllEC can be executed unintrusively. The paper provides proof of MAllEC’s optimality and shows that, in an application with dynamic, adjustable packet rate, MAllEC can maintain indefinite, uninterruptible, operation at an average rate of almost 100 packets per minute, where a 3Ah battery powered device, at the same rate, would deplete after less than 200 days.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 35-42
Dynamic Context for Static Context Header compression in LPWANs
Header compression is the key to adapting long header protocols like IPv6 for transmission using short frame size network protocols such as are used in Low Power Wide Area Networks (LPWANs). In LPWANs only one or two octets may be available to transmit upper layer protocol headers, which makes known header compression mechanisms unsuitable. Static Context Header Compression (SCHC) has recently been proposed to address the LPWANs limitations. SCHC works under the assumption that LPWANs are preprogrammed with known data flows, thus uses a static context. However, this assumption is not always valid in an Internet of Things (IoT) context, where devices should be accessible from any IPv6 address. Therefore, in this paper we propose a dummy mapping technique that can effectively compress/decompress some header fields of unknown flows. The dummy mapping creates a fixed size list of dummy values that are dynamically mapped at the gateway compressor to the values of headers fields. The mappings stay alive to compress/decompress these fields until their flow ends, and then the same dummy values can be remapped to different header fields of different flows. The Dummy mapping exploits the SCHC framework and does not require resynchronization to meet the limitations of LPWANs. Here, we explore the impact of the dummy mapping size, the request arrival rate and the LPWAN link layer parameters on the compression efficiency.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 35-42
Dynamic Context for Static Context Header compression in LPWANs
Header compression is the key to adapting long header protocols like IPv6 for transmission using short frame size network protocols such as are used in Low Power Wide Area Networks (LPWANs). In LPWANs only one or two octets may be available to transmit upper layer protocol headers, which makes known header compression mechanisms unsuitable. Static Context Header Compression (SCHC) has recently been proposed to address the LPWANs limitations. SCHC works under the assumption that LPWANs are preprogrammed with known data flows, thus uses a static context. However, this assumption is not always valid in an Internet of Things (IoT) context, where devices should be accessible from any IPv6 address. Therefore, in this paper we propose a dummy mapping technique that can effectively compress/decompress some header fields of unknown flows. The dummy mapping creates a fixed size list of dummy values that are dynamically mapped at the gateway compressor to the values of headers fields. The mappings stay alive to compress/decompress these fields until their flow ends, and then the same dummy values can be remapped to different header fields of different flows. The Dummy mapping exploits the SCHC framework and does not require resynchronization to meet the limitations of LPWANs. Here, we explore the impact of the dummy mapping size, the request arrival rate and the LPWAN link layer parameters on the compression efficiency.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 14-15
Fair Adaptive Data Rate Allocation and Power Control in LoRaWAN
In this paper, we present results of a study of the data rate fairness among nodes within a LoRaWAN cell. Since LoRa/LoRaWAN supports various data rates, we firstly derive the fairest ratios of deploying each data rate within a cell for a fair collision probability. LoRa/LoRaWan, like other frequency modulation based radio interfaces, exhibits the capture effect in which only the stronger signal of colliding signals will be extracted. This leads to unfairness, where far nodes or nodes experiencing higher attenuation are less likely to see their packets received correctly. Therefore, we secondly develop a transmission power control algorithm to balance the received signal powers from all nodes regardless of their distances from the gateway for a fair data extraction. Simulations show that our approach achieves higher fairness in data rate than the state-of-art in almost all network configurations.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 14-15
Fair Adaptive Data Rate Allocation and Power Control in LoRaWAN
In this paper, we present results of a study of the data rate fairness among nodes within a LoRaWAN cell. Since LoRa/LoRaWAN supports various data rates, we firstly derive the fairest ratios of deploying each data rate within a cell for a fair collision probability. LoRa/LoRaWan, like other frequency modulation based radio interfaces, exhibits the capture effect in which only the stronger signal of colliding signals will be extracted. This leads to unfairness, where far nodes or nodes experiencing higher attenuation are less likely to see their packets received correctly. Therefore, we secondly develop a transmission power control algorithm to balance the received signal powers from all nodes regardless of their distances from the gateway for a fair data extraction. Simulations show that our approach achieves higher fairness in data rate than the state-of-art in almost all network configurations.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
JudiShare: Judicious resource allocation for QoS-based services in shared wireless sensor networks
In shared wireless sensor networks (WSNs), multiple users request access to sensing resources, often with varying sampling rates and QoS requirements. To accommodate a request, appropriate sensing, computing and communication resources need to be allocated across the network. Traditionally, each request is mapped to a dedicated set of resources, even when the requests are similar. The need to reduce resource usage has led to data virtualization techniques that focus primarily on merging the requests ignoring the QoS requirements. In this paper, we present a QoS-aware resource allocation approach, JudiShare, that merges requests, where possible, if they are compatible in their requirements, providing judicious reuse of both sensing and communication resources through a mixture of data virtualization and Virtual Network Embedding (VNE). We show that JudiShare respects QoS requirements and reduces resource usage to up to 60%. This, in turn, allows up to 50% more requests to be accommodated onto the network, even when the network resources are fully utilized.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
JudiShare: Judicious resource allocation for QoS-based services in shared wireless sensor networks
In shared wireless sensor networks (WSNs), multiple users request access to sensing resources, often with varying sampling rates and QoS requirements. To accommodate a request, appropriate sensing, computing and communication resources need to be allocated across the network. Traditionally, each request is mapped to a dedicated set of resources, even when the requests are similar. The need to reduce resource usage has led to data virtualization techniques that focus primarily on merging the requests ignoring the QoS requirements. In this paper, we present a QoS-aware resource allocation approach, JudiShare, that merges requests, where possible, if they are compatible in their requirements, providing judicious reuse of both sensing and communication resources through a mixture of data virtualization and Virtual Network Embedding (VNE). We show that JudiShare respects QoS requirements and reduces resource usage to up to 60%. This, in turn, allows up to 50% more requests to be accommodated onto the network, even when the network resources are fully utilized.
- Open Access
Fair Adaptive Data Rate Allocation and Power Control in LoRaWAN
In this paper, we present results of a study of the data rate fairness among nodes within a LoRaWAN cell. Since LoRa/LoRaWAN supports various data rates, we firstly derive the fairest ratios of deploying each data rate within a cell for a fair collision probability. LoRa/LoRaWAN, like other frequency modulation based radio interfaces, exhibits the \textit{capture effect} in which only the stronger signal of colliding signals will be extracted. This leads to unfairness, where far nodes or nodes experiencing higher attenuation are less likely to see their packets received correctly. Therefore, we secondly develop a transmission power control algorithm to balance the received signal powers from all nodes regardless of their distances from the gateway for a fair data extraction. Simulations show that our approach achieves higher fairness in data rate than the state-of-art in almost all network configurations.
Open AccessFair Adaptive Data Rate Allocation and Power Control in LoRaWAN
In this paper, we present results of a study of the data rate fairness among nodes within a LoRaWAN cell. Since LoRa/LoRaWAN supports various data rates, we firstly derive the fairest ratios of deploying each data rate within a cell for a fair collision probability. LoRa/LoRaWAN, like other frequency modulation based radio interfaces, exhibits the \textit{capture effect} in which only the stronger signal of colliding signals will be extracted. This leads to unfairness, where far nodes or nodes experiencing higher attenuation are less likely to see their packets received correctly. Therefore, we secondly develop a transmission power control algorithm to balance the received signal powers from all nodes regardless of their distances from the gateway for a fair data extraction. Simulations show that our approach achieves higher fairness in data rate than the state-of-art in almost all network configurations.