Show simple item record

REACTIVE GRASP WITH PATH RELINKING FOR BROADCAST SCHEDULING

dc.contributor.authorCommander, Clayton W.
dc.contributor.authorButenko, Sergiy I.
dc.contributor.authorPardalos, Panos M.
dc.contributor.authorOliveira, Carlos A.S.
dc.date.accessioned2016-04-18T18:38:19Zen
dc.date.available2016-04-18T18:38:19Zen
dc.date.issued2004-10en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/605798en
dc.descriptionInternational Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, Californiaen_US
dc.description.abstractThe Broadcast Scheduling Problem (BSP) is a well known NP-complete problem that arises in the study of wireless networks. In the BSP, a finite set of stations are to be scheduled in a time division multiple access (TDMA) frame. The objective is a collision free transmission schedule with the minimum number of TDMA slots and maximal slot utilization. Such a schedule will minimize the total system delay. We present variations of a Greedy Randomized Adaptive Search Procedure (GRASP) for the BSP. Path-relinking, a post-optimization strategy is applied. Also, a reactivity method is used to balance GRASP parameters. Numerical results of our research are reported and compared with other heuristics from the literature.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectBroadcast Scheduling Problemen
dc.subjectAd-hoc Networksen
dc.subjectCombinatorial Optimizationen
dc.subjectGRASPen
dc.subjectHeuristicsen
dc.titleREACTIVE GRASP WITH PATH RELINKING FOR BROADCAST SCHEDULINGen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentEglin Air Force Baseen
dc.contributor.departmentTexas A&M Universityen
dc.contributor.departmentUniversity of Floridaen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
refterms.dateFOA2018-06-17T23:32:31Z
html.description.abstractThe Broadcast Scheduling Problem (BSP) is a well known NP-complete problem that arises in the study of wireless networks. In the BSP, a finite set of stations are to be scheduled in a time division multiple access (TDMA) frame. The objective is a collision free transmission schedule with the minimum number of TDMA slots and maximal slot utilization. Such a schedule will minimize the total system delay. We present variations of a Greedy Randomized Adaptive Search Procedure (GRASP) for the BSP. Path-relinking, a post-optimization strategy is applied. Also, a reactivity method is used to balance GRASP parameters. Numerical results of our research are reported and compared with other heuristics from the literature.


Files in this item

Thumbnail
Name:
ITC_2004_04-22-01.pdf
Size:
138.2Kb
Format:
PDF
Download

This item appears in the following Collection(s)

Show simple item record