樹狀結構為基礎之行動隨意網路IP位址分配機制

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：6

、訪客IP：18.226.170.235

姓名

吳文志(Wen-zhi Wu) 查詢紙本館藏

畢業系所

資訊管理學系

論文名稱

樹狀結構為基礎之行動隨意網路IP位址分配機制
(A tree-based IP assignment scheme in mobile ad hoc network)

相關論文

★ 具代理人之行動匿名拍賣與付款機制	★ 網路攝影機遠端連線安全性分析
★ HSDPA環境下的複合式細胞切換機制	★ 平面環境中目標區域之偵測 - 使用行動感測網路技術
★ 藍芽Scatternet上的P2P檔案分享機制	★ 交通壅塞避免之動態繞路機制
★ 運用UWB提升MANET上檔案分享之效能	★ 合作學習平台對團體迷思現象及學習成效之影響–以英文字彙學習為例
★ 以RFID為基礎的室內定位機制─使用虛擬標籤的經驗法則	★ 適用於實體購物情境的行動商品比價系統-使用影像辨識技術
★ 信用卡網路刷卡安全性	★ DEAP:適用於行動RFID系統之高效能動態認證協定
★ 在破產預測與信用評估領域對前處理方式與分類器組合的比較分析	★ 單一類別分類方法於不平衡資料集－搭配遺漏值填補和樣本選取方法
★ 正規化與變數篩選在破產領域的適用性研究	★ 分群式前處理方法於類別不平衡問題之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

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

摘要(中)

行動隨意網路為一個多點跳躍的網路，因此裝置間需要時常通訊。在有線網路中裝置可透過DHCP自動取得獨一無二的IP位址，然而行動隨意網路是臨時且隨意形成，因此IP位址分配工作無法由特定單一裝置負責。有鑑於此，本研究設計出一套適用於行動隨意網路中的IP位址分配機制，使所有節點進入網路後均可獲得一個獨一無二的IP位址。
目前行動隨意網路上IP位址分配機制可分為兩類：氾濫式與位址池，本論文以位址池方式為主。在本論文中，只有部份節點可分配IP位址(稱之為分配者)，而無法分配IP位址之節點，彼此間可透過週期性廣播得知目前最近分配者資訊，因此當新節點進入網路後便可使用較少的頻寬資源且不必浪費過多的時間來取得IP位址。
行動隨意網路之拓撲是持續變動，使得網路分離與合併的情況時常出現，因而發生IP位址遺失與衝突，本研究也針對網路分離與合併設計出一套偵測方式，並且解決節點IP位址遺失與衝突情況的發生。在進行網路與合併分離時需要確認目前網路IP位址使用狀況，以往的研究是節點逐一回報IP位址資訊給合併/分離者，本機制利用氾濫訊息建立位址回報樹，因此可減少節點回報IP位址資訊所造成之流量。
本研究透過ns2模擬証明所提出機制之可行性，並且分析不同參數設定值對機制效能所造成之影響，進而從中歸納機制之優缺點與可能改進之處，作為未來改進方向。

摘要(英)

Mobile Ad-hoc Network (MANET) is a multi-hop network for which the communication between mobile nodes is persistent. The IP addresses can be assigned automatically by DHCP server in the wired network. However, it cannot be applied to MANET because of its distributed and dynamic nature. In this paper, we propose a tree-based IP assignment scheme which assigns a unique IP address for each node in MANET.
There are two ways of IP assignment scheme for MANET, flooding based and address-pool based. The presented scheme is based on an address-pool way in which only some of the nodes are assigned as allocators which are responsible for assigning an IP address to a new node in the network. Mobile nodes exchange hello messages to find the closest allocators, hence new incoming node can occupy less bandwidth resource to obtain an IP address quickly.
Because of the rapid change and unpredictability of MANET topology, networks merging and partitioning are occurred frequently. The IP addresses of the nodes may be lost or collide when networks merge or partition. We design methods for detecting and solving such problems. In previous IP assignment schemes, nodes report their IP addresses information to the node which detects networks merging and partitioning through unicast. In our scheme, we design an address-reported-tree in order to reduce the communication overhead occurred by all nodes reporting their IP address at the same time.
In this paper, we use ns-2 simulators to evaluate our scheme by modifying various parameters. According to the simulation results, the advantages and disadvantages of our scheme are discussed, and the future works of our scheme is figured out.

關鍵字(中)

★ 位址分配
★ 行動隨意網路

關鍵字(英)

★ ip assignment
★ mobile ad hoc network

論文目次

