File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fair spatial TDMA channel access protocols for multihop radio networks

TitleFair spatial TDMA channel access protocols for multihop radio networks
Authors
Issue Date1991
PublisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/
Citation
Proceedings - Ieee Infocom, 1991, v. 3, p. 1064-1073 How to Cite?
AbstractThe issues of fairness are considered in designing time division multiple access (TDMA) channel access protocols for multihop radio networks. It is shown that there is a limitation as to how fair one can design a channel access protocol for a static multihop radio network. Several fairness measures which are functions of the channel access protocol and the network topology are proposed. It is shown that to find the optimal protocol with respect to any defined fairness measure is NP-hard. Criteria for designing a fair protocol which are independent of the network topology are introduced and their properties are proved. A lower upper bound of one of the measures is found. Two heuristic protocols are developed based on these criteria. Performance comparisons with existing protocols are given.
Persistent Identifierhttp://hdl.handle.net/10722/158087
ISSN

 

DC FieldValueLanguage
dc.contributor.authorChou, ArrMienen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:58:01Z-
dc.date.available2012-08-08T08:58:01Z-
dc.date.issued1991en_US
dc.identifier.citationProceedings - Ieee Infocom, 1991, v. 3, p. 1064-1073en_US
dc.identifier.issn0743-166Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/158087-
dc.description.abstractThe issues of fairness are considered in designing time division multiple access (TDMA) channel access protocols for multihop radio networks. It is shown that there is a limitation as to how fair one can design a channel access protocol for a static multihop radio network. Several fairness measures which are functions of the channel access protocol and the network topology are proposed. It is shown that to find the optimal protocol with respect to any defined fairness measure is NP-hard. Criteria for designing a fair protocol which are independent of the network topology are introduced and their properties are proved. A lower upper bound of one of the measures is found. Two heuristic protocols are developed based on these criteria. Performance comparisons with existing protocols are given.en_US
dc.languageengen_US
dc.publisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/en_US
dc.relation.ispartofProceedings - IEEE INFOCOMen_US
dc.titleFair spatial TDMA channel access protocols for multihop radio networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, Victor OK:vli@eee.hku.hken_US
dc.identifier.authorityLi, Victor OK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0025849816en_US
dc.identifier.volume3en_US
dc.identifier.spage1064en_US
dc.identifier.epage1073en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChou, ArrMien=7006164493en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats