File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An optimal topology-transparent scheduling method in multihop packet radio networks

TitleAn optimal topology-transparent scheduling method in multihop packet radio networks
Authors
KeywordsPacket radio network
Time-division multiple access
Topology-transparent scheduling
Issue Date1998
PublisherI E E E. The Journal's web site is located at http://www.comsoc.org/livepubs/net
Citation
Ieee/Acm Transactions On Networking, 1998, v. 6 n. 3, p. 298-306 How to Cite?
AbstractMany transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length in multihop packet radio networks. Almost all existing algorithms assume exact network topology information and do not adapt to different traffic requirements. Chlamtac and Farago proposed a topology-transparent algorithm. Following their approach, but with a different design strategy, we propose another algorithm which is optimal in that it maximizes the minimum throughput. We compare our algorithm with that of Chlamtac and Farago's and with the TDMA algorithm, and find that it gives better performance in terms of minimum throughput and minimum and maximum delay times. Our algorithm requires estimated values of the number of nodes and the maximum nodal degree in the network. However, we show that the performance of our algorithm is insensitive to these design parameters. © 1998 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/42770
ISSN
2015 Impact Factor: 2.186
2015 SCImago Journal Rankings: 1.795
References

 

DC FieldValueLanguage
dc.contributor.authorJu, JHen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2007-03-23T04:31:51Z-
dc.date.available2007-03-23T04:31:51Z-
dc.date.issued1998en_HK
dc.identifier.citationIeee/Acm Transactions On Networking, 1998, v. 6 n. 3, p. 298-306en_HK
dc.identifier.issn1063-6692en_HK
dc.identifier.urihttp://hdl.handle.net/10722/42770-
dc.description.abstractMany transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length in multihop packet radio networks. Almost all existing algorithms assume exact network topology information and do not adapt to different traffic requirements. Chlamtac and Farago proposed a topology-transparent algorithm. Following their approach, but with a different design strategy, we propose another algorithm which is optimal in that it maximizes the minimum throughput. We compare our algorithm with that of Chlamtac and Farago's and with the TDMA algorithm, and find that it gives better performance in terms of minimum throughput and minimum and maximum delay times. Our algorithm requires estimated values of the number of nodes and the maximum nodal degree in the network. However, we show that the performance of our algorithm is insensitive to these design parameters. © 1998 IEEE.en_HK
dc.format.extent270284 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://www.comsoc.org/livepubs/neten_HK
dc.relation.ispartofIEEE/ACM Transactions on Networkingen_HK
dc.rights©1998 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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectPacket radio networken_HK
dc.subjectTime-division multiple accessen_HK
dc.subjectTopology-transparent schedulingen_HK
dc.titleAn optimal topology-transparent scheduling method in multihop packet radio networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1063-6692&volume=6&issue=3&spage=298&epage=306&date=1998&atitle=An+optimal+topology-transparent+scheduling+method+in+multihop+packet+radio+networksen_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/90.700893en_HK
dc.identifier.scopuseid_2-s2.0-0032098795en_HK
dc.identifier.hkuros34352-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0032098795&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6en_HK
dc.identifier.issue3en_HK
dc.identifier.spage298en_HK
dc.identifier.epage306en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridJu, JH=7202751702en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats