4.3 結果數據分析與探討
4.3.3 節點數與資料封包到達率之間的研究結果與探討
針對環境中節點數量與資料封包正確到達率之間的關係研究。
實驗的環境參數如下表:
項目 參數名稱 參數值
1 Scope Level 2
2 Internal Update Interval 2 3 External Update Interval 5 4 SIMULATION-TIME 120 5 SEED 1~50
6 TERRAIN-DIMENSIONS (1000, 1000)
7 NUMBER-OF-NODES 50,75,100,125,150,175,200 8 RADIO-TX-POWER 7.87395Æ250M
9 MOBILITY-WP-MIN-SPEED 5 m/sec 10 MOBILITY-WP-MAX-SPEED 12 m/sec
圖表 21 節點數與資料傳遞到達率之實驗環境參數
實驗環境中，在同樣的網路環境中，分別從 50 個節點的密度，逐次增加到 200 個節點的數量，以觀察當網路範圍相同時，節點的數量與資料傳遞的非正 確性與到達率的關係。
從圖表 22 中，可以透過線性關係觀察出節點移動速度與資料傳送到達率上
從網路的拓墣變化上來觀察，平均的移動速度介於 5M/sec~12M/sec 之間，
也就是相當於機車以 18KM/Hr~43.2KM/Hr 行駛的的速度。實驗環境參數設定於 此速度的原因在於希望以日常生活中行人走路定義為低速，而小型車輛行進的
4.3.4 移動速度與遞路徑長度的研究結果與探討
針對環境中路徑長度與移動性之間的關係研究。
實驗的環境參數如下表:
項目 參數名稱 參數值
1 Scope Level 2
2 Internal Update Interval 2 3 External Update Interval 5 4 SIMULATION-TIME 120 5 SEED 1~50
6 TERRAIN-DIMENSIONS (1500M, 1500M) 7 NUMBER-OF-NODES 100
8 RADIO-TX-POWER 2.56781Æ125M
9 MOBILITY-WP-MIN-SPEED 0km/hr, 10km/hr, 20km/hr, 30km/hr,
40km/hr,50km/hr
10 MOBILITY-WP-MAX-SPEED 0km/hr, 10km/hr, 20km/hr, 30km/hr,
40km/hr,50km/hr
圖表 23 移動速度與路徑長度實驗環境的參數
在路徑長度研究的實驗環境中，限定在同一空間範圍大小(1500Mx1500M) 中，取 100 個節點數且每個節點的電力半徑固定為直徑 125M。分別統計從靜止 狀態開始每次增加 10Km/Hr 的節點移動速度，以觀察節點的移動速度與資料傳 遞路徑長度的關係。
從圖表 24 中，發現實驗結果數據再次與當初設計實驗時所預期的有很大的
先建立兩點之間的連結表 ( Connection Table)，再透過最短路徑演算法，找 出連結表中相對連線來建立路徑，可能會造成多條路徑建立時的長度相同，卻
五、結論
路徑的 ITM ( Intelligent Tracing Method) 方法，將節點移動路徑的預測以 及路徑建立時，加入連線建立的時間做穩定度的衡量依據。使得不論在路徑建參考文獻
[1] J. M. McQuillan, I. Richer, and E. C. Rosen. “The new routing algorithm for the Arpanet,” IEEE Trans. on Communication, COM-28(5), May 1980.
[2] Charles E, Perkins, Pravin Bhagwat, “Highly dynamic Destination-Sequenced Distance-vector routing (DSDV) for mobile computers.”, In Proc. ACM SIGCOMM Conference (SIGCOMM ’94), pages 234-244, August 1993
[3] T.-W. Chen and M. Gerla, “Global State Routing: A New Routing Scheme for Ad-hocWireless Networks,” In Proceedings of IEEE ICC’98, Atlanta, GA, Jun.
1998, pp. 171-175.
[4] Young-Bae Ko and Nitin H. Vaidya, "Location-Aided Routing(LAR) in Mobile Ad hoc Networks," ACM/Baltzer Wireless Networks (WINET) journal, Vol.6-4, 2000 - Extended version of the Mobicom'98 paper.
[5] Josh Broch, David Johnson, and David Maltz, “The Dynamic Source Routing Protocol for Mobile Ad hoc Networks.”, http://www.ietf.org/internet-drafts/
draft-ietfmanet-dsr-01.txt, Dec 1998. IETF Internet Draft (workin progress).
[6] S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, “A distance routing effect algorithm for mobility (DREAM),” in Proceedings of the ACM/IEEE MOBICOM, 1998, pp.76–84.
[7] Charles E. Perkins, Elizabeth M. Royer “Ad-hoc on-Demand Distance Vector Routing” Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
[8] S.-C. M. Woo, S. Singh, “Scalable routing protocol for ad hoc networks.”, Wireless Networks, vol. 7, pp. 513 529, Sept. 2001.
[9] Mario Gerla, Xiaoyan Hong, and Guangyu Pei, "Fisheye State Routing Protocol (FSR) for Ad Hoc Networks," IETF Internet Draft, MANET Working Group, draft-ietf-manet-fsr-03.txt, June 2002 (work in progress).
[10] Z. J. Haas and M. R. Pearlman, "The Zone Routing Protocol (ZRP) for Ad Hoc Networks", Internet Draft draft-zonerouting-protocol-01.txt, Aug, 1998.
[11] Royer, E.M. , Chai-Keong Toh, “A review of current routing protocols for ad hoc mobile wireless networks.”, IEEE Personal Communication, Volume: 6 Issue: 2, April 1999.
[12] Xiaoyan Hong Kaixin Xu, Mario Gerla, “Scalable Routing Protocols for Mobile Ad Hoc Networks.”, IEEE Network Magazine, July-Aug, 2002.
[13] S, Murthy, J. J. Garcia- Luna-Aceves, “An Efficient Routing Protocol for Wireless
[14] T. Camp, J. Boleng,B. Williams, L. Wilcox, W. Navidi, “Location Information Services in Mobile Ad Hoc Networks.”, In Proceedings of the IEEE International Conference on Communications(ICC),pages 3318-3324,New York City,New York, April 2002.
[15] B. Karp, H. T. Camp, “GPSR:Greedy perimeter stateless routing for wireless networks.” In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking(MOBICOM’00),page 243-254,2000.
[16] Wen-Hwa Liao, Jang-Ping Sheu, Yu-Chee Tseng, “GRID: A Fully Location-Aware Routing Protocol for Mobile Ad hoc Networks.”
Telecommunication Systems 18(1-3): 37-60 (2001)
[17] USCG Navigation Center GPS page Novembre 2003, http://www.navcen.uscg.gov/gps/default.htm
[18] E.D. Kaplan., “Understanding GPS: Principles and Applications.”, Artech House, Boston, MA, 1996.
[19] M. Takai, L. Bajaj, R, Ahuja, R. Bagrodia and M. Gerla, “GloMoSim: A Scalable Network Simulation Environment,” Technical report 990027, UCLA, Computer Science Department, 1999.
[20] Guangyu, P.; Geria, M.; Xiaoyan Hong: “LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility” Mobile and Ad Hoc
Networking and Computing, 2000. MobiHOC. 2000 First Annual Workshop on , 11 Aug. 2000 Pages:11 - 18
[21] Agarwal, A.; Das, S.R.; “ Dead reckoning in mobile ad hoc networks “ Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE , Volume:
3 , 16-20 March 2003 Pages:1838 - 1843 vol.3
[22] Paechter, B.; Back, T.; Schoenauer, M.; Sebag, M.; Eiben, A.E.; Merelo, J.J.;
Fogarty, T.C.; “A Distributed Resource Evolutionary Algorithm Machine (DREAM)” Evolutionary Computation, 2000. Proceedings of the 2000 Congress on , Volume: 2 , 16-19 July 2000 Pages:951 - 958 vol.2
[23] M. Takai, L. Bajaj, R, Ahuja, R. Bagrodia and M.Gerla, “GloMoSim: A Scalable NetworkSimulation Environment,” Technical report990027, UCLA, Computer Science Department,1999.
[24] http://www.ietf.org/proceedings/00dec/I-D/draft-ietf-manet-fsr-00.txt