File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Effect of information on routing performance in multi-hop wireless networks

TitleEffect of information on routing performance in multi-hop wireless networks
Authors
KeywordsAmount of information
Analytical results
Distance vector
Key issues
Limited information
Issue Date2010
PublisherIEEE.
Citation
The 71st IEEE Conference on Vehicular Technology (VTC 2010-Spring), Taipei, Taiwan, 16-19 May 2010. In Proceedings of the 71st IEEE IEEE Conference on Vehicular Technology, 2010, p. 1-5 How to Cite?
AbstractA key issue impacting wireless network performance is network information. In wireless networks, a significant amount of bandwidth and power resource is consumed to disseminate and maintain routing information. Previous work has presented different methods to broadcast and store such routing information so as to reduce the overhead. However, the amount of information required for a routing algorithm to be effective is not studied theoretically. In this paper, we consider two kinds of routing information, i.e., location information and link state information, and study the quantitative relationship between the available routing information and network performance. It is assumed that each node in the network can only obtain information of its k-hop neighbors, and for each packet, a distance vector based algorithm is employed to minimize the number of hops for the packet to reach its destination with the limited information. We then present a methodology to derive the analytical result on the quantitative relationship between routing performance and the information available for each node. The analysis in this paper can be a valuable tool on designing routing algorithms in wireless networks. © 2010 IEEE.
DescriptionProceedings of the IEEE Conference on Vehicular Technology, 2010, p. 1-5
Persistent Identifierhttp://hdl.handle.net/10722/126114
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorHong, Jen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2010-10-31T12:10:33Z-
dc.date.available2010-10-31T12:10:33Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 71st IEEE Conference on Vehicular Technology (VTC 2010-Spring), Taipei, Taiwan, 16-19 May 2010. In Proceedings of the 71st IEEE IEEE Conference on Vehicular Technology, 2010, p. 1-5en_HK
dc.identifier.issn1550-2252en_HK
dc.identifier.urihttp://hdl.handle.net/10722/126114-
dc.descriptionProceedings of the IEEE Conference on Vehicular Technology, 2010, p. 1-5-
dc.description.abstractA key issue impacting wireless network performance is network information. In wireless networks, a significant amount of bandwidth and power resource is consumed to disseminate and maintain routing information. Previous work has presented different methods to broadcast and store such routing information so as to reduce the overhead. However, the amount of information required for a routing algorithm to be effective is not studied theoretically. In this paper, we consider two kinds of routing information, i.e., location information and link state information, and study the quantitative relationship between the available routing information and network performance. It is assumed that each node in the network can only obtain information of its k-hop neighbors, and for each packet, a distance vector based algorithm is employed to minimize the number of hops for the packet to reach its destination with the limited information. We then present a methodology to derive the analytical result on the quantitative relationship between routing performance and the information available for each node. The analysis in this paper can be a valuable tool on designing routing algorithms in wireless networks. © 2010 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.-
dc.relation.ispartofProceedings of the IEEE Conference on Vehicular Technologyen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsIEEE-VTS Vehicular Technology Conference Proceedings. 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.subjectAmount of information-
dc.subjectAnalytical results-
dc.subjectDistance vector-
dc.subjectKey issues-
dc.subjectLimited information-
dc.titleEffect of information on routing performance in multi-hop wireless networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1550-2252&volume=&spage=1&epage=5&date=2010&atitle=Effect+of+information+on+routing+performance+in+multi-hop+wireless+networks-
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/VETECS.2010.5493671en_HK
dc.identifier.scopuseid_2-s2.0-77954915043en_HK
dc.identifier.hkuros181414en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77954915043&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage5-
dc.publisher.placeUnited Statesen_HK
dc.description.otherThe 71st IEEE Conference on Vehicular Technology (VTC 2010-Spring), Taipei, Taiwan, 16-19 May 2010. In Proceedings of the 71st IEEE IEEE Conference on Vehicular Technology, 2010, p. 1-5-
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