File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/WCL.2013.091113.130592
- Scopus: eid_2-s2.0-84891556133
- WOS: WOS:000209697100021
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks?
Title | Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks? |
---|---|
Authors | |
Keywords | efficiency topology-dependent scheduling Topology-transparent scheduling |
Issue Date | 2013 |
Publisher | IEEE. |
Citation | IEEE Wireless Communications Letters, 2013, v. 2 n. 6, p. 659-662 How to Cite? |
Abstract | Topology-transparent scheduling algorithms are oblivious to the network topology changes and can provide throughput and delay guarantees in mobile multihop networks. However, it has been argued that topology-transparent scheduling algorithms are inefficient when the network is static, compared to topology-dependent scheduling algorithms. In this paper, we propose to utilize both assigned and unassigned slots efficiently to boost the performance of topology-transparent scheduling algorithms. We conclude that, in certain cases, the performance of the proposed topology-transparent scheduling algorithm can be comparable to or better than that of some topology-dependent algorithms even when the network topology remains unchanged. Yet, the proposed algorithm also works even when the network topology is dynamic. |
Persistent Identifier | http://hdl.handle.net/10722/200613 |
ISSN | 2023 Impact Factor: 4.6 2023 SCImago Journal Rankings: 2.872 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Y | en_US |
dc.contributor.author | Li, VOK | en_US |
dc.contributor.author | Leung, KC | en_US |
dc.contributor.author | Zhang, L | en_US |
dc.date.accessioned | 2014-08-21T06:52:40Z | - |
dc.date.available | 2014-08-21T06:52:40Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.citation | IEEE Wireless Communications Letters, 2013, v. 2 n. 6, p. 659-662 | en_US |
dc.identifier.issn | 2162-2337 | - |
dc.identifier.uri | http://hdl.handle.net/10722/200613 | - |
dc.description.abstract | Topology-transparent scheduling algorithms are oblivious to the network topology changes and can provide throughput and delay guarantees in mobile multihop networks. However, it has been argued that topology-transparent scheduling algorithms are inefficient when the network is static, compared to topology-dependent scheduling algorithms. In this paper, we propose to utilize both assigned and unassigned slots efficiently to boost the performance of topology-transparent scheduling algorithms. We conclude that, in certain cases, the performance of the proposed topology-transparent scheduling algorithm can be comparable to or better than that of some topology-dependent algorithms even when the network topology remains unchanged. Yet, the proposed algorithm also works even when the network topology is dynamic. | - |
dc.language | eng | en_US |
dc.publisher | IEEE. | en_US |
dc.relation.ispartof | IEEE Wireless Communications Letters | en_US |
dc.subject | efficiency | - |
dc.subject | topology-dependent scheduling | - |
dc.subject | Topology-transparent scheduling | - |
dc.title | Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks? | en_US |
dc.type | Article | en_US |
dc.identifier.email | Liu, Y: ymliu@eee.hku.hk | en_US |
dc.identifier.email | Li, VOK: vli@eee.hku.hk | en_US |
dc.identifier.email | Leung, KC: kacleung@hkucc.hku.hk | en_US |
dc.identifier.authority | Li, VOK=rp00150 | en_US |
dc.identifier.authority | Leung, KC=rp00147 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/WCL.2013.091113.130592 | - |
dc.identifier.scopus | eid_2-s2.0-84891556133 | - |
dc.identifier.hkuros | 233405 | en_US |
dc.identifier.volume | 2 | en_US |
dc.identifier.spage | 659 | en_US |
dc.identifier.epage | 662 | en_US |
dc.identifier.eissn | 2162-2345 | - |
dc.identifier.isi | WOS:000209697100021 | - |
dc.identifier.issnl | 2162-2337 | - |