File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms

TitleCentralized broadcast scheduling in packet radio networks via genetic-fix algorithms
Authors
KeywordsBroadcast scheduling
Genetic algorithms (GAs)
Issue Date2003
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26
Citation
Ieee Transactions On Communications, 2003, v. 51 n. 9, p. 1439-1441 How to Cite?
AbstractAn important, yet difficult, problem in the design of a packet radio network is the determination of a conflict-free broadcast schedule at a minimum cycle length. In this letter, we first formulate the problem via a within-two-hop connectivity matrix and then, by assuming a known cycle length, determine a conflict-free scheduling pattern using a centralized approach that exploits the structure of the problem via a modified genetic algorithm. This algorithm, called genetic-fix, generates and manipulates individuals with fixed size (i.e., in binary representation, the number of ones is fixed) and therefore, can reduce the search space substantially. We also propose a method to find a reasonable cycle length and shorten it gradually to obtain a near-optimal one. Simulations on three benchmark problems showed that our approach could achieve 100% convergence to solutions with optimal cycle length within reasonable time.
Persistent Identifierhttp://hdl.handle.net/10722/42978
ISSN
2015 Impact Factor: 2.298
2015 SCImago Journal Rankings: 1.659
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorNgo, CYen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2007-03-23T04:35:55Z-
dc.date.available2007-03-23T04:35:55Z-
dc.date.issued2003en_HK
dc.identifier.citationIeee Transactions On Communications, 2003, v. 51 n. 9, p. 1439-1441en_HK
dc.identifier.issn0090-6778en_HK
dc.identifier.urihttp://hdl.handle.net/10722/42978-
dc.description.abstractAn important, yet difficult, problem in the design of a packet radio network is the determination of a conflict-free broadcast schedule at a minimum cycle length. In this letter, we first formulate the problem via a within-two-hop connectivity matrix and then, by assuming a known cycle length, determine a conflict-free scheduling pattern using a centralized approach that exploits the structure of the problem via a modified genetic algorithm. This algorithm, called genetic-fix, generates and manipulates individuals with fixed size (i.e., in binary representation, the number of ones is fixed) and therefore, can reduce the search space substantially. We also propose a method to find a reasonable cycle length and shorten it gradually to obtain a near-optimal one. Simulations on three benchmark problems showed that our approach could achieve 100% convergence to solutions with optimal cycle length within reasonable time.en_HK
dc.format.extent207602 bytes-
dc.format.extent158720 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26en_HK
dc.relation.ispartofIEEE Transactions on Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectBroadcast schedulingen_HK
dc.subjectGenetic algorithms (GAs)en_HK
dc.titleCentralized broadcast scheduling in packet radio networks via genetic-fix algorithmsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0090-6778&volume=51&issue=9&spage=1439&epage=1441&date=2003&atitle=Centralized+broadcast+scheduling+in+packet+radio+networks+via+genetic-fix+algorithmsen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TCOMM.2003.816950en_HK
dc.identifier.scopuseid_2-s2.0-0141885956en_HK
dc.identifier.hkuros92049-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0141885956&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume51en_HK
dc.identifier.issue9en_HK
dc.identifier.spage1439en_HK
dc.identifier.epage1441en_HK
dc.identifier.isiWOS:000185418500006-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridNgo, CY=7005184328en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats