none｜國立中央大學博碩士論文系統

簡易檢索 / 詳目顯示

回結果列表

研究生：	張致綱 Chih-Kang Chang
論文名稱：	On The Implementation of Path Pruning In Mobile Ad-hoc Networks
指導教授：	孫敏德 Min-Te Sun
口試委員:
學位類別：	碩士 Master
系所名稱：	資訊電機學院 - 資訊工程學系 Department of Computer Science & Information Engineering
論文出版年：	2016
畢業學年度：	104
語文別：	英文
論文頁數：	55
中文關鍵詞：	路徑修剪演算法、行動隨意網路、無線隨意網路
外文關鍵詞：	Path pruning, Mobile ad hoc networks, MANETs
相關次數：	點閱：5 下載：0
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

路徑修剪這種優化機制的想法已經在無線隨意網路及地理路由中被提出多年。然而，沒有論文提出實作路徑修剪的細節。在現實中，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.

Introduction 1
RelatedWork 3
1 Mobileadhocnetworks............................ 3
1.1 Proactive(table-driven)routingprotocols.............. 3
1.2 Reactive(on-demand)routingprotocols............... 4
1.3 HybridAdHocRoutingProtocols................... 4
2 Ad-hocondemandvectorroutingprotocol(AODV)............ 4
3 PathPruning.................................. 5
Preliminary 6
1 Wireshark.................................... 6
2 TCP(Reno)................................... 7
ProblemStatementandIntuitiveSolutions 9
1 TheOriginalPathPruningAlgorithm..................... 9
2 TheIntuitiveImplementationofPathPruning................ 10
3 Problem1:RetransmissionDuetoTimeout................. 11
4 Problem2:RetransmissionDuetoThreeDuplicateAcks.......... 15
5 TheSolutionThatWorks........................... 21
6 TheDesignofPrototypeImplementationInaSmall-scaleWirelessAdHoc
Network..................................... 26
SimulationResults 28
1 PrototypeImplementationInaSmall-scaleWirelessAdHocNetwork... 28
iii
2 SimulationCongurationandMetrics..................... 30
3 SimulationResultsandAnalysis........................ 32
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/.

簡易檢索 / 詳目顯示

相關論文