Node Labels in Local Decision

Conference paper

DOI: 10.1007/978-3-319-25258-2_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9439)
Cite this paper as:
Fraigniaud P., Hirvonen J., Suomela J. (2015) Node Labels in Local Decision. In: Scheideler C. (eds) Structural Information and Communication Complexity. SIROCCO 2015. Lecture Notes in Computer Science, vol 9439. Springer, Cham


The role of unique node identifiers in network computing is well understood as far as symmetry breaking is concerned. However, the unique identifiers also leak information about the computing environment—in particular, they provide some nodes with information related to the size of the network. It was recently proved that in the context of local decision, there are some decision problems such that (1) they cannot be solved without unique identifiers, and (2) unique node identifiers leak a sufficient amount of information such that the problem becomes solvable (PODC 2013).

In this work we study what is the minimal amount of information that we need to leak from the environment to the nodes in order to solve local decision problems. Our key results are related to scalar oraclesf that, for any given n, provide a multiset f(n) of n labels; then the adversary assigns the labels to the n nodes in the network. This is a direct generalisation of the usual assumption of unique node identifiers. We give a complete characterisation of the weakest oracle that leaks at least as much information as the unique identifiers.

Our main result is the following dichotomy: we classify scalar oracles as large and small, depending on their asymptotic behaviour, and show that (1) any large oracle is at least as powerful as the unique identifiers in the context of local decision problems, while (2) for any small oracle there are local decision problems that still benefit from unique identifiers.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Pierre Fraigniaud
    • 1
  • Juho Hirvonen
    • 2
  • Jukka Suomela
    • 2
  1. 1.Theoretical Computer Science FederationCNRS and University Paris DiderotParisFrance
  2. 2.Helsinki Institute for Information Technology HIIT, Department of Computer ScienceAalto UniversityEspooFinland

Personalised recommendations