Hierarchical District Partition Routing Protocol for Ad Hoc Wireless Networks

• Main Authors: Kun - Yu Yang, 楊坤育
• Other Authors: Ru - Sheng Liu
• Format: Others
• Language: zh-TW
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/50562789225675962557

碩士 === 元智大學 === 資訊工程學系 === 89 === The routing protocols for Ad Hoc wireless networks can be classified into two major categories. The first one is “Table-driven” routing protocol. Due to exchanging the routing information periodically, it is suitable for small scale’s networks. The second one is “On-demand” routing protocols. It has the advantage that only the needed information for routing is recorded. However, it may have the “Flooding problem”. In this paper, we proposed an efficient GPS aided routing protocol for Ad Hoc wireless networks. Through GPS, the network area is first partitioned into a finite numbers of non-overlapped equal-size square districts with gray and white ones interlaced each other. Next, a mobile host will be select as the gateway for each district. Then, the communication inside the district is using the Table-driven method and the communication between different districts is utilizing the On-demand protocol through the gateway hosts in gray districts. Our approach can be reduce the number of control packets quite well and promote the network efficiency.