第一章緒論 1
1.1 研究背景 1
1.2 研究動機與目的 5
1.3 論文架構 7
第二章背景介紹 8
2.1 行動網路分離與合併 8
2.2 氾濫式(flooding-based)為基礎之IP位址分配機制 10
2.3 位址池(address pool)為主之IP位址分配機制 14
第三章 IP分享機制 20
3.1 封包格式 20
3.2 名詞介紹 23
3.2.1 IP區塊模型 23
3.2.2 網路識別碼 24
3.2.3 角色任務介紹 25
3.2.4 IP區塊的管理 25
3.2.5 位址分配樹 27
3.3 機制介紹 32
3.3.1 機制簡介 32
3.3.2 節點進入 35
3.3.3 節點離開 38
3.3.4 網路分離(Network split) 39
3.3.5 網路合併(Network merge) 42
3.4 機制之強化 44
3.4.1 位址回報樹 44
3.4.2 廣播延遲時間設計 45
第四章模擬數據與效能評估 47
4.1 模擬環境 47
4.2 效能評估指標 47
4.3 廣播延遲係數(α)分析 48
4.4 位址池大小與跳躍數分析 51
4.5 節點速度之分析 54
4.6 節點密度之分析 56
第五章結論 59
5.1 機制特色 59
5.2 論文貢獻 60
5.3 未來研究方向 61

參考文獻

[1] ANSI/IEEE Std 802.11, “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications”, 2003.
[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] W.Q. Deng, “A Study on Delay-based Routing for Mobile Ad-hoc Networks”, Master Theses, Department of Information Management, Huafan University, May 2005.
[4] J.Z. Sun, “Mobile ad hoc networking: an essential technology for pervasive computing”, Proceedings of 2001 International Conferences on Info-tech and Info-net, vol.3, Oct. 2001, pp.316-321.
[5] P. Johansson et al., “Bluetooth: an enabler for personal area networking”, Network, vol.15, no.5, Sep. 2001, pp.28-37.
[6] C. Maihofer and R. Eberhardt, “Geocast in vehicular environments: caching and transmission range control for improved efficiency”, Intelligent Vehicles Symposium, Jun. 2004, pp.951-956.
[7] R. Droms, Dynamic Host Configuration Protocol, RFC 2131, Mar. 1997, http://www.ietf.org/rfc/rfc2131.txt?number=2131.
[8] M. Fazio et al., “IP address autoconfiguration in ad hoc networks : Design, implementation and measurements”, Computer Networks, vol. 50, no. 7, May 2006, pp.898-920.
[9] C.N. Ojeda-Guerra et al., “A new approach 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.
[10] P.O.G. John et al., “Influence of Network Merger on Address Assignment Strategies for Mobile Ad-hoc Network”, Proceedings of 2004 IEEE 60th Vehicular Technology Conference, vol. 4, Sept. 2004, pp.2892-2896.
[11] C.E. Perkins et al., “IP Address Autoconfiguration for Ad Hoc Networks”, IETF Internet draft, work in progress, Jan. 2001.
[12] M. Abolhasan et al., “A review of routing protocols for mobile ad hoc networks”, Ad Hoc Network, vol. 2, no. 1, Jan. 2004, pp.1-22.
[13] R. Prakash and S. Nesargi, “MANETconf : Configuration of Hosts in a Mobile Ad Hoc Network”, Proceedings of 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, Jun. 2002, pp.1059-1068.
[14] A.J. Mcauley and K. Manousakis, “Self-Configuring Networks”, Proceedings of 21st Century Military Communications Conference, vol. 1, Oct. 2000, pp.315-319.
[15] M. Mohsin and R. Prakash, “IP Address Assignment in a Mobile Ad Hoc Network”, Proceedings of Military Communications Conference, vol. 2, Oct. 2002, pp.856-861.
[16] P.T. Abhishek and A.L.M. Patnaik, “An address assignment for the automatic configuration of mobile ad hoc networks”, Personal and Ubiquitous Computing, vol. 8, no. 1, Feb. 2004, pp.47-54.
[17] M.R. 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, Jan. 2006, pp.4-19.
[18] J.P. Sheu et al., “A distributed IP address assignment scheme for ad hoc networks”, Proceedings of 11th International Conference on Parallel and Distributed Systems, vol. 1, Jul. 2005, pp.439-445.
[19] I.D. Chakeres and E.M. Belding-Royer, “The Utility of Hello Messages for Determining Link Connectivity”, Proceedings of the International Symposium on Wireless Personal Multimedia communications, vol. 2, Oct. 2002, pp.504-508.
[20] T. Clausen et al., “Optimized Link State Routing Protocol”, Proceedings of IEEE International Multitopic Conference, Dec. 2001, pp.62-68.
[21] Y.C. Tseng et al., “The Broadcast Storm Problem in a Mobile Ad Hoc Network”, Wireless Networks, vol. 8, no. 2-3, Mar. 2002, pp.153-167.
[22] R.L. Knoblauch et al., “Field studies of pedestrian walking speed and start-up time”, Transportation Research Record 1538, Dec. 1996, pp.27-38.
[23] The network simulator 2 ; http://www.isi.edu/nsnam/ns/
[24] The CMU Monarch Project’s Wireless and Mobility Extensions to ns ; http://www.monarch.cs.cmu.edu/

指導教授

蘇坤良(Kuen-Liang Sue)

審核日期

2007-4-19

推文