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
id ndltd-TW-090YZU00392028
record_format oai_dc
spelling ndltd-TW-090YZU003920282017-06-02T04:42:13Z http://ndltd.ncl.edu.tw/handle/68252359148278624721 Location Partition Routing Protocol for Ad Hoc Wireless Networks 運用於隨意型無線網路之區域劃分法協定 Pei-Hong Chen 陳佩鴻 碩士 元智大學 資訊工程學系 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. Dr.Robin Liu 劉如生 2002 學位論文 ; thesis 36 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 元智大學 === 資訊工程學系 === 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.
author2 Dr.Robin Liu
author_facet Dr.Robin Liu
Pei-Hong Chen
陳佩鴻
author Pei-Hong Chen
陳佩鴻
spellingShingle Pei-Hong Chen
陳佩鴻
Location Partition Routing Protocol for Ad Hoc Wireless Networks
author_sort Pei-Hong Chen
title Location Partition Routing Protocol for Ad Hoc Wireless Networks
title_short Location Partition Routing Protocol for Ad Hoc Wireless Networks
title_full Location Partition Routing Protocol for Ad Hoc Wireless Networks
title_fullStr Location Partition Routing Protocol for Ad Hoc Wireless Networks
title_full_unstemmed Location Partition Routing Protocol for Ad Hoc Wireless Networks
title_sort location partition routing protocol for ad hoc wireless networks
publishDate 2002
url http://ndltd.ncl.edu.tw/handle/68252359148278624721
work_keys_str_mv AT peihongchen locationpartitionroutingprotocolforadhocwirelessnetworks
AT chénpèihóng locationpartitionroutingprotocolforadhocwirelessnetworks
AT peihongchen yùnyòngyúsuíyìxíngwúxiànwǎnglùzhīqūyùhuàfēnfǎxiédìng
AT chénpèihóng yùnyòngyúsuíyìxíngwúxiànwǎnglùzhīqūyùhuàfēnfǎxiédìng
_version_ 1718454488642093056