Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler

Gradinariu, Maria; Johnen, Colette

doi:10.1007/3-540-44681-8_67

Cited by 28 publications

(26 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Step complexity Round complexity [10,12,9] sequential adversarial O(m) [7] distributed adversarial finite [2] distributed fair…”

Section: Reference Daemonmentioning

confidence: 99%

“…By using randomization, Gradinariu and Johnen [7] provide a scheme to give processes a local name that is unique within distance 2, and use this scheme to run Hsu and Huang's algorithm under an adversarial distributed daemon. However, only a finite stabilization time is proved.…”

Section: Introductionmentioning

confidence: 99%

“…As a side effect, we improve the best known algorithm for the adversarial daemon by lowering the environment requirements (distributed vs. sequential). To break symmetry, we assume that node identifiers are unique within distance 2 (this can be done using the scheme of [7,2]). The following table compares features of aforementioned algorithms and our (best features for each category is presented in boldface).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A New Self-stabilizing Maximal Matching Algorithm

Manne

Mjelde

Pilard

et al. 2007

Structural Information and Communication Complexity

View full text Add to dashboard Cite

The maximal matching problem has received considerable attention in the selfstabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon, the sequential adversarial daemon, as well as the synchronous daemon. In the following we present a single self-stabilizing algorithm for this problem that unites all of these algorithms in that it stabilizes in the same number of moves as the previous best algorithms for the sequential adversarial, the distributed fair, and the synchronous daemon. In addition, the algorithm improves the previous best moves complexities for the distributed adversarial daemon from O(n 2 ) and O(δm) to O(m) where n is the number of processes, m is the number of edges, and δ is the maximum degree in the graph. Key-words:Distributed systems, Distributed algorithm, Self-stabilization, Maximal matching, Complexity * University of Bergen, Norway, {fredrikm,mortenm}@ii.uib

show abstract

“…Step complexity Round complexity [10,12,9] sequential adversarial O(m) [7] distributed adversarial finite [2] distributed fair…”

Section: Reference Daemonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A New Self-stabilizing Maximal Matching Algorithm

Manne

Mjelde

Pilard

et al. 2007

Structural Information and Communication Complexity

View full text Add to dashboard Cite

show abstract

“…This problem is known as the neighborhood unique naming (NUN) problem, and is similar to the classical coloring graph problem with conditions at distance 2. In [8] it is proven that there is no determinist self-stabilizing algorithm to solve the NUN problem in uniform and anonymous networks under distributed scheduler and proposes a self-stabilizing probabilistic algorithm. The algorithm is very simple.…”

Section: Proposalmentioning

confidence: 99%

“…Unlike several initialization protocols [8,9], we have chosen to keep state variables private to each node, i.e. we avoid the use of caches with partial knowledge of the state variables of other nodes.…”

Section: Basic Protocolmentioning

confidence: 99%

Robust sensor self-initialization: Whispering to avoid intruders

Ribeiro

2007

The International Conference on Emerging Security Information, Systems, and Technologies (SECUREWARE 2007)

View full text Add to dashboard Cite

Abstract. Wireless Sensor Networks (WSN) are becoming bigger and with this growth comes the need for new automatic mechanisms for initializations done by hand. One of those mechanisms is the assignment of addresses to nodes. Several solution were already proposed for mobile ad-hoc networks but they either: i) do not scale well for WSN; ii) have no energy constraints; iii) have no security considerations; iv) or have no mechanisms to handle fusion of network partitions. We proposed an address self-assignment protocol which: uses negative acknowledgements and an improved version of a flood control mechanism to minimize the energy spent; uses a technique named whispering to achieve robustness against malicious nodes; and uses private nicknames to handle fusion of network partitions.

show abstract

Joint processing of topology control and channel assignment in wireless ad hoc networks

Li¹,

Fan²,

Letaief³

2008

Wireless Communications

View full text Add to dashboard Cite

Network topology construction and its channel assignment for each node in the constructed network topology are two main problems in the initialization of topology building. Topology control is an effective way to solve the problem of topology building. To investigate the joint effect of topology control and channel assignment, we propose a joint processing scheme composed of a k‐Neighbor topology control algorithm and a greedy channel assignment (GCA) algorithm in this paper. Based on this joint processing scheme, the relationships between the energy consumption, the total required channel number and the network connectivity are discussed. We also discuss the impact of some parameters on the performance of networks in terms of the path loss factor, node density, maximum node degree, etc. Our main contributions in this paper is that we find that topology control has a good effect on improving the performance of channel assignment, and the proposed joint processing scheme can reduce the required channel number effectively, compared with its theoretical upper bound. In particular, if the node degree in a network is not more than k, various simulations indicate that the required channel number is not more than 2k + 1. Copyright © 2008 John Wiley & Sons, Ltd.

show abstract

Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler

Cited by 28 publications

References 10 publications

A New Self-stabilizing Maximal Matching Algorithm

A New Self-stabilizing Maximal Matching Algorithm

Robust sensor self-initialization: Whispering to avoid intruders

Joint processing of topology control and channel assignment in wireless ad hoc networks

Contact Info

Product

Resources

About