臺灣博碩士論文加值系統

行動隨意網路是多跳躍、無基礎架構的無線網路，其拓撲具有高多變性與不可預測性，使得網路位址分派問題成為一大挑戰。TP通訊協定基於位址區塊分割概念，讓網路的節點各自擁有一些互無交集的可用網路位址集；當新節點加入時，由具有可用網路位址集的較鄰近節點來直接分配網路位址。由於可用網路位址集的互斥性，位址分派過程不需要使用網路廣播來確保網路位址的唯一性，能獲較佳的平均網路位址取得時間延遲及較少的頻寬負擔。然而，在新節點找尋有可用網路位址集的鄰近節點時，對詢問過的節點之鄰居節點的可用網路集之資訊卻能在未能借用，來提高盡速找到可用網路位址的機會，藉以提昇效能。再者，在回收完遺失網路位址之後，TP通訊協定僅提及應均勻重分配可用網路位址，但未提出具體方案。因此，本研究將提出一些改良方案讓TP通訊協定能更有效率。藉由現有的Hello訊息來獲得鄰居節點的可用網路位址數量，作為新節點請求分配網路位址的詢問順序之依據，當節點離開時也可依據此資訊來挑選鄰居節點歸還網路位址。針對均勻分散可用網路位址，本研究提出近最小網路節點涵蓋集演算法，來選擇較小的集合用以均勻分散可用網路位址，預期讓新節點加入時能在兩個跳躍範圍內就能找到擁有可用網路位址的節點，來降低平均網路位址取得時間延遲與減少平均頻寬負擔。系統模擬的實驗結果驗證本研究的改善方案能有效地改善TP通訊協定，具有較佳的平均網路位址取得時間延遲與平均頻寬負擔。

Mobile ad hoc networks (MANETs) are multihop wireless networks without any infrastructure. The network topology changes rapidly and unpredictably, therefore network address assignment is one of particularly challenging problems in MANETs. Based on the concept of address block partition, the TP protocol dynamically distributes available IP addresses among the nodes in the network. When a node joins the network, it can acquire an IP address from a node that is near to the joining node and has available IP addresses. Because of the mutual excusive property of available IP sets, the uniqueness of this acquired IP address can be guaranteed without network-wide broadcasting. As a result, the TP protocol can obtain better performance in terms of latency and bandwidth overhead. In the acquiring procedure, however, the TP protocol doesn’t use the information of the available IP sets, in the neighbors of the visited nodes, to reduce the latency of getting an available IP address. Moreover, after reclaiming the missing addresses, the TP protocol only mentions that these addresses should be redistributed evenly among the nodes, without presenting an approach. Hence, this project proposes an enhanced version of the TP protocol to improve it performance. With exchanging Hello messages, a node can obtain the available IP address information of it neighbors. The information can be used in the acquiring procedure to determine the visit order and in the departure procedure to choose a neighbor node to return IP address and available IP set. In order to support a joining node acquiring an available IP address from its neighbors within two hops distance, this project also proposes a sub-minimum node cover set algorithm to compute an approximate minimum node cover set for redistributing the reclaimed address. Simulation results show that the enhance TP protocol has low latency and low overhead compared to the TP protocol.

中文摘要
Abstract
目錄
圖目錄
表目錄
第一章 緒論
1.1研究背景
1.2研究動機與目的
1.3論文架構
第二章 相關研究
2.1背景介紹
2.2新節點網路位址取得方式
2.2.1隨機分配法
2.2.2分配資訊共有法
2.2.3位址區塊分割法
2.3 節點離開時的IP位址回收
2.4 網路分割與網路合併
2.4.1 可用IP位址的回收
2.4.2 IP位址衝突解決
2.5效能分析
2.6討論
第三章 改良型TP動態IP位址配置通訊協定
3.1名詞介紹
3.1.1 節點角色介紹
3.1.2網路識別碼
3.1.3 IP區塊分割方式
3.2 封包訊息說明
3.3 計時器
3.4 機制介紹
3.4.1機制運作概念
3.4.2節點加入
3.4.3節點的離開
3.4.4 網路分割
3.4.5網路合併的處理程序
3.5 近最少網路節點涵蓋集找尋演算法
第四章 模擬實驗與效能分析
4.1 實驗分析與環境參數
4.1.1 MANETconf與TP效能比較
4.1.2 TP與Our平均IP位址取得延遲比較
4.1.3 TP與Our平均頻寬負擔
4.2 進一步深入探討
4.2.1 初始位址區塊大小
4.2.2 網路空間範圍
4.2.3 節點移動速率
4.2.4 網路合併後有無均勻分配位址之影響
第五章 結論
參考文獻

