Distributed Computing and Intelligent Technology
20th International Conference, ICDCIT 2024, Bhubaneswar, India, January 17–20, 2024, Proceedings
Page
%P
-
Book and Conference Proceedings
-
Article
Deep recurrent Q-learning for energy-constrained coverage with a mobile robot
In this paper, we study the problem of coverage of an environment with an energy-constrained robot in the presence of multiple charging stations. As the robot’s on-board power supply is limited, it might not h...
-
Chapter and Conference Paper
Exploiting Security and Privacy Issues in Human-IoT Interaction Through the Virtual Assistant Technology in Amazon Alexa
Smart connected devices, called Smart IoTs are becoming a heavily adopted product around the world. They have been integrated into their service platform and are spreading rapidly in households as common produ...
-
Chapter and Conference Paper
A Constant-Factor Approximation Algorithm for Online Coverage Path Planning with Energy Constraint
We study the problem of coverage planning by a mobile robot with a limited energy budget. The objective of the robot is to cover every point in the environment while minimizing the traveled path length. The en...
-
Chapter and Conference Paper
Consensus on an Unknown Torus with Dense Byzantine Faults
We present a solution to consensus on a torus with Byzantine faults. Any solution to classic consensus that is tolerant to f Byzantine faults requires ...
-
Chapter and Conference Paper
Ordered Scheduling in Control-Flow Distributed Transactional Memory
Consider the control-flow model of transaction execution in a distributed system modeled as a communication graph where shared objects positioned at nodes of the graph are immobile but the transactions accessing ...
-
Book and Conference Proceedings
Distributed Computing and Intelligent Technology
19th International Conference, ICDCIT 2023, Bhubaneswar, India, January 18–22, 2023, Proceedings
-
Chapter and Conference Paper
Dispersion of Mobile Robots in Spite of Faults
We consider the problem of dispersion that asks a group of \(k\le n\) k ≤ ...
-
Article
Dynamic scheduling in distributed transactional memory
We investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the obj...
-
Chapter and Conference Paper
Flexible Scheduling of Transactional Memory on Trees
We study the efficiency of executing transactions in a distributed transactional memory system. The system is modeled as a wired network with the topology of a tree. Contrary to previous approaches, we allow t...
-
Chapter and Conference Paper
Dispersion of Mobile Robots on Directed Anonymous Graphs
Given any arbitrary initial configuration of \(k\le n\) k ≤ n ...
-
Chapter and Conference Paper
Blockchain in Dynamic Networks
We consider blockchain in dynamic networks. We define the Blockchain Decision Problem. It requires miners that maintain the blockchain to confirm whether a particular block is accepted. We establish the necess...
-
Article
Fast Scheduling in Distributed Transactional Memory
We investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the obj...
-
Chapter and Conference Paper
On Optimal Doorway Egress by Autonomous Robots
We consider the distributed setting of n autonomous mobile robots operating in Look-Compute-Move (LCM) cycles in the Euclidean plane. In this paper, we introduce and study the problem of exiting n robots position...
-
Chapter and Conference Paper
Weak Amnesiac Flooding of Multiple Messages
Flooding is a fundamental concept in distributed computing. In flooding, typically, a node forwards a message to its neighbors for the first time when it receives a message. Later if the node receives the same...
-
Chapter and Conference Paper
Byzantine Geoconsensus
We define and investigate consensus for a set of N processes embedded in the d-dimensional plane, \(d\ge 2\) ...
-
Chapter and Conference Paper
Brief Announcement: Byzantine Geoconsensus
We define and investigate the consensus problem for a set of N processes embedded on the d-dimensional plane, \(d\ge 2\) d ≥ 2 , which we call the geoconsensus problem. The processes have unique coordinates ...
-
Chapter and Conference Paper
Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots
We consider \(K=(k+1)\times (k+1)\) K = ( k + 1 ) × ( k + 1 ) autonomous mobile robots operating on an anonymous \(N=(n+1)\times (n+1)\) N = ( n + 1 ) × ( n + 1 ) -node grid, \(n=k\cdot d, d\ge 2\)
-
Chapter and Conference Paper
Dispersion of Mobile Robots on Grids
The dispersion problem on graphs asks \(k\le n\) robots initially placed arbitrarily on the nodes of an n-node anonymous graph to reposition autonomously to reach a configuration in which each robot is on a dist...
-
Chapter and Conference Paper
Brief Announcement Blockguard: Adaptive Blockchain Security
We change the security of blockchain transactions by varying the size of consensus committees. To improve performance, such committees operate concurrently. We present two algorithms that allow adaptive securi...
