On The Implementation of Path Pruning In Mobile Ad-hoc Networks

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：40

、訪客IP：3.147.127.55

姓名

張致綱(Chih-Kang Chang) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

(On The Implementation of Path Pruning In Mobile Ad-hoc Networks)

相關論文

★ Dynamic Overlay Construction for Mobile Target Detection in Wireless Sensor Networks	★ 車輛導航的簡易繞路策略
★ 使用傳送端電壓改善定位	★ 利用車輛分類建構車載網路上的虛擬骨幹
★ Why Topology-based Broadcast Algorithms Do Not Work Well in Heterogeneous Wireless Networks?	★ 針對移動性目標物的有效率無線感測網路
★ 適用於無線隨意網路中以關節點為基礎的分散式拓樸控制方法	★ A Review of Existing Web Frameworks
★ 將感測網路切割成貪婪區塊的分散式演算法	★ 無線網路上Range-free的距離測量
★ Inferring Floor Plan from Trajectories	★ An Indoor Collaborative Pedestrian Dead Reckoning System
★ Dynamic Content Adjustment In Mobile Ad Hoc Networks	★ 以影像為基礎的定位系統
★ 大範圍無線感測網路下分散式資料壓縮收集演算法	★ 車用WiFi網路中的碰撞分析

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

路徑修剪這種優化機制的想法已經在無線隨意網路及地理路由中被提出多年。然而，沒有論文提出實作路徑修剪的細節。在現實中，TCP傳輸在某些情況下可能會產生重傳封包。而如果路徑修剪是在TCP的環境下實作，可能會因為重傳封包產生錯誤的路徑，導致路徑迴圈或更長的路徑。在這篇論文當中，我們提出了一種路徑修剪演算法去解決這個問題，並在無線隨意網路中進行實作及在NS-2中進行模擬以驗證方法。將路徑修剪應用於AODV路由協定中及在兩種不同的網路拓樸中模擬的結果驗證了我們提出的演算法能夠在重傳封包的情況下正確的進行路徑修剪。

摘要(英)

The idea of path pruning has been proposed as a post-optimization mechanism for routing in mobile ad hoc networks and geographic routing for several years. However, no paper has provided the implementation details of path pruning. In reality, the source of a TCP connection may retransmit packets in certain situations. The path pruning algorithm, when used under TCP, may result in incorrect paths (e.g., longer routes or even loops) due to retransmitted packets. In this paper, we propose a path pruning algorithm to resolve this issue. The proposed path pruning algorithm has been verified in both a wireless ad hoc network prototype and NS-2. The results of path pruning on top of the AODV routing protocol obtained from the prototype as well as the simulations of two different mobile network scenarios have validated that the proposed algorithm results in correct path pruning under various packet retransmission situations.

關鍵字(中)

★ 路徑修剪演算法
★ 行動隨意網路
★ 無線隨意網路

關鍵字(英)

★ Path pruning
★ Mobile ad hoc networks
★ MANETs

論文目次

1 Introduction 1
2 RelatedWork 3
2.1 Mobileadhocnetworks............................ 3
2.1.1 Proactive(table-driven)routingprotocols.............. 3
2.1.2 Reactive(on-demand)routingprotocols............... 4
2.1.3 HybridAdHocRoutingProtocols................... 4
2.2 Ad-hocondemandvectorroutingprotocol(AODV)............ 4
2.3 PathPruning.................................. 5
3 Preliminary 6
3.1 Wireshark.................................... 6
3.2 TCP(Reno)................................... 7
4 ProblemStatementandIntuitiveSolutions 9
4.1 TheOriginalPathPruningAlgorithm..................... 9
4.2 TheIntuitiveImplementationofPathPruning................ 10
4.3 Problem1:RetransmissionDuetoTimeout................. 11
4.4 Problem2:RetransmissionDuetoThreeDuplicateAcks.......... 15
4.5 TheSolutionThatWorks........................... 21
4.6 TheDesignofPrototypeImplementationInaSmall-scaleWirelessAdHoc
Network..................................... 26
5 SimulationResults 28
5.1 PrototypeImplementationInaSmall-scaleWirelessAdHocNetwork... 28
iii
5.2 SimulationCongurationandMetrics..................... 30
5.3 SimulationResultsandAnalysis........................ 32
6 Conclusions 41
Reference 42

參考文獻

