Persistent Link:
http://hdl.handle.net/10150/605798
Title:
REACTIVE GRASP WITH PATH RELINKING FOR BROADCAST SCHEDULING
Author:
Commander, Clayton W.; Butenko, Sergiy I.; Pardalos, Panos M.; Oliveira, Carlos A.S.
Affiliation:
Eglin Air Force Base; Texas A&M University; University of Florida
Issue Date:
2004-10
Rights:
Copyright © International Foundation for Telemetering
Collection Information:
Proceedings 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.
Publisher:
International Foundation for Telemetering
Journal:
International Telemetering Conference Proceedings
Abstract:
The 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.
Keywords:
Broadcast Scheduling Problem; Ad-hoc Networks; Combinatorial Optimization; GRASP; Heuristics
Sponsors:
International Foundation for Telemetering
ISSN:
0884-5123; 0074-9079
Additional Links:
http://www.telemetry.org/

Full metadata record

DC FieldValue Language
dc.language.isoen_USen
dc.titleREACTIVE GRASP WITH PATH RELINKING FOR BROADCAST SCHEDULINGen_US
dc.contributor.authorCommander, Clayton W.en
dc.contributor.authorButenko, Sergiy I.en
dc.contributor.authorPardalos, Panos M.en
dc.contributor.authorOliveira, Carlos A.S.en
dc.contributor.departmentEglin Air Force Baseen
dc.contributor.departmentTexas A&M Universityen
dc.contributor.departmentUniversity of Floridaen
dc.date.issued2004-10en
dc.rightsCopyright © International Foundation for Telemeteringen
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
dc.publisherInternational Foundation for Telemeteringen
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.en
dc.subjectBroadcast Scheduling Problemen
dc.subjectAd-hoc Networksen
dc.subjectCombinatorial Optimizationen
dc.subjectGRASPen
dc.subjectHeuristicsen
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/605798en
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.typetexten
dc.typeProceedingsen
dc.relation.urlhttp://www.telemetry.org/en
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.