[1] IEEE std. 802.11, “Wireless LAN medium access control (MAC) and physical layer (PHY) specifications,” 1999.
[2] S. Corson and J. Macker, Mobile Ad hoc Networking (MANet): Routing Protocol Performance Issues and Evaluation Considerations, RFC2501, January 1999,http://www.ietf.org/rfc/rfc2501.txt?number=2501.
[3] P.Johansson et al., “Bluetooth: an enabler for personal area networking”, Network, vol.15,no.5 Sep. 2001, pp.28-37.
[4] J.Z. Sun, “Mobile ad hoc networking: an essential technology for pervasive computing”, Proceedings for 2001 International Conferences on Info-tech and Info-net, vol.3, Oct. 2001, pp.316-321.
[5] C.Maihofer and R. Eberhardt, “Geocast in vehicular environments:caching and transmission rnage control for improved efficiency”, Intelligent Vehicles Symposium, Jun. 2004, pp.951-956.
[6] Charles E. Perkins. Pravin Bhagwat. “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Computer Communications Rev., Oct. 1994, pp.234-244.
[7] T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol,” RFC3626, Oct. 2003.
[8] D. B. Johnson, and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks.”, IEEE Transactions on Mobile Computing, Vol.353, 1996, pp.153-181.
[9] C. E. Perkins and E. M. Royer, “Ad-hoc on demand distance vector routing,” in IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), February 1999. pp. 90-100.
[10] R. Droms, “Dynamic host configuration protocol,” RFC2131, March 1997.
[11] S. Thomson, T. Narten, “IPv6 Stateless Autoconfiguration,” RFC2462, December 1998.
[12] C.N Ojeda-Guerra er al., “A new pproach to merge partitions in an ad hoc wireless network based on an updating of DHCP,” Processings of 13th Euromicro Conference on Parallel, Distributed and Network-Based , Feb. 2005, pp.144-151.
[13] Perkins CE, Malinen JT, Wakikawa R, Belding-Royer EM,Sun Y, “Ad hoc Address Autoconfiguration”, IETF Internet Draft, draft-ietf-manet-autoconf-01.txt, November 2001.
[14] Ezzouhairi A, Quintero A, Pierre S, “IP configuration in Ad Hoc Network”, Wireless And Mobile Computing, Networking And Communications, Vol. 3, Aug. 22-24, 2005, pp. 170-177.
[15] Venkata C Giruka, Mukesh Singhal, “A Localized IP-address Auto-configuration Protocol for Wireless Ad-Hoc Networks”, Wireless mobile applications and services on WLAN hotspots, 2006, pp.101-108.
[16] Weniger K, “PACMAN: Passive autoconfiguration for mobile ad hoc networks” , Selected Areas in Communications, IEEE Journal on, Vol. 23, March 2005, pp. 507-519.
[17] Parchipulusu P, “Dynamic Address Allocation Protocols for Mobile Ad Hoc Network”, Computer Science, Texas A&M University, Aug. 1997.
[18] Nakiung Choi Toh,C.K, Yongho Seok,Dongkyun Kim,Yanghee Choi., “Random and linear address allocation for mobile ad hoc networks”, IEEE Wireless Communications and Networking Conference, Vol. 4, March 13-17, 2005, pp. 2231-2237.
[19] Nesargi S and Prakash R, “MANETconf: Configuration of hosts in a mobile ad hoc network,” IEEE INFOCOM, Vol. 2, June 23-27, 2002, pp.1059-1068.
[20] Kosuke Yamazaki, Kaoru Sezaki, “SPATIO-TEMPORAL ADDRESSING SCHEME FOR MOBILE AD HOC NETWORK”, TENCON 2004. 2004 IEEE Region 10 Conference, Vol. B, Nov. 21-24, 2004, pp. 223-226.
[21] Sun Y, Belding-Royer EM , “Dynamic Address Configuration in Mobile Ad hoc Networks, ”Computer Science Department, UNIVERSITY OF CALIFORNIA SANTA BARBABA, Technical Report: Report ID: 2003-11, March 2003.
[22] Mohsin M. and Prakash R., “IP Address Assignment in a Mobile Ad Hoc Network,” IEEE MILCOM, Vol. 2, Oct. 7-10, 2002, pp. 856-861.
[23] M.R Thoppian, R Prakash, “A distributed protocol for dynamic address assignment in mobile ad hoc networks,” Mobile Computing, IEEE Transactions on, Vol. 5, Jan. 2006, pp.4-19.
[24] Insu Jeong, Hyunjun Choi, Joongsoo Ma, “Study on address allocation in ad-hoc,” Computer and Information Science, 2005. Fourth Annual ACIS International Conference on, 2005, pp. 604-609.
[25] Yuan Sun, Elizabeth M, Belding-Royer, “A study of dynamic addressing techniques in mobile ad hoc networks,” WIRELESS COMMUNICATIONS AND MOBILE COMPUTING, Vol. 4, 2004, pp.315-329.
[26] Zhe Guang Zhou and Aruna Seneviratne, “A Survey of Zero and Auto Configurations for Wireless Networks,” Australian Telecommunications, Networks and Applications, 2003.
[27] 溫榮宏編譯，無線區域網路與無所不在的網路，全華科技圖書出版社，民94年11月。
[28] Udi Manber, “Introduction to Algorithms: A Creative Approach,” Addison-Wesley Publishing Company, 1989.
[29] K. Fall and K. Varadhan, “The ns Manual,” http://www.isi.edu/nsman/ns/ns-documentation.html.
[30] The Rice Monarch Project, “Wireless and Mobility Extensions to ns-2, ” http://www.monarch.cs.rice.edu/cmu-ns.html.
[31] BonnMotion mobility scenario generator http://web.informatik.uni-bonn.de/IV/Mitarbeiter/dewaal/BonnMotion/
[32] 許俊萍、莊耀得、潘慧珊、詹森仁、邱川峰， “行動隨意網路改良型動態IP位址分配協定,” 論文集光碟 of UHC2007全國優質家庭學術研討會, 崑山科技大學, 2007.
[33] 許俊萍、莊耀得、潘慧珊， “行動隨意網路中重複位址偵測的新方案,” 明新科際大學校內專題研究計畫,計畫編號 MUST-96-資管-01.