Gentian Jakllari
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
Gentian Jakllari has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Andre-Luc Beylot
ENSEEIHT
3 shared publications Andre-Luc Beylot
Department of Telecommunications and Networks, University of Toulouse, Toulouse
2 shared publications- Michalis Faloutsos
University of California, Riverside, Riverside, California, USA
2 shared publications - Srikanth V. Krishnamurthy
University of California, Riverside, Riverside, CA, USA
2 shared publications Beatrice Paillassa
IRIT-ENSEEIHT, University of Toulouse, France
1 shared publication- Boualem Benatallah
Dublin City University
1 shared publication
Latest Publications
- Open Access
- 9 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Technological and Research Challenges in Data Engineering for Sustainable Agriculture
This paper presents a concise exploration of the evolving landscape of sustainable agriculture through the lens of data engineering. The aim is to highlight the most important challenges in the field and sketch ideas for how to address them. This position paper delves into key research challenges such as multi-modal data integration, data quality assurance, network optimisation and edge versus fog data processing strategies. Additionally, it emphasises the significance of performance enhancement in driving innovation within sustainable agriculture. By addressing these challenges and following the proposed visionary approaches for future research endeavours, we claim that data engineering will serve as a catalyst for advancing sustainable agriculture practices.
- 9 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessTechnological and Research Challenges in Data Engineering for Sustainable Agriculture
This paper presents a concise exploration of the evolving landscape of sustainable agriculture through the lens of data engineering. The aim is to highlight the most important challenges in the field and sketch ideas for how to address them. This position paper delves into key research challenges such as multi-modal data integration, data quality assurance, network optimisation and edge versus fog data processing strategies. Additionally, it emphasises the significance of performance enhancement in driving innovation within sustainable agriculture. By addressing these challenges and following the proposed visionary approaches for future research endeavours, we claim that data engineering will serve as a catalyst for advancing sustainable agriculture practices.
- Open Access
- 22 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-11
HandRate: Heart Rate Monitoring While Simply Holding a Smartphone
We present HandRate, the first smartphone-based system using a standard sensor (accelerometer) for opportunistically computing heart rate while a user holds their phone. Fundamentally, HandRate revisits ballistocardiography (BCG), a century-old technique for monitoring heart activity by measuring the body movement caused by the cardiac cycle. Traditionally performed using custom hardware, attached to a subject's body, revisiting BCG for the smartphone, held in hand, faces several challenges. The hand is an external organ furthest from the aorta and subject to motion artifacts, leading to a weak and noisy signal, while the position the phone is held in can impact which accelerometer axis best captures BCG. HandRate addresses these challenges by introducing a design involving two modules operating in tandem: the first aimed at transforming the accelerometer readings into a single-dimensional signal oblivious to how the phone is held, while the second module making heartbeat predictions based on this signal. Results from testing HandRate using data collected from 18 subjects show that it can estimate heart rate with accuracy similar to or better than systems requiring special sensors and/or active user participation.
- 22 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-11
Open AccessHandRate: Heart Rate Monitoring While Simply Holding a Smartphone
We present HandRate, the first smartphone-based system using a standard sensor (accelerometer) for opportunistically computing heart rate while a user holds their phone. Fundamentally, HandRate revisits ballistocardiography (BCG), a century-old technique for monitoring heart activity by measuring the body movement caused by the cardiac cycle. Traditionally performed using custom hardware, attached to a subject's body, revisiting BCG for the smartphone, held in hand, faces several challenges. The hand is an external organ furthest from the aorta and subject to motion artifacts, leading to a weak and noisy signal, while the position the phone is held in can impact which accelerometer axis best captures BCG. HandRate addresses these challenges by introducing a design involving two modules operating in tandem: the first aimed at transforming the accelerometer readings into a single-dimensional signal oblivious to how the phone is held, while the second module making heartbeat predictions based on this signal. Results from testing HandRate using data collected from 18 subjects show that it can estimate heart rate with accuracy similar to or better than systems requiring special sensors and/or active user participation.
- 8 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (3) , 3498-3508
On Assessing the Performance of IEEE 802.11ad Beamforming Training
In the race for Gigabit wireless links, IEEE introduced 802.11ad, an amendment aimed at delivering Gbps capacities in a WLAN setting by leveraging the 60 GHz band. The key innovation of the standard is its beamforming training protocol. Executed periodically at the beginning of every beacon interval, it enables the formation of directional links. To address contention during the uplink part of beamforming training, 802.11ad introduced A-BFT (Association BeamForming Training), an Aloha-inspired, two-level backoff race. While central to the functionality of 802.11ad networks, the performance of A-BFT, however, remains poorly understood. In this article, we propose an analytical finite-population model for evaluating the performance of IEEE 802.11ad A-BFT under two channel models: loss-free, and a channel introducing a constant bit error rate. After using an open-source simulator to demonstrate its accuracy, we use our model to assess the performance of A-BFT. We find that a counter-intuitive, quit-easily/be-lazy approach by the stations leads to the best overall beamforming training performance.
- 8 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (3) , 3498-3508
On Assessing the Performance of IEEE 802.11ad Beamforming Training
In the race for Gigabit wireless links, IEEE introduced 802.11ad, an amendment aimed at delivering Gbps capacities in a WLAN setting by leveraging the 60 GHz band. The key innovation of the standard is its beamforming training protocol. Executed periodically at the beginning of every beacon interval, it enables the formation of directional links. To address contention during the uplink part of beamforming training, 802.11ad introduced A-BFT (Association BeamForming Training), an Aloha-inspired, two-level backoff race. While central to the functionality of 802.11ad networks, the performance of A-BFT, however, remains poorly understood. In this article, we propose an analytical finite-population model for evaluating the performance of IEEE 802.11ad A-BFT under two channel models: loss-free, and a channel introducing a constant bit error rate. After using an open-source simulator to demonstrate its accuracy, we use our model to assess the performance of A-BFT. We find that a counter-intuitive, quit-easily/be-lazy approach by the stations leads to the best overall beamforming training performance.
- 28 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 18 (12) , 2725-2739
A Framework for Evaluating Physical-Layer Network Coding Gains in Multi-Hop Wireless Networks
Physical-Layer Network Coding (PLNC) was first introduced as a solution to increase the throughput of a two-way relay channel communication. Unlike most wireless communication techniques which try to avoid collisions, PLNC allows two simultaneous transmissions to a common receiver. In basic topologies, this technique has been shown to significantly enhance the throughput performance compared to classical interference-free communications. However, quantifying the impact of PLNC in large multi-hop networks remains an open question. In this work, we introduce the first theoretical framework that, given a particular network topology and traffic matrix, can evaluate the optimal network throughput subject to a fairness constraint relative to the initial demand of each flow, when PLNC is adopted. Based on linear programming, our solution ensures to respect the particularities imposed by PLNC. We use this framework to evaluate three state-of-the-art PLNC schemes across a variety of topologies and traffic matrices. Our numerical analysis reveals that while in simple toy topologies PLNC can significantly increase the network throughput, in large topologies the verdict is mixed. For certain topologies and traffic patterns adopting PLNC can double the throughput while in others, depending on the scheme used for implementing PLNC, the gain can be as high as 60 percent or as low as 0 percent when compared to traditional interference-free transmissions.
- 28 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 18 (12) , 2725-2739
A Framework for Evaluating Physical-Layer Network Coding Gains in Multi-Hop Wireless Networks
Physical-Layer Network Coding (PLNC) was first introduced as a solution to increase the throughput of a two-way relay channel communication. Unlike most wireless communication techniques which try to avoid collisions, PLNC allows two simultaneous transmissions to a common receiver. In basic topologies, this technique has been shown to significantly enhance the throughput performance compared to classical interference-free communications. However, quantifying the impact of PLNC in large multi-hop networks remains an open question. In this work, we introduce the first theoretical framework that, given a particular network topology and traffic matrix, can evaluate the optimal network throughput subject to a fairness constraint relative to the initial demand of each flow, when PLNC is adopted. Based on linear programming, our solution ensures to respect the particularities imposed by PLNC. We use this framework to evaluate three state-of-the-art PLNC schemes across a variety of topologies and traffic matrices. Our numerical analysis reveals that while in simple toy topologies PLNC can significantly increase the network throughput, in large topologies the verdict is mixed. For certain topologies and traffic patterns adopting PLNC can double the throughput while in others, depending on the scheme used for implementing PLNC, the gain can be as high as 60 percent or as low as 0 percent when compared to traditional interference-free transmissions.
- 4 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 26 (3) , 1390-1403
Statistical Admission Control in Multi-Hop Cognitive Radio Networks
We address the problem of online admission control in multi-hop, multi-transceiver cognitive radio networks where the channel access is regulated by a bare-bones time-division multiple access protocol and the primary user activity is modeled as an ON/OFF process. We show that the problem of computing the available end-to-end bandwidth-necessary for admission control-is NP-Complete. Rather than working on an approximation algorithm and analyzing its worst-case performance, we relax the problem of online admission control by using a randomized scheduling algorithm and analyzing its average performance. Randomized scheduling is widely used because of its simplicity and efficiency. However, computing the resulting average throughput is challenging and remains an open problem. We solve this problem analytically and use the solution as vehicle for BRAND-a centralized heuristic for computing the average bandwidth available with randomized scheduling between a source destination pair in cognitive radio networks. Driven by practical considerations, we introduce a distributed version of BRAND and prove its correctness. An extensive numerical analysis demonstrates the accuracy of BRAND and its enabling value in performing admission control.
- 4 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 26 (3) , 1390-1403
Statistical Admission Control in Multi-Hop Cognitive Radio Networks
We address the problem of online admission control in multi-hop, multi-transceiver cognitive radio networks where the channel access is regulated by a bare-bones time-division multiple access protocol and the primary user activity is modeled as an ON/OFF process. We show that the problem of computing the available end-to-end bandwidth-necessary for admission control-is NP-Complete. Rather than working on an approximation algorithm and analyzing its worst-case performance, we relax the problem of online admission control by using a randomized scheduling algorithm and analyzing its average performance. Randomized scheduling is widely used because of its simplicity and efficiency. However, computing the resulting average throughput is challenging and remains an open problem. We solve this problem analytically and use the solution as vehicle for BRAND-a centralized heuristic for computing the average bandwidth available with randomized scheduling between a source destination pair in cognitive radio networks. Driven by practical considerations, we introduce a distributed version of BRAND and prove its correctness. An extensive numerical analysis demonstrates the accuracy of BRAND and its enabling value in performing admission control.
- Open Access
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Mitigate the load sharing of segment routing for SDN green traffic engineering
This research paper proposes IEEE802.3az incorporated green algorithmic schemes on the software defined networking-based segment routing (SDN-based SR) centralized network. The proposed schemes are the green (i.e. the EAGER and CARE metrics) SDN-based SR networks with and without traffic engineering (TE) tunneling. Green metrics extend the IEEE 802.3az energy saving to the whole network, while tunneling avoids the load sharing mechanism included in the segment routing that is not convenient for energy saving purpose. The findings of emulation revealed that the energy efficiency under the EAGER-tunneling strategy is comparable to the conventional metric with TE tunneling, and the saving realized under the CARE-tunneling scheme is twofold in comparison with the LEGACY-tunneling strategy. Meanwhile, the energy saving performance achieved with all three metrics under TE non-tunneling was inferior to those with tunneling. Nonetheless, the lower end-to-end delay and lower maximum link utilization (MLU) were achievable with the non-tunneling strategy.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessMitigate the load sharing of segment routing for SDN green traffic engineering
This research paper proposes IEEE802.3az incorporated green algorithmic schemes on the software defined networking-based segment routing (SDN-based SR) centralized network. The proposed schemes are the green (i.e. the EAGER and CARE metrics) SDN-based SR networks with and without traffic engineering (TE) tunneling. Green metrics extend the IEEE 802.3az energy saving to the whole network, while tunneling avoids the load sharing mechanism included in the segment routing that is not convenient for energy saving purpose. The findings of emulation revealed that the energy efficiency under the EAGER-tunneling strategy is comparable to the conventional metric with TE tunneling, and the saving realized under the CARE-tunneling scheme is twofold in comparison with the LEGACY-tunneling strategy. Meanwhile, the energy saving performance achieved with all three metrics under TE non-tunneling was inferior to those with tunneling. Nonetheless, the lower end-to-end delay and lower maximum link utilization (MLU) were achievable with the non-tunneling strategy.
- Open Access
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3001, 1-7
Unlocking the smartphone's senses for smart city parking
Studies have shown that in places like New York City drivers often spend over 20 min looking for parking, contributing to as much as 30% of the total traffic. In response, cities like San Francisco have deployed systems capable of pointing drivers to the closest available parking spot. Unfortunately, such systems have gained little traction as they rely on specialized infrastructure that is expensive to build and maintain. We present SmartPark, a smartphone based system that relaxes the requirement for specialized infrastructure by relying on the smartphone's sensors and ubiquitous Wi-Fi and cellular infrastructure. To accomplish this, SmartPark addresses two major challenges, under the constraint of minimum impact on battery life: automatic transportation mode detection and location matching. Solved together, they enable SmartPark to automatically detect when a user pulls out of a parking spot, making it available again. It addresses each challenge using a combination of thorough statistical analysis of the sensor readings and a novel Random Forest based classification algorithm. Experimental results from 12 volunteers, using 7 different smartphones, in 3 different cities show that SmartPark can distinguish 9 different transportation modes with accuracy between 95.57-100%, enabling it to correctly detect unparking events virtually 100% of the time. This is accomplished with a minimum impact on battery life-running SmartPark on a fully charged LG Google Nexus 5 for 5 h straight caused the battery level to drop only about 4%.
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3001, 1-7
Open AccessUnlocking the smartphone's senses for smart city parking
Studies have shown that in places like New York City drivers often spend over 20 min looking for parking, contributing to as much as 30% of the total traffic. In response, cities like San Francisco have deployed systems capable of pointing drivers to the closest available parking spot. Unfortunately, such systems have gained little traction as they rely on specialized infrastructure that is expensive to build and maintain. We present SmartPark, a smartphone based system that relaxes the requirement for specialized infrastructure by relying on the smartphone's sensors and ubiquitous Wi-Fi and cellular infrastructure. To accomplish this, SmartPark addresses two major challenges, under the constraint of minimum impact on battery life: automatic transportation mode detection and location matching. Solved together, they enable SmartPark to automatically detect when a user pulls out of a parking spot, making it available again. It addresses each challenge using a combination of thorough statistical analysis of the sensor readings and a novel Random Forest based classification algorithm. Experimental results from 12 volunteers, using 7 different smartphones, in 3 different cities show that SmartPark can distinguish 9 different transportation modes with accuracy between 95.57-100%, enabling it to correctly detect unparking events virtually 100% of the time. This is accomplished with a minimum impact on battery life-running SmartPark on a fully charged LG Google Nexus 5 for 5 h straight caused the battery level to drop only about 4%.
- 13 November 2012
- Published by Springer Nature in Wireless Networks
- Vol. 19 (5) , 985-1003
An integrated routing and rate adaptation framework for multi-rate multi-hop wireless networks
- 13 November 2012
- Published by Springer Nature in Wireless Networks
- Vol. 19 (5) , 985-1003
An integrated routing and rate adaptation framework for multi-rate multi-hop wireless networks
- Open Access
- 9 September 2007
- Published by Association for Computing Machinery (ACM)
- p. 302-305
Revisiting minimum cost reliable routing in wireless mesh networks
We revisit the problem of computing the path with the minimum cost in terms of the expected number of link layer retransmissions in wireless mesh networks. Unlike previous efforts (such as the popular ETX) we account for the fact that link layer protocols (such as the IEEE 802.11 MAC) incorporate a non-zero but finite number of retransmission attempts per packet. A key observation that motivates this work is that the performance of a path depends not only on the number of links on the path and their qualities, but also on the relative positions of the links on the path. In particular, the closer a lossy link to the destination, the higher is its impact on the performance of that path. We design a new path metricthat captures all of the above factors and we call this metric ETOP. In this paper, we provide a synopsis of the analytical computation of ETOP. We also implement a routing strategy based on ETOP on a 25-node experimental testbed and provide sample results to showcase the performance with ETOP.
- 9 September 2007
- Published by Association for Computing Machinery (ACM)
- p. 302-305
Open AccessRevisiting minimum cost reliable routing in wireless mesh networks
We revisit the problem of computing the path with the minimum cost in terms of the expected number of link layer retransmissions in wireless mesh networks. Unlike previous efforts (such as the popular ETX) we account for the fact that link layer protocols (such as the IEEE 802.11 MAC) incorporate a non-zero but finite number of retransmission attempts per packet. A key observation that motivates this work is that the performance of a path depends not only on the number of links on the path and their qualities, but also on the relative positions of the links on the path. In particular, the closer a lossy link to the destination, the higher is its impact on the performance of that path. We design a new path metricthat captures all of the above factors and we call this metric ETOP. In this paper, we provide a synopsis of the analytical computation of ETOP. We also implement a routing strategy based on ETOP on a 25-node experimental testbed and provide sample results to showcase the performance with ETOP.