A Novel Ant Algorithm for Solving the Minimum Broadcast Time Problem

  • Yehudit Hasson
  • Moshe Sipper
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3242)

Abstract

The problem of Minimum Broadcast Time (MBT) seeks to find the minimal number of times steps required to broadcast a message through a communication network. We describe a novel ant algorithm for solving this NP-Complete problem and compare it to three other known algorithms, one of which is genetic. Through experimentation on randomly generated graphs we show that our algorithm finds the best solutions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M.R., Johnson, D.S.: Computers and Interactability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)MATHGoogle Scholar
  2. Scheuermann, P., Wu, G.: Heuristic algorithms for broadcasting in point-to-point computer networks. IEEE Transactions on Computers C-33 (1984)Google Scholar
  3. Hoelting, C.J., Schoenefeld, D.A., Wainwright, R.L.: A genetic algorithm for the minimum broadcast time problem using a global precedence vector. In: Proceedings of the 1996 ACM Symposium on Applied Computing, Philadelphia, PA, pp. 258–262. ACM Press, New York (1996)CrossRefGoogle Scholar
  4. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. SFI Studies in the Sciences of Complexity. Oxford university Press, Oxford (1999)MATHGoogle Scholar
  5. Theraulaz, G., Bonabeau, E.: Coordination in distributed building. Science 269, 686–688 (1995)CrossRefGoogle Scholar
  6. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics—Part B 26, 1–13 (1996)Google Scholar
  7. Das, A.K.: II, R.J.M., El-Sharkawi, M.A., Arabshahi, P., Gray, A.: The minimum power broadcast problem in wireless networks: An ant colony approach. In: Proceedings of IEEE CAS Workshop on Wireless Communications and Networking, Pasadena, CA (2002)Google Scholar
  8. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, New Jersey (1962)MATHGoogle Scholar
  9. Baker, B., Shostak, R.: Gossips and telephones. Discrete Mathematics 2, 191–193 (1972)MATHCrossRefMathSciNetGoogle Scholar
  10. Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 320–349 (1988)CrossRefMathSciNetGoogle Scholar
  11. Hakimi, S.L.: Steiner’s problem in graphs and its implications. Networks 1, 113–133 (1971)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Yehudit Hasson
    • 1
  • Moshe Sipper
    • 1
  1. 1.Department of Computer ScienceBen-Gurion UniversityIsrael

Personalised recommendations