東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Optimal resource allocation and rout...

Lott, Christopher Gerard.

FindBook

Google Book

Amazon

博客來

Optimal resource allocation and routing in wireless networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Optimal resource allocation and routing in wireless networks./
作者:	Lott, Christopher Gerard.
面頁冊數:	183 p.
附註:	Chair: Demosthenis Teneketzis.
Contained By:	Dissertation Abstracts International62-01B.
標題:	Engineering, Electronics and Electrical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3000999
ISBN:	0493096671

Optimal resource allocation and routing in wireless networks.
Lott, Christopher Gerard.

Optimal resource allocation and routing in wireless networks. - 183 p.

Chair: Demosthenis Teneketzis.

Thesis (Ph.D.)--University of Michigan, 2001.

We are in a time of fundamental change in the world's telecommunications infrastructure, with the nature and quantity of information transmission undergoing major transformation. With expanding interest in mobile access to this communications infrastructure has come rapid growth in the number of users of wireless communication networks. The backbone of this growth has been single-hop networks, such as cellular systems, in which service areas are under the central control of a base station. More recently, researchers began investigating ad hoc wireless networks, which operate without a central controller, with each node acting as a network router. In this dissertation, we formulate models for both kinds of wireless networks, and develop optimal policies (protocols) under a variety of system assumptions.

ISBN: 0493096671Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Optimal resource allocation and routing in wireless networks.
LDR:03321nam 2200313 a 45 001 932263
005 20110505
008 110505s2001 eng d
020 $a 0493096671
035 $a (UnM)AAI3000999
035 $a AAI3000999
040 $a UnM $c UnM
100 1 $a Lott, Christopher Gerard. $3 1256015
245 1 0 $a Optimal resource allocation and routing in wireless networks.
300 $a 183 p.
500 $a Chair: Demosthenis Teneketzis.
500 $a Source: Dissertation Abstracts International, Volume: 62-01, Section: B, page: 0431.
502 $a Thesis (Ph.D.)--University of Michigan, 2001.
520 $a We are in a time of fundamental change in the world's telecommunications infrastructure, with the nature and quantity of information transmission undergoing major transformation. With expanding interest in mobile access to this communications infrastructure has come rapid growth in the number of users of wireless communication networks. The backbone of this growth has been single-hop networks, such as cellular systems, in which service areas are under the central control of a base station. More recently, researchers began investigating ad hoc wireless networks, which operate without a central controller, with each node acting as a network router. In this dissertation, we formulate models for both kinds of wireless networks, and develop optimal policies (protocols) under a variety of system assumptions.
520 $a First, we formulate a problem in single-hop resource (multi-channel) allocation for wireless networks, under general arrival and connectivity processes at each mobile node. We provide conditions sufficient to guarantee the optimality of an index policy for this problem. We then refine the aforementioned sufficient conditions under additional assumptions on the arrival and connectivity processes.
520 $a Next, we define a problem which both extends and restricts the previous model. The extension is to include a switching cost when server (channel) allocation changes; this cost models the penalty paid when a communications resource is moved between customers. The restriction is to include only one server in the model. We provide conditions sufficient to guarantee the optimality of an index policy for this problem.
520 $a Finally, we present a time-invariant stochastic model for routing in ad hoc wireless networks, and we discuss the design decisions leading to this model. We first view the routing problem as a problem of centralized control, and prove optimality of an index policy. Then, we demonstrate that this index policy can be implemented in a distributed manner. We add quality of service considerations by allowing time-varying system parameters, and provide conditions under which we can specify an optimal policy for the time-varying system. We define three distributed algorithms, and prove each computes an optimal routing policy for the time-invariant problem. With these distributed algorithms, the original goal of finding an optimal decentralized protocol is attained.
590 $a School code: 0127.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Engineering, System Science. $3 1018128
690 $a 0544
690 $a 0790
710 2 0 $a University of Michigan. $3 777416
773 0 $t Dissertation Abstracts International $g 62-01B.
790 $a 0127
790 1 0 $a Teneketzis, Demosthenis, $e advisor
791 $a Ph.D.
792 $a 2001
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3000999