Improving Routing Distance for Geographic Multicast with Fermat Points in Mobile Ad Hoc Networks
碩士 === 國立成功大學 === 電腦與通信工程研究所 === 94 === An ad hoc network is a new research area that joins an important factor of mobility. Each node is either randomly or planned moving in the field. These nodes have ability to transmit, receive, and route packets. Reducing routing distance is always an essential...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/47721260764553256894 |
id |
ndltd-TW-094NCKU5652030 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094NCKU56520302016-05-30T04:21:59Z http://ndltd.ncl.edu.tw/handle/47721260764553256894 Improving Routing Distance for Geographic Multicast with Fermat Points in Mobile Ad Hoc Networks 行動隨意網路中使用費瑪點減少區域性群播的繞送距離 An-Guo Yang 楊安國 碩士 國立成功大學 電腦與通信工程研究所 94 An ad hoc network is a new research area that joins an important factor of mobility. Each node is either randomly or planned moving in the field. These nodes have ability to transmit, receive, and route packets. Reducing routing distance is always an essential issue for the mobile ad hoc network. However, no matter in the ad hoc network or static network, the problem to minimize the overall routing distance for multicasting is NP-complete. Therefore, it is hard to guarantee an optimal solution. This paper presents an efficient geographic multicast protocol, called GMFP, based on Fermat points. GMFP aims to improve overall routing distance for multicast tasks. Our simulation shows that GMFP performs better than PBM that was the best multicast mechanism in mobile ad hoc networks. Kuo-Feng Ssu 斯國峰 2006 學位論文 ; thesis 39 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立成功大學 === 電腦與通信工程研究所 === 94 === An ad hoc network is a new research area that joins an important factor of mobility. Each node is either randomly or planned moving in the field. These nodes have ability to transmit, receive, and route packets. Reducing routing distance is always an essential issue for the mobile ad hoc network. However, no matter in the ad hoc network or static network, the problem to minimize the overall routing distance for multicasting is NP-complete. Therefore, it is hard to guarantee an optimal solution. This paper presents an efficient geographic multicast protocol, called GMFP, based on Fermat points. GMFP aims to improve overall routing distance for multicast tasks. Our simulation shows that GMFP performs better than PBM that was the best multicast mechanism in mobile ad hoc networks.
|
author2 |
Kuo-Feng Ssu |
author_facet |
Kuo-Feng Ssu An-Guo Yang 楊安國 |
author |
An-Guo Yang 楊安國 |
spellingShingle |
An-Guo Yang 楊安國 Improving Routing Distance for Geographic Multicast with Fermat Points in Mobile Ad Hoc Networks |
author_sort |
An-Guo Yang |
title |
Improving Routing Distance for Geographic Multicast with Fermat Points in Mobile Ad Hoc Networks |
title_short |
Improving Routing Distance for Geographic Multicast with Fermat Points in Mobile Ad Hoc Networks |
title_full |
Improving Routing Distance for Geographic Multicast with Fermat Points in Mobile Ad Hoc Networks |
title_fullStr |
Improving Routing Distance for Geographic Multicast with Fermat Points in Mobile Ad Hoc Networks |
title_full_unstemmed |
Improving Routing Distance for Geographic Multicast with Fermat Points in Mobile Ad Hoc Networks |
title_sort |
improving routing distance for geographic multicast with fermat points in mobile ad hoc networks |
publishDate |
2006 |
url |
http://ndltd.ncl.edu.tw/handle/47721260764553256894 |
work_keys_str_mv |
AT anguoyang improvingroutingdistanceforgeographicmulticastwithfermatpointsinmobileadhocnetworks AT yángānguó improvingroutingdistanceforgeographicmulticastwithfermatpointsinmobileadhocnetworks AT anguoyang xíngdòngsuíyìwǎnglùzhōngshǐyòngfèimǎdiǎnjiǎnshǎoqūyùxìngqúnbōderàosòngjùlí AT yángānguó xíngdòngsuíyìwǎnglùzhōngshǐyòngfèimǎdiǎnjiǎnshǎoqūyùxìngqúnbōderàosòngjùlí |
_version_ |
1718285862295306240 |