Quasi-Optimal Leader Election Algorithms in Radio Networks With Log-Logarithmic Awake Time-Slots

doi 10.1109/ictel.2003.1191592
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Uniform Leader Election Protocols for Radio Networks

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2002English

Uniform Leader Election Protocols for Radio Networks

2001English

Perpetuities in Fair Leader Election Algorithms

2013English

Logarithmic Slots Antennas Using Substrate Integrated Waveguide

International Journal of Microwave Science and Technology
Electronic EngineeringRadiationElectricalCondensed Matter Physics
2015English

Optimal Distributed T-Resilient Election in Complete Networks

IEEE Transactions on Software Engineering
Software
1990English

Logarithmic-Time Updates and Queries in Probabilistic Networks

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Enumeration and Leader Election in Partially Anonymous and Multi-Hop Broadcast Networks

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

Optimal Algorithms and Approximation Algorithms for Replica Placement With Distance Constraints in Tree Networks

2012English

Leader Election Using Loneliness Detection

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy