A Novel Ant Algorithm for Solving the Minimum Broadcast Time Problem
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.
Unable to display preview. Download preview PDF.
- Scheuermann, P., Wu, G.: Heuristic algorithms for broadcasting in point-to-point computer networks. IEEE Transactions on Computers C-33 (1984)Google Scholar
- 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
- 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