Maximal Lifetime Routing Algorithm using GPS In Mobile Ad-hoc Network

碩士 === 國立清華大學 === 通訊工程研究所 === 90 === Routing protocols have been widely studied in Ad-hoc networks. However, most of the Ad-hoc network routing protocols are based on shortest path algorithms. In Ad-hoc networks, due to the mobility of the transmitters and/or the receivers, a receiver can easily mov...

Full description

Bibliographic Details
Main Author: 楊裕仁
Other Authors: 李端興
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/40712753904847097856
id ndltd-TW-090NTHU0650026
record_format oai_dc
spelling ndltd-TW-090NTHU06500262015-10-13T10:34:06Z http://ndltd.ncl.edu.tw/handle/40712753904847097856 Maximal Lifetime Routing Algorithm using GPS In Mobile Ad-hoc Network 利用全球定位系統選擇隨意網路上的長時效性封包路由協定 楊裕仁 碩士 國立清華大學 通訊工程研究所 90 Routing protocols have been widely studied in Ad-hoc networks. However, most of the Ad-hoc network routing protocols are based on shortest path algorithms. In Ad-hoc networks, due to the mobility of the transmitters and/or the receivers, a receiver can easily move outside of the power range of its transmitter and this causes the wireless link between the two mobile nodes to fail. When link failure occurs during a communication session, it costs a lot to detect that the shortest routing path is no longer feasible and to retransmit the lost packets.In this paper, we propose a new routing algorithm called the Maximal Lifetime Routing algorithm (MLR). MLR is a hybrid type of Ad-hoc network routing algorithm. Every mobile node in the Ad-hoc network periodically exchanges position information collected using Global Positioning System (GPS) devices with other nodes. With the GPS information, the mobile nodes can estimate the velocity and the moving direction of other mobile nodes. Hence, the mobile nodes can estimate the life time of the wireless links. When a new routing path is needed, the source node finds the path that has the longest life time. Furthermore, MLR can predict when the current routing path will fail due to the mobility of the mobile nodes along the path and find an alternative routing path before the path failure. Simulation result shows that MLR can effectively reduce average packet transmission delay and packet lost rate comparing to shortest path routing algorithm. 李端興 2002 學位論文 ; thesis 32 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立清華大學 === 通訊工程研究所 === 90 === Routing protocols have been widely studied in Ad-hoc networks. However, most of the Ad-hoc network routing protocols are based on shortest path algorithms. In Ad-hoc networks, due to the mobility of the transmitters and/or the receivers, a receiver can easily move outside of the power range of its transmitter and this causes the wireless link between the two mobile nodes to fail. When link failure occurs during a communication session, it costs a lot to detect that the shortest routing path is no longer feasible and to retransmit the lost packets.In this paper, we propose a new routing algorithm called the Maximal Lifetime Routing algorithm (MLR). MLR is a hybrid type of Ad-hoc network routing algorithm. Every mobile node in the Ad-hoc network periodically exchanges position information collected using Global Positioning System (GPS) devices with other nodes. With the GPS information, the mobile nodes can estimate the velocity and the moving direction of other mobile nodes. Hence, the mobile nodes can estimate the life time of the wireless links. When a new routing path is needed, the source node finds the path that has the longest life time. Furthermore, MLR can predict when the current routing path will fail due to the mobility of the mobile nodes along the path and find an alternative routing path before the path failure. Simulation result shows that MLR can effectively reduce average packet transmission delay and packet lost rate comparing to shortest path routing algorithm.
author2 李端興
author_facet 李端興
楊裕仁
author 楊裕仁
spellingShingle 楊裕仁
Maximal Lifetime Routing Algorithm using GPS In Mobile Ad-hoc Network
author_sort 楊裕仁
title Maximal Lifetime Routing Algorithm using GPS In Mobile Ad-hoc Network
title_short Maximal Lifetime Routing Algorithm using GPS In Mobile Ad-hoc Network
title_full Maximal Lifetime Routing Algorithm using GPS In Mobile Ad-hoc Network
title_fullStr Maximal Lifetime Routing Algorithm using GPS In Mobile Ad-hoc Network
title_full_unstemmed Maximal Lifetime Routing Algorithm using GPS In Mobile Ad-hoc Network
title_sort maximal lifetime routing algorithm using gps in mobile ad-hoc network
publishDate 2002
url http://ndltd.ncl.edu.tw/handle/40712753904847097856
work_keys_str_mv AT yángyùrén maximallifetimeroutingalgorithmusinggpsinmobileadhocnetwork
AT yángyùrén lìyòngquánqiúdìngwèixìtǒngxuǎnzésuíyìwǎnglùshàngdezhǎngshíxiàoxìngfēngbāolùyóuxiédìng
_version_ 1716829295192571904