Proceedings of the 10th International Conference on Networking, Systems and Security最新文献

筛选

英文中文

Strategic Placement of Intrusion Detection Systems in IoT Mesh Networks through Machine Learning 通过机器学习在物联网网状网络中战略性安置入侵检测系统

Proceedings of the 10th International Conference on Networking, Systems and Security Pub Date : 2023-12-21 DOI: 10.1145/3629188.3629195

Samhitha Perala, Manaswitha Reddy, Sharvari Ravindran, Sasirekha Gvk, Jyotsna L. Bapat

{"title":"Strategic Placement of Intrusion Detection Systems in IoT Mesh Networks through Machine Learning","authors":"Samhitha Perala, Manaswitha Reddy, Sharvari Ravindran, Sasirekha Gvk, Jyotsna L. Bapat","doi":"10.1145/3629188.3629195","DOIUrl":"https://doi.org/10.1145/3629188.3629195","url":null,"abstract":"The usage of Bluetooth Low Energy (BLE) mesh networks in Internet of Things (IoT) applications, such as healthcare gives it several advantages such as resilience to network disrupts and better coverage. However, mesh networks are prone to complex attacks, comprising multiple individual attacks like Denial of Service (DoS), Man-in-the-Middle (MitM) and so on. These are referred to as multi-stage attacks that can drastically deteriorate the network’s performance. The need to detect such attacks has been well investigated and several Intrusion Detection Systems (IDS) for detecting and mitigating attacks in mesh networks have been developed. However, the deployment of IDS for monitoring intrusions is costly in terms of computations and the power required. Hence, achieving the maximum probability of intrusion detection through strategic placement for a given limited number of IDS is the challenge. In this paper, Machine Learning (ML)-based analysis is proposed to determine the suitable positions for the IDS on relay nodes of the BLE mesh network. In comparison to the graph theoretical methodology proposed in the prior art, the approach discussed in this paper considers practical aspects, such as the network topology, underlying routing protocol, routing path of the application and variation in the traffic metrics with and without attack.","PeriodicalId":508572,"journal":{"name":"Proceedings of the 10th International Conference on Networking, Systems and Security","volume":"13 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139167464","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

Algorithm for Modified Minimum Length Sliding k Transmitter Problem 修正的最小长度滑动 k 发射器问题算法

Proceedings of the 10th International Conference on Networking, Systems and Security Pub Date : 2023-12-21 DOI: 10.1145/3629188.3629192

Mohammad Al-Mahmud, Md. Saidur Rahman

{"title":"Algorithm for Modified Minimum Length Sliding k Transmitter Problem","authors":"Mohammad Al-Mahmud, Md. Saidur Rahman","doi":"10.1145/3629188.3629192","DOIUrl":"https://doi.org/10.1145/3629188.3629192","url":null,"abstract":"Advancement in wireless technology, artificial intelligence and robotics introduces different problems on coverage or visibility in different architectural shapes. Usually, architectural shapes are represented by two dimensional polygons. Such two dimensional polygons are partitioned using various partitioning techniques to solve those coverage or visibility problems. One such partitioning technique uses reflex vertices of orthogonal polygons. We establish some relations among different components of an orthogonal polygon after it is being partitioned by reflex vertices. There are many variants of each visibility or coverage problems in wireless technology. One such variant is minimum length sliding k transmitter problem. Such transmitters can travel back and forth along the boundary of an orthogonal polygon and can modeled as an omnidirectional wireless modem, transmit signal orthogonally and can penetrate through k walls (k is a fixed integer and k > 0) to reach the client. Let s be an orthogonal line segment where the k transmitter travels back and forth. A point p is covered by the guard if there exist a point q ∈ s such that is a line segment normal to s and at most k intersections with the boundary walls of the polygon. The objective is to minimize the sum of lengths of the sliding k transmitters to cover the entire polygon. In this paper we consider a modification in the above problem where instead of omnidirectional k transmitters we consider k transmitters which can transmit and receive signal orthogonally inside the polygon. The objective of the problem remains same and we termed this problem as modified minimum length sliding k transmitter problem. We develop an algorithm for this modified problem which finds the minimum length cover in O(n2) time.","PeriodicalId":508572,"journal":{"name":"Proceedings of the 10th International Conference on Networking, Systems and Security","volume":"19 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139167368","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

首页上一页