Bjorn Landfeldt
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
Research Interests
Bjorn Landfeldt has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Emma Fitzgerald
Department of Electrical and Information Technology, Lund University, SE-221 00 Lund, Sweden
4 shared publications - Mehmet Karaca
Department of Electrical and Information Technology, Lund University, Lund, Sweden
3 shared publications - Farnaz Moradi
Ericsson Research,Sweden
2 shared publications - Héctor Caltenco
Device Software Research, Ericsson, Lund, Sweden
2 shared publications - Ziyu Zhong
EIT, Lund University (LU), Lund, Skane, Sweden
2 shared publications - Abbas Jamalipour
The University of Sydney
1 shared publication
Latest Publications
- Open Access
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1039-1047
XRPoseSync: A Synchronized Multimodal Dataset for EdgeXR Pose Prediction
Existing VR datasets lack synchronized multimodal pairing of headset tracking and egocentric visual context, making it difficult to systematically study when and how visual cues improve head-motion prediction. While prior prediction work suggests visual information can help, these claims often rest on isolated models rather than shared benchmarks with aligned pose, video, and external ground truth. We present XRPoseSync, a synchronized multimodal dataset with 65 dual-stream pose sessions, 57 of which also include first-person ego-view video captured from the SteamVR VR View mirror at the headset’s display refresh rate (effective ≈ 60 FPS), together with OpenXR device tracking (200 Hz), Qualisys motion-capture reference (500 Hz), segment metadata, and synchronization diagnostics for controlled multimodal analysis. The dataset is designed to expose realistic interactive VR motion under a common timeline rather than to privilege a single predictor or modality. We include a lightweight pose-history versus pose-plus-video benchmark based on dense optical-flow descriptors. The results show that visual cues do not uniformly help prediction: in this baseline, video gains are horizon- and entropy-dependent, with the most notable translation improvement of 0.48 cm at the 600 ms horizon, while gains are negligible at short horizons and at 800–1000 ms. These findings should be interpreted as evidence of research questions enabled by XRPoseSync, not as a final statement on the best visual representation for XR pose prediction. XRPoseSync provides synchronized pose-video pairs, external reference streams, alignment metadata, entropy-based characterization, and user-disjoint splits for reproducible multimodal XR analysis.
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1039-1047
Open AccessXRPoseSync: A Synchronized Multimodal Dataset for EdgeXR Pose Prediction
Existing VR datasets lack synchronized multimodal pairing of headset tracking and egocentric visual context, making it difficult to systematically study when and how visual cues improve head-motion prediction. While prior prediction work suggests visual information can help, these claims often rest on isolated models rather than shared benchmarks with aligned pose, video, and external ground truth. We present XRPoseSync, a synchronized multimodal dataset with 65 dual-stream pose sessions, 57 of which also include first-person ego-view video captured from the SteamVR VR View mirror at the headset’s display refresh rate (effective ≈ 60 FPS), together with OpenXR device tracking (200 Hz), Qualisys motion-capture reference (500 Hz), segment metadata, and synchronization diagnostics for controlled multimodal analysis. The dataset is designed to expose realistic interactive VR motion under a common timeline rather than to privilege a single predictor or modality. We include a lightweight pose-history versus pose-plus-video benchmark based on dense optical-flow descriptors. The results show that visual cues do not uniformly help prediction: in this baseline, video gains are horizon- and entropy-dependent, with the most notable translation improvement of 0.48 cm at the 600 ms horizon, while gains are negligible at short horizons and at 800–1000 ms. These findings should be interpreted as evidence of research questions enabled by XRPoseSync, not as a final statement on the best visual representation for XR pose prediction. XRPoseSync provides synchronized pose-video pairs, external reference streams, alignment metadata, entropy-based characterization, and user-disjoint splits for reproducible multimodal XR analysis.
- Open Access
- 12 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Predictability-Aware Motion Prediction for Edge XR via High-Order Error-State Kalman Filtering
- 12 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessPredictability-Aware Motion Prediction for Edge XR via High-Order Error-State Kalman Filtering
- 31 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 3 (3) , 142-146
Load Reduction for Timely Applications in the Cloud
In many IoT applications, sensor data is sent remotely to be processed, but only the freshest result is of interest. In this letter we investigate a feedback mechanism that aborts the processing of stale data at the remote end to reduce the load and save costs. The process is approximated by an M/M/ ∞ queueing system with a feedback loop. We find the exact expression of the average computational time saved and show that with the feedback loop in place the computation time per CPU can be cut up to 25%, making the technique very promising.
- 31 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 3 (3) , 142-146
Load Reduction for Timely Applications in the Cloud
In many IoT applications, sensor data is sent remotely to be processed, but only the freshest result is of interest. In this letter we investigate a feedback mechanism that aborts the processing of stale data at the remote end to reduce the load and save costs. The process is approximated by an M/M/ ∞ queueing system with a feedback loop. We find the exact expression of the average computational time saved and show that with the feedback loop in place the computation time per CPU can be cut up to 25%, making the technique very promising.
- 20 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (4) , 2574-2584
Modeling DRX for D2D Communication
Discontinuous Reception (DRX) has been included in 4G-LTE as the main power saving mechanism for User Equipment (UE). However, the existing 3-state DRX model is not sufficient for new use cases introduced by 4G and 5G. For example, the device discovery process in Device to Device (D2D) communication has a significant impact on delay and power consumption, but the existing conventional 3-state DRX model is unable to capture this impact. In this paper, we propose a novel 5-state DRX model for D2D communications using a semi-Markov process, with separate arrival processes for data and discovery messages. The proposed model includes separate states for the discovery process, and is general and easy to extend for possible future changes. Our model allows us to investigate the behavior of the system under various DRX and discovery parameters. Numerical results show significant influence of the discovery phase on the performance of the DRX mechanism and provide new insights into how it affects power saving and delay.
- 20 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (4) , 2574-2584
Modeling DRX for D2D Communication
Discontinuous Reception (DRX) has been included in 4G-LTE as the main power saving mechanism for User Equipment (UE). However, the existing 3-state DRX model is not sufficient for new use cases introduced by 4G and 5G. For example, the device discovery process in Device to Device (D2D) communication has a significant impact on delay and power consumption, but the existing conventional 3-state DRX model is unable to capture this impact. In this paper, we propose a novel 5-state DRX model for D2D communications using a semi-Markov process, with separate arrival processes for data and discovery messages. The proposed model includes separate states for the discovery process, and is general and easy to extend for possible future changes. Our model allows us to investigate the behavior of the system under various DRX and discovery parameters. Numerical results show significant influence of the discovery phase on the performance of the DRX mechanism and provide new insights into how it affects power saving and delay.
- 3 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 6 (2) , 306-319
Energy-Efficient Stable and Balanced Task Scheduling in Data Centers
It is well known that load balancing in data centres can lead to unnecessary energy usage if all servers are kept active. Using dynamic server provisioning, the number of servers that serve requests can be reduced by turning off idle servers and thereby saving energy. However, such a scheme, usually increases the risk of instability of server queues. In this work, we analyze the trade-off between energy usage and stability of servers in a data center when we balance the load by dispatching arriving jobs. We propose algorithms to solve a stability and energy objective stochastic optimization problem with a high degree of flexibility to handle the trade-off between these two objectives. We consider variable size jobs to apply load balancing on selected active servers and find that the optimal solution is an NP-hard problem. We therefore develop two computationally efficient greedy and randomized approximation schemes to achieve the trade-off between these objectives. We investigate the performance of our proposed algorithms in minimizing the risk of queue length growth as well as the number of active servers needed to serve jobs, and compare it with several metrics in heterogeneous load scenarios.
- 3 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 6 (2) , 306-319
Energy-Efficient Stable and Balanced Task Scheduling in Data Centers
It is well known that load balancing in data centres can lead to unnecessary energy usage if all servers are kept active. Using dynamic server provisioning, the number of servers that serve requests can be reduced by turning off idle servers and thereby saving energy. However, such a scheme, usually increases the risk of instability of server queues. In this work, we analyze the trade-off between energy usage and stability of servers in a data center when we balance the load by dispatching arriving jobs. We propose algorithms to solve a stability and energy objective stochastic optimization problem with a high degree of flexibility to handle the trade-off between these two objectives. We consider variable size jobs to apply load balancing on selected active servers and find that the optimal solution is an NP-hard problem. We therefore develop two computationally efficient greedy and randomized approximation schemes to achieve the trade-off between these objectives. We investigate the performance of our proposed algorithms in minimizing the risk of queue length growth as well as the number of active servers needed to serve jobs, and compare it with several metrics in heterogeneous load scenarios.
- 23 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (7) , 7723-7734
Traffic Differentiated Clustering Routing in DSRC and C-V2X Hybrid Vehicular Networks
Vehicles equipped with sensors can participate in mobile crowdsourcing applications. Vehicular Ad Hoc Networks (VANETs) based on Dedicated Short Range Communication (DSRC) are used to carry sensing data. However, multi-hop transmissions for gathering data to Road Side Units (RSUs) in VANETs suffer from low data rate and long end-to-end delay, which can hardly meet the QoS requirements of delay-sensitive services. This triggers the consideration of constituting a DSRC and Cellular-Vehicle-to-Everything (C-V2X) hybrid vehicular network. Nevertheless, using cellular links to carry traffic can cause high cellular bandwidth costs. In this paper, we propose a Traffic Differentiated Clustering Routing (TDCR) mechanism in a Software Defined Network (SDN)-enabled hybrid vehicular network. The proposed mechanism includes a centralized one-hop clustering approach and a data delivery optimization method. Particularly, the optimization is to make a tradeoff between cellular bandwidth cost and end-to-end delay, for Cluster Heads (CHs) delivering their aggregated data either by multi-hop Vehicle-to-Vehicle (V2V) transmissions or by cellular networks. Since the problem is proven to be NP-hard, a two-stage heuristic algorithm is designed. We carry out simulations to evaluate the performance of our data collection scheme and the results show that it performs better than traditional mechanisms.
- 23 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (7) , 7723-7734
Traffic Differentiated Clustering Routing in DSRC and C-V2X Hybrid Vehicular Networks
Vehicles equipped with sensors can participate in mobile crowdsourcing applications. Vehicular Ad Hoc Networks (VANETs) based on Dedicated Short Range Communication (DSRC) are used to carry sensing data. However, multi-hop transmissions for gathering data to Road Side Units (RSUs) in VANETs suffer from low data rate and long end-to-end delay, which can hardly meet the QoS requirements of delay-sensitive services. This triggers the consideration of constituting a DSRC and Cellular-Vehicle-to-Everything (C-V2X) hybrid vehicular network. Nevertheless, using cellular links to carry traffic can cause high cellular bandwidth costs. In this paper, we propose a Traffic Differentiated Clustering Routing (TDCR) mechanism in a Software Defined Network (SDN)-enabled hybrid vehicular network. The proposed mechanism includes a centralized one-hop clustering approach and a data delivery optimization method. Particularly, the optimization is to make a tradeoff between cellular bandwidth cost and end-to-end delay, for Cluster Heads (CHs) delivering their aggregated data either by multi-hop Vehicle-to-Vehicle (V2V) transmissions or by cellular networks. Since the problem is proven to be NP-hard, a two-stage heuristic algorithm is designed. We carry out simulations to evaluate the performance of our data collection scheme and the results show that it performs better than traditional mechanisms.
- 8 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (1) , 607-621
Flexible DRX Optimization for LTE and 5G
- 8 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (1) , 607-621
Flexible DRX Optimization for LTE and 5G
- Open Access
- 23 October 2017
- Published by Cambridge University Press (CUP) in Slavic Review
- Vol. 76 (3) , 900-902
Collected Essays
- 23 October 2017
- Published by Cambridge University Press (CUP) in Slavic Review
- Vol. 76 (3) , 900-902
Open AccessCollected Essays
- Open Access
- 3 February 2017
- Published by Springer Nature in Telecommunication Systems
- Vol. 66 (2) , 197-215
An analytic model for Throughput Optimal Distributed Coordination Function (TO-DCF)
TO-DCF, a new backoff scheme for 802.11, has the potential to significantly increase throughput in dense wireless LANs while also opportunistically favouring nodes with heavier traffic loads and/or better channel conditions. In this paper we present an analytical model to investigate the behaviour and performance of the TO-DCF protocol with regards to operating parameters such as the number of nodes, the contention window size and the backoff countdown probabilities. We then compare numerical results from an implementation of our model with simulations. Our model shows a high level of accuracy, even when the model assumptions are relaxed, and provides guidance for network operators to correctly configure the weight functions for nodes running TO-DCF given the network’s operating conditions.
- 3 February 2017
- Published by Springer Nature in Telecommunication Systems
- Vol. 66 (2) , 197-215
Open AccessAn analytic model for Throughput Optimal Distributed Coordination Function (TO-DCF)
TO-DCF, a new backoff scheme for 802.11, has the potential to significantly increase throughput in dense wireless LANs while also opportunistically favouring nodes with heavier traffic loads and/or better channel conditions. In this paper we present an analytical model to investigate the behaviour and performance of the TO-DCF protocol with regards to operating parameters such as the number of nodes, the contention window size and the backoff countdown probabilities. We then compare numerical results from an implementation of our model with simulations. Our model shows a high level of accuracy, even when the model assumptions are relaxed, and provides guidance for network operators to correctly configure the weight functions for nodes running TO-DCF given the network’s operating conditions.
- Open Access
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Load-aware channel selection for 802.11 WLANs with limited measurement
It has been known that load unaware channel selection in 802.11 networks results in high level interference, and can significantly reduce the network throughput. In current implementation, the only way to determine the traffic load on a channel is to measure that channel for a certain duration of time. Therefore, in order to find the best channel with the minimum load all channels have to be measured, which is costly and can cause unacceptable communication interruptions between the AP and the stations. In this paper, we propose a learning based approach which aims to find the channel with the minimum load by measuring only limited number of channels. Our method uses Gaussian Process Regressing to accurately track the traffic load on each channel based on the previous measured load. We confirm the performance of our algorithm by using experimental data, and show that the time consumed for the load measurement can be reduced up to 46% compared to the case where all channels are monitored.
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Open AccessLoad-aware channel selection for 802.11 WLANs with limited measurement
It has been known that load unaware channel selection in 802.11 networks results in high level interference, and can significantly reduce the network throughput. In current implementation, the only way to determine the traffic load on a channel is to measure that channel for a certain duration of time. Therefore, in order to find the best channel with the minimum load all channels have to be measured, which is costly and can cause unacceptable communication interruptions between the AP and the stations. In this paper, we propose a learning based approach which aims to find the channel with the minimum load by measuring only limited number of channels. Our method uses Gaussian Process Regressing to accurately track the traffic load on each channel based on the previous measured load. We confirm the performance of our algorithm by using experimental data, and show that the time consumed for the load measurement can be reduced up to 46% compared to the case where all channels are monitored.