Location Partition Routing Protocol for Ad Hoc Wireless Networks

碩士 === 元智大學 === 資訊工程學系 === 90 === The routing protocols for Ad Hoc wireless networks can be classified into two categories: ”Table-driven” and “On Demand” routing protocols. Here, we are dealing with “On Demand” routing protocol. In this paper, we propose a strategy that selects the rec...

Full description

Bibliographic Details
Main Authors: Pei-Hong Chen, 陳佩鴻
Other Authors: Dr.Robin Liu
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/68252359148278624721
Description
Summary:碩士 === 元智大學 === 資訊工程學系 === 90 === The routing protocols for Ad Hoc wireless networks can be classified into two categories: ”Table-driven” and “On Demand” routing protocols. Here, we are dealing with “On Demand” routing protocol. In this paper, we propose a strategy that selects the receiving nodes within the best transmitting range of the sending node, such that the routing path is more reliable. In order to make sure that the receiving nodes are within the best transmitting range, we will utilize the location function of GPS. Besides, for reducing the flooding of control packets, we will partition the topological space into equal-size & equal-number blocks with gray and white (color) ones interlaced each other and only allow the nodes in gray blocks to transmit the request packets. Basically, our method should establish a quite stable routing path with easy maintenance and reduce the number of control packets for routing quite efficiently.