Results 11  20
of
29
A SelfStabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Graph
 Computers and Mathematics with Applications
, 2003
"... In a graph # # #####, a set # # # is said to be total dominating if every # # # is adjacent to some member of #. When the graph represents a communication network, a total dominating set corresponds to a collection of servers having a certain desirable backup property, namely, that every server is a ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
In a graph # # #####, a set # # # is said to be total dominating if every # # # is adjacent to some member of #. When the graph represents a communication network, a total dominating set corresponds to a collection of servers having a certain desirable backup property, namely, that every server is adjacent to some other server. Selfstabilization, introduced by Dijkstra [1, 2], is the most inclusive approach to fault tolerance in distributed systems [3, 4]. We propose a new selfstabilizing distributed algorithm for finding a minimal total dominating set in an arbitrary graph. We also show how the basic ideas behind the proposed protocol can be generalized to solve other related problems.
Selfstabilizing deterministic time division multiple access for sensor networks
 AIAA JOURNAL OF AEROSPACE COMPUTING, INFORMATION, AND COMMUNICATION (JACIC)
, 2006
"... An algorithm for time division multiple access (TDMA) is found to be applicable in converting existing distributed algorithms into a model that is consistent with sensor networks. Such a TDMA service needs to be selfstabilizing so that in the event of corruption of assigned slots and clock drift, i ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
An algorithm for time division multiple access (TDMA) is found to be applicable in converting existing distributed algorithms into a model that is consistent with sensor networks. Such a TDMA service needs to be selfstabilizing so that in the event of corruption of assigned slots and clock drift, it recovers to states from where TDMA slots are consistent. Previous selfstabilizing solutions for TDMA are either randomized or assume that the topology is known upfront and cannot change. Thus, the question of feasibility of selfstabilizing deterministic TDMA algorithm where the topology is unknown remains open. In this paper, we present a selfstabilizing deterministic algorithm for TDMA in networks where a sensor is only aware of its neighbors. To our knowledge, this is the first such algorithm that achieves these properties. Moreover, this is the first algorithm that demonstrates the feasibility of stabilizationpreserving deterministic transformation of a program in sharedmemory model on an arbitrary topology into a program that is consistent with the sensor network model.
Eventually kBounded WaitFree Distributed Daemons
, 2007
"... Waitfree scheduling is unsolvable in asynchronous messagepassing systems subject to crash faults. Given the practical importance of this problem, we examine its solvability under partial synchrony relative to the eventually perfect failure detector 3P. Specifically, we present a new oraclebased s ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Waitfree scheduling is unsolvable in asynchronous messagepassing systems subject to crash faults. Given the practical importance of this problem, we examine its solvability under partial synchrony relative to the eventually perfect failure detector 3P. Specifically, we present a new oraclebased solution to the dining philosophers problem that is waitfree in the presence of arbitrarily many crash faults. Additionally, our solution satisfies eventual kbounded waiting, which guarantees that every execution has an infinite suffix where no process can overtake any live hungry neighbor more than k consecutive times. Finally, our algorithm uses only bounded space, boundedcapacity channels, and is also quiescent with respect to crashed processes. Among other practical applications, our results support waitfree distributed daemons for fairly scheduling selfstabilizing protocols in the presence of crash faults.
SelfStabilizing Distributed Algorithm for Strong Matching in a System Graph
 In Proceedings of HiPC 2003, volume LNCS 2913
, 2003
"... We present a new selfstabilizing algorithm for finding a maximal strong matching in an arbitrary distributed network. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2]. The concepts behind the algorithm, using Ids in the newtork ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We present a new selfstabilizing algorithm for finding a maximal strong matching in an arbitrary distributed network. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2]. The concepts behind the algorithm, using Ids in the newtork, promise to have applications for other graph theoretic primitives.
relationships between communication models in networks using atomic registers
 In IPDPS'2006 Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium
, 2006
"... registers ..."
(Show Context)
Alternators in read/write atomicity
 Inform. Process. Lett
