東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Performance tradeoffs for routing in...

Meghanathan, Natarajan.

FindBook

Google Book

Amazon

博客來

Performance tradeoffs for routing in mobile ad hoc networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Performance tradeoffs for routing in mobile ad hoc networks./
作者:	Meghanathan, Natarajan.
面頁冊數:	184 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-02, Section: B, page: 0992.
Contained By:	Dissertation Abstracts International66-02B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3163255
ISBN:	0496971255

Performance tradeoffs for routing in mobile ad hoc networks.
Meghanathan, Natarajan.

Performance tradeoffs for routing in mobile ad hoc networks. - 184 p.

Source: Dissertation Abstracts International, Volume: 66-02, Section: B, page: 0992.

Thesis (Ph.D.)--The University of Texas at Dallas, 2005.

A mobile ad hoc network (MANET) is a self-organizing collection of wireless mobile nodes with dynamically changing topology. Given the plethora of MANET applications and their diverse performance needs, it is virtually impossible to design a routing protocol that could provide optimality in all the performance metrics. In Chapter 2 of the dissertation, we present a survey of 55 unicast MANET routing protocols that had been proposed with objectives to optimize particular performance metrics and satisfy specific application requirements. The objective of this dissertation is to explore the diverse performance tradeoffs encountered in MANET routing protocols and routing strategies. We consider the tradeoffs between the following performance metrics: hop count, delay, energy consumption, network (node) lifetime and stability.

ISBN: 0496971255Subjects--Topical Terms:

626642
Computer Science.

Performance tradeoffs for routing in mobile ad hoc networks.
LDR:03168nmm 2200289 4500 001 1846219
005 20051117110105.5
008 130614s2005 eng d
020 $a 0496971255
035 $a (UnM)AAI3163255
035 $a AAI3163255
040 $a UnM $c UnM
100 1 $a Meghanathan, Natarajan. $3 1245026
245 1 0 $a Performance tradeoffs for routing in mobile ad hoc networks.
300 $a 184 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-02, Section: B, page: 0992.
500 $a Supervisor: Andras Farago.
502 $a Thesis (Ph.D.)--The University of Texas at Dallas, 2005.
520 $a A mobile ad hoc network (MANET) is a self-organizing collection of wireless mobile nodes with dynamically changing topology. Given the plethora of MANET applications and their diverse performance needs, it is virtually impossible to design a routing protocol that could provide optimality in all the performance metrics. In Chapter 2 of the dissertation, we present a survey of 55 unicast MANET routing protocols that had been proposed with objectives to optimize particular performance metrics and satisfy specific application requirements. The objective of this dissertation is to explore the diverse performance tradeoffs encountered in MANET routing protocols and routing strategies. We consider the tradeoffs between the following performance metrics: hop count, delay, energy consumption, network (node) lifetime and stability.
520 $a In the first half of the dissertation, we address the issue of how to find a sequence of stable paths such that the number of route transitions incurred is as small as possible. We present a polynomial time greedy algorithm called OptTrans to determine the minimum required number of route transitions for a source-destination (s-d) session. We illustrate the tradeoff between hop count and the number of route transitions and show that the objectives of minimum hop and maximum stability conflict with each other. We then use algorithm OptTrans to derive benchmarks for the overall energy consumption for an s-d session in MANEs. We also show OptTrans is very general and explain how it can be extended to find a sequence of stable Steiner trees and stable connected dominating sets. We estimate the stability-delay tradeoff for common MANET routing protocols using a measure of the proximity of the protocol's actual stability and delay with respect to the optimal stability and delay computed under the same history of network topology changes.
520 $a In the second half of the dissertation, we study the tradeoff between network (node) lifetime and hop count, delay as well as energy consumption by proposing power-sensitive power control and on-demand recharging strategies. We also investigate the performance tradeoffs in on-demand power-aware routing; show how mobility can influence routing dynamics and reduce the route refreshing frequency.
590 $a School code: 0382.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a The University of Texas at Dallas. $3 1018411
773 0 $t Dissertation Abstracts International $g 66-02B.
790 1 0 $a Farago, Andras, $e advisor
790 $a 0382
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3163255