臺灣博碩士論文加值系統

在行動隨意網路(MANET)中，位址指派是一個很重要的問題，一個行動節點加入網路之後必須先取得一個唯一識別的位址，然後才能與其他的節點進行單點廣播，透過動態位址指派可以讓行動節點不經由任何其他硬體設備就能取得一個routable的位址，然後藉由這個位址與其他的行動節點進行相互的溝通以及資訊交流，因此在MANET中位址指派不但是一個很基本而且也是一個很有挑戰性的問題。多數先前的研究往往忽略了位址指派的重要性，當網路建構時就直接假設每個節點都已經事先分配好位址才加入網路，這樣的假設在有線網路也閉O可行的，但是由於MANET中的節點具有行動能力，隨著時間的變動可以隨意的加入或離開網路，因此如此的假設就不適合運用在拓墣變化快速的MANET環境中。近年來也有釵h不同的動態位址分配概念被提出來，但是總有不同的缺點出現，因此我們透過動態計時器的概念提出一個分散式的位址分配機制來分配給新進的節點一個唯一的位址，當新進的節點提出位址要求後，MANET中已經配置好位址而且鄰近新進節點的節點就會依據目前網路節點個數以及自己手中分配到的位址池動態計算產生一個計時器，當計時器倒數完畢才會回應新進節點，如此就能讓具有較大位址池的節點較早回應新進節點的位址要求，使得新進節點能夠從較大位址池的節點手中取得一個可用的位址，並且避免同時回應訊息而產生碰撞的情形，降低網路的流量，提升無線傳輸的品質，其主要的觀念與無線網路中的CSMA/CA相似，都是利用一個back-off timer來避免封包碰撞。在我們的模擬結果中，也觀察出我們的方法具有少量的communication overhead，並且能在平均0.25秒內取得一個有效位址。

A mobile node in MANET must be assigned a unique address before it may participate in unicast communication. Dynamic address assignment enables nodes in MANET to obtain a routable address without the need for any explicit configuration. It provides a means for nodes to communicate without any centralized infrastructure and provides a mechanism for dynamic network membership. This is a fundamental and difficult problem in the practical use of any MANET. Most MANET literature assumes that network related information of a node such as address is configured statically, prior to the node joining the MANET. However, this may not be feasible as nodes can enter and leave MANET dynamically. Recently, a considerable number of dynamic addressing protocols have been proposed. However, these approaches have different drawbacks. Hence, we propose a distributed protocol with dynamic timer for address assignment to nodes in MANET. Every configured node in MANET calculates a dynamic delay timer for new join node. The difference of delay timer could make the configured node with the bigger address pool to reply the request faster than the node with the smaller address pool. Hence, the requester can obtain an address pool as big as possible. By the way, it uses the concept of CSMA/CA to avoid the collision of reply messages and decrease the traffic between configured nodes and newly joining nodes. Simulation results show that the protocol incurs low latency and communication overhead for an address assignment and the address allocations require around 0.25 seconds.

誌謝 i
中文摘要 ii
英文摘要(Abstract) iii
內容 iv
圖片標題索引 v
表格標題索引 vi
1. 導論 1
2. 相關研究 3
2.1 Zeroconf研究團隊提出的方法 3
2.2 Autoconf研究團隊提出的方法 4
2.3 MANETconf研究團隊提出的方法 4
2.4 預言家位址分配(Prophet Addressing) 5
2.5 以夥伴系統(buddy systems)為基礎的位址分配機制 6
3. 問題描述與解決方案 8
3.1 設計的基本概念 8
3.2 動態延遲函式(Dynamic Delay Function)之設計 12
3.3 演算法描述 15
3.4 平衡位址池演算法(Balance Pool Algorithm) 21
3.5 訊息封包介紹 22
4. 模擬實驗 24
4.1 模擬環境之設定 24
4.2 實驗結果與分析討論 25
5. 結論 32
參考文獻 33

[1]C. E. Perkins and P. Bhagwat, “DSDV routing over a multi-hop wireless network of mobile computers”, In Tomasz Imielinski and Henry F. Korth, editors, Mobile Computing, pages 183-206. Kluwer Academic Publishers, 1996.
[2]D. Johnson, D. Maltz, and J. Broch, “DSR：The Dynamic Source Routing protocol for multi-hop wireless ad hoc networks”, In C.E. Perkins, editor, Ad Hoc Networking, pages 139-172. Addison-Wesley, 2001.
[3]C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing”, In C.E. Perkins, editor, Ad Hoc Networking, pages 173-219. Addison-Wesley, 2001.
[4]P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, “Optimized link state routing protocol for ad hoc networks”, In Proceedings of IEEE International Multi Topic Conference (IEEE INMIC) 2001, pages 62-68, 28-30 Dec. 2001.
[5]Z. J. Haas and M. R. Pearlman, “ZRP: a hybrid framework for routing in ad hoc networks”, In C.E. Perkins, editor, Ad Hoc Networking, pages 221-253. Addison-Wesley, 2001.
[6]M. Gerla, X. Hong, and G. Pei, “Fisheye State Routing Protocol (FSR) for Ad Hod Networks”, Internet Engineering Task Force, Internet Draft, draft-ietf-manet-fsr-03.txt, Jun. 2002.
[7]R. Droms, “Dynamic Host Configuration Protocol”, Internet Engineering Task Force, RFC 2131, Mar. 1997.
[8]D. Maltz, J. Broch, and D. Johnson, “Quantitative Lessons From a Full-Scale Multi-Hop Wireless Ad Hoc Network Testbed”, in Proceedings of the IEEE Wireless Communications and Networking Conference, Set 2000.
[9]S. Cheshire, B. Aboba, and E. Guttman, “Dynamic Configuration of IPv4 Link-Local Addresses”, Internet Draft, July 2004.
[10]C.E. Perkins, J.T. Malinen, R. Wakikawa, E.M. Belding-Roger, and Y. Sun, “IP Address Autoconfiguration for Ad Hoc Networks draft-ietfmanet-autoconf-01.txt”, Internet Engineering Task Force, MANETWorking Group, July 2000.
[11]S. Nesargi and R. Prakash, “MANETconf: Configuration of hosts in a mobile ad hoc network”, In Proceedings of the Twenty-first Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), volume 2, pages 1059-1068, 23-27 Jun. 2002.
[12]H. Zhou, L. Ni, and M. Mutka, “Prophet address allocation for large scale MANETs”, In Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003) , volume 2, pages 1304-1311, San Francisco, CA, United States, Mar. 30-Apr. 3 2003.
[13]P. Wilson, M. Johnstone, M. Neely, and D. Boles, “Dynamic Storage Allocation: A Survey and Critical Review”, International Workshop on Memory Management, Set 1995.
[14]M. Mohsin and R. Prakash, “IP address assignment in a mobile ad hoc network”, In Proceedings of IEEE Military Communications Conference (MILCOM 2002), volume 2, pages 856-861, Anaheim, CA, United States, 7-10 Oct. 2002.
[15]M. Thoppian and R. Prakash, “A Distributed Protocol for Dynamic Address Assignment in Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, vol. 5, no. 1, pp. 4-19, 2006.
[16]S.Y. Wang, “The GUI User Manual for the NCTUns 3.0 Network Simulator and Emulator”, May. 2006.