Abstract
We analyze information dissemination in random geometric networks, which consist of n nodes placed uniformly at random in the square \({[0,\sqrt{n}]^{2}}\) . In the corresponding graph two nodes u and v are connected by a (directed) edge, i.e., u is an (incoming) neighbor of v, if and only if the distance between u and v is smaller than the transmission radius assigned to u. In order to study the performance of distributed communication algorithms in such networks, we adopt here the ad-hoc radio communication model with no collision detection mechanism available. In this model the topology of network connections is not known in advance. Also a node v is capable of receiving a message from its neighbor u if u is the only (incoming) neighbor transmitting in a given step. Otherwise a collision occurs prompting interference that is not distinguishable from the background noise in the network. First, we consider networks modeled by random geometric graphs in which all nodes have the same radius \({r > \delta \sqrt{\log n}}\) , where δ is a sufficiently large constant. In such networks, we provide a rigorous study of the classical communication problem of distributed gossiping (all-to-all communication). We examine various scenarios depending on initial local knowledge and capabilities of network nodes. We show that in many cases an asymptotically optimal distributed O(D)-time gossiping is feasible, where D stands for the diameter of the network. Later, we consider networks in which the transmission radii of the nodes vary according to a power law distribution, i.e., any node is assigned a transmission radius r > r min according to probability density function ρ(r) ~ r −α. More precisely, \({\rho(r) = (\alpha-1)r_{\min}^{\alpha-1} r^{-\alpha}}\) , where \({\alpha \in (1, 3)}\) and \({r_{\min} > \delta \sqrt{\log n}}\) with δ being a large constant. In this case, we develop a simple broadcasting algorithm that runs in time O(log log n) (i.e., O(D)) always surely, and we show that this result is asymptotically optimal. Finally, we consider networks in which any node is assigned a transmission radius r > c according to the probability density function ρ(r) = (α−1)c α-1 r −α, where α is a constant from the same range as before and c is a constant. In this model the graph is usually not strongly connected, however, there is one giant component with Ω(n) nodes, and there is a directed path from each node of this giant component to every other node in the graph. We assume that the message which has to be disseminated is placed initially in one of the nodes of the giant component, and every node is aware of its own position in \({[0,\sqrt{n}] \times [0,\sqrt{n}]}\) . Then, we show that there exists a randomized algorithm which delivers the broadcast message to all nodes in the network in time O(D . (log log n)2), almost always surely, where D stands for the diameter of the giant component of the graph. One can conclude from our studies that setting the transmission radii of the nodes according to a power law distribution brings clear advantages. In particular, one can design energy efficient radio networks with low average transmission radius, in which broadcasting can be performed exponentially faster than in the (extensively studied) case where all nodes have the uniform low transmission power.
Similar content being viewed by others
References
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)
Berenbrink, P., Cooper, C., Hu, Z.: Energy efficient randomised communication in unknown adhoc networks. In: Proceedings of the 19th SPAA’07, pp. 250–259 (2007)
Brusci D., Pinto M.D.: Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10(3), 129–135 (1997)
Capkun S., Hamdi M., Hubaux J.-P.: GPS-free positioning in mobile ad hoc networks. Clust. Comput. 5(2), 157–167 (2002)
Chernoff H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493–507 (1952)
Chlamtac I., Kutten S.: On broadcasting in radio networks—problem analysis and protocol design. IEEE Trans. Commun. 33(12), 1240–1246 (1985)
Chlebus, B.S.: Randomized communication in radio networks. In: Pardalos, P.M., Rajasekaran, S., Reif, J., Rolim, J.D.P. (eds.) Handbook of Randomized Computing, pp. 401–456. Kluwer, Dordrecht (2001)
Chlebus, B.S., Gąsieniec, L., Östlin, A., Robson, J.: Deterministic radio broadcasting. In: Proceedings of the 27th ICALP’00, pp. 717–728 (2000)
Chlebus B.S., Gąsieniec L., Gibbons A., Pelc A., Rytter W.: Deterministic broadcasting in ad hoc radio networks. Distrib. Comput. 15(1), 27–38 (2002)
Chrobak M., Gąsieniec L., Rytter W.: Fast broadcasting and gossiping in radio networks. J. Algorithm. 43(2), 177–189 (2002)
Cicalese, F., Manne, F., Xin, Q.: Faster centralized communication in radio networks. In: Proceedings of the 17th ISAAC’06, pp. 339–348 (2006)
Clementi A., Monti A., Silvestri R.: Distributed broadcast in radio networks with unknown topology. Theor. Comput. Sci. 302(1–3), 337–364 (2003)
Czumaj A., Rytter W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithm. 60(2), 115–143 (2006)
Czumaj, A., Wang, X.: Fast messgae dissemination in random geometric ad-hoc radio networks. In: Proceedings of the 18th ISAAC’07, pp. 220–231 (2007)
De Marco, G.: Distributed broadcast in unknown radio networks. In: Proceedings of the 19th SODA’08, pp. 208–217 (2008)
De Marco G., Pelc A.: Faster broadcasting in unknown radio networks. Inf. Process. Lett. 79(2), 53–56 (2001)
Dessmark A., Pelc A.: Broadcasting in geometric radio networks. J. Discret. Algorithm. 5(1), 187–201 (2007)
Elkin, M., Kortsarz, G.: An improved algorithm for radio broadcast. ACM Trans. Algorithm. 3(1) (2007)
Elsässer R., Gąsieniec L.: Radio communication in random graphs. J. Comput. Syst. Sci. 72(3), 490–506 (2006)
Elsässer, R., Gąsieniec, L., Sauerwald, T.: On radio broadcasting in random geometric graphs. In: Proceedings of the 22nd DISC’08, pp. 212–226 (2008)
Emek, Y., Gąsieniec, L., Kantor, E., Pelc, A., Peleg, D., Su, C.: Broadcasting in UDG radio networks with unknown topology. In: Proceedings of the 26th PODC’07, pp. 195–204 (2007)
Emek, Y., Kantor, E., Peleg, D.: On the effect of the deployment setting on broadcasting in Euclidean radio networks. In: Proceedings of the 27th PODC’08, pp. 223–232 (2008)
Gaber I., Mansour Y.: Centralized broadcast in multihop radio networks. J. Algorithm. 46(1), 1–20 (2003)
Ganesan D., Govindan R., Shenker S., Estrin D.: Highly resilient, energy-efficient multipath routing in wireless sensor networks. ACM SIGMOBILE Mobile Comput. Commun. Rev. 5(4), 11–25 (2001)
Gąsieniec L., Pagourtzis A., Potapov I., Radzik T.: Deterministic communication in radio networks with large labels. Algorithmica 47(1), 97–117 (2007)
Gąsieniec L., Peleg D., Xin Q.: Faster communication in known topology radio networks. Distrib. Comput. 19(4), 289–300 (2007)
Gąsieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad-hoc radio networks. In: Proceedings of the 9th SWAT’04, pp. 397–407 (2004)
Giordano, S., Stojmenovic, I.: Position based ad hoc routes in ad hoc networks. In: Handbook of Ad Hoc Wireless Networks, Chap. 16, pp. 1–14 (2003)
Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: McEneany, W.M., Yin, G., Zhang Q. (eds.) Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, Birkhauser, pp. 547–566. Boston, MA (1998)
Hagerup T., Rüb C.: A guided tour of Chernoff bounds. Inf. Process. Lett. 36(6), 305–308 (1990)
Ishizuka, M., Aida, M.: Achieving power-law placement in wireless sensor networks. In: Proceedings of the 7th ISADS’05, pp. 661–666 (2005)
Kowalski D., Pelc A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. Comput. 33(4), 870–891 (2004)
Kowalski D., Pelc A.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18(1), 43–57 (2005)
Kowalski D., Pelc A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. 19(3), 183–195 (2007)
Krishnamachari, B., Wicker, S., Bejar, R., Pearlman, M.: Critical density thresholds in distributed wireless networks. In: Barghava, H., Poor, H.V., Tarokh, V., Yoon, S. (eds.) Communications, Information and Network Security. Kluwer, Dordrecht (2002)
Lotker, Z., Navarra, A.: Managing random sensor networks by means of grid emulation. In: Proceedings of the Networking’06, pp. 856–867 (2006)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of the 20th INFOCOM’01, vol. 3, pp. 1380–1387 (2001)
Muthukrishnan, S., Pandurangan, G.: The bin-covering technique for thresholding geometric graph properties. In: Proceedings of the 16th SODA’05, pp. 989–998 (2005)
Nasipuri, A., Li, K., Sappidi, U.R.: Power consumption and throughput in mobile ad hoc networks using directional antennas. In: Proceedings of the 11th ICCCN’02, pp. 620–626 (2002)
Penrose, M.: Random Geometric Graphs. Oxford Studies in Probability (2003)
Sen, A., Huson, M.: A new model for scheduling packet radio networks. In: Proceedings of the 15th INFOCOM’96, pp. 1116–1124 (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was originally invited to the special issue of Distributed Computing based on selected papers presented at the 22nd International Symposium on Distributed Computing (DISC 2008). It appears separately due to publication delays.
Partially supported by the Royal Society IJP 2007/R1 “Geometric Sensor Networks with Random Topology,” by the Integrated Project IST-15964 “Algorithmic Principles for Building Efficient Overlay Networks” of the European Union, by NSF ITR grant CCR-0313219, and by the Centre for Discrete Mathematics and its Applications (DIMAP), EPSRC award EP/D063191/1.
Rights and permissions
About this article
Cite this article
Czumaj, A., Elsässer, R., Gąsieniec, L. et al. Fast message dissemination in random geometric networks. Distrib. Comput. 26, 1–24 (2013). https://doi.org/10.1007/s00446-011-0154-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-011-0154-4