東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Throughput maximization and latency ...

Gau, Chii-Chang (Victor).

Linked to FindBook

Google Book

Amazon

博客來

Throughput maximization and latency minimization in dense wireless ad hoc networks.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Throughput maximization and latency minimization in dense wireless ad hoc networks./
Author:	Gau, Chii-Chang (Victor).
Description:	84 p.
Notes:	Source: Dissertation Abstracts International, Volume: 71-10, Section: B, page: 6325.
Contained By:	Dissertation Abstracts International71-10B.
Subject:	Engineering, Computer. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3421769
ISBN:	9781124226019

Throughput maximization and latency minimization in dense wireless ad hoc networks.
Gau, Chii-Chang (Victor).

Throughput maximization and latency minimization in dense wireless ad hoc networks. - 84 p.

Source: Dissertation Abstracts International, Volume: 71-10, Section: B, page: 6325.

Thesis (Ph.D.)--University of Washington, 2010.

This dissertation presents methods to approach throughput maximum and latency minimum in dense wireless Ad Hoc networks. For throughput maximization, we propose an idle probability based broadcasting method, iPro, which employs an adaptive probabilistic mechanism to improve performance of data broadcasting over dense Wireless Ad Hoc Networks. In one-hop broadcasting scenarios, the modeling and simulation results of the proposed iPro are shown to be consistent and both significantly outperform the standard IEEE 802.11 under saturated conditions. Moreover, without estimating the number of competing nodes and changing the contention window size, the proposed iPro can still approach the theoretical throughput bound. We further apply iPro to multi-hop broadcasting scenarios, and the experiment results show that, with the same elapsed time after the broadcasting from the sources, the proposed iPro has significantly higher Packet Delivery Ratios (PDR) than traditional methods.

ISBN: 9781124226019Subjects--Topical Terms:

1669061
Engineering, Computer.

Throughput maximization and latency minimization in dense wireless ad hoc networks.
LDR:03151nam 2200301 4500 001 1405140
005 20111206130416.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124226019
035 $a (UMI)AAI3421769
035 $a AAI3421769
040 $a UMI $c UMI
100 1 $a Gau, Chii-Chang (Victor). $3 1684498
245 1 0 $a Throughput maximization and latency minimization in dense wireless ad hoc networks.
300 $a 84 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-10, Section: B, page: 6325.
500 $a Adviser: Jeng-Neng Hwang.
502 $a Thesis (Ph.D.)--University of Washington, 2010.
520 $a This dissertation presents methods to approach throughput maximum and latency minimum in dense wireless Ad Hoc networks. For throughput maximization, we propose an idle probability based broadcasting method, iPro, which employs an adaptive probabilistic mechanism to improve performance of data broadcasting over dense Wireless Ad Hoc Networks. In one-hop broadcasting scenarios, the modeling and simulation results of the proposed iPro are shown to be consistent and both significantly outperform the standard IEEE 802.11 under saturated conditions. Moreover, without estimating the number of competing nodes and changing the contention window size, the proposed iPro can still approach the theoretical throughput bound. We further apply iPro to multi-hop broadcasting scenarios, and the experiment results show that, with the same elapsed time after the broadcasting from the sources, the proposed iPro has significantly higher Packet Delivery Ratios (PDR) than traditional methods.
520 $a For latency minimization, we analyze latency performance based on p-Persistence CSMA, and show that when the number of competing nodes is much larger than the number of messages a node requests to receive from neighbors and the packet, length is a lot longer than the slot time, the optimal transmission probability for latency minimized p-Persistent CSMA (LMPP) in an event-driven scenario equals the optimal transmission probability for throughput maximization in a saturated wireless local area network. Instead of creating a completely new protocol, we further propose Latency Minimized Probabilistic CSMA/CA (LaMP), which is a multiple access scheme with constant contention window size built atop standard IEEE 802.11 CSMA/CA, to approach the performance of LMPP. However, when the number of competing nodes is unknown, a quick and reliable estimate of the number of competing nodes is highly desired to apply the proposed method and achieve minimize latency. Therefore, we propose an Exponentially Decreased Matching (EDeM) strategy to estimate the number of competing nodes and approach the minimum latency. Simulation results show that the proposed method consistently outperforms existing methods in latency performance.
590 $a School code: 0250.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
690 $a 0464
690 $a 0544
690 $a 0984
710 2 $a University of Washington. $3 545923
773 0 $t Dissertation Abstracts International $g 71-10B.
790 1 0 $a Hwang, Jeng-Neng, $e advisor
790 $a 0250
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3421769