File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: The effect of information on scheduling performance in multi-hop wireless networks

TitleThe effect of information on scheduling performance in multi-hop wireless networks
Authors
Keywordsmulti-hop wireless networks
Network state information
scheduling
Issue Date2010
PublisherIEEE.
Citation
Ieee Transactions On Wireless Communications, 2010, v. 9 n. 10, p. 3238-3246 How to Cite?
AbstractPrevious research has estimated the performance of wireless networks by assuming that nodes in the network can obtain precise network information. However, in reality, available network information is mostly imprecise and incomplete. In this paper, we study the relationship between wireless network performance and available network information. It is assumed that each node in the network can obtain the information about other nodes within its information collection range, and a distributed graph coloring algorithm is employed to perform scheduling with the available information. The analytical result on the quantitative relationship between the information collection range and the network throughput is derived. We also consider the communication overhead of collecting information, and analyze the tradeoff between network capacity improvement and information collection overhead. Based on the derived result, an optimal information collection range which maximizes the net data rate can be found. Since wireless networks are typically mobile, and the collected information may be inaccurate due to the dynamics of the networks, we analyze the effect of information for mobile wireless networks by considering the information updating rate, and the result can be used to determine the information collection range as well as the information updating period. © 2010 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/142342
ISSN
2015 Impact Factor: 2.925
2015 SCImago Journal Rankings: 2.340
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorHong, Jen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2011-10-28T02:43:55Z-
dc.date.available2011-10-28T02:43:55Z-
dc.date.issued2010en_HK
dc.identifier.citationIeee Transactions On Wireless Communications, 2010, v. 9 n. 10, p. 3238-3246en_HK
dc.identifier.issn1536-1276en_HK
dc.identifier.urihttp://hdl.handle.net/10722/142342-
dc.description.abstractPrevious research has estimated the performance of wireless networks by assuming that nodes in the network can obtain precise network information. However, in reality, available network information is mostly imprecise and incomplete. In this paper, we study the relationship between wireless network performance and available network information. It is assumed that each node in the network can obtain the information about other nodes within its information collection range, and a distributed graph coloring algorithm is employed to perform scheduling with the available information. The analytical result on the quantitative relationship between the information collection range and the network throughput is derived. We also consider the communication overhead of collecting information, and analyze the tradeoff between network capacity improvement and information collection overhead. Based on the derived result, an optimal information collection range which maximizes the net data rate can be found. Since wireless networks are typically mobile, and the collected information may be inaccurate due to the dynamics of the networks, we analyze the effect of information for mobile wireless networks by considering the information updating rate, and the result can be used to determine the information collection range as well as the information updating period. © 2010 IEEE.en_HK
dc.languageengen_US
dc.publisherIEEE.-
dc.relation.ispartofIEEE Transactions on Wireless Communicationsen_HK
dc.rightsIEEE Transactions on Wireless Communications. Copyright © IEEE.-
dc.rights©2010 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.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectmulti-hop wireless networksen_HK
dc.subjectNetwork state informationen_HK
dc.subjectschedulingen_HK
dc.titleThe effect of information on scheduling performance in multi-hop wireless networksen_HK
dc.typeArticleen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/TWC.2010.090210.091764en_HK
dc.identifier.scopuseid_2-s2.0-77957895614en_HK
dc.identifier.hkuros196883en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77957895614&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume9en_HK
dc.identifier.issue10en_HK
dc.identifier.spage3238en_HK
dc.identifier.epage3246en_HK
dc.identifier.isiWOS:000283436800029-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridHong, J=36052637200en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats