Regional consecutive leader election in mobile ad-hoc networks

Chung, Hyun Chul; Robinson, Peter; Welch, Jennifer L.

doi:10.1145/1860684.1860701

Cited by 14 publications

(38 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Existing solutions to dynamic leader election problem consider only deterministic algorithms [10,11], but the powerful adversary knows the execution of algorithm in advance.…”

Section: Related Workmentioning

confidence: 99%

“…In this paper, we study the multi-leader election problem in dynamic sensor networks, the main reason is that if there exist multiple leaders in the network, it is convenient to achieve power management, resource allocation, message collection, and energy saving. There have been many results for multi-leader election problem, such as in [10]; Chung et al applied "regional consecutive leader election" to mark the process of leader election.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multi-leader election in dynamic sensor networks

Meng

Jiang

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

The leader election problem is one of the fundamental problems in distributed computing. Different from most of the existing results studying the multi-leader election in static networks or one leader election in dynamic networks, in this paper, we focus on the multi-leader election in dynamic sensor networks where nodes are deployed randomly. A centralized simple leader election algorithm (VLE), a distributed leader election algorithm (NMDLE), and a multi-leader election algorithm (PSMLE) are proposed so as to elect multi-leaders for the purpose of saving energy and prolonging the network lifetime, respectively. Specifically, the proposed algorithms aim at using less leaders to control the whole network, which is controlled by at least k opt leaders, here k opt denotes the optimal number of network partitions. Then we analyze the impacts of the sleep scheme of nodes and node moving on energy consumption and establish a theoretical model for energy cost. Finally, we provide extensive simulation results valuating the correctness of theoretical analysis.

show abstract

“…Existing solutions to dynamic leader election problem consider only deterministic algorithms [10,11], but the powerful adversary knows the execution of algorithm in advance.…”

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Multi-leader election in dynamic sensor networks

Meng

Jiang

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Let α ′ be a closed execution fragment within the given execution α, 6 and let j be a process. Then define:…”

Section: Acknowledgment Correctnessmentioning

confidence: 99%

“…Both are initially empty. 6 Formally, that means that there exist fragments α ′′ and α ′′′ such that α = α ′′ α ′ α ′′′ , and moreover, the first state of α ′ is the last state of α ′′ . Notice, this allows α ′ to begin and/or end in the middle of a trajectory.…”

Section: The Multi-message Broadcast Problemmentioning

confidence: 99%

See 1 more Smart Citation

Multi-message broadcast with abstract MAC layers and unreliable links

Ghaffari¹,

Kantor²,

Lynch³

et al. 2014

Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

We study the multi-message broadcast problem using abstract MAC layer models of wireless networks. These models capture the key guarantees of existing MAC layers while abstracting away low-level details such as signal propagation and contention. We begin by studying upper and lower bounds for this problem in a standard abstract MAC layer model-identifying an interesting dependence between the structure of unreliable links and achievable time complexity. In more detail, given a restriction that devices connected directly by an unreliable link are not too far from each other in the reliable link topology, we can (almost) match the efficiency of the reliable case. For the related restriction, however, that two devices connected by an unreliable link are not too far from each other in geographic distance, we prove a new lower bound that shows that this efficiency is impossible. We then investigate how much extra power must be added to the model to enable a new order of magnitude of efficiency. In more detail, we consider an enhanced abstract MAC layer model and present a new multi-message broadcast algorithm that (under certain natural assumptions) solves the problem in this model faster than any known solutions in an abstract MAC layer setting. IntroductionMost existing work on distributed algorithms for wireless networks assumes low-level synchronous models that require algorithms to deal directly with link-layer issues such as signal fading (e.g., [22,20,13]) and contention (e.g., [2, 16, 28, 12]). These low-level models are appropriate for answering basic science questions about the capabilities and limits of wireless communication. We argue, however, that they are often not appropriate for designing and analyzing algorithms meant for real world deployment, because: (1) they fail to capture the unpredictable reality of real radio signal propagation (which tends not to follow simple collision or fading rules [33]); (2) they do not address issues like network co-existence (it is rarely true that your algorithm is alone in using the wireless channel); and (3) they ignore the presence of general purpose MAC layers which are standard and hard to bypass in existing devices. * Supported in a part by AFOSR FA9550-13-1-0042 and NSF grants Nos. CCF-0939370, CCF-1217506, and CCF-AF-0937274. 1In [29,30], we introduced the abstract MAC layer approach as an alternative to low-level models for studying wireless algorithms. This approach moves the algorithm designer up the network stack by modeling the basic guarantees of most existing wireless MAC layers. In doing so, it abstracts away low level issues such as signal fading and contention, instead capturing the impact of this behavior on higher layers with model uncertainty. Because abstract MAC layers are defined to maintain the basic guarantees of most standard wireless MAC layers, algorithms developed in such models can be deployed on existing devices while maintaining their formally proved properties.In this paper, we study the basic communication primitive of mult...

show abstract

Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks

et al. 2015

Self Cite

View full text Add to dashboard Cite

We study distributed agreement in synchronous directed dynamic networks, where an omniscient message adversary controls the presence/absence of communication links. We prove that consensus is impossible under a message adversary that guarantees weak connectivity only, and introduce vertex-stable root components (VSRCs) as a means for circumventing this impossibility: A VSRC(k, d) message adversary guarantees that, eventually, there is an interval of d consecutive rounds where every communication graph contains at most k strongly connected components consisting of the same processes (with possibly varying interconnect topology), which have at most out-going links to the remaining processes. We present a consensus algorithm that works correctly under a VSRC(1, 4H + 2) message adversary, where H is the dynamic causal network diameter. Our algorithm maintains local estimates of the communication graphs, and applies techniques for detecting network stability and univalent system configurations. Several related impossibility results and lower bounds, in particular, that neither a VSRC(1, H − 1) message adversary nor a VSRC(2, ∞) one allow to solve consensus, reveal that there is not much hope to deal with (much) stronger message adversaries here. However, we show that gracefully degrading consensus, which degrades to general k-set agreement in case of unfavorable network conditions, allows to cope with stronger message adversaries: We provide a k-uniform k-set agreement algorithm, where the number of system-wide decision values k is not encoded in the algorithm, but rather determined by the actual power of the message adversary in a run: Our algorithm guarantees at most k decision values under a VSRC(n, d) + MAJINF(k) message adversary, which combines VSRC(n, d) (with some small value of d, ensuring termination) with some information flow guarantee MAJINF(k) between certain VSRCs (ensuring k-agreement).Since related impossibility results reveal that a VSRC(k, d) message adversary is too strong for solving k-set agreement and that some information flow between VSRCs is mandatory for this purpose as well, our results provide a significant step towards the exact solvability/impossibility border of general k-set agreement in directed dynamic networks.Dynamic networks, instantiated, e.g., by wireless sensor networks, mobile ad-hoc networks and vehicle area networks, are becoming ubiquitous nowadays. The primary properties of such networks are sets of participants (called processes in the sequel) that are a priori unknown and potentially changing, timevarying connectivity between processes, and the absence of a central control. Dynamic networks is an important and very active area of research [37].Accurately modeling dynamic networks is challenging, for several reasons: First, process mobility, process crashes/recoveries, deliberate joins/leaves, and peculiarities in the low-level system design like duty-cycling (used to save energy in wireless sensor networks) make static communication topologies, as typically used in class...

show abstract

Regional consecutive leader election in mobile ad-hoc networks

Cited by 14 publications

References 11 publications

Multi-leader election in dynamic sensor networks

Multi-leader election in dynamic sensor networks

Multi-message broadcast with abstract MAC layers and unreliable links

Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks

Contact Info

Product

Resources

About