An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks. (4th January 2009)

• Record Type: Journal Article
• Authors: Ahmad Ahmad, Imtiaz Imtiaz; Al-Kazemi Al-Kazemi, Buthaina Buthaina; Das Das, A. Shoba A. Shoba
• Other Names: Nasser Nasser Nidal Nidal Academic Editor.
• Is Part Of: Journal of computer systems, networks, and communications. Volume 2008(2008)
• Publication Date: 2009-01-04
• Subjects: Computer systems -- Periodicals; Computer networks -- Periodicals; Computer networks; Computer systems; Periodicals; Electronic journals; 004.605
• DOI: 10.1155/2008/712126
• Languages: English
• ISSNs: 1687-7381

Abstract

Abstract : The broadcast scheduling is of fundamental importance and practical concern for ad hoc network performance measures such as the communication delay and the throughput. The scheduling problem on hand involves determination of a collision-free broadcast schedule with the minimum length TDMA frame and the maximum slot utilization by efficient distribution of slots among stations. The problem is widely known as NP-complete, and diverse heuristic algorithms were reported to solve this problem recently. The intractable nature of the broadcast scheduling problem and its importance in ad hoc TDMA networks necessitates development of more efficient heuristic algorithms. In this paper, we developed a new heuristic approach which employs a tight lower bound derived from the maximal incompatibles and generates a search space from the set of maximal compatibles. The developed algorithm is very efficient and effective in conquering the intractable nature of the broadcast scheduling problem in the sense that it explores complex solution space in smaller CPU time. A comparison with existing techniques for the test examples reported in the literature shows that our algorithm achieves a collision-free broadcast with minimum frame length and the maximum slot utilization in relatively shorter time.