Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing
碩士 === 國立成功大學 === 電腦與通信工程研究所 === 94 === Many routing protocols have been proposed in mobile ad hoc networks. Most protocols assume that node density of the networks is high enough so network partitions will not occur. As a matter of fact, it is illegitimate to have such hypothesis because node mobil...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/84285562043842989776 |
id |
ndltd-TW-094NCKU5652035 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094NCKU56520352016-05-30T04:21:59Z http://ndltd.ncl.edu.tw/handle/84285562043842989776 Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing 在使用位址資訊的無線隨意網路中利用輔助節點提升資料傳輸成功率 Shin-Hung Chung 鍾欣宏 碩士 國立成功大學 電腦與通信工程研究所 94 Many routing protocols have been proposed in mobile ad hoc networks. Most protocols assume that node density of the networks is high enough so network partitions will not occur. As a matter of fact, it is illegitimate to have such hypothesis because node mobility and random deployment can easily make partitions happened. This thesis describes an approach to locating helping nodes for carrying data packets from one partition to another with geographic routing. Unlike assisting nodes in other schemes, the helping node chosen from a group of regular mobile nodes keeps moving based on its will. The approach also handles handoff when needed in the routing trip of the helping node. The mechanism has been implemented with the network simulator 2. The results demonstrate that the algorithm can improve the information availability especially in sparse networks. Kuo-Feng Ssu 斯國峰 2006 學位論文 ; thesis 34 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立成功大學 === 電腦與通信工程研究所 === 94 === Many routing protocols have been proposed in mobile ad hoc networks. Most protocols assume that node density of the networks is high enough so network partitions will not occur. As a matter of fact, it is illegitimate to have such hypothesis because node mobility and random deployment can easily make partitions happened. This thesis describes an approach to locating helping nodes for carrying data packets from one partition to another with geographic routing. Unlike assisting nodes in other schemes, the helping node chosen from a group of regular mobile nodes keeps moving based on its will. The approach also handles handoff when needed in the routing trip of the helping node. The mechanism has been implemented with the network simulator 2. The results demonstrate that the algorithm can improve the information availability especially in sparse networks.
|
author2 |
Kuo-Feng Ssu |
author_facet |
Kuo-Feng Ssu Shin-Hung Chung 鍾欣宏 |
author |
Shin-Hung Chung 鍾欣宏 |
spellingShingle |
Shin-Hung Chung 鍾欣宏 Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing |
author_sort |
Shin-Hung Chung |
title |
Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing |
title_short |
Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing |
title_full |
Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing |
title_fullStr |
Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing |
title_full_unstemmed |
Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing |
title_sort |
improving data transmission with helping nodes for geographical ad hoc routing |
publishDate |
2006 |
url |
http://ndltd.ncl.edu.tw/handle/84285562043842989776 |
work_keys_str_mv |
AT shinhungchung improvingdatatransmissionwithhelpingnodesforgeographicaladhocrouting AT zhōngxīnhóng improvingdatatransmissionwithhelpingnodesforgeographicaladhocrouting AT shinhungchung zàishǐyòngwèizhǐzīxùndewúxiànsuíyìwǎnglùzhōnglìyòngfǔzhùjiédiǎntíshēngzīliàochuánshūchénggōnglǜ AT zhōngxīnhóng zàishǐyòngwèizhǐzīxùndewúxiànsuíyìwǎnglùzhōnglìyòngfǔzhùjiédiǎntíshēngzīliàochuánshūchénggōnglǜ |
_version_ |
1718285864891580416 |