Short Labeling Schemes for Topology Recognition in Wireless Tree Networks

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10641)

Abstract

We consider the problem of topology recognition in wireless (radio) networks modeled as undirected graphs. Topology recognition is a fundamental task in which every node of the network has to output a map of the underlying graph i.e., an isomorphic copy of it, and situate itself in this map. In wireless networks, nodes communicate in synchronous rounds. In each round a node can either transmit a message to all its neighbors, or stay silent and listen. At the receiving end, a node v hears a message from a neighbor w in a given round, if v listens in this round, and if w is its only neighbor that transmits in this round. Nodes have labels which are (not necessarily different) binary strings. The length of a labeling scheme is the largest length of a label. We concentrate on wireless networks modeled by trees, and we investigate two problems.

• What is the shortest labeling scheme that permits topology recognition in all wireless tree networks of diameter D and maximum degree $$\varDelta$$?

• What is the fastest topology recognition algorithm working for all wireless tree networks of diameter D and maximum degree $$\varDelta$$, using such a short labeling scheme?

We are interested in deterministic topology recognition algorithms. For the first problem, we show that the minimum length of a labeling scheme allowing topology recognition in all trees of maximum degree $$\varDelta \ge 3$$ is $$\varTheta (\log \log \varDelta )$$. For such short schemes, used by an algorithm working for the class of trees of diameter $$D\ge 4$$ and maximum degree $$\varDelta \ge 3$$, we show almost matching bounds on the time of topology recognition: an upper bound $$O(D\varDelta )$$, and a lower bound $$\varOmega (D\varDelta ^{\epsilon })$$, for any constant $$\epsilon <1$$.

Our upper bounds are proven by constructing a topology recognition algorithm using a labeling scheme of length $$O(\log \log \varDelta )$$ and using time $$O(D\varDelta )$$. Our lower bounds are proven by constructing a class of trees for which any topology recognition algorithm must use a labeling scheme of length at least $$\varOmega (\log \log \varDelta )$$, and a class of trees for which any topology recognition algorithm using a labeling scheme of length $$O(\log \log \varDelta )$$ must use time at least $$\varOmega (D\varDelta ^{\epsilon })$$, on some tree of this class.

Keywords

Topology recognition Wireless network Labeling scheme Feasibility Tree Time

References

1. 1.
Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 547–556 (2001)Google Scholar
2. 2.
Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms 43, 177–189 (2002)
3. 3.
Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4, 42 (2008)
4. 4.
Dereniowski, D., Pelc, A.: Drawing maps with advice. J. Parallel Distrib. Comput. 72, 132–143 (2012)
5. 5.
Emek, Y., Fraigniaud, P., Korman, A., Rosen, A.: Online computation with advice. Theoret. Comput. Sci. 412, 2642–2656 (2011)
6. 6.
Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: information sensitivity of graph coloring. Distrib. Comput. 21, 395–403 (2009)
7. 7.
Fraigniaud, P., Ilcinkas, D., Pelc, A.: Communication algorithms with advice. J. Comput. Syst. Sci. 76, 222–232 (2010)
8. 8.
Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with advice. Inf. Comput. 206, 1276–1287 (2008)
9. 9.
Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. Theory Comput. Syst. 47, 920–933 (2010)
10. 10.
Fusco, E., Pelc, A.: Trade-offs between the size of advice and broadcasting time in trees. Algorithmica 60, 719–734 (2011)
11. 11.
Fusco, E., Pelc, A., Petreschi, R.: Topology recognition with advice. Inf. Comput. 247, 254–265 (2016)
12. 12.
Gasieniec, L., Pagourtzis, A., Potapov, I., Radzik, T.: Deterministic communication in radio networks with large labels. Algorithmica 47, 97–117 (2007)
13. 13.
Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. Distrib. Comput. 19, 289–300 (2007)
14. 14.
Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53, 85–112 (2004)
15. 15.
Glacet, C., Miller, A., Pelc, A.: Time vs. information tradeoffs for leader election in anonymous trees. In: Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 600–609 (2016)Google Scholar
16. 16.
Ilcinkas, D., Kowalski, D., Pelc, A.: Fast radio broadcasting with advice. Theoret. Comput. Sci. 411, 1544–1557 (2012)
17. 17.
Katz, M., Katz, N., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM J. Comput. 34, 23–40 (2004)
18. 18.
Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22, 215–233 (2010)
19. 19.
Kowalski, D., Pelc, A.: Leader election in ad hoc radio networks: a keen ear helps. J. Comput. Syst. Sci. 79, 1164–1180 (2013)
20. 20.
Nisse, N., Soguet, D.: Graph searching with advice. Theoret. Comput. Sci. 410, 1307–1318 (2009)
21. 21.
Peleg, D.: Distributed Computing, a Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000) 