EUVIMEDEUVIMED entdecken
Open Access · CC BY 3.0

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

Imtiaz Ahmad, Buthaina Al-Kazemi, A. Shoba Das

Journal of Computer Networks and Communications · 2008

DOI: 10.1155/2008/712126 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computer Networks and Communications, 2008. Verfasst von Imtiaz Ahmad und 2 weiteren Autor:innen. Die Arbeit wurde bisher 15-mal zitiert (Crossref) und nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 3.0). Gefördert von: Kuwait University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • Kuwait University

Zitieren

APA

Ahmad, I., Al-Kazemi, B., & Das, A. S. (2008). An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks. Journal of Computer Networks and Communications. https://doi.org/10.1155/2008/712126

Vancouver

Ahmad I, Al-Kazemi B, Das AS. An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks. Journal of Computer Networks and Communications. 2008. doi:10.1155/2008/712126

BibTeX
@article{Ahmad2008,
  author = {Ahmad, Imtiaz and Al-Kazemi, Buthaina and Das, A. Shoba},
  title = {An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks},
  journal = {Journal of Computer Networks and Communications},
  year = {2008},
  doi = {10.1155/2008/712126}
}
Kostenlos starten →