東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

A minimum-cost-neighbor multicast ro...

Amiri, Keyvan.

FindBook

Google Book

Amazon

博客來

A minimum-cost-neighbor multicast routing protocol for mobile wireless ad hoc networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	A minimum-cost-neighbor multicast routing protocol for mobile wireless ad hoc networks./
作者:	Amiri, Keyvan.
面頁冊數:	75 p.
附註:	Source: Masters Abstracts International, Volume: 49-01, page: 0566.
Contained By:	Masters Abstracts International49-01.
標題:	Applied Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1486059
ISBN:	9781124212760

A minimum-cost-neighbor multicast routing protocol for mobile wireless ad hoc networks.
Amiri, Keyvan.

A minimum-cost-neighbor multicast routing protocol for mobile wireless ad hoc networks. - 75 p.

Source: Masters Abstracts International, Volume: 49-01, page: 0566.

Thesis (M.S.)--Rice University, 2010.

MiCoN (Minimum-Cost Neighbor) is a new on-demand multicast routing protocol for mobile wireless ad hoc networks. Multicast routing in MiCoN is based on a new multi-route unicast routing protocol for maintaining routes between the network nodes and all group receivers. This routing is guaranteed to be loop-free even in the presence of dropped packets in the wireless network. MiCoN packet forwarding is based on a new local approximation of the optimal multicast tree, achieved by modeling multicasting as a Facility-Location-Problem. Evaluated in ns-2 simulations. MiCoN outperforms ADMR, the previously best performing on-demand multicast routing protocol for mobile ad hoc networks. To support this evaluation, I have also developed a new simulation model for sparse movement scenarios in ad hoc networks. MiCoN achieves better performance than ADMR, in terms of its packet delivery ratio, latency, and overhead in dense scenarios, and substantially outperforms ADMR on these metrics in sparse networks.

ISBN: 9781124212760Subjects--Topical Terms:

1669109
Applied Mathematics.

A minimum-cost-neighbor multicast routing protocol for mobile wireless ad hoc networks.
LDR:01897nam 2200289 4500 001 1394324
005 20110506085333.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124212760
035 $a (UMI)AAI1486059
035 $a AAI1486059
040 $a UMI $c UMI
100 1 $a Amiri, Keyvan. $3 1672942
245 1 2 $a A minimum-cost-neighbor multicast routing protocol for mobile wireless ad hoc networks.
300 $a 75 p.
500 $a Source: Masters Abstracts International, Volume: 49-01, page: 0566.
500 $a Adviser: David B. Johnson.
502 $a Thesis (M.S.)--Rice University, 2010.
520 $a MiCoN (Minimum-Cost Neighbor) is a new on-demand multicast routing protocol for mobile wireless ad hoc networks. Multicast routing in MiCoN is based on a new multi-route unicast routing protocol for maintaining routes between the network nodes and all group receivers. This routing is guaranteed to be loop-free even in the presence of dropped packets in the wireless network. MiCoN packet forwarding is based on a new local approximation of the optimal multicast tree, achieved by modeling multicasting as a Facility-Location-Problem. Evaluated in ns-2 simulations. MiCoN outperforms ADMR, the previously best performing on-demand multicast routing protocol for mobile ad hoc networks. To support this evaluation, I have also developed a new simulation model for sparse movement scenarios in ad hoc networks. MiCoN achieves better performance than ADMR, in terms of its packet delivery ratio, latency, and overhead in dense scenarios, and substantially outperforms ADMR on these metrics in sparse networks.
590 $a School code: 0187.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
690 $a 0364
690 $a 0544
690 $a 0984
710 2 $a Rice University. $3 960124
773 0 $t Masters Abstracts International $g 49-01.
790 1 0 $a Johnson, David B., $e advisor
790 $a 0187
791 $a M.S.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1486059