A Hybrid Location Service Scheme for Large Ad Hoc Networks

碩士 === 逢甲大學 === 資訊工程所 === 91 === Wireless ad hoc networks are dynamically organized by a collection of wireless mobile hosts. The communication between mobile hosts can be accomplished via the nearby mobile hosts interchanging messages. In ad hoc networks, any pre-established wired or wireless infru...

Full description

Bibliographic Details
Main Authors: Kun-Hsien Lu, 呂坤憲
Other Authors: Shiow-Fen Hwang
Format: Others
Language:zh-TW
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/2ryvf4
Description
Summary:碩士 === 逢甲大學 === 資訊工程所 === 91 === Wireless ad hoc networks are dynamically organized by a collection of wireless mobile hosts. The communication between mobile hosts can be accomplished via the nearby mobile hosts interchanging messages. In ad hoc networks, any pre-established wired or wireless infrustrctures and the centralized administration, such as the base stations, are unnecessary. Thus, the wireless ad hoc network is especially important and useful in the small region or the region without base station supporting such as in battlefield or disaster area. Recently, due to the popularity of GPS (Global Positioning System), many researchers focus on the location-aware mobile ad hoc networks for routing problems. However, most of them do not consider the location service problem (the source how to obtain the location information of the destination). Although the location information can be obtained by utilizing flooding scheme, the performance of routing will be effected due to the waste of bandwidth or network congestion under the limitations of network bandwidth, memory capacity and battery power. A few papers of the location service are therefore presented gradually, but almost of them are limited by the number of mobile hosts and have large location update overhead. In this paper, we design a hybrid location service scheme which combines the advantages of proactive and reactive mechanism for large ad hoc network. Simulations indicate our scheme is superior in location update overhead, query path length (in hops) and query success rate.