Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843360
S. Aust
An integral part of software defined vehicles (SDVs) is the vehicle update manager that is used to frequently update the vehicle’s software. The vehicle update manager connects the in-car communication network with the out-car services, such as diagnostic or cloud vehicle services. The out-car services provide the latest software of a fleet, which is sent to each vehicle’s update manager to update the in-car software. How the software update architecture is designed is outlined in this demo. Furthermore, a vehicle’s update master unit receives the updates and forwards them to connected subordinates. The update process in this demo is based on the adaptive AUTOSAR platform, that uses the concept of update and configuration manager (UCM), which demonstrates the latest development in vehicle updates in SDVs.
{"title":"Vehicle Update Management in Software Defined Vehicles","authors":"S. Aust","doi":"10.1109/LCN53696.2022.9843360","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843360","url":null,"abstract":"An integral part of software defined vehicles (SDVs) is the vehicle update manager that is used to frequently update the vehicle’s software. The vehicle update manager connects the in-car communication network with the out-car services, such as diagnostic or cloud vehicle services. The out-car services provide the latest software of a fleet, which is sent to each vehicle’s update manager to update the in-car software. How the software update architecture is designed is outlined in this demo. Furthermore, a vehicle’s update master unit receives the updates and forwards them to connected subordinates. The update process in this demo is based on the adaptive AUTOSAR platform, that uses the concept of update and configuration manager (UCM), which demonstrates the latest development in vehicle updates in SDVs.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123448430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843509
Patrick Rathje, O. Landsiedel
Bluetooth Low Energy (BLE) is the prevalent IoT radio technology and perfectly suited for mobile and battery-driven applications. However, it is not designed for intermittent connectivity and opportunistic networking. Hence, the vast infrastructure that BLE-equipped devices such as smartphones, wearables, and sensors provide, remains untapped, even with its potential for data collection, sharing, or emergency communication in disaster scenarios. This paper introduces DISRUPTABLE to unfold this potential: A universal BLE-based store-and-forward architecture for delay-tolerant and opportunistic networking. Tailored to the resource constraints of IoT nodes and the feature set of BLE, DISRUPTABLE enables opportunistic interactions between BLE-equipped devices, providing a resilient network even when established communication over cellular networks or Wi-Fi fails. In our evaluation, we show that in a highly dynamic pedestrian scenario in downtown Stockholm, broadcasts reliably inform pedestrians in 7.1 seconds, while unicast messages arrive within 20 minutes in 48.1% of cases.
{"title":"DisruptaBLE: Opportunistic BLE Networking","authors":"Patrick Rathje, O. Landsiedel","doi":"10.1109/LCN53696.2022.9843509","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843509","url":null,"abstract":"Bluetooth Low Energy (BLE) is the prevalent IoT radio technology and perfectly suited for mobile and battery-driven applications. However, it is not designed for intermittent connectivity and opportunistic networking. Hence, the vast infrastructure that BLE-equipped devices such as smartphones, wearables, and sensors provide, remains untapped, even with its potential for data collection, sharing, or emergency communication in disaster scenarios. This paper introduces DISRUPTABLE to unfold this potential: A universal BLE-based store-and-forward architecture for delay-tolerant and opportunistic networking. Tailored to the resource constraints of IoT nodes and the feature set of BLE, DISRUPTABLE enables opportunistic interactions between BLE-equipped devices, providing a resilient network even when established communication over cellular networks or Wi-Fi fails. In our evaluation, we show that in a highly dynamic pedestrian scenario in downtown Stockholm, broadcasts reliably inform pedestrians in 7.1 seconds, while unicast messages arrive within 20 minutes in 48.1% of cases.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130264995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843423
Hua Wu, Rui Wang, Guang Cheng, Xiaoyan Hu
Identifying mobile applications from network traffic is important for Internet service providers (ISPs) to manage their networks at a fine-grained level. However, the rise of public services has led to a gradual increase in service coupling among applications, making it more difficult to identify applications. Existing methods produce classification ambiguities when identifying highly coupled mobile applications, resulting in low application identification accuracy. In this paper, we propose a service-based method to quickly identify highly service coupling applications after the applications are launched. It can accurately identify highly coupled mobile applications based on the features of the services accessed by the applications. Experiments on a real network traffic dataset of highly coupled mobile applications verify that our method can identify applications within 25s after the mobile applications are launched, and the identification accuracy is over 99%.
{"title":"Service-Based Identification of Highly Coupled Mobile Applications","authors":"Hua Wu, Rui Wang, Guang Cheng, Xiaoyan Hu","doi":"10.1109/LCN53696.2022.9843423","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843423","url":null,"abstract":"Identifying mobile applications from network traffic is important for Internet service providers (ISPs) to manage their networks at a fine-grained level. However, the rise of public services has led to a gradual increase in service coupling among applications, making it more difficult to identify applications. Existing methods produce classification ambiguities when identifying highly coupled mobile applications, resulting in low application identification accuracy. In this paper, we propose a service-based method to quickly identify highly service coupling applications after the applications are launched. It can accurately identify highly coupled mobile applications based on the features of the services accessed by the applications. Experiments on a real network traffic dataset of highly coupled mobile applications verify that our method can identify applications within 25s after the mobile applications are launched, and the identification accuracy is over 99%.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114138167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843570
Camille Moriot, François Lesueur, N. Stouls, F. Valois
There is a constant threat of having our computing systems under attack. Information regarding the origins of the traffic we receive can be valuable. Currently, the AS-number and the localization are the most commonly used IP-related information to characterize an attack.In this paper, we propose expanding knowledge about a remote IP’s owner to improve defensive reaction effectiveness and obtain in-depth analyzes of attacker profiles. We introduce the enrichment with socio-organizational information (such as organization type, activity field, etc.) about the entities owning the IP in addition to infrastructural information. This integration is driven by combining RDAP and Wikidata. We demonstrate that this proposal is promising.
{"title":"How to build socio-organizational information from remote IP addresses to enrich security analysis?","authors":"Camille Moriot, François Lesueur, N. Stouls, F. Valois","doi":"10.1109/LCN53696.2022.9843570","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843570","url":null,"abstract":"There is a constant threat of having our computing systems under attack. Information regarding the origins of the traffic we receive can be valuable. Currently, the AS-number and the localization are the most commonly used IP-related information to characterize an attack.In this paper, we propose expanding knowledge about a remote IP’s owner to improve defensive reaction effectiveness and obtain in-depth analyzes of attacker profiles. We introduce the enrichment with socio-organizational information (such as organization type, activity field, etc.) about the entities owning the IP in addition to infrastructural information. This integration is driven by combining RDAP and Wikidata. We demonstrate that this proposal is promising.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843645
Zakaria Abou El Houda, B. Brik, L. Khoukhi
Software-defined network (SDN) is widely deployed on Smart Grid (SG) systems. It consists in decoupling control and data planes, to automate the monitoring and management of the communication network, and thus enabling zero touch management of SG systems. However, SDN-based SG is prone to several security threats and varios type of new attacks. To alleviate these issues, various Machine/Deep learning (ML/DL)-based intrusion detection systems (IDS) were designed to improve the detection accuracy of conventional IDS. However, they suffer from high variance and/or bias, which may lead to an inaccurate security threat detection. In this context, ensemble learning is an emerging ML technique that aims at combining several ML models; the objective is to generate less data-sensitive (i.e., less variance) and more flexible (i.e., less bias) machine learning models. In this paper, we design a novel framework, called BoostIDS, that leverages ensemble learning to efficiently detect and mitigate security threats in SDN-based SG system. BoostIDS comprises two main modules: (1) A data monitoring and feature selection module that makes use of an efficient Boosting Feature Selection Algorithm to select the best/relevant SG-based features; and (2) An ensemble learning-based threats detection moel that implements a Lightweight Boosting Algorithm (LBA) to timely and effectively detects SG-based attacks in a SDN environment. We conduct extensive experiments to validate BoostIDS on top of multiple real attacks; the obtained results using NSL-KDD and UNSW-NB15 datasets, confirm that BoostIDS can effectively detect/mitigate security threats in SDN-based SG systems, while optimizing training/test time complexity.
{"title":"Ensemble Learning for Intrusion Detection in SDN-Based Zero Touch Smart Grid Systems","authors":"Zakaria Abou El Houda, B. Brik, L. Khoukhi","doi":"10.1109/LCN53696.2022.9843645","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843645","url":null,"abstract":"Software-defined network (SDN) is widely deployed on Smart Grid (SG) systems. It consists in decoupling control and data planes, to automate the monitoring and management of the communication network, and thus enabling zero touch management of SG systems. However, SDN-based SG is prone to several security threats and varios type of new attacks. To alleviate these issues, various Machine/Deep learning (ML/DL)-based intrusion detection systems (IDS) were designed to improve the detection accuracy of conventional IDS. However, they suffer from high variance and/or bias, which may lead to an inaccurate security threat detection. In this context, ensemble learning is an emerging ML technique that aims at combining several ML models; the objective is to generate less data-sensitive (i.e., less variance) and more flexible (i.e., less bias) machine learning models. In this paper, we design a novel framework, called BoostIDS, that leverages ensemble learning to efficiently detect and mitigate security threats in SDN-based SG system. BoostIDS comprises two main modules: (1) A data monitoring and feature selection module that makes use of an efficient Boosting Feature Selection Algorithm to select the best/relevant SG-based features; and (2) An ensemble learning-based threats detection moel that implements a Lightweight Boosting Algorithm (LBA) to timely and effectively detects SG-based attacks in a SDN environment. We conduct extensive experiments to validate BoostIDS on top of multiple real attacks; the obtained results using NSL-KDD and UNSW-NB15 datasets, confirm that BoostIDS can effectively detect/mitigate security threats in SDN-based SG systems, while optimizing training/test time complexity.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129656767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843246
A. Shokry, Maged A. Youssef
Fingerprinting is one of the mainstream technologies for localization. However, it needs significant storage overhead and running time, preventing it from scaling to support world-wide indoor/outdoor localization.Quantum computing has the potential to revolutionize computation by making some classically intractable problems solvable on quantum computers. In this paper, we propose a quantum fingerprint-based localization algorithm for enabling large-scale location tracking systems, envisioning future era of location tracking and spatial systems. Specifically, we propose a quantum algorithm that provides an exponential enhancement of both the space and running time complexity compared to the traditional classical systems. We give the details of how to build the quantum fingerprint, how to encode the received signal strength (RSS) measurements in quantum particles, and finally; present a quantum algorithm for calculating the cosine similarity between the online RSS measurements and the fingerprint ones.Results from deploying our algorithm in three real testbeds on IBM Quantum Experience machines confirm the ability of our quantum system to get the same accuracy as the classical one but with the potential exponential saving in both space and running time.
{"title":"A Quantum Algorithm for RF-based Fingerprinting Localization Systems","authors":"A. Shokry, Maged A. Youssef","doi":"10.1109/LCN53696.2022.9843246","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843246","url":null,"abstract":"Fingerprinting is one of the mainstream technologies for localization. However, it needs significant storage overhead and running time, preventing it from scaling to support world-wide indoor/outdoor localization.Quantum computing has the potential to revolutionize computation by making some classically intractable problems solvable on quantum computers. In this paper, we propose a quantum fingerprint-based localization algorithm for enabling large-scale location tracking systems, envisioning future era of location tracking and spatial systems. Specifically, we propose a quantum algorithm that provides an exponential enhancement of both the space and running time complexity compared to the traditional classical systems. We give the details of how to build the quantum fingerprint, how to encode the received signal strength (RSS) measurements in quantum particles, and finally; present a quantum algorithm for calculating the cosine similarity between the online RSS measurements and the fingerprint ones.Results from deploying our algorithm in three real testbeds on IBM Quantum Experience machines confirm the ability of our quantum system to get the same accuracy as the classical one but with the potential exponential saving in both space and running time.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124694502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843706
J. Garcia-Luna-Aceves
OPERA is a framework recently introduced that formalizes routing etiquettes based on path information. New rules derived from OPERA to provide total ordering among paths are added to the policy mechanisms used in IBGP and EBGP, which results in OPERA-based BGP (OBGP). OBGP is a complete loop-free inter-domain multi-path routing solution based on IBGP and EBGP. OBGP is proven to be stable and loop-free at every instant. Well-known examples of systems in which IBGP and EBGP do not converge are used to illustrate the benefits of OBGP.
{"title":"Eliminating Routing Loops and Oscillations in BGP Using Total Ordering","authors":"J. Garcia-Luna-Aceves","doi":"10.1109/LCN53696.2022.9843706","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843706","url":null,"abstract":"OPERA is a framework recently introduced that formalizes routing etiquettes based on path information. New rules derived from OPERA to provide total ordering among paths are added to the policy mechanisms used in IBGP and EBGP, which results in OPERA-based BGP (OBGP). OBGP is a complete loop-free inter-domain multi-path routing solution based on IBGP and EBGP. OBGP is proven to be stable and loop-free at every instant. Well-known examples of systems in which IBGP and EBGP do not converge are used to illustrate the benefits of OBGP.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"115 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120939242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843613
I. Amer, Sharief M. A. Oteafy, H. Hassanein
Edge networks provide ample resources for low-latency service recruitment, unlike remote resources in the Cloud. As such, smart devices and Internet of Things (IoT) nodes form a pool of Extreme Edge Devices (EED) that are within reach of Mist and Fog networks, providing significant advantages in latency, geographic cognizance, and reduced communication costs. EEDs are often recruited in Edge networks assuming they are reliable in their commitment to tasks. However, many EEDs may fail to fulfill their tasks because they operate under opportunistic approaches and are prone to intermittent connectivity. To ameliorate task failure, we aim to optimize task allocation under the assumption of failure. Additionally, we optimize CPU utilization to engage reliable EEDs, resorting to replication when needed to exceed a tunable reliability margin. We demonstrate the efficacy of our model in multiple scenarios and present future work in EED utilization.
{"title":"Task Replication in Unreliable Edge Networks","authors":"I. Amer, Sharief M. A. Oteafy, H. Hassanein","doi":"10.1109/LCN53696.2022.9843613","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843613","url":null,"abstract":"Edge networks provide ample resources for low-latency service recruitment, unlike remote resources in the Cloud. As such, smart devices and Internet of Things (IoT) nodes form a pool of Extreme Edge Devices (EED) that are within reach of Mist and Fog networks, providing significant advantages in latency, geographic cognizance, and reduced communication costs. EEDs are often recruited in Edge networks assuming they are reliable in their commitment to tasks. However, many EEDs may fail to fulfill their tasks because they operate under opportunistic approaches and are prone to intermittent connectivity. To ameliorate task failure, we aim to optimize task allocation under the assumption of failure. Additionally, we optimize CPU utilization to engage reliable EEDs, resorting to replication when needed to exceed a tunable reliability margin. We demonstrate the efficacy of our model in multiple scenarios and present future work in EED utilization.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126564242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843413
T. Dreibholz, Mah-Rukh Fida, Azza H. Ahmed, Andrés F. Ocampo, Foivos Michelinakis
Network Function Virtualization is a key enabler to building future mobile networks in a flexible and cost-efficient way. Such a network is expected to manage and maintain itself with minimum human intervention. With early deployments of the fifth generation of mobile technologies – 5G – around the world, setting up 4G/5G experimental infrastructure is necessary to optimally design Self-Organising Networks (SON). In this demo, we present a custom small-scale 4G/5G testbed. As a step towards self-healing, the testbed integrates Programming Protocol-independent Packet Processors (P4) virtual switches, that are placed along interfaces between different components of transport and core network. This demo not only shows the administration and monitoring of the Evolved Packet Core VNF components, using Open Source MANO, but also serves as a proof of concept for the potential of P4-based telemetry in detecting anomalous behaviour of the mobile network, such as a congestion in the transport part.
{"title":"A Live Demonstration of In-Band Telemetry in OSM-Orchestrated Core Networks","authors":"T. Dreibholz, Mah-Rukh Fida, Azza H. Ahmed, Andrés F. Ocampo, Foivos Michelinakis","doi":"10.1109/LCN53696.2022.9843413","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843413","url":null,"abstract":"Network Function Virtualization is a key enabler to building future mobile networks in a flexible and cost-efficient way. Such a network is expected to manage and maintain itself with minimum human intervention. With early deployments of the fifth generation of mobile technologies – 5G – around the world, setting up 4G/5G experimental infrastructure is necessary to optimally design Self-Organising Networks (SON). In this demo, we present a custom small-scale 4G/5G testbed. As a step towards self-healing, the testbed integrates Programming Protocol-independent Packet Processors (P4) virtual switches, that are placed along interfaces between different components of transport and core network. This demo not only shows the administration and monitoring of the Evolved Packet Core VNF components, using Open Source MANO, but also serves as a proof of concept for the potential of P4-based telemetry in detecting anomalous behaviour of the mobile network, such as a congestion in the transport part.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131721200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843205
O. Nielsen, Lucas Koefoed Schnügger, Charalampos Orfanidis, Xenofon Fafoutis
TSCH is a MAC protocol able to provide reliable wireless communication to IoT networks. For applications where mobility is necessary research has shown that TSCH presents a suboptimal performance. One of the main issues is that the time required for a device to join a TSCH network is unpredictable and theoretically has no upper limit. The joining process to a TSCH network can take several minutes in some cases which can ensue significant delay and power overheads. In this paper we examine how TSCH can be adapted to support mobile applications, by improving the joining and re-joining procedure. Relevant information about the network topology is aggregated throughout the network to be utilized during the joining process. The results show that the joining time can be reduced by 50% and the re-joining time by 90%.
{"title":"Mobility-Focused Joining in TSCH Networks","authors":"O. Nielsen, Lucas Koefoed Schnügger, Charalampos Orfanidis, Xenofon Fafoutis","doi":"10.1109/LCN53696.2022.9843205","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843205","url":null,"abstract":"TSCH is a MAC protocol able to provide reliable wireless communication to IoT networks. For applications where mobility is necessary research has shown that TSCH presents a suboptimal performance. One of the main issues is that the time required for a device to join a TSCH network is unpredictable and theoretically has no upper limit. The joining process to a TSCH network can take several minutes in some cases which can ensue significant delay and power overheads. In this paper we examine how TSCH can be adapted to support mobile applications, by improving the joining and re-joining procedure. Relevant information about the network topology is aggregated throughout the network to be utilized during the joining process. The results show that the joining time can be reduced by 50% and the re-joining time by 90%.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134126532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：