File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: TDMA scheduling design of multihop packet radio networks based on latin squares

TitleTDMA scheduling design of multihop packet radio networks based on latin squares
Authors
Issue Date1999
Citation
Ieee Journal On Selected Areas In Communications, 1999, v. 17 n. 8, p. 1345-1352 How to Cite?
AbstractMany transmission scheduling algorithms have been proposed to maximize 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 require recomputations when the network topology changes. In addition, existing work focuses on single channel TDMA systems. In this paper, we propose a multichannel topology-transparent algorithm based on latin squares. The proposed algorithm has the flexibility to allow the growth of the network, i.e., the network can add more mobile nodes without recomputation of transmission schedules for existing nodes. At the same time, a minimum throughput is guaranteed. We analyze the efficiency of this algorithm and examine the topology-transparent characteristics and the sensitivity on design parameters by analytical and simulation techniques.
Persistent Identifierhttp://hdl.handle.net/10722/155102
ISSN
2015 Impact Factor: 3.672
2015 SCImago Journal Rankings: 2.915
References

 

DC FieldValueLanguage
dc.contributor.authorJu, JHen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2012-08-08T08:31:52Z-
dc.date.available2012-08-08T08:31:52Z-
dc.date.issued1999en_US
dc.identifier.citationIeee Journal On Selected Areas In Communications, 1999, v. 17 n. 8, p. 1345-1352en_US
dc.identifier.issn0733-8716en_US
dc.identifier.urihttp://hdl.handle.net/10722/155102-
dc.description.abstractMany transmission scheduling algorithms have been proposed to maximize 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 require recomputations when the network topology changes. In addition, existing work focuses on single channel TDMA systems. In this paper, we propose a multichannel topology-transparent algorithm based on latin squares. The proposed algorithm has the flexibility to allow the growth of the network, i.e., the network can add more mobile nodes without recomputation of transmission schedules for existing nodes. At the same time, a minimum throughput is guaranteed. We analyze the efficiency of this algorithm and examine the topology-transparent characteristics and the sensitivity on design parameters by analytical and simulation techniques.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Journal on Selected Areas in Communicationsen_US
dc.titleTDMA scheduling design of multihop packet radio networks based on latin squaresen_US
dc.typeArticleen_US
dc.identifier.emailLi, VOK:vli@eee.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/49.779918en_US
dc.identifier.scopuseid_2-s2.0-0032659920en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0032659920&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume17en_US
dc.identifier.issue8en_US
dc.identifier.spage1345en_US
dc.identifier.epage1352en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridJu, JH=7202751702en_US
dc.identifier.scopusauthoridLi, VOK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats