Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Bounded-Contention Coding for the additive network model

Abstract

Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communication in such networks. This paper proposes a novel approach for wireless communication, which embraces collisions rather than avoiding them, over an additive channel. It introduces a coding technique called Bounded-Contention Coding (BCC) that allows collisions to be successfully decoded by the receiving nodes into the original transmissions and whose complexity depends on a bound on the contention among the transmitters. BCC enables deterministic local broadcast in a network with \(n\) nodes and at most \(a\) transmitters with information of \(\ell \) bits each within \(O(a\log {n}+a\ell )\) bits of communication with full-duplex radios, and \(O((a\log {n}+a\ell )(\log {n}))\) bits, with high probability, with half-duplex radios. When combined with random linear network coding, BCC gives global broadcast within \(O((D+a+\log {n})(a\log {n}+\ell ))\) bits, with high probability. This also holds in dynamic networks that can change arbitrarily over time by a worst-case adversary. When no bound on the contention is given, it is shown how to probabilistically estimate it and obtain global broadcast that is adaptive to the true contention in the network.

This is a preview of subscription content, log in to check access.

Notes

  1. 1.

    Throughout this paper, high probability refers to values that are at least \(1-1/n^c\) for some constant \(c \ge 1\).

  2. 2.

    For every set \(S\subseteq C\), let \(\bar{y}_S\) be the length \(M\) vector characterizing the set \(S\), i.e., \(\bar{y}_S(i)=1\) if and only if the \(i\)-th column is an element in \(S\). Consider the multiplication of the matrix \(H\) by the vector \(\bar{y}_S\). If \(H\cdot \bar{y}_S^T=0\) then \(\bar{y}\) is orthogonal to \(D^{\bot }\), hence \(\bar{y} \in (D^{\bot })^{\bot }=D\). This implies that the Hamming weight of \(\bar{y}\) is at least \(2a+1\).

