Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems最新文献

Pebble guided Treasure Hunt in Plane 鹅卵石引导寻宝在飞机上

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-05-10 DOI: 10.48550/arXiv.2305.06067

Adri Bhattacharya, B. Gorain, P. Mandal

{"title":"Pebble guided Treasure Hunt in Plane","authors":"Adri Bhattacharya, B. Gorain, P. Mandal","doi":"10.48550/arXiv.2305.06067","DOIUrl":"https://doi.org/10.48550/arXiv.2305.06067","url":null,"abstract":"We study the problem of treasure hunt in a Euclidean plane by a mobile agent with the guidance of pebbles. The initial position of the agent and position of the treasure are modeled as special points in the Euclidean plane. The treasure is situated at a distance at most $D>0$ from the initial position of the agent. The agent has a perfect compass, but an adversary controls the speed of the agent. Hence, the agent can not measure how much distance it traveled for a given time. The agent can find the treasure only when it reaches the exact position of the treasure. The cost of the treasure hunt is defined as the total distance traveled by the agent before it finds the treasure. The agent has no prior knowledge of the position of the treasure or the value of $D$. An Oracle, which knows the treasure's position and the agent's initial location, places some pebbles to guide the agent towards the treasure. Once decided to move along some specified angular direction, the agent can decide to change its direction only when it encounters a pebble or a special point. We ask the following central question in this paper: ``For given $k ge 0$, What is cheapest treasure hunt algorithm if at most $k$ pebbles are placed by the Oracle?\"We show that for $k=1$, there does not exist any treasure hunt algorithm that finds the treasure with finite cost. We show the existence of an algorithm with cost $O(D)$ for $k=2$. For $k>8$ we have designed an algorithm that uses $k$ many pebbles to find the treasure with cost $O(k^{2}) + D(sintheta' + costheta')$, where $theta'=frac{pi}{2^{k-8}}$. The second result shows the existence of an algorithm with cost arbitrarily close to $D$ for sufficiently large values of $D$.","PeriodicalId":92573,"journal":{"name":"Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems","volume":"3 1","pages":"141-156"},"PeriodicalIF":0.0,"publicationDate":"2023-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81484447","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

Consensus on an Unknown Torus with Dense Byzantine Faults 一个具有密集拜占庭断层的未知环面的共识

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-03-22 DOI: 10.1007/978-3-031-37765-5_9

Joseph Oglio, Kendric Hood, Gokarna Sharma, Mikhail Nesterenko

引用次数: 0

Distance-2-Dispersion: Dispersion with Further Constraints 距离-2-分散:具有进一步约束的分散

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-01-12 DOI: 10.48550/arXiv.2301.04938

Tanvir Kaur, Kaushik Mondal

{"title":"Distance-2-Dispersion: Dispersion with Further Constraints","authors":"Tanvir Kaur, Kaushik Mondal","doi":"10.48550/arXiv.2301.04938","DOIUrl":"https://doi.org/10.48550/arXiv.2301.04938","url":null,"abstract":"The aim of the dispersion problem is to place a set of $k(leq n)$ mobile robots in the nodes of an unknown graph consisting of $n$ nodes such that in the final configuration each node contains at most one robot, starting from any arbitrary initial configuration of the robots on the graph. In this work we propose a variant of the dispersion problem where we start with any number of robots, and put an additional constraint that no two adjacent nodes contain robots in the final configuration. We name this problem as Distance-2-Dispersion (D-2-D). However, even if the number of robots $k$ is less than $n$, it may not possible for each robot to find a distinct node to reside, maintaining our added constraint. Specifically, if a maximal independent set is already formed by the nodes which contain a robot each, then other robots, if any, who are searching for a node to seat, will not find one. Hence we allow multiple robots to seat on some nodes only if there is no place to seat. If $kgeq n$, it is guaranteed that the nodes with robots form a maximal independent set of the underlying network. The graph $G=(V, E)$ has $n$ nodes and $m$ edges, where nodes are anonymous. It is a port labelled graph, i.e., each node $u$ assigns a distinct port number to each of its incident edges from a range $[0,delta-1]$ where $delta$ is the degree of the node $u$. The robots have unique ids in the range $[1, L]$, where $L ge k$. Co-located robots can communicate among themselves. We provide an algorithm that solves D-2-D starting from a rooted configuration (i.e., initially all the robots are co-located) and terminate after $2Delta(8m-3n+3)$ synchronous rounds using $O(log Delta)$ memory per robot without using any global knowledge of the graph parameters $m$, $n$ and $Delta$, the maximum degree of the graph. We also provide $Omega(mDelta)$ lower bound on the number of rounds for the D-2-D problem.","PeriodicalId":92573,"journal":{"name":"Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems","volume":"25 1","pages":"157-173"},"PeriodicalIF":0.0,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76134622","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}

引用次数: 2

Case Study on the Performance of ML-Based Network Intrusion Detection Systems in SDN 基于机器学习的SDN网络入侵检测系统性能的实例研究

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-37765-5_7

Adnane Mzibri, R. Benaini, M. B. Mamoun

引用次数: 0

Comparing Causal Convergence Consistency Models 比较因果收敛一致性模型

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-37765-5_5

Sidi Mohamed Beillahi, A. Bouajjani, C. Enea

引用次数: 0

Edge-Based Bird Species Recognition via Active Learning 基于主动学习的边缘鸟类物种识别

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-37765-5_2

Hicham Bellafkir, M. Vogelbacher, Daniel Schneider, M. Mühling, Nikolaus Korfhage, Bernd Freisleben

引用次数: 0

A Peer to Peer Federated Graph Neural Network for Threat Intelligence 面向威胁情报的点对点联邦图神经网络

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-37765-5_3

Mouad Bouharoun, Bilal Taghdouti, M. Erradi

引用次数: 0

A Formal Analysis of Karn's Algorithm Karn算法的形式分析

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-37765-5_4

Max von Hippel, K. McMillan, C. Nita-Rotaru, L. Zuck

引用次数: 2

Detection of Fake News Through Heterogeneous Graph Interactions 基于异构图交互的假新闻检测

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-37765-5_1

Raed Alharbi, Tre' R. Jeter, M. Thai

引用次数: 0

Beyond Locks and Keys: Structural Equation Modeling Based Framework to Explore Security Breaches Through the Lens of Crime Theories 超越锁和钥匙:基于结构方程模型的框架，通过犯罪理论的镜头探索安全漏洞

Proceedings of the ... International Conference on Embedded Networked Sensor Systems. International Conference on Embedded Networked Sensor Systems Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-37765-5_8

Narjisse Nejjari, Karim Zkik, H. Benbrahim, Mounir Ghogho

引用次数: 0