Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Systems, Networks, and Communications
Volume 2008, Article ID 712126, 10 pages
http://dx.doi.org/10.1155/2008/712126
Research Article

An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks

Department of Computer Engineering, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait

Received 16 September 2008; Accepted 3 December 2008

Academic Editor: Nidal Nasser

Copyright © 2008 Imtiaz Ahmad et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Ephremides and T. V. Truong, “Scheduling broadcasts in multihop radio networks,” IEEE Transactions on Communications, vol. 38, no. 4, pp. 456–460, 1990. View at Publisher · View at Google Scholar
  2. N. Funabiki and Y. Takefuji, “A parallel algorithm for broadcast scheduling problems in packet radio networks,” IEEE Transactions on Communications, vol. 41, no. 6, pp. 828–831, 1993. View at Publisher · View at Google Scholar
  3. S. Ramanathan and E. L. Lloyd, “Scheduling algorithms for multihop radio networks,” IEEE/ACM Transactions on Networking, vol. 1, no. 2, pp. 166–177, 1993. View at Publisher · View at Google Scholar
  4. H. Fattah and C. Leung, “An overview of scheduling algorithms in wireless multimedia networks,” IEEE Wireless Communications, vol. 9, no. 5, pp. 76–83, 2002. View at Publisher · View at Google Scholar
  5. G. Wang and N. Ansari, “Optimal broadcast scheduling in packet radio networks using mean field annealing,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 2, pp. 250–260, 1997. View at Publisher · View at Google Scholar
  6. J. Yeo, H. Lee, and S. Kim, “An efficient broadcast scheduling algorithm for TDMA ad-hoc networks,” Computers & Operations Research, vol. 29, no. 13, pp. 1793–1806, 2002. View at Publisher · View at Google Scholar
  7. S. Salcedo-Sanz, C. Bousoño-Calzón, and A. R. Figueiras-Vidal, “A mixed neural-genetic algorithm for the broadcast scheduling problem,” IEEE Transactions on Wireless Communications, vol. 2, no. 2, pp. 277–283, 2003. View at Publisher · View at Google Scholar
  8. Z. Cai, M. Lu, and C. N. Georghiades, “Topology-transparent time division multiple access broadcast scheduling in multihop packet radio networks,” IEEE Transactions on Vehicular Technology, vol. 52, no. 4, pp. 970–984, 2003. View at Publisher · View at Google Scholar
  9. G. Chakraborty, “Genetic algorithm to solve optimum TDMA transmission schedule in broadcast packet radio networks,” IEEE Transactions on Communications, vol. 52, no. 5, pp. 765–777, 2004. View at Publisher · View at Google Scholar
  10. Y. Peng, B. H. Soong, and L. Wang, “Broadcast scheduling in packet radio networks using mixed tabu-greedy algorithm,” Electronics Letters, vol. 40, no. 6, pp. 375–376, 2004. View at Publisher · View at Google Scholar
  11. C. Y. Ngo and V. O. K. Li, “Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms,” IEEE Transactions on Communications, vol. 51, no. 9, pp. 1439–1441, 2003. View at Publisher · View at Google Scholar
  12. C. W. Commander, S. I. Butenko, P. M. Pardalos, and C. A. S. Oliveira, “Reactive GRASP with path relinking for the broadcast scheduling problem,” in Proceedings of the 40th Annual International Telemetry Conference (ITC '04), pp. 792–800, San Diego, Calif, USA, October 2004.
  13. J.-C. Chen, Y.-C. Wang, and J.-T. Chen, “A novel broadcast scheduling strategy using factor graphs and the sum-product algorithm,” IEEE Transactions on Wireless Communications, vol. 5, no. 6, pp. 1241–1249, 2006. View at Publisher · View at Google Scholar
  14. H. Shi and L. Wang, “A hybrid neural network for optimal TDMA transmission scheduling in packet radio networks,” in Proceedings of IEEE International Joint Conference on Neural Networks (IJCNN '05), vol. 5, pp. 3210–3213, Montreal, Canada, July-August 2005. View at Publisher · View at Google Scholar
  15. W. Bi, Z. Tang, J. Wang, and Q. Cao, “An improved neural network algorithm for broad-cast scheduling problem in packet radio,” Neural Information Processing-Letters and Reviews, vol. 9, no. 1, pp. 23–29, 2005. View at Google Scholar
  16. X. Wu, B. S. Sharif, O. P. Hinton, and C. C. Tsimenidis, “Solving optimum TDMA broadcast scheduling in mobile ad hoc networks: a competent permutation genetic algorithm approach,” IEE Proceedings: Communications, vol. 152, no. 6, pp. 780–788, 2005. View at Publisher · View at Google Scholar
  17. Y.-J. Shen and M.-S. Wang, “Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network,” Expert Systems with Applications, vol. 34, no. 2, pp. 900–907, 2008. View at Publisher · View at Google Scholar
  18. C. W. Commander, S. I. Butenko, and P. M. Pardalos, “On the performance of heuristics for broadcast scheduling,” in Theory and Algorithms for Cooperative Systems, chapter 1, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004. View at Google Scholar
  19. R. Puri and J. Gu, “An efficient algorithm to search for minimal closed covers in sequential machines,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 12, no. 6, pp. 737–745, 1993. View at Publisher · View at Google Scholar
  20. I. Ahmad and A. S. Das, “A heuristic algorithm for the minimization of incompletely specified finite state machines,” Computers & Electrical Engineering, vol. 27, no. 2, pp. 159–172, 2001. View at Publisher · View at Google Scholar
  21. B. Rosgen and L. Stewart, “Complexity results on graphs with few cliques,” Discrete Mathematics and Theoretical Computer Science, vol. 9, pp. 127–136, 2007. View at Google Scholar