Subscribe
Issue No.06 - June (2010 vol.21)
pp: 790-800
Scott C.-H. Huang , City University of Hong Kong, Hong Kong
Peng-Jun Wan , Illinois Institute of Technology, Chicago
Hongwei Du , Illinois Institute of Technology, Chicago and Chinese Academy of Sciences, China
E.-K. Park , University of Missouri at Kansas City, Kansas City
ABSTRACT
We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and the objective is to distribute each node's message to the entire network with minimum latency. We studied this problem in the unit-size message model and the unit disk graph model. The unit-size model means different messages cannot be combined as one message, and the unit disk graph model means a link exists between two nodes if and only if their euclidean distance is less than 1. The minimum latency gossiping problem is known to be NP-hard in these two models. In this work, we designed a gossiping scheme that significantly improved all current gossiping algorithms in terms of the approximation ratio. Our work has approximation ratio 27, a great improvement of the current state-of-the-art algorithm (which has ratio 1,947). We also discussed the single point of failure problem and its impact on our approximation ratio. We designed an amended gossiping algorithm with ratio 27 in case of a nonsource node failure. We also designed an amended gossiping algorithm with ratio 29 in case of source failure.
INDEX TERMS
 [1] R. Bar-Yehuda, A. Israeli, and A. Itai, "Multiple Communication in Multihop Radio Networks," SIAM J. Computing, vol. 22, no. 4, pp. 875-887, 1993. [2] J.C. Bermond, L. Gargano, A.A. Rescigno, and U. Vacarro, "Fast Gossiping by Short Messages," Proc. 22nd Int'l Colloquium Automata, Languages and Programming (ICALP '95), pp. 135-146, 1995. [3] J.-C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro, "Fast Gossiping by Short Messages," SIAM J. Computing, vol. 27, no. 4, pp. 917-941, 1998. [4] B.S. Chlebus, L. Gasieniec, A. Lingas, and A.T. Pagourtzis, "Oblivious Gossiping in Ad-Hoc Radio Networks," Proc. Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '01), pp. 44-51, 2001. [5] M. Christersson, L. Gasieniec, and A. Lingas, "Gossiping with Bounded Size Messages in Ad Hoc Radio Networks," Proc. 29th Int'l Colloquium Automata, Languages and Programming (ICALP '02), pp. 377-389, 2002. [6] M. Chrobak, L. Gasiniec, and W. Rytter, "Fast Broadcasting and Gossiping in Radio Networks," Proc. 41st IEEE Symp. Foundation of Computer Science (FOCS '00), pp. 575-581, 2000. [7] M. Chrobak, L. Gasiniec, and W. Rytter, "A Randomized Algorithm for Gossiping in Radio Networks," Proc. Seventh Ann. Int'l Computing and Combinatorics Conf. (COCOON '01), pp. 483-492, 2001. [8] M. Chrobak, L. Gasiniec, and W. Rytter, "Ast Broadcasting and Gossiping in Radio Networks," J. Algorithms, vol. 43, no. 2, pp. 177-189, 2002. [9] A.E.F. Clementi, A. Monti, and R. Silvestri, "Selective Families, Superimposed Codes, and Broadcasting in Unknown Radio Networks," Proc. 12th ACM-SIAM Symp. Discrete Algorithms (SODA '01), pp. 709-718, 2001. [10] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed., chapter 25. McGraw-Hill, 2001. [11] M. Flamini and S. Perennes, "Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols," technical report, Inst. Nat'l de Recherche en Informatique et en Automatique, 1999. [12] C. Florens, M. Franceschetti, and R.J. McEliece, "Lower Bounds on Data Collection Time in Sensory Networks," IEEE J. Selected Areas Comm., vol. 22, no. 6, pp. 1110-1120, Aug. 2004. [13] R.W. Floyd, "Algorithm 97: Shortest Path," Comm. ACM, vol. 5, no. 6, p. 345, 1962. [14] R. Gandhi, S. Parthasarathy, and A. Mishra, "Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks," Proc. ACM MobiHoc, pp. 222-232, 2003. [15] L. Gasieniec and A. Lingas, "On Adaptive Deterministic Gossiping in Ad Hoc Radio Networks," Information Processing Letters, vol. 83, pp. 89-93, 2002. [16] L. Gasieniec and I. Potapov, "Gossiping with Unit Messages in Known Radio Networks," Proc. IFIP 17th World Computer Congress—TC1 Stream/Second IFIP Int'l Conf. Theoretical Computer Science (TCS '02), pp. 193-205, 2002. [17] L. Gasieniec, I. Potapov, and Q. Xin, "Time Efficient Gossiping in Known Radio Networks," Proc. 11th Colloquium Structural Information and Comm. Complexity (SIROCCO '04), pp. 173-184, 2004. [18] S.C.-H. Huang, P.-J. Wan, X. Jia, H. Du, and W. Shang, "Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks," Proc. IEEE INFOCOM, pp. 733-739, 2007. [19] P. Indyk, "Explicit Constructions of Selectors and Related Combinatorial Structures, with Applications," Proc. 13th ACM-SIAM Symp. Discrete Algorithms (SODA '02), pp. 697-704, 2002. [20] X. Jia, "A Distributed Algorithm of Delay Bounded Multicast Routing for Multimedia Applications in Wide Area Networks," IEEE/ACM Trans. Networking, vol. 6, no. 6, pp. 828-837, Dec. 1998. [21] D. Li, X. Jia, and H. Liu, "Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks," IEEE Trans. Mobile Computing, vol. 3, no. 2, pp. 144-151, Apr.-June 2004. [22] F. Manne and Q. Xin, "Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks," Proc. Third Workshop Combinatorial and Algorithmic Aspects of Networking (CAAN '06), pp. 125-134, 2006. [23] S. Marti, T.J. Giuli, K. Lai, and M. Baker, "Mitigating Routing Misbehavior in Mobile Ad Hoc Networks," Proc. ACM MobiCom, pp. 255-265, 2000. [24] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The Broadcast Storm Problem in a Mobile Ad Hoc Network," Proc. ACM/IEEE MobiCom, pp. 151-162, 1999. [25] K. Ravishankar and S. Singh, "Asymptotically Optimal Gossiping in Radio Networks," Discrete Applied Math., vol. 61, pp. 61-85, 1995. [26] K. Ravishankar and S. Singh, "Gossiping on a Ring with Radios," Parallel Processing Letters, vol. 6, no. 1, pp. 115-126, 1996. [27] Y. Xu, "An ${O}(n^{1.5})$ Deterministic Gossiping Algorithm for Radio Networks," Algorithmica, vol. 36, no. 1.