東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Quality of service in ad-hoc networks.

Gupta, Rajarshi.

FindBook

Google Book

Amazon

博客來

Quality of service in ad-hoc networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Quality of service in ad-hoc networks./
作者:	Gupta, Rajarshi.
面頁冊數:	240 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6158.
Contained By:	Dissertation Abstracts International66-11B.
標題:	Engineering, Electronics and Electrical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3196594
ISBN:	0542406748

Quality of service in ad-hoc networks.
Gupta, Rajarshi.

Quality of service in ad-hoc networks. - 240 p.

Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6158.

Thesis (Ph.D.)--University of California, Berkeley, 2005.

The broad problem we address is to support multi-hop flows in a wireless ad-hoc network. In such networks, achieving predictable quality of service is difficult due to interference between links. This thesis approaches this complicated problem by addressing the following three sub-areas.

ISBN: 0542406748Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Quality of service in ad-hoc networks.
LDR:03389nmm 2200325 4500 001 1818482
005 20060908145755.5
008 130610s2005 eng d
020 $a 0542406748
035 $a (UnM)AAI3196594
035 $a AAI3196594
040 $a UnM $c UnM
100 1 $a Gupta, Rajarshi. $3 1907810
245 1 0 $a Quality of service in ad-hoc networks.
300 $a 240 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6158.
500 $a Chair: Jean Walrand.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2005.
520 $a The broad problem we address is to support multi-hop flows in a wireless ad-hoc network. In such networks, achieving predictable quality of service is difficult due to interference between links. This thesis approaches this complicated problem by addressing the following three sub-areas.
520 $a 1. Fairness in distributed MAC. The backoff mechanism used by most distributed ad-hoc MAC protocols (like 802.11) is unfair towards nodes in the middle of the network. We propose the novel Impatient Backoff Algorithm (IBA) that achieves a fairer allocation of the available bandwidth by decreasing the backoff delay upon collision, or a failure to transmit. That is, a node becomes more aggressive after each failure. Nodes maintain stability by resetting, in a distributed way, the average backoff delays when they become too small. We perform a Markov analysis of the system to prove stability and fairness in simple topologies. We also simulate the performance of IBA in random ad-hoc networks and compare with exponential backoff scheme. Results show that IBA achieves comparable mean throughput, while delivering significantly better fairness.
520 $a 2. Service limits. We address the feasibility of a given set of flows on an arbitrary ad-hoc network, by modeling the interference between links as a conflict graph. We consider cliques in the conflict graph, and propose a distributed polynomial-time approximation algorithm to generate all maximal cliques. We then use these cliques to write constraints that provide sufficient conditions for feasibility, yet are guaranteed to be within a constant bound of the optimal.
520 $a 3. QoS routing. We propose a distributed Ad-hoc Shortest Widest Path (ASWP) routing algorithm, which transforms the well-known SWP paradigm to the ad-hoc domain by taking interference into account, and addresses its limitations. We further propose IQRouting - a source-based heuristic mechanism that is able to select QoS routed paths in a dynamic manner, using only localized state information. Results show that the admission ratio of IQRouting achieves significant gains over comparable ad-hoc QoS routing algorithms.
520 $a We also present prior work on algorithms for protection and restoration in networks that require quality guarantees. We propose a novel scheme that shares the protection bandwidth, and even the reserved normal bandwidth during a failure. This allows enhanced accounting of the available resources in the network, thereby supporting more flows.
590 $a School code: 0028.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
690 $a 0544
690 $a 0984
710 2 0 $a University of California, Berkeley. $3 687832
773 0 $t Dissertation Abstracts International $g 66-11B.
790 1 0 $a Walrand, Jean, $e advisor
790 $a 0028
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3196594