References

  1. 1.

    Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290–298 (1991)

  2. 2.

    Amaudruz, A., Fragouli, C.: Combinatorial algorithms for wireless information flow. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 555–564 (2009)

  3. 3.

    Avestimehr, A.S., Diggavi, S.N., Tse, D.N.C.: Wireless network information flow: a deterministic approach. IEEE Trans. Inf. Theory 57(4), 1872–1905 (2011)

  4. 4.

    Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45(1), 104–126 (1992)

  5. 5.

    Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multi-hop radio networks. SIAM J. Comput. 22, 875–887 (1993)

  6. 6.

    Berger, T., Mehravari, N., Towsley, D., Wolf, J.: Random multiple-access communication and group testing. IEEE Trans. Commun. 32(7), 769–779 (1984)

  7. 7.

    Bienkowski, M., Klonowski, M., Korzeniowski, M., Kowalski, D.R.: Dynamic sharing of a multiple access channel. In 27th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 83–94 (2010)

  8. 8.

    Chlebus, B.S., Kowalski, D.R., Pelc, A., Rokicki, M.A.: Efficient distributed communication in ad-hoc radio networks. In Proceedings of the 38th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 613–624 (2011)

  9. 9.

    Clementi, A.E.F., Monti, A., Pasquale, F., Silvestri, R.: Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4), 213–230 (2009)

  10. 10.

    Cornejo, A., Newport, C.: Prioritized gossip in vehicular networks. In Proceedings of the 6th ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (DIALM-POMC 2010) (2010)

  11. 11.

    Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), p. 492 (2003)

  12. 12.

    Czyzowicz, J., Gasieniec, L., Kowalski, D.R., Pelc, A.: Consensus and mutual exclusion in a multiple access channel. IEEE Trans. Parallel Distrib. Syst. 22(7), 1092–1104 (2011)

  13. 13.

    De Marco, G.: Distributed broadcast in unknown radio networks. SIAM J. Comput. 39, 2162–2175 (2010)

  14. 14.

    Effros, M., Médard, M., Ho, T., Ray, S., Karger, D., Koetter, R.: Linear network codes: A unified framework for source channel, and network coding. In Proceedings of the DIMACS Workshop on Network Information Theory (Invited paper) (2003)

  15. 15.

    Erez, E., Kim, M., Xu, Y., Yeh, E.M., Médard, M.: Deterministic network model revisited: an algebraic network coding approach. IEEE Trans. Inf. Theory 60(8), 4867–4879 (2014)

  16. 16.

    Erez, E., Xu, Y., Yeh, E.M.: Coding for the deterministic network model. In Allerton Conference on Communication, Control and Computing (2010)

  17. 17.

    Goemans, M.X., Iwata, S., Zenklusen, R.: An algorithmic framework for wireless information flow. In Proceedings of Allerton Conference on Communication, Control, and Computing (2009)

  18. 18.

    Gollakota, S., Katabi, D.: Zigzag decoding: combating hidden terminals in wireless networks. In Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 159–170 (2008)

  19. 19.

    Haeupler, B.: Analyzing network coding gossip made easy. In Proceedings of the 43rd annual ACM symposium on Theory of computing (STOC), pp. 293–302 (2011)

  20. 20.

    Haeupler, B., Karger, D.: Faster information dissemination in dynamic networks via network coding. In Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 381–390 (2011)

  21. 21.

    Ho, T., Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A random linear network coding approach to multicast. IEEE Trans. Inf. Theory 52(10), 4413–4430 (2006)

  22. 22.

    Hui, J., Humblet, P.: The capacity region of the totally asynchronous multiple-access channel. IEEE Trans. Inf. Theory 31(2), 207–216 (1985)

  23. 23.

    Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC), pp. 535–549 (2002)

  24. 24.

    Khabbazian, M., Kowalski, D.: Time-efficient randomized multiple-message broadcast in radio networks. In Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2011)

  25. 25.

    Khabbazian, M., Kowalski, D., Kuhn, F., Lynch, N.: Decomposing broadcast algorithms using Abstract MAC layers. In Proceedings of Sixth ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (DIALM-POMC) (2010)

  26. 26.

    Kim, M., Médard, M.: Algebraic network coding approach to deterministic wireless relay network. In Allerton Conference on Communication, Control and Computing (2010)

  27. 27.

    Koetter, R., Médard, M.: An algebraic approach to network coding. IEEE/ACM Trans. Netw. 11, 782–795 (2003)

  28. 28.

    Komlós, J., Greenberg, A.G.: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31(2), 302–306 (1985)

  29. 29.

    Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18, 43–57 (2005)

  30. 30.

    Kuhn, F., Lynch, N.A., Oshman. R.: Distributed computation in dynamic networks. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pp. 513–522 (2010)

  31. 31.

    Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 1–10 (2011)

  32. 32.

    Kuhn, F., Oshman, R.: The complexity of data aggregation in directed networks. In Distributed Computing: 25th International Symposium on Distributed Computing (DISC), pp. 416–431 (2011)

  33. 33.

    Kushilevitz, E., Mansour, Y.: An \(\varOmega (D\log (N/D))\) lower bound for broadcast in radio networks. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 65–74 (1993)

  34. 34.

    Martel, C.U.: Maximum finding on a multiple access broadcast network. Inf. Process. Lett. 52(1), 7–15 (1994)

  35. 35.

    Medard, M., Huang, J., Goldsmith, A., Meyn, S., Coleman, T.: Capacity of time-slotted ALOHA packetized multiple-access systems over the AWGN channel. IEEE Trans. Wirel. Commun. 3(2), 486–499 (2004)

  36. 36.

    O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 104–110 (2005)

  37. 37.

    ParandehGheibi, A., Sundararajan, J.-K., Médard, M.: Collision helps—algebraic collision recovery for wireless erasure networks. In Proceedings of the Wireless Network Coding workshop (WiNC) (2010)

  38. 38.

    Peleg, D.: Time-efficient broadcasting in radio networks: a review. In Proceedings of the 4th International Conference on Distributed Computing and Internet Technology (ICDCIT), pp. 1–18 (2007)

  39. 39.

    Roth, R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)

  40. 40.

    Shi, C., Ramamoorthy, A.: Improved combinatorial algorithms for wireless information flow. In Proceedings of Allerton Conference on Communication, Control, and Computing (2010)

Download references

Acknowledgments

The authors thank Seth Gilbert for useful discussions regarding probabilistic retransmissions, MinJi Kim and Ali ParandehGheibi for many discussions about the XOR collisions model addressed in this paper, and Amir Shpilka for pointing out the existence of the simple codes we use to implement our BCC framework. We further thank the anonymous reviewers for their effort and valuable feedback which improved and clarified the presentation of this work in many ways. This work was supported in part by the Simons Postdoctoral Fellows Program, ISF Grant 1696/14, AFOSR Contract Number: FA9550-13-1-0042, AFOSR Contract Number: FA9550-14-1-0403, and NSF Award 0939370-CCF.

Author information

Correspondence to Keren Censor-Hillel.

Additional information

A preliminary version of this paper appeared in Proceedings of the 26th International Symposium on Distributed Computing (DISC), pp. 91–105, 2012.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Censor-Hillel, K., Haeupler, B., Lynch, N. et al. Bounded-Contention Coding for the additive network model. Distrib. Comput. 28, 297–308 (2015). https://doi.org/10.1007/s00446-015-0244-9

Download citation

Keywords

  • Wireless networks
  • High SNR
  • Coding
  • Additive channel