Results 1 
9 of
9
Selfstabilization in selforganized wireless multihop networks
 In Proc. of the 2nd International Workshop on Wireless Ad Hoc Networking WWAN
, 2005
"... Old City Publishing Group. ..."
(Show Context)
T.: A selfstabilizing minimal dominating set algorithm with safe convergence
 In: IPDPS (2006
"... A selfstabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory corruption. In this paper, we formulate a concept of safe convergence in the framework of selfstabilization. An ordinary s ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
A selfstabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory corruption. In this paper, we formulate a concept of safe convergence in the framework of selfstabilization. An ordinary selfstabilizing algorithm has no safety guarantee while it is in converging from any initial configuration. The safe convergence property guarantees that a system quickly converges to a safe configuration, and then, it gracefully moves to an optimal configuration without breaking safety. Then, we propose a minimal independent dominating set algorithm with safe convergence property. Especially, the proposed algorithm computes the lexicographically first minimal independent dominating set according to the process identifier as a priority. The priority scheme can be arbitrarily changed such as stability, battery power and/or computation power of node. 1.
1 Reader AntiCollision in Dense RFID Networks With Mobile Tags
, 2011
"... Abstract—In a RadioFrequency IDentification network, while several readers are placed close together toimprove coverage and consequently read rate, readerreader collision problems happen frequently and inevitably. High probability of collision not only impairs the benefit of multireader deploymen ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract—In a RadioFrequency IDentification network, while several readers are placed close together toimprove coverage and consequently read rate, readerreader collision problems happen frequently and inevitably. High probability of collision not only impairs the benefit of multireader deployment, but also results in misreadings in moving RFID tags. In order to eliminate or reduce reader collisions, we propose an Adaptive Color based Reader Anticollision Scheduling algorithm (ACoRAS) for 13.56 MHz RFID technology where every reader is assigned a set of colors that allows it to read tags during a specific time slot within a time frame. Only the reader holding a color (token) can read at a time. Due to application constraints, the number of available colors should be limited, a perfect coloring scheme is not always feasible. ACoRAS tries to assign colors in such a way that overlapping areas at a given time are reduced. To the best of our knowledge ACoRAS is the first reader anticollision algorithm which considers, within its design, both application and hardware requirements in reading tags. We show, through extensive simulations, that ACoRAS outperforms several anticollision methods and detects more than 99 % of mobile tags while fitting application requirements. I.
A SelfStabilizing Algorithm for Finding a Minimal Distance2 Dominating Set in Distributed Systems
"... The study of various dominating set problems is an important area within graph theory. In applications, a dominating set in a system can be considered as an ideal place for allocating resources. And, a minimal dominating set allows allocating a smaller number of resources. Distanceversions of the c ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The study of various dominating set problems is an important area within graph theory. In applications, a dominating set in a system can be considered as an ideal place for allocating resources. And, a minimal dominating set allows allocating a smaller number of resources. Distanceversions of the concept of minimal dominating sets are more applicable to modeling realworld problems, such as placing a smaller number of objects within acceptable distances of a given population. However, due to the main restriction that any processor in a distributed system can only access the data of its direct neighbors, a selfstabilizing algorithm for finding a minimal distancek (with k ≥ 2) dominating set is hard to get, and its correctness is hard to verify. In this paper, a selfstabilizing algorithm for finding a minimal distance2 dominating set is proposed. The algorithm can be applied to any distributed system that operates under the central demon model. The correctness of the algorithm is verified.
Time and SpaceEfficient SelfStabilizing Algorithms
, 2012
"... In a distributed system error handling is inherently more difficult than in conventional systems that have a central control unit. To recover from an erroneous state the nodes have to cooperate and coordinate their actions based on local information only. Selfstabilization is a general approach to ..."
Abstract
 Add to MetaCart
In a distributed system error handling is inherently more difficult than in conventional systems that have a central control unit. To recover from an erroneous state the nodes have to cooperate and coordinate their actions based on local information only. Selfstabilization is a general approach to make a distributed system tolerate arbitrary transient faults by design. A selfstabilizing algorithm reaches a legitimate configuration in a finite number of steps by itself without any external intervention, regardless of the initial configuration. Furthermore, once having reached legitimacy this property is preserved. An important characteristic of an algorithm is its worstcase runtime and its memory requirements. This thesis presents new time and spaceefficient selfstabilizing algorithms for wellknown problems in algorithmic graph theory and provides new complexity analyses for existing algorithms. The main focus is on proof techniques used in the complexity analyses and the design of the algorithms. All algorithms presented in this thesis assume the most general concept with respect to concurrency.
SELFSTABILIZING GRAPH PROTOCOLS
 PARALLEL PROCESSING LETTERS
, 2006
"... We provide selfstabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggybacking on the ..."
Abstract
 Add to MetaCart
We provide selfstabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggybacking on the beacon messages that nodes already use.
LinearTime SelfStabilizing Algorithms for Disjoint Independent Sets
, 2012
"... A set S of nodes in a graph G = (V,E) is independent if no two nodes in S are adjacent. We present two types of selfstabilizing algorithms for finding disjoint independent sets R and B. In one type, R is maximal independent in G and B is maximal independent in the induced subgraph G[V − R]. In the ..."
Abstract
 Add to MetaCart
A set S of nodes in a graph G = (V,E) is independent if no two nodes in S are adjacent. We present two types of selfstabilizing algorithms for finding disjoint independent sets R and B. In one type, R is maximal independent in G and B is maximal independent in the induced subgraph G[V − R]. In the second type, R is maximal independent in G[V − B] and B is maximal independent in G[V − R]. Both the central and distributed schedulers are considered.