國立高雄大學圖資館 |

Language: English

Back

Design, analysis and optimization of...

Medapalli, Kameswara Rao.

Design, analysis and optimization of CSMA/CA based wireless networks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Design, analysis and optimization of CSMA/CA based wireless networks.
Author:	Medapalli, Kameswara Rao.
Description:	196 p.
Notes:	Adviser: Fouad Tobagi.
Notes:	Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5290.
Contained By:	Dissertation Abstracts International67-09B.
Subject:	Engineering, Electronics and Electrical.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235288
ISBN:	9780542895043

Design, analysis and optimization of CSMA/CA based wireless networks.
Medapalli, Kameswara Rao.

Design, analysis and optimization of CSMA/CA based wireless networks. - 196 p.

Adviser: Fouad Tobagi.

Thesis (Ph.D.)--Stanford University, 2006.

In this thesis, we start by considering single-hop networks and develop packet cycle time analysis as a convenient means of analyzing the throughput and delay characteristics of CSMA/CA based wireless networks. Our model captures the complex interactions that exist between the physical and media access layers, and higher layers (traffic). In particular, we will study the saturation throughput and develop M/G/1 processor sharing and G/G/1 queueing models. We then generalize the analysis to multi-hop networks and apply the model to help answer important network design questions such as determining the feasibility of a traffic matrix and identifying bottlenecks. We study in-depth the impact of Binary Exponential Backoff (BEB) on the throughput-fairness tradeoff and find that the initial contention window is the most influential parameter on the unfairness problem.

ISBN: 9780542895043Subjects--Topical Terms:

226981
Engineering, Electronics and Electrical.

Design, analysis and optimization of CSMA/CA based wireless networks.
LDR:03005nmm _2200277 _450 001 180680
005 20080111103816.5
008 090528s2006 eng d
020 $a 9780542895043
035 $a 00311706
040 $a UMI $c UMI
100 0 $a Medapalli, Kameswara Rao. $3 264259
245 1 0 $a Design, analysis and optimization of CSMA/CA based wireless networks.
300 $a 196 p.
500 $a Adviser: Fouad Tobagi.
500 $a Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5290.
502 $a Thesis (Ph.D.)--Stanford University, 2006.
520 # $a In this thesis, we start by considering single-hop networks and develop packet cycle time analysis as a convenient means of analyzing the throughput and delay characteristics of CSMA/CA based wireless networks. Our model captures the complex interactions that exist between the physical and media access layers, and higher layers (traffic). In particular, we will study the saturation throughput and develop M/G/1 processor sharing and G/G/1 queueing models. We then generalize the analysis to multi-hop networks and apply the model to help answer important network design questions such as determining the feasibility of a traffic matrix and identifying bottlenecks. We study in-depth the impact of Binary Exponential Backoff (BEB) on the throughput-fairness tradeoff and find that the initial contention window is the most influential parameter on the unfairness problem.
520 # $a Recent years have witnessed a remarkable interest in wireless networks that need little or no infrastructure support. Popular examples of such networks include IEEE 802.11 based ad hoc and local area networks which use CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) as the random media access protocol. In contrast to cellular systems, little understanding exists regarding the design and optimization of these networks.
520 # $a We then optimize CSMA/CA contention parameters and find that once the initial contention window is optimized, interestingly, BEB either offers no additional improvement or penalizes performance. We find that the optimal backoff policy is agnostic to the trans mission type, i.e., it chooses the same backoff window for a new transmission as well as a retransmission. Among other advantages, we show that such an optimization has several practical benefits with respect to selfish and automatic link adaptation, and, latency minimization in sensor networks. We conclude by presenting an adaptive distributed CSMA/CA protocol called WABA that outperforms the BEB protocol of IEEE 802.11 systems while achieving close to optimal performance.
590 $a School code: 0212.
650 # 0 $a Engineering, Electronics and Electrical. $3 226981
690 $a 0544
710 0 # $a Stanford University. $3 212607
773 0 # $g 67-09B. $t Dissertation Abstracts International
790 $a 0212
790 1 0 $a Tobagi, Fouad, $e advisor
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235288 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235288