File Download
Supplementary

Article: Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks?

TitleIs Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks?
Authors
Issue Date2013
PublisherIEEE.
Citation
IEEE Wireless Communications Letters, 2013, v. 2 n. 6, p. 659-662 How to Cite?
Persistent Identifierhttp://hdl.handle.net/10722/200613

 

DC FieldValueLanguage
dc.contributor.authorLiu, Yen_US
dc.contributor.authorLi, VOKen_US
dc.contributor.authorLeung, KCen_US
dc.contributor.authorZhang, Len_US
dc.date.accessioned2014-08-21T06:52:40Z-
dc.date.available2014-08-21T06:52:40Z-
dc.date.issued2013en_US
dc.identifier.citationIEEE Wireless Communications Letters, 2013, v. 2 n. 6, p. 659-662en_US
dc.identifier.urihttp://hdl.handle.net/10722/200613-
dc.languageengen_US
dc.publisherIEEE.en_US
dc.relation.ispartofIEEE Wireless Communications Lettersen_US
dc.rightsIEEE Wireless Communications Letters. Copyright © IEEE.en_US
dc.rights©2013 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_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleIs Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks?en_US
dc.typeArticleen_US
dc.identifier.emailLiu, Y: ymliu@eee.hku.hken_US
dc.identifier.emailLi, VOK: vli@eee.hku.hken_US
dc.identifier.emailLeung, KC: kacleung@hkucc.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.identifier.authorityLeung, KC=rp00147en_US
dc.description.naturepublished_or_final_version-
dc.identifier.hkuros233405en_US
dc.identifier.volume2en_US
dc.identifier.spage659en_US
dc.identifier.epage662en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats