Self-stabilizing Synchronization in Mobile Sensor Networks with Covering

Beauquier, Joffroy; Burman, Janna

doi:10.1007/978-3-642-13651-1_26

Cited by 6 publications

(19 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A scheduler schedules the next event according to the cover times of agents. Even though this type of the local fairness condition seems relatively strong, many problems stay impossible to solve in such a model (see, e.g., [6,9]). In this work, we prove a similar impossibility result stating that in the model with only bounded state agents, mutual exclusion has no solution (Sec.…”

mentioning

confidence: 99%

“…This result can be easily extended to the group mutual exclusion problem as well. For circumventing the impossibility result, as in [6,9,10], we introduce a special agent, the base station (BS). We assume that BS has a memory size proportional to the number of the other system agents.…”

mentioning

confidence: 99%

“…However, it uses strong schemes of "mobile agents" and of oracles. In [6], a simple self-stabilizing algorithm for GME is proposed for the same model as here. However, in this solution, agents can spend only some bounded predefined period in the critical session (CS).…”

mentioning

confidence: 99%

“…We design our algorithms in combination with the phase clock tool proposed in [6]. This synchronization tool provides an easy way to organize protocol execution into phases.…”

mentioning

confidence: 99%

“…This synchronization tool provides an easy way to organize protocol execution into phases. However, the tool in [6] allows to define and run only phases with bounded duration. In order to be able to grant to an agent an unbounded (but finite) amount of time in CS, we extend the phase clock with the mechanism allowing it to manage also the unbounded duration phases (Sec.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering

Beauquier

Burman

2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents and proves correct two self-stabilizing deterministic algorithms solving the mutual exclusion and the group mutual exclusion problems in the model of population protocols with covering. In this variant of the population protocol model, a local fairness is used and bounded state anonymous mobile agents interact in pairs according to constraints expressed in terms of their cover times. The cover time is an indicator of the "time" for an agent to communicate with all the other agents. This indicator is expressed in the number of the pairwise communications (events) and is unknown to agents. In the model, we also assume the existence of a particular agent, the base station. In contrast with the other agents, it has a memory size proportional to the number of agents. We prove that without this kind of assumption, the mutual exclusion problem has no solution. The algorithms in the paper use a phase clock tool. This is a synchronization tool that was recently proposed in the model we use. For our needs, we extend the functionality of this tool to support also phases with unbounded (but finite) duration. This extension seems to be useful also in the future works.

show abstract

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

“…We design our algorithms in combination with the phase clock tool proposed in [6]. This synchronization tool provides an easy way to organize protocol execution into phases.…”

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations