Senior Researcher
Office: Würzburger Str.35, 01087, Dresden, 1st floor, Room FAL 112 Phone: +49 351 463-38611 Fax: +49 351 463-37163 EMail: ievgenii.tsokalo@tu-dresden.de
Diploma Thesis
Master Thesis
Student Thesis
Mini-project
Tsokalo, Ievgenii A.; Wu, Huanzhuo; Nguyen, Giang T.; Salah, Hani; Fitzek, Frank H. P.
Mobile Edge Cloud for Robot Control Services in Industry Automation Proceedings Article
In: 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) (CCNC 2019), Las Vegas, USA, 2019.
BibTeX
@inproceedings{ccnc419, title = {Mobile Edge Cloud for Robot Control Services in Industry Automation}, author = {Ievgenii A. {Tsokalo} and Huanzhuo {Wu} and Giang T. {Nguyen} and Hani {Salah} and Frank H. P. {Fitzek}}, year = {2019}, date = {2019-01-01}, booktitle = {2019 16th IEEE Annual Consumer Communications \& Networking Conference (CCNC) (CCNC 2019)}, address = {Las Vegas, USA}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Close
Wu, Huanzhuo; Tsokalo, Ievgenii A.; Taghouti, Maroua; Salah, Hani; Fitzek, Frank H. P.
Compressible Source Separation in Industrial IoT Broadband Communication Proceedings Article
In: 2019 IEEE 24th International Conference on Emerging Technologies and Factory Automation (ETFA), IEEE 2019.
@inproceedings{wu2019compressible, title = {Compressible Source Separation in Industrial IoT Broadband Communication}, author = {Huanzhuo {Wu} and Ievgenii A. {Tsokalo} and Maroua {Taghouti} and Hani {Salah} and Frank H. P. {Fitzek}}, year = {2019}, date = {2019-01-01}, booktitle = {2019 IEEE 24th International Conference on Emerging Technologies and Factory Automation (ETFA)}, organization = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Gabriel, Frank; Chorppath, Anil K.; Tsokalo, Ievgenii A.; Fitzek, Frank H. P.
Multipath Communication with Finite Sliding Window Network Coding for Ultra-Reliability and Low Latency Proceedings Article
In: 2018 IEEE International Conference on Communications Workshops (ICC Workshops), pp. 1-6, Kansas City, US, 2018, ISBN: 2474-9133.
Abstract | Links | BibTeX
@inproceedings{gabriel2018multipath, title = {Multipath Communication with Finite Sliding Window Network Coding for Ultra-Reliability and Low Latency}, author = {Frank {Gabriel} and Anil K. {Chorppath} and Ievgenii A. {Tsokalo} and Frank H. P. {Fitzek}}, doi = {10.1109/ICCW.2018.8403489}, isbn = {2474-9133}, year = {2018}, date = {2018-05-19}, booktitle = {2018 IEEE International Conference on Communications Workshops (ICC Workshops)}, pages = {1-6}, address = {Kansas City, US}, abstract = {We use random linear network coding (RLNC) based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultra-reliability and low latency. A sliding window version of RLNC is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths. The packets are scheduled in the paths in a round robin fashion proportional to the data rates. We use finite encoding and decoding window size and do not rely on feedback for closing the sliding window, unlike the previous work. Our implementation of two paths with LTE and WiFi characteristics shows that the proposed sliding window scheme achieves better latency compared to the block RLNC code. It is also shown that the proposed scheme achieves low latency communication through multiple paths compared to the individual paths for bursty traffic by translating the throughput on both the paths into latency gain.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Tsokalo, Ievgenii A.; Gabriel, Frank; Pandi, Sreekrishna; Fitzek, Frank H. P.; Lehnert, Ralf
Reliable Feedback Mechanisms for Routing Protocols with Network Coding Proceedings Article
In: Proceedings of 2018 IEEE International Symposium on Power Line Communications and its Applications (ISPLC), pp. 7, Technische Universität Dresden IEEE, Manchester, UK, 2018, ISBN: 978-1-5386-1913-1.
@inproceedings{Tsokalo2018, title = {Reliable Feedback Mechanisms for Routing Protocols with Network Coding}, author = {Ievgenii A. {Tsokalo} and Frank {Gabriel} and Sreekrishna {Pandi} and Frank H. P. {Fitzek} and Ralf {Lehnert}}, doi = {10.1109/ISPLC.2018.8360234}, isbn = {978-1-5386-1913-1}, year = {2018}, date = {2018-04-11}, booktitle = {Proceedings of 2018 IEEE International Symposium on Power Line Communications and its Applications (ISPLC)}, volume = {1}, number = {1}, pages = {7}, publisher = {IEEE}, address = {Manchester, UK}, organization = {Technische Universit\"{a}t Dresden}, series = {1}, abstract = {PLC has the broadcast channel that enables overhearing and allows to use cooperative routing strategies. Opportunistic Routing (OpR) is a modern cooperative routing paradigm in broadcast channel networks such as PLC and wireless networks. In combination with Random Linear Network Coding (RLNC), it has been proven to increase the achievable data rate and reliability significantly. The reliability is supported by Automatic Repeat reQuest (ARQ) mechanisms. Traditional ARQs as Stop-And-Wait, Go-Back-N and Selective-Repeat are outperformed by the hybrid ARQs (HARQs). We analyze and compare six HARQs designed especially for protocols with Network Coding (NC). For this purpose, we propose a novel minimalistic evaluation setup. It reveals the disadvantages of each feedback (ARQ) mechanisms allowing an effective and fair comparison. We define performance metrics that indicate the reliability and efficiency and conduct the experiments using different NC parameters and the feedback frequency. We notice that some HARQs allow high reliability (packet loss \< 10 \^{O}\^{e}\AE4 ), while others have just a few percent protocol overhead. For such results, only one feedback per the code block is normally sufficient.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Tömösközi, Máté; Tsokalo, Ievgenii A.; Pandi, Sreekrishna; Fitzek, Frank H. P.; Ekler, Péter
Header Compression in Opportunistic Routing Proceedings Article
In: European Wireless 2018 (EW 2018), Catania, Italy, 2018.
@inproceedings{Tomo1805:Header, title = {Header Compression in Opportunistic Routing}, author = {M\'{a}t\'{e} {T\"{o}m\"{o}sk\"{o}zi} and Ievgenii A. {Tsokalo} and Sreekrishna {Pandi} and Frank H. P. {Fitzek} and P\'{e}ter {Ekler}}, year = {2018}, date = {2018-01-01}, booktitle = {European Wireless 2018 (EW 2018)}, address = {Catania, Italy}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Pandi, Sreekrishna; Tsokalo, Ievgenii A.; Wunderlich, Simon; Fitzek, Frank H. P.
Cooperation Group Size in Opportunistic Wireless Mesh: Optimal Versus Practical Proceedings Article
Abstract | BibTeX
@inproceedings{Pand1805:Cooperation, title = {Cooperation Group Size in Opportunistic Wireless Mesh: Optimal Versus Practical}, author = {Sreekrishna {Pandi} and Ievgenii A. {Tsokalo} and Simon {Wunderlich} and Frank H. P. {Fitzek}}, year = {2018}, date = {2018-01-01}, booktitle = {European Wireless 2018 (EW 2018)}, address = {Catania, Italy}, abstract = {This paper investigates the performance of wireless mesh networks advocating for Opportunistic Routing (OpR) over traditional Single Path Routing (SPR). In OpR, all nodes overhearing the transmission can form a cooperation group and forward the fragments of the received message. The bigger the cooperation group, the more is the message sub-divided and the harder it gets to manage this process. If poorly managed, multiple duplicate fragments can be forwarded that downgrades the overall performance and destabilizes the routing protocol. In this paper, we propose several methods for shrinking the cooperation group and define the best one that can be later used as a part of the routing protocol. Using a testbed of 15 node WiFi network deployed in the office building, we show that the cooperation group size can be significantly reduced using our proposed methods. The throughput gain of OpR over SPR reaches as high as 51% in our testbed. We also show that only 3% of the average gain is lost when shrinking the cooperation group to less than one-third of its original size. The conducted measurement and the analysis of the results form the benchmark for potential performance evaluation of the mesh networks.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Tsokalo, Ievgenii A.
Opportunistic Routing with Network Coding in Powerline Communications PhD Thesis
2017.
@phdthesis{dissTsokalo, title = {Opportunistic Routing with Network Coding in Powerline Communications}, author = {Ievgenii A. {Tsokalo}}, year = {2017}, date = {2017-10-27}, abstract = {Opportunistic Routing (OR) can be used as an alternative to the legacy routing (LR) protocols in networks with a broadcast lossy channel and possibility of overhearing the signal. The power line medium creates such an environment. OR can better exploit the channel than LR because it allows the cooperation of all nodes that receive any data. With LR, only a chain of nodes is selected for communication. Other nodes drop the received information. We investigate OR for the one-source one-destination scenario with one traffic flow. First, we evaluate the upper bound on the achievable data rate and advocate the decentralized algorithm for its calculation. This knowledge is used in the design of Basic Routing Rules (BRR). They use the link quality metric that equals the upper bound on the achievable data rate between the given node and the destination. We call it the node priority. It considers the possibility of multi-path communication and the packet loss correlation. BRR allows achieving the optimal data rate pertaining to certain theoretical assumptions. The Extended BRR (BRR-E) are free of them. The major difference between BRR and BRR-E lie in the usage of Network Coding (NC) for prognosis of the feedback. In this way, the protocol overhead can be severely reduced. We also study the Automatic Repeat-reQuest (ARQ) mechanism that is applicable to OR. It differs to ARQ with LR in that each sender has several sinks and none of the sinks except destination require the full recovery of the original message. Using BRR-E, ARQ and other services like network initialization and link state control, we design the Advanced Network Coding based Opportunistic Routing protocol (ANChOR). With the analytic and simulation results we demonstrate the near optimum performance of ANChOR. For the triangular topology, the achievable data rate is just 2% away from the theoretical maximum and it is up to 90% higher than it is possible to achieve with LR. Using the G.hn standard, we also show the full protocol stack simulation results (including IP/UDP and realistic channel model). In this simulation, we revealed that the gain of OR to LR can be even more increased by reducing the head-of-the-line problem in ARQ. Even considering the ANChOR overhead through additional headers and feedbacks, it outperforms the original G.hn setup in data rate up to 40% and in latency up to 60%.}, keywords = {}, pubstate = {published}, tppubtype = {phdthesis} }
Tsokalo, Ievgenii A.; Prasad, Gautham; Mudriievskyi, Stanislav; Lehnert, Ralf
CSMA/CD in PLC: Test with Full G.hn and IP/UDP Protocol Stack Proceedings Article
In: Proceedings of ISPLC 2017, Madrid, Spain, 2017.
@inproceedings{x1e, title = {CSMA/CD in PLC: Test with Full G.hn and IP/UDP Protocol Stack}, author = {Ievgenii A. {Tsokalo} and Gautham {Prasad} and Stanislav {Mudriievskyi} and Ralf {Lehnert}}, year = {2017}, date = {2017-04-01}, booktitle = {Proceedings of ISPLC 2017, Madrid, Spain}, journal = {ISPLC 2017, Madrid, Spain}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Tsokalo, Ievgenii A.; Matthiesen, Bho; Fitzek, Frank H. P.
Approaching the Limits in Routing in Power Line Communication Exploiting Network Coding Proceedings Article
@inproceedings{x2, title = {Approaching the Limits in Routing in Power Line Communication Exploiting Network Coding}, author = {Ievgenii A. {Tsokalo} and Bho {Matthiesen} and Frank H. P. {Fitzek}}, year = {2017}, date = {2017-04-01}, booktitle = {Proceedings of ISPLC 2017, Madrid, Spain}, journal = {ISPLC 2017, Madrid, Spain}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }
Tsokalo, Ievgenii A.; Lehnert, Ralf
Potential of Routing with Network Coding in PLC Networks Proceedings Article
In: Workshop PLC 2016, Paris, France, 2016.
@inproceedings{x3, title = {Potential of Routing with Network Coding in PLC Networks}, author = {Ievgenii A. {Tsokalo} and Ralf {Lehnert}}, year = {2016}, date = {2016-09-01}, booktitle = {Workshop PLC 2016, Paris, France}, journal = {Workshop PLC 2016, Paris, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} }