, 2005
"... The alternator problem requires that in legitimate states no two neighboring processes are enabled and between two executions of a process, its neighbors execute at least once. In this paper, we present a solution for the alternator problem that has the following properties: (1) If the underlying to ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
The alternator problem requires that in legitimate states no two neighboring processes are enabled and between two executions of a process, its neighbors execute at least once. In this paper, we present a solution for the alternator problem that has the following properties: (1) If the underlying topology is arbitrary and the program is executed in read/write atomicity then it is stabilizing faulttolerant, i.e., starting from an arbitrary state, it recovers to states from where its specification is satisfied, (2) If the underlying topology is bipartite and the program is executed in the concurrent execution model then it provides stabilizing faulttolerance and maximal concurrency, (3) If the underlying topology is linear or tree then the program provides both these properties, and (4) The program uses bounded state if the network size is known. To our knowledge, this is the first alternator program that achieves these properties.
Rapid Prototyping and Quick Deployment of Sensor Networks
, 2006
"... Eventdriven programming platforms for sensor networks require the programmers to deal with several challenges including buffer management, stack management, and flow control. To simplify the design of sensor network protocols, several highlevel primitives are proposed. However, these primitives ha ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Eventdriven programming platforms for sensor networks require the programmers to deal with several challenges including buffer management, stack management, and flow control. To simplify the design of sensor network protocols, several highlevel primitives are proposed. However, these primitives have to be implemented in an existing eventdriven programming platform and most of them still require the programmers to use the same platform (though some intricate details of the platform are hidden). In this dissertation, we develop tools and protocols that enable the programmers to rapidly prototype and quickly deploy sensor network protocols. We propose to reuse existing abstract models from distributed computing literature (e.g., read/write model, sharedmemory model). Since these models hide several lowlevel challenges of the target system, programs written in these models are simple, easy to understand, and concise. These abstract programs must then be transformed into a model consistent with sensor networks. The main contributions of this dissertation are as follows.
A Distributed and Deterministic TDMA Algorithm for WriteAllWithCollision Model
, 2008
"... Several selfstabilizing time division multiple access (TDMA) algorithms are proposed for sensor networks. In addition to providing a collisionfree communication service, such algorithms enable the transformation of programs written in abstract models considered in distributed computing literature ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Several selfstabilizing time division multiple access (TDMA) algorithms are proposed for sensor networks. In addition to providing a collisionfree communication service, such algorithms enable the transformation of programs written in abstract models considered in distributed computing literature into a model consistent with sensor networks, i.e., write all with collision (WAC) model. Existing TDMA slot assignment algorithms have one or more of the following properties: (i) compute slots using a randomized algorithm, (ii) assume that the topology is known upfront, and/or (iii) assign slots sequentially. If these algorithms are used to transform abstract programs into programs in WAC model then the transformed programs are probabilistically correct, do not allow the addition of new nodes, and/or converge in a sequential fashion. In this paper, we propose a selfstabilizing deterministic TDMA algorithm where a sensor is aware of only its neighbors. We show that the slots are assigned to the sensors in a concurrent fashion and starting from arbitrary initial states, the algorithm converges to states where collisionfree communication among the sensors is restored. Moreover, this algorithm facilitates the transformation of abstract programs into programs in WAC model that are deterministically correct.
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time
, 2003
"... We present a selfstabilizing algorithm for finding a generalized maximal matching (#matching) in an arbitrary distributed network. We show that the algorithm converges in #### moves under an unfair central demon independent of the #values at different nodes. The algorithm is capable of working wi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We present a selfstabilizing algorithm for finding a generalized maximal matching (#matching) in an arbitrary distributed network. We show that the algorithm converges in #### moves under an unfair central demon independent of the #values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].
Selfstabilizing distributed local mutual exclusion
, 2002
"... A selfstabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. Th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
A selfstabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have the same identifiers. Under the assumption that the process identifiers are chromatic, this paper proposes two selfstabilizing local mutual exclusion algorithms; one assumes a tree as the topology of communication network and requires 3 states per process, while the other, which works on any communication network, requires n + 1 states per process, where n is the number of processes in the system. We also show that the process identifiers being chromatic is close to necessary for a system to have a selfstabilizing local mutual exclusion algorithm. We adopt the shared memory model for communication and the unfair distributed daemon for process scheduling.