发布求助
文献互助 智能选刊 最新文献

2021 IEEE 46th Conference on Local Computer Networks (LCN)最新文献

筛选
英文 中文
WhisperChord: Scalable and Secure Node Discovery for Overlay Networks WhisperChord:覆盖网络的可扩展和安全节点发现
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9525008
A. Panchenko, Asya Mitseva, Sara Knabe
{"title":"WhisperChord: Scalable and Secure Node Discovery for Overlay Networks","authors":"A. Panchenko, Asya Mitseva, Sara Knabe","doi":"10.1109/LCN52139.2021.9525008","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9525008","url":null,"abstract":"Node discovery is a fundamental service for any overlay network, including anonymization networks. Although anonymization and node discovery are two disjoint services, the node discovery has a direct impact on the anonymization. Centralized methods require a trusted third party, limit the network scalability, and are vulnerable to intersection (statistical disclosure) attacks. Therefore, several distributed node discovery methods were proposed to meet the security requirements of anonymization networks through additional structures within Distributed Hash Tables (DHTs). However, they require a high management overhead, a strict cooperation between nodes, and are susceptible to active and passive attacks.We propose WhisperChord—an alternative distributed node discovery approach, which incorporates gossiping into structured overlays. WhisperChord is based on a Chord DHT and neither creates any additional structures within the DHT nor requires any trusted third party. Via simulations, we show that our method provides superior protection against active attacks than prior methods and can effectively thwart information leakages.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125315995","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}
引用次数: 1
Network Traffic Classification Method Supporting Unknown Protocol Detection 支持未知协议检测的网络流分类方法
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/lcn52139.2021.9525009
Hongyu Liu, Bo Lang
{"title":"Network Traffic Classification Method Supporting Unknown Protocol Detection","authors":"Hongyu Liu, Bo Lang","doi":"10.1109/lcn52139.2021.9525009","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9525009","url":null,"abstract":"At present, private protocols are widely used on the Internet. As a result, traditional traffic classification methods including port-based and DPI methods have become restricted. Existing machine learning-based methods depend on feature engineering, which makes feature design difficult. In addition, classification models can only classify data as predefined categories, which restricts the models when they are used to detect unknown protocol traffic. To address the above problems, we propose a two-stage traffic classification method combining a CNN model and a density-based clustering algorithm, which can classify known protocol traffic and detect arbitrary kinds of unknown protocol traffic simultaneously. We conducted sufficient experiments on the Information Security Centre of Excellence (ISCX) VPN-nonVPN and Defense Advanced Research Projects Agency (DARPA) 1998 datasets, and the accuracies on the test sets containing known and unknown protocol traffic achieved 97.03% and 98.50%, respectively, which are superior to other studies.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127728783","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}
引用次数: 3
Toward a lightweight machine learning based solution against cyber-intrusions for IoT 针对物联网网络入侵的轻量级机器学习解决方案
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9525002
Mawloud Omar, L. George
{"title":"Toward a lightweight machine learning based solution against cyber-intrusions for IoT","authors":"Mawloud Omar, L. George","doi":"10.1109/LCN52139.2021.9525002","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9525002","url":null,"abstract":"Internet of Things starts to integrate deeply our daily life through the comfort and the services that it offers. This technology made us already more intertwined with the external environment via deployed communicating devices. However, even though this proximity offers many advantages, it presents also strong security issues. The cyber-attack surface is significantly increased and the intruder impact is becoming more compromising. In this context, we present the preliminary results of our study toward the conception of a machine learning based solution against cyber-intrusions. The main purpose is to develop a resource-preserving solution with high precision of detection. We were interested in the IoTID20 dataset over which we experimented the most accurate machine learning models. The employed pre-processing approach that we propose pushes the machine learning models to the peak of their performances. Our study provides a comprehensive view of models efficiency with respect to detection rate, size and delay.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131248162","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}
引用次数: 1
A Minimal Delay Violation downlink LTE scheduler 最小延迟违反下行LTE调度程序
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/lcn52139.2021.9524881
J. V. D. Eynde, C. Blondia
{"title":"A Minimal Delay Violation downlink LTE scheduler","authors":"J. V. D. Eynde, C. Blondia","doi":"10.1109/lcn52139.2021.9524881","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9524881","url":null,"abstract":"Mobile communications and the accompanying demand for real-time services are growing rapidly. Dynamic resource allocation is required in technologies such as long-term evolution (LTE) and 5G to ensure fair and efficient resource usage. However, 3rd Generation Partnership Project (3GPP) does not impose a scheduling algorithm to assign those resources, leading to a vast body of downlink schedulers, each focusing on different aspects, such as throughput, packet loss ratio, energy efficiency etc. In this paper, we propose a new scheduler that aims to minimize delay violations, while maintaining a good throughput. The scheduler is based on a digital subscriber line (DSL) resource allocation mechanism, and uses the arrival rate together with the state of the flows and the network. We compare the scheduler to other schedulers from literature and observe that the proposed scheduler achieves a lower packet loss ratio (PLR) than the other schedulers, while maintaining a system high throughput.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132848262","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}
引用次数: 1
QX-MAC: Improving QoS and Energy Performance of IoT-based WSNs using Q-Learning QX-MAC:利用q -学习提高基于物联网的wsn的QoS和能量性能
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524962
F. Afroz, R. Braun
{"title":"QX-MAC: Improving QoS and Energy Performance of IoT-based WSNs using Q-Learning","authors":"F. Afroz, R. Braun","doi":"10.1109/LCN52139.2021.9524962","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524962","url":null,"abstract":"Low-power wireless sensor networks (WSNs) play a vital role in different IoT applications. In WSNs, MAC protocols are of paramount importance to improve energy efficiency and quality of service (QoS). This paper proposes a traffic-adaptive, energy-efficient MAC protocol, which combines the Q-Learning algorithm and the more bit scheme to provide low energy consumption together with better QoS without introducing additional overhead to the network. Simulation results show that, on average, QX-MAC offers an energy savings of 23.23% and 79.91% over the X-MAC and the B-MAC protocols respectively. QX-MAC can carry up to 92.78% of traffic, whilst X-MAC and B-MAC can transfer a maximum of 88.5%, and 67.3% traffic respectively. Furthermore, QX-MAC reduces the mean end-to-end packet delivery delay, even in the presence of high traffic loads, and improves the throughput up to 41.67% and 65.05% compared to X-MAC and B-MAC, respectively.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129312745","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}
引用次数: 1
Hop-By-Hop: Advancing Cooperative Congestion Control for Cyber-Physical Systems 逐跳:推进网络物理系统的合作拥塞控制
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524887
Markus Jung, M. Zitterbart
{"title":"Hop-By-Hop: Advancing Cooperative Congestion Control for Cyber-Physical Systems","authors":"Markus Jung, M. Zitterbart","doi":"10.1109/LCN52139.2021.9524887","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524887","url":null,"abstract":"Networked cyber-physical systems are driven by control loops that commonly depend on tight communication timing guarantees, requiring both complex and inflexible scheduling mechanisms to provide the necessary amount of determinism. We previously presented the fundamental idea of Cooperative Congestion Control (CoCC), which enables elastic control applications to share a common network cooperatively. By balancing the resource demands of control applications, it achieves fairness w.r.t. to the quality of control and efficiently avoids congestion and thus harmful delays and losses without the need for complex scheduling mechanisms. We propose lightweight and effective solutions that enable CoCC to deal with multiple bottlenecks and double its convergence speed. Our evaluation results show that high utilization, low delay, fairness, and fast convergence can be achieved by CoCC even in complex multi-bottleneck scenarios with a high number of flows.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114282616","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}
引用次数: 0
Graph Based Visualisation Techniques for Analysis of Blockchain Transactions 区块链交易分析的基于图的可视化技术
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/lcn52139.2021.9524878
Jeyakumar Samantha Tharani, E. Charles, Zhé Hóu, M. Palaniswami, V. Muthukkumarasamy
{"title":"Graph Based Visualisation Techniques for Analysis of Blockchain Transactions","authors":"Jeyakumar Samantha Tharani, E. Charles, Zhé Hóu, M. Palaniswami, V. Muthukkumarasamy","doi":"10.1109/lcn52139.2021.9524878","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9524878","url":null,"abstract":"Blockchain is a digital technology built on three pillars: decentralization, transparency and immutability. Bitcoin and Ethereum are two prevalent Blockchain platforms, where the participants are globally connected in a peer-to-peer manner and anonymously perform trade electronically. The vast number of decentralized transactions and the pseudo-anonymity of participants open the door for scams, cyber frauds, hacks, money laundering and fraudulent transactions. It is challenging to detect such fraudulent activities using traditional auditing techniques, since they need more processing power, time and memory for complex queries to join combinations of tables. This paper proposes several algorithms to extract the transaction- related features from the Bitcoin and Ethereum networks and to represent the features as graphs. Moreover, the paper discusses how visualisation of graphs can reflect the anomalies and patterns of fraudulent activities.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114465719","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}
引用次数: 5
A Vehicle Message Scheduling Scheme For Vehicle Trust Management 一种用于车辆信任管理的车辆消息调度方案
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524964
Qinwen Hu, Wanqing Tu
{"title":"A Vehicle Message Scheduling Scheme For Vehicle Trust Management","authors":"Qinwen Hu, Wanqing Tu","doi":"10.1109/LCN52139.2021.9524964","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524964","url":null,"abstract":"The trustworthiness of vehicle messages is a major focus in intelligent transportation research. Existing studies focus on enhancing the accuracy of vehicle trustworthiness evaluation, overlooking that the transmission performance may affect the quality of vehicle messages, which are essential for implementing trustworthiness evaluation. This paper studies a novel vehicle message scheduling scheme to regulate vehicles’ transmissions so that incident messages for any part of the road can be reliably and accurately sent to a roadside unit. Through strategically scheduling vehicle transmissions to avoid interference between vehicles while guaranteeing sufficient numbers of vehicles transmitting their sensor data, vehicle messages can reliably yet timely arrive at Road Side Units (RSUs) without missing reporting an event on the road.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114084882","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}
引用次数: 1
A two-stage algorithm for the Virtual Network Embedding problem 虚拟网络嵌入问题的两阶段算法
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524968
Massinissa Ait Aba, Maxime Elkael, B. Jouaber, Hind Castel-Taleb, Andrea Araldo, David Olivier
{"title":"A two-stage algorithm for the Virtual Network Embedding problem","authors":"Massinissa Ait Aba, Maxime Elkael, B. Jouaber, Hind Castel-Taleb, Andrea Araldo, David Olivier","doi":"10.1109/LCN52139.2021.9524968","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524968","url":null,"abstract":"The 5G telecommunication ecosystem is expected to dynamically support new and various applications from the industrial and the service sectors that are very heterogeneous in terms of QoS and resources’ requirements. In this context, a promising important concept for network resource management is emerging, denoted by Network Slicing. It involves decisions on embedding and managing several virtual networks on the same physical resources. This problem in its simplified form can be modeled by the Virtual Network Embedding (VNE) problem. In this paper, we propose a new resolution method, in which we first reduce the set of admitted routes and then solve an integer program. Our proposed approach is then compared to the optimal solution and to a method from the state of the art. Obtained results show that our approach provides good result in terms of slice acceptance ratio and resource consumption while reducing the overall complexity and runtime.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123462308","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}
引用次数: 4
Opportunistic Routing and Synchronous Transmissions Meet TSCH 机会路由和同步传输满足TSCH
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524952
Laura Harms, O. Landsiedel
{"title":"Opportunistic Routing and Synchronous Transmissions Meet TSCH","authors":"Laura Harms, O. Landsiedel","doi":"10.1109/LCN52139.2021.9524952","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524952","url":null,"abstract":"Low-power wireless networking commonly uses either Time-Slotted Channel Hopping (TSCH), synchronous transmissions, or opportunistic routing. All three of these different, orthogonal approaches strive for efficient and reliable communication but follow different trajectories. With this paper, we combine these concepts into one protocol: Autobahn.Autobahn merges TSCH scheduling with opportunistically routed, synchronous transmissions. This opens the possibility to create long-term stable schedules overcoming local interference. We prove the stability of schedules over several days in our experimental evaluation. Moreover, Autobahn outperforms the autonomous scheduler Orchestra under interference in terms of reliability by 13.9 percentage points and in terms of latency by a factor of 9 under a minor duty cycle increase of 2.1 percentage points.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133545841","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书