Michael Stein, Tobias Petry, Immanuel Schweizer, Martina Brachmann, M. Mühlhäuser
Graph-based topology control adapts wireless topologies to achieve certain target graph structures. Wireless sensor networks seem well-suited for the expectations (in particular those on provided energy savings) raised by topology control. Nevertheless, topology control has never made the breakthrough in real-world deployments. This work explores the reasons for this, identifying five practical obstacles of today's topology control: (i) unrealistic assumptions, (ii) unsuitable graph structures, (iii) application agnosticism, (iv) unclear role in the stack, and (v) insufficient framework support. To address the latter obstacle, we provide a re-usable framework for the implementation and evaluation of topology control. Based on this framework, we conduct a testbed-based evaluation for two application scenarios and three topology control algorithms including a novel application-specific algorithm. Indeed, the identified obstacles hinder topology control from boosting the application. However, the achieved graph structures show the practical feasibility of topology control in principle.
{"title":"Topology Control in Wireless Sensor Networks: What Blocks the Breakthrough?","authors":"Michael Stein, Tobias Petry, Immanuel Schweizer, Martina Brachmann, M. Mühlhäuser","doi":"10.1109/LCN.2016.67","DOIUrl":"https://doi.org/10.1109/LCN.2016.67","url":null,"abstract":"Graph-based topology control adapts wireless topologies to achieve certain target graph structures. Wireless sensor networks seem well-suited for the expectations (in particular those on provided energy savings) raised by topology control. Nevertheless, topology control has never made the breakthrough in real-world deployments. This work explores the reasons for this, identifying five practical obstacles of today's topology control: (i) unrealistic assumptions, (ii) unsuitable graph structures, (iii) application agnosticism, (iv) unclear role in the stack, and (v) insufficient framework support. To address the latter obstacle, we provide a re-usable framework for the implementation and evaluation of topology control. Based on this framework, we conduct a testbed-based evaluation for two application scenarios and three topology control algorithms including a novel application-specific algorithm. Indeed, the identified obstacles hinder topology control from boosting the application. However, the achieved graph structures show the practical feasibility of topology control in principle.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"156 1","pages":"389-397"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79851801","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}
Decentralized systems, such as overlay networks or content delivery networks, form a virtual network on top of a physical network leading to inefficiencies in handling network traffic as physical locations are not considered. Therefore, this work investigates, analyzes, and evaluates two feasible network locality metrics for decentralized systems to overcome such inefficiencies. Furthermore, those metrics to determine network locality have been implemented and evaluated within an international testbed. These metrics evaluated consider aspects of path stability and path symmetry. The evaluation performed did reveal that the stability and symmetry metrics provide accurate locality indication.
{"title":"Towards Path Quality Metrics for Overlay Networks","authors":"Andri Lareida, Daniel Meier, T. Bocek, B. Stiller","doi":"10.1109/LCN.2016.31","DOIUrl":"https://doi.org/10.1109/LCN.2016.31","url":null,"abstract":"Decentralized systems, such as overlay networks or content delivery networks, form a virtual network on top of a physical network leading to inefficiencies in handling network traffic as physical locations are not considered. Therefore, this work investigates, analyzes, and evaluates two feasible network locality metrics for decentralized systems to overcome such inefficiencies. Furthermore, those metrics to determine network locality have been implemented and evaluated within an international testbed. These metrics evaluated consider aspects of path stability and path symmetry. The evaluation performed did reveal that the stability and symmetry metrics provide accurate locality indication.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"97 1","pages":"156-159"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79214811","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}
Sima Das, J. Leopold, Susmita K. Ghosh, Sajal K. Das
Real world large scale networks exhibit intrinsic community structure, with dense intra-community connectivity and sparse inter-community connectivity. Leveraging their community structure for parallelization of computational tasks and applications, is a significant step towards computational efficiency and application effectiveness. We propose a weighted depth-first-search graph partitioning algorithm for community formation that preserves the needed community dependency without any cycles. To comply with heterogeneity in community structure and size of the real world networks, we use a flexible limiting value for them. Further, our algorithm is a diversion from the existing modularity based algorithms. We evaluate our algorithm as the quality of the generated partitions, measured in terms of number of graph cuts.
{"title":"Graph Partitioning in Parallelization of Large Scale Networks","authors":"Sima Das, J. Leopold, Susmita K. Ghosh, Sajal K. Das","doi":"10.1109/LCN.2016.36","DOIUrl":"https://doi.org/10.1109/LCN.2016.36","url":null,"abstract":"Real world large scale networks exhibit intrinsic community structure, with dense intra-community connectivity and sparse inter-community connectivity. Leveraging their community structure for parallelization of computational tasks and applications, is a significant step towards computational efficiency and application effectiveness. We propose a weighted depth-first-search graph partitioning algorithm for community formation that preserves the needed community dependency without any cycles. To comply with heterogeneity in community structure and size of the real world networks, we use a flexible limiting value for them. Further, our algorithm is a diversion from the existing modularity based algorithms. We evaluate our algorithm as the quality of the generated partitions, measured in terms of number of graph cuts.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"176-179"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74926342","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}
BGP measurement is important for monitoring and understanding the Internet anomalies. Most of the previous works on BGP measurement rely on aggregated statistics from BGP monitors, e.g., total updates. However, BGP events may have quite limited visibility. Therefore, merely investigating aggregated data may lead to misunderstanding Internet instability, e.g., overestimating the impact of monitor-local events. In this empirical study, we demonstrate how BGP data are distributed among a large number of monitors. We define eleven features as the analysis targets, and three metrics to quantify disparity. We apply the method to 1.14 TB data and find that the distribution of most of the features is quite uneven, and different types of feature illustrate different levels of disparity. We also observe long periods of persistent high disparity, and a small set of cross-feature highly active monitors. Our analysis highlights the necessity of per-monitor data analysis in future BGP measurement study.
{"title":"A Measurement Study on the Distribution Disparity of BGP Instabilities","authors":"Meng Chen, Mingwei Xu, Yuan Yang, Qing Li","doi":"10.1109/LCN.2016.13","DOIUrl":"https://doi.org/10.1109/LCN.2016.13","url":null,"abstract":"BGP measurement is important for monitoring and understanding the Internet anomalies. Most of the previous works on BGP measurement rely on aggregated statistics from BGP monitors, e.g., total updates. However, BGP events may have quite limited visibility. Therefore, merely investigating aggregated data may lead to misunderstanding Internet instability, e.g., overestimating the impact of monitor-local events. In this empirical study, we demonstrate how BGP data are distributed among a large number of monitors. We define eleven features as the analysis targets, and three metrics to quantify disparity. We apply the method to 1.14 TB data and find that the distribution of most of the features is quite uneven, and different types of feature illustrate different levels of disparity. We also observe long periods of persistent high disparity, and a small set of cross-feature highly active monitors. Our analysis highlights the necessity of per-monitor data analysis in future BGP measurement study.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"38 1","pages":"19-27"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77351963","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}
This paper presents ESCAPE, an informed moving target defense mechanism for cloud containers. ESCAPE models the interaction between attackers and their target containers as a "predator searching for a prey" search game. Live migration of Linux-containers (prey) is used to avoid attacks (predator) and failures. The entire process is guided by a novel host-based behavior-monitoring system that seamlessly monitors containers for indications of intrusions and attacks. To evaluate ESCAPE effectiveness, we simulated the attack avoidance process based on a mathematical model mimicking the prey-vs-predator search game. Simulation results show high container survival probabilities with minimal added overhead.
{"title":"Toward Smart Moving Target Defense for Linux Container Resiliency","authors":"M. Azab, B. Mokhtar, A. S. Abed, M. Eltoweissy","doi":"10.1109/LCN.2016.106","DOIUrl":"https://doi.org/10.1109/LCN.2016.106","url":null,"abstract":"This paper presents ESCAPE, an informed moving target defense mechanism for cloud containers. ESCAPE models the interaction between attackers and their target containers as a \"predator searching for a prey\" search game. Live migration of Linux-containers (prey) is used to avoid attacks (predator) and failures. The entire process is guided by a novel host-based behavior-monitoring system that seamlessly monitors containers for indications of intrusions and attacks. To evaluate ESCAPE effectiveness, we simulated the attack avoidance process based on a mathematical model mimicking the prey-vs-predator search game. Simulation results show high container survival probabilities with minimal added overhead.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"7 1","pages":"619-622"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79116114","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}
Motivated by the computational, bandwidth and energy restrictions of wireless sensor network nodes and their need to, collectively, determine the presence of exogenous interference that could impair their communication, we consider schemes that could support the task of interference classification as a first step towards interference mitigation strategies. In particular, we examine the effectiveness of the Discrete Wavelet Transform (DWT) to communicate to other nodes the state of the channel, as sampled by a node, in a compressed, denoised form. We examine the suitability of different wavelet filters and thresholding methods in order to: (a) preserve key features of the interference, (b) denoise the noisy interference samples, and (c) reduce the amount of information that needs to be communicated to describe the interference.
{"title":"Wavelet-Based Analysis of Interference in WSNs","authors":"Aikaterini Vlachaki, I. Nikolaidis, J. Harms","doi":"10.1109/LCN.2016.127","DOIUrl":"https://doi.org/10.1109/LCN.2016.127","url":null,"abstract":"Motivated by the computational, bandwidth and energy restrictions of wireless sensor network nodes and their need to, collectively, determine the presence of exogenous interference that could impair their communication, we consider schemes that could support the task of interference classification as a first step towards interference mitigation strategies. In particular, we examine the effectiveness of the Discrete Wavelet Transform (DWT) to communicate to other nodes the state of the channel, as sampled by a node, in a compressed, denoised form. We examine the suitability of different wavelet filters and thresholding methods in order to: (a) preserve key features of the interference, (b) denoise the noisy interference samples, and (c) reduce the amount of information that needs to be communicated to describe the interference.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"639-642"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72962450","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}
Data capture is important for some critical network applications, such as network diagnosis and criminal investigation. In multi-channel wireless networks, the fundamental challenge for data capture is how to assign operation channels to wireless sniffers. The existing approaches make some impractical assumptions, such as the prior knowledge on network traffic and the perfect conditions of data capture. In this paper, we relax these assumptions and investigate the sniffer-channel assignment problem in multi-hop scenarios. Especially, sniffer redundancy deployment is discussed, which enables multiple sniffers to monitor one traffic. This problem is formulated as a combinatorial multi-arm bandit (MAB) problem, and a cooperative distribute learning policy is proposed. We analyze the regret of our policy in theory, and validate its effectiveness through numerical simulations.
{"title":"Monitoring Multi-Hop Multi-Channel Wireless Networks: Online Sniffer Channel Assignment","authors":"Jing Xu, Wei Liu, K. Zeng","doi":"10.1109/LCN.2016.97","DOIUrl":"https://doi.org/10.1109/LCN.2016.97","url":null,"abstract":"Data capture is important for some critical network applications, such as network diagnosis and criminal investigation. In multi-channel wireless networks, the fundamental challenge for data capture is how to assign operation channels to wireless sniffers. The existing approaches make some impractical assumptions, such as the prior knowledge on network traffic and the perfect conditions of data capture. In this paper, we relax these assumptions and investigate the sniffer-channel assignment problem in multi-hop scenarios. Especially, sniffer redundancy deployment is discussed, which enables multiple sniffers to monitor one traffic. This problem is formulated as a combinatorial multi-arm bandit (MAB) problem, and a cooperative distribute learning policy is proposed. We analyze the regret of our policy in theory, and validate its effectiveness through numerical simulations.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"83 7 1","pages":"579-582"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80077248","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}
The ultra-low latency transmission for emergency services needs an effective resources management scheme to deliver content in few milliseconds. The traditional solutions can't guarantee the ultra-low latency performance required by such traffic. In this paper, we propose an air-interface slice based dynamic resource reservation schema for a massive number of sensors with emergency flows in the context of the next generation cellular networks. The proposed schema allows ultra-low latency flows to be transported by guaranteed-rate radio link connection with a content name as identifier and it achieves air-interface latency in few milliseconds. The dynamic bit-map update, silence probability and window-based re-transmission are introduced based on the Frame Slotted Aloha, which can schedules the delay-sensitive flows immediately from one or many groups of connected terminals. Furthermore, a probability theory based analytic model is provided and evaluated with Monte-Carlo simulation results.
{"title":"Air-Interface Slice Based Dynamic Resource Reservation for Ultra-Low-Latency IoT Transmissions","authors":"Guolin Sun, Guohui Wang, Guisong Liu","doi":"10.1109/LCN.2016.102","DOIUrl":"https://doi.org/10.1109/LCN.2016.102","url":null,"abstract":"The ultra-low latency transmission for emergency services needs an effective resources management scheme to deliver content in few milliseconds. The traditional solutions can't guarantee the ultra-low latency performance required by such traffic. In this paper, we propose an air-interface slice based dynamic resource reservation schema for a massive number of sensors with emergency flows in the context of the next generation cellular networks. The proposed schema allows ultra-low latency flows to be transported by guaranteed-rate radio link connection with a content name as identifier and it achieves air-interface latency in few milliseconds. The dynamic bit-map update, silence probability and window-based re-transmission are introduced based on the Frame Slotted Aloha, which can schedules the delay-sensitive flows immediately from one or many groups of connected terminals. Furthermore, a probability theory based analytic model is provided and evaluated with Monte-Carlo simulation results.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"34 1","pages":"603-606"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80331409","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}
Many MANET routing protocols do not perform well in dense scenarios with high network load. In these situations, we can observe a high level of route instability, which is often called "route flapping". In this paper we present the PRIME routing protocol, which uses a probabilistic multipath forwarding process to increase route stability in dense scenarios with high network load. We describe the routing protocol and propose different scenarios to evaluate the protocol performance. We compare the behavior of our protocol with the well-known OLSR and AODV protocols in those scenarios. The evaluation results show that the PRIME routing protocol does in fact have a positive impact on route stability and can improve the overall network performance in situations with high network load.
{"title":"Using Probabilistic Multipath Routing to Improve Route Stability in MANETs","authors":"Fabian Rump, Sascha Jopen, M. Frank","doi":"10.1109/LCN.2016.40","DOIUrl":"https://doi.org/10.1109/LCN.2016.40","url":null,"abstract":"Many MANET routing protocols do not perform well in dense scenarios with high network load. In these situations, we can observe a high level of route instability, which is often called \"route flapping\". In this paper we present the PRIME routing protocol, which uses a probabilistic multipath forwarding process to increase route stability in dense scenarios with high network load. We describe the routing protocol and propose different scenarios to evaluate the protocol performance. We compare the behavior of our protocol with the well-known OLSR and AODV protocols in those scenarios. The evaluation results show that the PRIME routing protocol does in fact have a positive impact on route stability and can improve the overall network performance in situations with high network load.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"73 1","pages":"192-195"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86380605","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}
Ensuring network interoperability when IEEE 802.11s-based NAN and LTE-based WAN is deployed for Smart Grid (SG) Advanced Metering Infrastructure (AMI) poses significant challenges. Besides the QoS mismatch between networks, LTE tunneling mechanism becomes an issue when forwarding downlink traffic to IEEE 802.11s network since the gateway of these networks is supposed to be the end device in LTE setup. Yet, inherent security/privacy overhead in SG traffic makes it even more challenging. To address these issues, a novel UE access list is proposed for LTE network to enable the downlink traffic identification to IEEE 802.11s network and accordingly selects the corresponding gateway. For the QoS mismatch, Dual-Queues (DQs) for each Access Category of the underlying MAC protocol, namely Enhanced Distributed Channel Access (EDCA) in IEEE 802.11s network is proposed. By using ns-3 network simulator, extensive performance evaluations under heavy security overhead are conducted to assess the performance of the proposed mechanisms.
{"title":"Addressing Network Interoperability in Hybrid IEEE 802.11s/LTE Smart Grid Communications","authors":"Nico Saputro, K. Akkaya, Samet Tonyali","doi":"10.1109/LCN.2016.107","DOIUrl":"https://doi.org/10.1109/LCN.2016.107","url":null,"abstract":"Ensuring network interoperability when IEEE 802.11s-based NAN and LTE-based WAN is deployed for Smart Grid (SG) Advanced Metering Infrastructure (AMI) poses significant challenges. Besides the QoS mismatch between networks, LTE tunneling mechanism becomes an issue when forwarding downlink traffic to IEEE 802.11s network since the gateway of these networks is supposed to be the end device in LTE setup. Yet, inherent security/privacy overhead in SG traffic makes it even more challenging. To address these issues, a novel UE access list is proposed for LTE network to enable the downlink traffic identification to IEEE 802.11s network and accordingly selects the corresponding gateway. For the QoS mismatch, Dual-Queues (DQs) for each Access Category of the underlying MAC protocol, namely Enhanced Distributed Channel Access (EDCA) in IEEE 802.11s network is proposed. By using ns-3 network simulator, extensive performance evaluations under heavy security overhead are conducted to assess the performance of the proposed mechanisms.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"14 1","pages":"623-626"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84370626","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
扫码关注我们
求助内容：
应助结果提醒方式：