[1] C. GuiandP.Mohapatra.Short:Self-healingandoptimizingroutingtechniquesfor
mobile adhocnetworks.In Proc.ACMMobiHoc, pages279{290,June2003.
[2] M.-T. Sun,K.Sakai,B.R.Hamilton,W.-S.Ku,andX.Ma.G-star:Geometric
stateless routingfor3dwirelesssensornetworks.In AdHocNetworksJournal,vol.
9, issue3, pages341{354,March2011.
[3] Xiaoli Ma,Min-TeSun,GangZhao,andXiangqianLiu.Anefficientpathpruning
algorithm forgeographicalroutinginwirelessnetworks.In IEEE Transactionson
VehicularTechnology(Volume:57,Issue:4), pages2474{2488,July2008.
[4] Charles E.PerkinsandCharlesE.Perkins.Ad-hocon-demanddistancevectorrouting. In WMCSA ′99ProceedingsoftheSecondIEEEWorkshoponMobileComputer
Systems andApplications, page90,1999.
[5] Jonathan Loo,JaimeLloretMauri,andJessHamiltonOrtiz. Mobile AdHocNet-
works: CurrentStatusandFutureTrends. CRCPress,2002.
[6] P.Jacquet,P.Muhlethaler,T.Clausen,A.Laouiti,A.Qayyum,andL.Viennot.
Optimized linkstateroutingprotocolforadhocnetworks.In INMIC, 2001.
[7] Charles E.PerkinsandPravinBhagwat.Highlydynamicdestination-sequenced
distance-vectorrouting(dsdv)formobilecomputers.In SIGCOMM, 1994.
[8] DavidB.JohnsonandDavidA.Maltz.Dynamicsourceroutinginadhocwireless
networks.In WMCSA ′99ProceedingsoftheSecondIEEEWorkshoponMobile
Computer SystemsandApplications, page90,1998.
[9] VincentD.ParkaandM.ScottCorson.Ahighlyadaptivedistributedroutingalgorithm formobilewirelessnetworks.In INFOCOM, pages1405{1413,1997.
[10] Chai-Keong Toh.Associativity-basedroutingforadhocmobilenetworks.In Wireless
Personal Communications:AnInternationalJournalarchiveVolume4Issue2, pages
103{139, March1997.
[11] R. Dube,C.D.Rais,Kuang-YehWang,andS.K.Tripathi.Signalstability based
adaptiverouting(ssa)foradhocmobilenetworks.In IEEE PersonalCommunications (Volume:4,Issue:1), pages36{45,February1997.
[12] Z. J.Haas.Anewroutingprotocolfortherecongurablewirelessnetworks.In
Universal PersonalCommunicationsRecord,1997.ConferenceRecord.,1997IEEE
6th InternationalConferenceon(Volume:2), pages562{566,October1997.
[13] Marc R.PearlmanandPrinceSamar.Theintrazoneroutingprotocol(iarp)forad
hocnetworks.June2001.
[14] Mario Joa-NgandI-TaiLu.Apeer-to-peerzone-basedtwo-levellinkstaterouting
for mobileadhocnetworks.In IEEE journalonselectedareasincommunications,
VOL.17,NO.8, pages1415{1425,August1999.
[15] Wireshark godeep. https://www.wireshark.org/.
[16] Tcpdump/libpcappublicrepository. www.tcpdump.org/.
[17] Winpcap-home. https://www.winpcap.org/.
[18] W. RichardStevensandGaryR.Wright. TCP/IP ILLUSTRATEDVOLUME2.
Addison-WesleyPublishingCo.,NewYork,1995.
[19] V. Jacobson. ModiedTCPcongestionavoidancealgorithm, 1990.end2end-interest
mailing list.
[20] Fastretransmit. https://en.wikipedia.org/wiki/TCP_congestion_control/
Fast_retransmit/.
[21] VernPaxsonandMarkAllman. Computing TCP′sRetransmissionTimer, 2000.
RFC2988.
[22] Naidu Venkata.Minimumrtovalues. http://www.postel.org/pipermail/
end2end-interest/2004-November/004402.html, November2004.
[23] VanJacobson,BobBraden,andDaveBorman. TCP ExtensionsforHighPerfor-
mance, May1992.RFC1323.
[24] Ubuntu:Theleadingosforpc,tablet,phoneandcloud. www.ubuntu.com/.
[25] Aodv-uu. https://sourceforge.net/projects/aodvuu/.
[26] The networksimulatorns-2. http://www.isi.edu/nsnam/ns/.
[27] Ieee 802.11. http://standards.ieee.org/about/get/802/802.11.html/.

指導教授

孫敏德(Min-Te Sun)

審核日期

2016-7-27

推文