Efficient Detectors for Telegram Splitting based Transmission in Low Power Wide Area Networks with Bursty Interference
Steven Kisseleff, Jakob Kneissl, Gerd Kilian, Wolfgang H., Gerstacker

TL;DR
This paper introduces a low-complexity, flexible detection scheme for telegram splitting in LPWA networks, significantly improving packet error rates under bursty interference conditions.
Contribution
It develops a practical, high-performance detector that reduces complexity while maintaining near-optimal performance, addressing limitations of existing methods.
Findings
Proposed detector outperforms existing practical methods in packet error rate.
Enhanced flexibility and reduced complexity compared to optimal Markov chain-based detectors.
Significant performance gains demonstrated in bursty interference scenarios.
Abstract
Low Power Wide Area (LPWA) networks are known to be highly vulnerable to external in-band interference in terms of packet collisions which may substantially degrade the system performance. In order to enhance the performance in such cases, the telegram splitting (TS) method has been proposed recently. This approach exploits the typical burstiness of the interference via forward error correction (FEC) and offers a substantial performance improvement compared to other methods for packet transmissions in LPWA networks. While it has been already demonstrated that the TS method benefits from knowledge on the current interference state at the receiver side, corresponding practical receiver algorithms of high performance are still missing. The modeling of the bursty interference via Markov chains leads to the optimal detector in terms of a-posteriori symbol error probability. However, this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
