Uniform leader election protocols for radio networks

Nakano, Koji; Olariu, Stephan

doi:10.1109/icpp.2001.952068

Cited by 41 publications

(62 citation statements)

References 6 publications

(6 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each of the receiving clusterheads will, in turn, calculate the next virtual relay and attempt to transmit, participating in a local competition, the winner of which will be the only one to forward the message further. Similarly to leader election approaches (see [20]), whenever a message is delivered by a clusterhead c ∈ C i,j (the fastest one), any other c ′ ∈ C i,j will receive it and thus it will be informed that the message is already forwarded. In addition, as previously mentioned, because of the assumption of omnidirectional antennas, clusterheads that are not selected to participate in the path towards the sink may receive the message.…”

Section: Basic Routingmentioning

confidence: 99%

VIBE: An energy efficient routing protocol for dense and mobile sensor networks

Papadopoulos¹,

Navarra²,

McCann³

et al. 2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Section: Basic Routingmentioning

confidence: 99%

VIBE: An energy efficient routing protocol for dense and mobile sensor networks

Papadopoulos¹,

Navarra²,

McCann³

et al. 2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

“…An asynchronous algorithm using O(n log n) messages was given, e.g., in [32] and the optimality of this message complexity was shown in [4]. Leader election in radio networks has been studied, e.g., in [22,24,30] and randomized leader election, e.g., in [35].…”

Section: Related Workmentioning

confidence: 99%

How Much Memory Is Needed for Leader Election

Fusco

Pełc

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We study the minimum memory size with which nodes of a network have to be equipped, in order to solve deterministically the leader election problem. Nodes are unlabeled, but ports at each node have arbitrary fixed labelings which, together with the topology of the network, can create asymmetries to be exploited in leader election. We consider two versions of the leader election problem: strong LE in which exactly one leader has to be elected, if this is possible, while all nodes must terminate in a state "infeasible" in the case of failure, and weak LE, which differs from strong LE in that no requirement on the behavior of nodes is imposed, if leader election is impossible. Nodes are modeled as identical automata and we ask what is the minimum amount of memory of such an automaton to enable leader election.We show that logarithmic memory is optimal for both strong and weak leader election in the class of arbitrary connected graphs. By contrast we show that A preliminary version of this paper appeared in the Pro-

show abstract

“…The classic leader election problem has been extensively studied in the context of radio networks [29,30] in which a communication channel is shared by all nodes and the network is fully connected in the sense that any node can send packets directly to any other node. The time is slotted to avoid collisions, so that each packet transmission always starts at the beginning of a time slot.…”

Section: Related Workmentioning

confidence: 99%

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

2006

View full text Add to dashboard Cite

There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node's delay of transmitting a signal is dependent on the probability of the node's ability to best perform a pertinent task and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding named Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.Keywords -Wireless ad hoc networks, wireless networks, ad hoc routing, ad hoc flooding, leader election INTRODUCTIONWireless ad hoc networks (WANETs) [1] are used to provide on-demand network infrastructures. They are usually composed of small portable clients (or nodes), but they lack consistent topologies. They range in size from small Bluetooth piconets [2] used for device synchronization to large-scale networks used for supporting military and emergency-response applications. Perhaps the most popular WANET applications recently have been wireless sensor networks [3], which are most often used for the pervasive and remote monitoring of environmental or spatial phenomena.To date, a plethora of research efforts have addressed some significant challenges introduced by various aspects of WANET operation, perhaps the most fundamental being fault-tolerant and energy-efficient communication. Since communication is typically the most costly operation in WANETs because of the overhead of transceiver operation, innovative and efficient approaches to basic communication algorithms such as flooding and routing are in strong demand. Fortunately, the communication primitive in WANETs, broadcast, offers some interesting possibilities.As an instructive example, let us consider a lecture hall with a lecturer and student audience. If the lecturer wants to identify a student with a certain property (e.g., the least number of credits taken at the university) in a lecture hall with n students, it seems that n communications (verbal in this case) would be needed. However, if the lecturer and students use the broadcast nature of verbal communication, they can accomplish this task in just two communications. In the first broadcast, the lecturer asks all students to announce their total number of completed credits after a delay (in seconds, start...

show abstract

Uniform leader election protocols for radio networks

Abstract: Abstract

Cited by 41 publications

References 6 publications

VIBE: An energy efficient routing protocol for dense and mobile sensor networks

VIBE: An energy efficient routing protocol for dense and mobile sensor networks

How Much Memory Is Needed for Leader Election

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

Contact Info

Product

Resources

About