In this article, we outline an asynchronous boundary broadcast algorithm that upholds three key principles: boundary safety, propagation 1-safety, and propagation reliability. Boundary safety maintains the integrity o...
详细信息
ISBN:
(纸本)9798350370058;9798350370164
In this article, we outline an asynchronous boundary broadcast algorithm that upholds three key principles: boundary safety, propagation 1-safety, and propagation reliability. Boundary safety maintains the integrity of boundary processes by separating completed processes from others. Propagation 1-safety ensures that once a message is sent from a genuine source, it cannot be further disseminated if it originates from an unauthorized source. Propagation reliability guarantees that each process within the system receives a legitimate message exactly once. The algorithm is designed to initiate from any initial configuration and bears significance for the development of secure network protocols and command and control systems.
We present a deterministic distributed Propagation of information with Feedback (PIF) protocol in arbitrary rooted networks. The proposed algorithm does not use a pre-constructed spanning tree. The protocol is self-st...
详细信息
ISBN:
(纸本)0769510779
We present a deterministic distributed Propagation of information with Feedback (PIF) protocol in arbitrary rooted networks. The proposed algorithm does not use a pre-constructed spanning tree. The protocol is self-stabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is guaranteed to behave according to its specification. Every PIF wave initiated by the root inherently creates a tree in the graph. So, the tree is dynamically created according to the progress of the PIF wave. This allows our PIF algorithm to take advantage of the relative speed of different components of the network. The proposed algorithm can be easily used to implement any self-stabilizing system which requires a (self-stabilizing) wave protocol running on an arbitrary network.
We present the first snap-stabilizing Propagation Of In formation with Feedback (PIF) protocol in arbitrary networks. A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behav...
详细信息
ISBN:
(纸本)0769515851
We present the first snap-stabilizing Propagation Of In formation with Feedback (PIF) protocol in arbitrary networks. A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behaves according to its specification. Our protocol is distributed, deterministic, and does not use a pre-constructed spanning tree.
In this paper, we first show the condition under which the transient faults are observable and the safety requirements are satisfied for a broadcast algorithm. Then we propose the first safe fault-containing and self-...
详细信息
ISBN:
(纸本)9781665497794
In this paper, we first show the condition under which the transient faults are observable and the safety requirements are satisfied for a broadcast algorithm. Then we propose the first safe fault-containing and self-healing broadcast algorithm for locally observable faults in tree networks. A locally observable transient fault refers to a transient fault that perturbs the state of a process such that a faulty state of a process could be distinguished from a non-faulty state by all neighbours of the faulty process, and locally non-observable transient faults, otherwise. Our proposed algorithm contains and self-heals an unlimited number of transient faults in at most O(3) rounds provided that any two faulty processes are separated by two non-faulty processes.
In swarm robotics , it is necessary to develop methods and strategies that guide the collective execution of tasks by the robots. The design of such tasks can be done considering it as a collection of simpler behavior...
详细信息
In swarm robotics , it is necessary to develop methods and strategies that guide the collective execution of tasks by the robots. The design of such tasks can be done considering it as a collection of simpler behaviors, called subtasks . In this paper, the wave Swarm is presented as a general strategy to manage the sequence of subtasks that compose the collective navigation , which is an important task in swarm robotics. The proposed strategy is based mainly on the execution of wave algorithms. The swarm is viewed as a distributed system, wherein the communication is achieved by message passing among robot's neighborhood. Message propagation delimits the start and end of each subtask. Simulations are performed to demonstrate that controlled navigation of robot swarms/clusters is achieved with three subtasks, which are recruitment, alignment and movement.
暂无评论