跳到主要內容

臺灣博碩士論文加值系統

(3.95.131.146) 您好!臺灣時間:2021/07/26 02:18
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:詹立翔
研究生(外文):Li-Hsiang Chan
論文名稱:隨意網路中利用分散式方法來設IP位址
論文名稱(外文):A Distributed IP Address Assignment Scheme in Ad Hoc Networks
指導教授:許健平許健平引用關係
指導教授(外文):Jang-Ping Sheu
學位類別:碩士
校院名稱:國立中央大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:英文
論文頁數:35
中文關鍵詞:IP位址自動分配
外文關鍵詞:network configuration.IP address assignmentAuto-configuration
相關次數:
  • 被引用被引用:0
  • 點閱點閱:167
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在傳統的有線網路中,每一個設備要連線到網際網路中必須設定相關的IP位址資訊才可以跟其它設備連通,這些IP位址的自動設定方法一般是採用一個集中式的DHCP伺服器來統一分配IP位址相關資訊給參與網路的設備,但是這樣的方式並不適合用在MANETs的環境裡頭。由於各設備會動態的移動或是離開網路,所以DHCP伺服器並沒有辦法保證在MANETs的環境下,可以讓每一個設備都可以連線到自己。在這篇論文裡頭,我們提出一個分散式的方法來設定IP位址相關資訊給新參與的網路設備。在網路中有一些設備會負責分配IP位址相關資訊給新參與網路的設備,我們稱它為coordinator設備。每一個新參與網路的設備都會利用交換Hello message來得知距離最近的coordinator在哪裡並發出IP位址相關資訊的需求給這個coordinator設備。因為IP位址是有限的資源所以必須妥善利用,為了有效的維護IP 位址並降低通訊的所花費的成本,我們利用經常的交換Hello message的特性來建立一個virtual C-tree的架構來降低整各網路的通訊成本。因此這一個virtual C-tree的架構可用被利用來備份每一個coordinator設備的IP-Address pools的相關資訊並且收集要離開網路設備的IP位址以便減少通訊所花費的成本。
In traditional wired networks, nodes are assigned IP-related information by a centralized server like Dynamic Host Configuration Protocol (DHCP) server, but it is not suitable for Mobile Ad Hoc Networks (MANETs). Due to each node will move and leave the network dynamically, the DHCP server cannot guarantee to be accessed by each node in the MANET. In this thesis, we will present a scheme to assign IP-related information to each new-joined node. Some nodes are assigned as coordinators and responsible for assigning an IP address to a new-joined node in the network. A new-joined node will use the exchanged hello messages to find the closest coordinator and to get a new IP address from the coordinator. In order to maintain the IP-address pools efficiently, the distributed coordinators are organized as a tree topology named virtual C-tree by exchanging the hello messages. The tree is used to backup the coordinators IP-address pools, collection IP addresses from leaving nodes, and record the IP-address pools status. We evaluate the performance of the proposed scheme through simulations and the results show that our protocol has low control messages overhead on invoking an IP address from a new-joined node and IP address maintenance from the leaving nodes.
1 Introduction 1
2 Previous Works 4
3 IP Address Assignment Scheme 8
3.1 IP Address Assignment 8
3.2 IP-Address Pools Maintenance 12
4 Simulation Results 22
5 Conclusions 30
[1]Anthony Mcauley and Kyriakos Manousakis, “Self-Configuring Networks,” in Proceedings of Military Communications Conference (MILCOM 2000), No. 1, pages 315 - 319, Los Angeles, CA, USA, October 2000.
[2]Anthony Mcauley, Archan Misra, L. Wong, and Kyriakos Manousakis, “Experience with Autoconfiguring a Network with IP Addresses,” in Proceedings of Military Communications Conference (MILCOM 2001), No. 1, pages 272 - 276, Fairfax, USA, October 2001.
[3]Archan Misra, Subir Das, Anthony Mcauley, and Sajal K. Das, “Autoconfiguration, Registration, and Mobility Management for Pervasive Computing,” IEEE Personal Communications Systems Magazine, volume 8, pages 24 - 31, August 2001.
[4]Charles E. Perkins, Elizabeth M. Belding-Royer, and Samir R. Das, “IP Address Autoconfiguration for Ad Hoc Networks,” Mobile Ad Hoc Networking Working Group - Internet Draft, January 2001.
[5]Charles E. Perkins, Elizabeth M. Belding-Royer, and Samir R. Das, “Ad Hoc On-Demand Distance Vector Routing Protocol,” Mobile Ad Hoc Networking Working Group - Internet Draft, January 2002.
[6]Charles E. Perkins, “Ad Hoc Networking,” Addison-Wesley, USA, 2000, ISBN 0-201-30976-9.
[7]Curt Schurgers, Gautam Kulkarni, and Mani B. Srivastava, ”Distributed On-Demand Address Assignment in Wireless Sensor Networks,” IEEE Transactions on Parallel and Distributed Systems, volume 13, No. 10, pages 1056 – 1065, October 2002.
[8]Guangyu Pei, Mario Gerla, and Tsu-Wei Chen, “Fisheye State Routing in Mobile Ad Hoc Networks,” in Proceedings of International Conference on Distributed Computing System (ICDCS 2000), pages D71 – D78, Taipei, Taiwan, ROC, April 2000.
[9]Hongbo Zhou, Lionel M. Ni, and Matt W. Mutka, “Prophet Address allocation for Large Scale MANETs,” in Proceedings of IEEE INFOCOM, volume 3, pages 1304 - 1311, Hyatt Regency, San Francisco, USA, March 2003.
[10]Ian D. Chakeres and Elizabeth M. Belding-Royer, “The Utility of Hello Messages for Determining Link Connectivity,” in Proceedings of the International Symposium on Wireless Personal Multimedia communications, pages 504-508, Sheraton Waikiki, Honolulu, Hawaii, October, 2002.
[11]Jakob Eriksson, Michalis Falotsos, and Srikanth Krishnamurthy, “PeerNet: Pushing Peer-to-Peer Down the Stack,” in Electronic Proceedings of International Workshop on Peer-to-Peer Systems (IPTPS 2003), pages 268 – 277, Berkeley, CA, USA, February 2003.
[12]Jeff Boleng, “Efficient Network Layer Addressing for Mobile Ad Hoc Networks,” in Proceedings of International Conference on Wireless Networks, pages 271 – 277, Las Vegas, USA, June 2002.
[13]Jung-Soo Park, Yong-Jin Kim, ETRI, and Sung-Woo, “Stateless Address Autoconfigurtion in Mobile Ad Hoc Networks Using Site-Local Address,” Mobile Ad Hoc Networking Working Group - Internet Draft, January 2002.
[14]Kilian Weniger, “Passive Duplicate Address Detection in Mobile Ad Hoc Networks,” in Proceedings of IEEE Wireless Communication and Networking Conference (WCNC 2003), volume 3, pages 1504 - 1509, March 2003.
[15]Kilian Weniger and Martina Zitterbart, “IPv6 Autoconfiguration in Large Scale Mobile Ad Hoc Networks,” in Proceedings of European Wireless, volume 1, pages 142-148, Florence, Italy, February 2002.
[16]Mansoor Mohsin and Ravi Prakash, “IP Address Assignment in a Mobile Ad Hoc Network,” in Proceedings of Military Communications Conference (MILCOM 2002), volume 2, pages 856 – 861, Anaheim, California, USA, October 2002.
[17]Nitin H. Vaidya, “Weak Duplicate Address Detection in Mobile Ad Hoc Networks,” in Proceedings of ACM International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc 2002), pages 206 - 216, Lausanne, Switzerland, June 2002.
[18]Ralph Droms, “Dynamic Host Configuration Protocol,” Network Working Group – RFC 2131, March 1997.
[19]Richard G. Ogier, Fred L. Templin, Bhargav Bellur, and Mark G. Lewis, “Topology Base on Reverse-Path Forwarding,” Mobile Ad Hoc Networking Working Group - Internet Draft, March 2002.
[20]SanKet Nesargi and Ravi Prakash, “MANETconf: Configuration of Hosts in a Mobile Ad Hoc Network,” in Proceedings of IEEE INfOCOM, volume 2, pages 23 – 27, New York, USA, June 2002.
[21]Susan Thomson and Thomas Narten, “IPv6 Stateless Address Autoconfiguration,” Network Working Group - RFC 2462, December 1998.
[22]Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network”, in Proceedings of International Conference on Mobile Computing and Networking (MobiCom 1999), pages 151 – 162, Washington, USA, August 1999.
[23]Tadashi Komori and Takamichi Saito, “The Secure DHCP System with User Authentication,” in Proceedings of IEEE conference on Local Computer Networks, pages 123 – 131, Tampa, Florida, USA, November 2002.
[24]Thomas Clausen, Philippe Jacquet, Anis Laouiti, Pascale Mulethaler, Amir Qayyum, and Laurent Viennot, “Optimized Link State Routing Protocol”, in Proceedings of IEEE International Multitopic Conference (INMIC 2001), pages 62 – 68, Lahore, Pakistan, December 2001.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top