Minimum Multicast Time Problem in Wireless Sensor Networks

  • Jianming Zhu
  • Xujin Chen
  • Xiaodong Hu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4138)


Given an undirected graph representing a network of processors, and a source node needs to broadcast a message to all other nodes in the graph, the minimum broadcast time problem is to find a scheme that accomplishes the broadcast in a minimum number of time steps under the constraint that at each time round, any node can send the message to at most one of its neighbors in the network. This NP-complete problem has been extensively studied in literature.

In this paper, we consider a generation of the minimum broadcast problem, the minimum multicast time problem, in unit disk graphs which model wireless sensor networks. The goal is to multicast a message from the source node to a set of specified sensor nodes of the network in a minimum number of time rounds. We prove that this problem is NP-complete, and give an O(1)–approximation algorithm for it. Our simulation results show that the practical performance of the proposed algorithm is much better than the theoretically proved approximation ratio.


Sensor Node Wireless Sensor Network Approximation Algorithm Source Node Transmission Range 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Annamalai, V., Gupta, S.K.S., Schwiebert, L.: On tree-based convergecasting in wireless sensor networks. In: WCNC 2003-IEEE Wireless Communication and Networking Conference, vol. 4(1), pp. 1942–1947 (2003)Google Scholar
  2. 2.
    Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Message multicasting in heterogeneous networks. SIAM Journal on Computing 30(2), 347–358 (2000)CrossRefMathSciNetMATHGoogle Scholar
  3. 3.
    Bulusu, N., Heidemann, J., Estrin, D.: GPS-less low cost outdoor localization for very small devices. Technical Report 00-729, Computer Science Department, University of Sourthern California (April 2000)Google Scholar
  4. 4.
    Chen, X., Hu, X., Zhu, J.: Minimum Data Aggregation Time Problem in Wireless Sensor Networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 133–142. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Elkin, M., Kortsarz, G.: A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: Proceedings of 34th ACM Annual Symposium on Theory of Computing, pp. 438–447 (2002)Google Scholar
  6. 6.
    Elkin, M., Kortsarz, G.: Sublogarithmic approximation algorithm for the undirected telephone broadcast problem: a path out of a jungle. In: Proceedings of 14th Annual ACM-SCIM Symposium on Discrete Algorithms, pp. 76–85 (2003)Google Scholar
  7. 7.
    Elkin, M., Kortsarz, G.: Approximation algorithm for directed telephone multicast problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 212–223. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Gandhi, R., Parthasarathy, S., Mishr̀a, A.: Minimizing broadcasting latency and redundancy in ad hoc networks. In: Proceedings of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, pp. 222–231 (2003)Google Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)MATHGoogle Scholar
  10. 10.
    Intanagonwiwat, C., Estrin, D., Govindan, R., Heidemann, J.: Impact of network density on data aggregation in wireless sensor networks. In: The 22nd International Conference on Distributed Computing Systems, Austria (July 2002)Google Scholar
  11. 11.
    Kyasanur, P., Vaidya, N.: Routing and interface assignment in multi-channel wireless networks. In: Proceedings of IEEE Wireless Communications and Networking Conference, vol. 4, pp. 2051–2056 (2005)Google Scholar
  12. 12.
    Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing 11, 329–343 (1982)CrossRefMathSciNetMATHGoogle Scholar
  13. 13.
    Pelc, A.: Broadcasting in radio networks. In: Handbook of Wireless Networks and Mobile Computing, John Wiley and Sons, Inc., New York (2002)Google Scholar
  14. 14.
    Ravi, R.: Rapid rumor ramification: approximating the minimum broadcast time. In: Proceedings of the IEEE Symposium on Computer Science, pp. 202–213 (1994)Google Scholar
  15. 15.
    Raghavendra, C.S., Sivalingam, K.M., Znati, T.: Wireless Sensor Networks. Kluwer Academic Publishers, Dordrecht (2004)CrossRefGoogle Scholar
  16. 16.
    Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM Journal on Computing 10, 692–701 (1981)CrossRefMathSciNetMATHGoogle Scholar
  17. 17.
    Xu, L., Xiang, Y., Shi, M.: On the Problem of Channel Assignment for Multi-NIC Multihop Wireless Networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 633–642. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  18. 18.
    Yu, Y., Krishnamachari, B., Prasanna, V.K.: Energy-latency tradeoffs for data gathering in wireless sensor networks. In: The 23rd Conference of IEEE Communication Society, Hong Kong, SAR China (March 2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jianming Zhu
    • 1
  • Xujin Chen
    • 1
  • Xiaodong Hu
    • 1
  1. 1.Institute of Applied MathematicsChinese Academy of SciencesBeijingChina

Personalised recommendations