Article

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

Authors:

Rachid Guerraoui,

Eric RuppertAuthors Info & Claims

ICALP '09: Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II

Pages 484 - 495

https://doi.org/10.1007/978-3-642-02930-1_40

Published: 03 July 2009 Publication History

Abstract

We introduce a new theoretical model of ad hoc mobile computing in which agents have restricted memory, highly unpredictable movement and no initial knowledge of the system. Each agent's memory can store O (1) bits, plus a unique identifier, and O (1) other agents' identifiers. Inputs are distributed across n agents, and all agents must converge to the correct output value. We give a universal construction that proves the model is surprisingly strong: It can solve any decision problem in NSPACE (n logn ). Moreover, the construction is robust with respect to Byzantine failures of a constant number of agents.

References

[1]

Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4), 235-253 (2006).

Crossref

Google Scholar

[2]

Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distributed Computing 21(2), 87-102 (2008).

Google Scholar

[3]

Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279-304 (2007).

Google Scholar

[4]

Aspnes, J., Ruppert, E.: An introduction to population protocols. In: Middleware for Network Eccentric and Mobile Applications. Springer, Heidelberg (2009).

Google Scholar

[5]

Ben-Amram, A.M.: Pointer machines and pointer algorithms: an annotated bibliography, http://www2.mta.ac.il/~amirben

Google Scholar

[6]

Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: Making population protocols fault-tolerant. In: Proc. 2nd IEEE International Conference on Distributed Computing in Sensor Systems, pp. 51-66 (2006).

Crossref

Google Scholar

[7]

Guerraoui, R., Ruppert, E.: Even small birds are unique: Population protocols with identifiers. Technical Report CSE-2007-04, Dept of Computer Science and Engineering, York University (2007).

Google Scholar

[8]

Mostefaoui, A., Rajsbaum, S., Raynal, M.: Conditions on input vectors for consensus solvability in asynchronous distributed systems. J. ACM 50(6), 922-954 (2003).

Crossref

Google Scholar

[9]

Numonyx. M25PX64 data sheet (2007), http://www.numonyx.com/Documents/Datasheets/M25PX64.pdf

Google Scholar

[10]

Schönhage, A.: Storage modification machines. SIAM J. Comput. 9(3), 490-508 (1980).

Google Scholar

[11]

Texas Instruments. MSP430 ultra-low-power microcontrollers (2008), http://focus.ti.com/lit/ml/slab034n/slab034n.pdf

Google Scholar

[12]

van Emde Boas, P.: Space measures for storage modification machines. Inf. Process. Lett. 30(2), 103-110 (1989).

Crossref

Google Scholar

Cited By

View all

Busch CGarncarek PKowalski D(2024)Locally Balanced Allocations Under Strong Byzantine InfluenceStructural Information and Communication Complexity10.1007/978-3-031-60603-8_15(262-280)Online publication date: 27-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-60603-8_15
Raskin M(2021)Population Protocols with Unreliable CommunicationAlgorithms for Sensor Systems10.1007/978-3-030-89240-1_10(140-154)Online publication date: 9-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-89240-1_10
Bournez OCohen JRabie M(2018)Homonym Population ProtocolsTheory of Computing Systems10.5555/3214123.321412862:5(1318-1346)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.5555/3214123.3214128
Show More Cited By

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
1. Networks

Recommendations

Dynamic names and private address maps: complete self-configuration for MANETs
CoNEXT '06: Proceedings of the 2006 ACM CoNEXT conference

In this paper we propose a self-configuring framework for mobile ad hoc networks (MANETs). Our architecture is based on the degenerated use of network address translation (NAT) where each node locally builds its "private address map", i.e. its own view ...
A weight-based clustering multicast routing protocol for mobile ad hoc networks

In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, multicasting ...
A Study of Speed Aware Routing for Mobile Ad Hoc Networks

The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network ...

Comments

Information & Contributors

Information

Published In

ICALP '09: Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II

July 2009

594 pages

ISBN:9783642029295

Co-chair:
Yossi Matias
Tel Aviv University Google R&D Center, School of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978
,
Editors:
Susanne Albers
Department of Computer Science, University of Freiburg, Freiburg, Germany 79110
,
Alberto Marchetti-Spaccamela
Department of Computer and Systems Sciences, Sapienza University of Rome, Roma, Italy 00184
,
Sotiris Nikoletseas
University of Patras and CTI, Rion, Greece 26504
,
Wolfgang Thomas
RWTH Aachen, Aachen, Germany 52056

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 July 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Busch CGarncarek PKowalski D(2024)Locally Balanced Allocations Under Strong Byzantine InfluenceStructural Information and Communication Complexity10.1007/978-3-031-60603-8_15(262-280)Online publication date: 27-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-60603-8_15
Raskin M(2021)Population Protocols with Unreliable CommunicationAlgorithms for Sensor Systems10.1007/978-3-030-89240-1_10(140-154)Online publication date: 9-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-89240-1_10
Bournez OCohen JRabie M(2018)Homonym Population ProtocolsTheory of Computing Systems10.5555/3214123.321412862:5(1318-1346)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.5555/3214123.3214128
Burman JBeauquier JSohier DNewport CKeidar I(2018)Brief AnnouncementProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212791(479-481)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212791
Michail OSpirakis P(2018)Elements of the theory of dynamic networksCommunications of the ACM10.1145/315669361:2(72-72)Online publication date: 23-Jan-2018
https://dl.acm.org/doi/10.1145/3156693
Michail OSpirakis P(2018)How many cooks spoil the soup?Distributed Computing10.1007/s00446-017-0317-z31:6(455-469)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00446-017-0317-z
Michail O(2018)Terminating distributed construction of shapes and patterns in a fair solution of automataDistributed Computing10.1007/s00446-017-0309-z31:5(343-365)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s00446-017-0309-z
Michail OSpirakis P(2016)Simple and efficient local codes for distributed stable network constructionDistributed Computing10.1007/s00446-015-0257-429:3(207-237)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s00446-015-0257-4
Michail OGeorgiou CSpirakis P(2015)Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of AutomataProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767402(37-46)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767402
(2015)Terminating population protocols via some minimal global knowledge assumptionsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2015.02.00581:C(1-10)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2015.02.005
Show More Cited By

Abstract

References

Cited By

Recommendations

Dynamic names and private address maps: complete self-configuration for MANETs

A weight-based clustering multicast routing protocol for mobile ad hoc networks

A Study of Speed Aware Routing for Mobile Ad Hoc Networks

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations