Gossiping in Jail
Consider a set of prisoners that want to gossip with one another, and suppose that these prisoners are located at fixed locations (e.g., in jail cells) along a corridor. Each prisoner has a way to broadcast messages (e.g. by voice or contraband radio) with transmission radius R and interference radius R′ ≥ R. We study synchronous algorithms for this problem (that is, prisoners are allowed to speak at regulated intervals) including two restricted subclasses. We prove exact upper and lower bounds on the gossiping completion time for all three classes. We demonstrate that each restriction placed on the algorithm results in decreasing performance.
KeywordsRadio Network Time Slot Network Topology Transmission Radius Broadcasting Algorithm
Unable to display preview. Download preview PDF.
- 2.Chlebus, B., Gąsieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad-hoc radio networks. In: Proc. 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 2001), pp. 44–51 (2001)Google Scholar
- 3.Chrobak, M., Gąsieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: IEEE Symposium on Foundations of Computer Science, pp. 575–581 (2000)Google Scholar
- 4.Cicalese, F., Manne, F., Xin, Q.: Faster centralized communication in radio networks. In: International Symposium on Algorithms and Computation, pp. 339–348 (2006)Google Scholar
- 5.Gąsieniec, L., Potapov, I., Xin, Q.: Time efficient gossiping in known radio networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 173–184. Springer, Heidelberg (2004)Google Scholar
- 6.Gąsieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad-hoc radio networks. In: 9th Scandinavian Workshop on Algorithm Theory, pp. 397–407 (2004)Google Scholar
- 7.Miller, A.: Gossiping in one-dimensional synchronous ad hoc radio networks. Master’s thesis, University of Toronto (2009), http://www.cs.toronto.edu/~a4miller