{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:43:35Z","timestamp":1753886615936,"version":"3.41.2"},"reference-count":21,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2009,2,25]],"date-time":"2009-02-25T00:00:00Z","timestamp":1235520000000},"content-version":"vor","delay-in-days":421,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100004482","name":"Kuwait University","doi-asserted-by":"publisher","award":["EO 07\/06"],"award-info":[{"award-number":["EO 07\/06"]}],"id":[{"id":"10.13039\/501100004482","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Networks and Communications"],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>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\u2010free 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\u2010complete, 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\u2010free broadcast with minimum frame length and the maximum slot utilization in relatively shorter time.<\/jats:p>","DOI":"10.1155\/2008\/712126","type":"journal-article","created":{"date-parts":[[2009,2,25]],"date-time":"2009-02-25T15:06:12Z","timestamp":1235574372000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["An Efficient Algorithm to Find Broadcast Schedule in  Ad Hoc TDMA Networks"],"prefix":"10.1155","volume":"2008","author":[{"given":"Imtiaz","family":"Ahmad","sequence":"first","affiliation":[]},{"given":"Buthaina","family":"Al-Kazemi","sequence":"additional","affiliation":[]},{"given":"A. Shoba","family":"Das","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2009,2,25]]},"reference":[{"key":"e_1_2_7_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.52656"},{"key":"e_1_2_7_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.231903"},{"key":"e_1_2_7_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.222924"},{"key":"e_1_2_7_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2002.1043857"},{"key":"e_1_2_7_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.552074"},{"key":"e_1_2_7_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00057-0"},{"key":"e_1_2_7_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2003.808967"},{"key":"e_1_2_7_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2002.807634"},{"key":"e_1_2_7_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826234"},{"key":"e_1_2_7_10_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:20040263"},{"key":"e_1_2_7_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.816950"},{"key":"e_1_2_7_12_2","unstructured":"CommanderC. W. ButenkoS. I. PardalosP. M. andOliveiraC. A. S. Reactive GRASP with path relinking for the broadcast scheduling problem Proceedings of the 40th Annual International Telemetry Conference (ITC \u203204) October 2004 San Diego Calif USA 792\u2013800."},{"key":"e_1_2_7_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2006.1638642"},{"key":"e_1_2_7_14_2","doi-asserted-by":"crossref","unstructured":"ShiH.andpg02782641@ntu.edu.sg WangL. elpwang@ntu.edu.sg A hybrid neural network for optimal TDMA transmission scheduling in packet radio networks 5 Proceedings of IEEE International Joint Conference on Neural Networks (IJCNN \u203205) July-August 2005 Montreal Canada 3210\u20133213 https:\/\/doi.org\/10.1109\/IJCNN.2005.1556441.","DOI":"10.1109\/IJCNN.2005.1556441"},{"key":"e_1_2_7_15_2","first-page":"23","article-title":"An improved neural network algorithm for broad-cast scheduling problem in packet radio","volume":"9","author":"Bi W.","year":"2005","journal-title":"Neural Information Processing-Letters and Reviews"},{"key":"e_1_2_7_16_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20045188"},{"key":"e_1_2_7_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2006.10.024"},{"volume-title":"Theory and Algorithms for Cooperative Systems","year":"2004","author":"Commander C. W.","key":"e_1_2_7_18_2"},{"key":"e_1_2_7_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.229748"},{"key":"e_1_2_7_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7906(00)00016-1"},{"key":"e_1_2_7_21_2","first-page":"127","article-title":"Complexity results on graphs with few cliques","volume":"9","author":"Rosgen B.","year":"2007","journal-title":"Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Journal of Computer Networks and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2008\/712126.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2008\/712126.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2008\/712126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T12:47:04Z","timestamp":1719924424000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2008\/712126"}},"subtitle":[],"editor":[{"given":"Nidal","family":"Nasser","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1155\/2008\/712126"],"URL":"https:\/\/doi.org\/10.1155\/2008\/712126","archive":["Portico"],"relation":{},"ISSN":["2090-7141","2090-715X"],"issn-type":[{"type":"print","value":"2090-7141"},{"type":"electronic","value":"2090-715X"}],"subject":[],"published":{"date-parts":[[2008,1]]},"assertion":[{"value":"2008-09-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-02-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"712126"}}