Full metadata record
DC FieldValueLanguage
dc.contributor.authorJan, RHen_US
dc.contributor.authorLin, YLen_US
dc.date.accessioned2014-12-08T15:38:29Z-
dc.date.available2014-12-08T15:38:29Z-
dc.date.issued2004-10-01en_US
dc.identifier.issn0916-8516en_US
dc.identifier.urihttp://hdl.handle.net/11536/26348-
dc.description.abstractA multi-hop wireless local area network (LAN) is an adhoc wireless network that connects to the Internet backbone via an access point. Routing paths between mobile hosts and a fixed host can be divided into two sub-paths, wireless and wired. In this paper, we apply the Hierarchical Routing Tree (HRT) concept to finding wireless sub-paths. That is, by constructing an HRT. each mobile host can find a routing path to an access point (i.e.. the HRT root) quickly and thus gain the access to Internet. In addition, we choose the Ad-hoc On-demand Distance Vector (AODV) routing protocol as a point-to-point routing method for sources and destinations located in the same ad-hoc network in order to improve upon a weakness in the HRT method. Numerical experiments are given to show the effectiveness of the hybrid routing method.en_US
dc.language.isoen_USen_US
dc.subjectrouting protocolen_US
dc.subjectad-hoc networksen_US
dc.subjectwireless LANen_US
dc.titleA hybrid routing method for multi-hop wireless local area networksen_US
dc.typeArticleen_US
dc.identifier.journalIEICE TRANSACTIONS ON COMMUNICATIONSen_US
dc.citation.volumeE87Ben_US
dc.citation.issue10en_US
dc.citation.spage2939en_US
dc.citation.epage2945en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000224393900012-
dc.citation.woscount0-
Appears in Collections:Articles