File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/VETECS.2010.5493671
- Scopus: eid_2-s2.0-77954915043
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Effect of information on routing performance in multi-hop wireless networks
Title | Effect of information on routing performance in multi-hop wireless networks |
---|---|
Authors | |
Keywords | Amount of information Analytical results Distance vector Key issues Limited information |
Issue Date | 2010 |
Publisher | IEEE. |
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? |
Abstract | A 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. |
Description | Proceedings of the IEEE Conference on Vehicular Technology, 2010, p. 1-5 |
Persistent Identifier | http://hdl.handle.net/10722/126114 |
ISSN | 2020 SCImago Journal Rankings: 0.277 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hong, J | en_HK |
dc.contributor.author | Li, VOK | en_HK |
dc.date.accessioned | 2010-10-31T12:10:33Z | - |
dc.date.available | 2010-10-31T12:10:33Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.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 | en_HK |
dc.identifier.issn | 1550-2252 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/126114 | - |
dc.description | Proceedings of the IEEE Conference on Vehicular Technology, 2010, p. 1-5 | - |
dc.description.abstract | A 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.language | eng | en_HK |
dc.publisher | IEEE. | - |
dc.relation.ispartof | Proceedings of the IEEE Conference on Vehicular Technology | en_HK |
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.subject | Amount of information | - |
dc.subject | Analytical results | - |
dc.subject | Distance vector | - |
dc.subject | Key issues | - |
dc.subject | Limited information | - |
dc.title | Effect of information on routing performance in multi-hop wireless networks | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://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.email | Li, VOK:vli@eee.hku.hk | en_HK |
dc.identifier.authority | Li, VOK=rp00150 | en_HK |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/VETECS.2010.5493671 | en_HK |
dc.identifier.scopus | eid_2-s2.0-77954915043 | en_HK |
dc.identifier.hkuros | 181414 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-77954915043&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 1 | - |
dc.identifier.epage | 5 | - |
dc.publisher.place | United States | en_HK |
dc.description.other | 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 | - |
dc.identifier.scopusauthorid | Hong, J=36052637200 | en_HK |
dc.identifier.scopusauthorid | Li, VOK=7202621685 | en_HK |