跳到主要內容

簡易檢索 / 詳目顯示

研究生: 劉又誠
Yu-Cheng Liu
論文名稱: 隨意網路中利用位置資訊來設定IP位址
Location-Based IP Assignment Protocol for Ad Hoc Networks
指導教授: 許健平
Jang-Ping Sheu
口試委員:
學位類別: 碩士
Master
系所名稱: 資訊電機學院 - 資訊工程學系
Department of Computer Science & Information Engineering
畢業學年度: 93
語文別: 英文
論文頁數: 36
中文關鍵詞: 隨意型網路IP位址指派位置資訊察覺
外文關鍵詞: IP address assignment, Ad hoc network, location awareness
相關次數: 點閱:4下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在傳統的有線網路中,每一個設備要連線到網際網路中必須設定相關的IP位址資訊才可以跟其它設備連通,這些IP位址的自動設定方法一般是採用一個集中式的DHCP伺服器來統一分配IP位址相關資訊給參與網路的設備,但是這樣的方式並不適合用在MANETs的環境裡。由於各設備會動態的移動或是離開網路,所以DHCP伺服器並沒有辦法保證在MANETs的環境下,可以讓每一個設備都可以連線到自己。在這篇論文裡,我們提出一個利用位置資訊來為新參與的網路設備設定IP位址的方法,我們事先將整個網路區域分割成數個大小相同的蜂巢狀小區域,每個小區域會被分配到一段彼此沒有交集的IP位址區段。在一個蜂巢狀小區域中第一個出現的網路設備會成為coordinator的角色,接著出現的網路設備則會成為member的角色,coordinator負責分配IP位址給後來加入此蜂巢狀小區域的網路設備,和維護此蜂巢狀小區域中所有的可用IP位址,member則可以透過coordinator來取得一個唯一的IP位址。在MANETs環境中,網路設備有可能呈現不平均的分佈情形,造成部分的coordinators沒有足夠的IP位址可以分配給新加入的網路設備,因此我們提出了一個可用IP位址重新分配的機制,當IP位址不足夠時,可以做動態的調整以增加可用IP位址的個數。藉由位置資訊的輔助,這篇論文所提出的方法可以完全避免掉網路合併和分解的問題,可用IP位址可以有效率的被使用,且要求一個新IP位址時所花費的延遲時間是可被接受的。


    In traditional wired networks, hosts 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 host will move and leave the network dynamically, the DHCP server cannot guarantee to be accessed by each host in the MANETs. Several decentralized solutions have been proposed for the issue of IP assignment. A new IP-address allocation algorithm, namely location-based IP assignment protocol, is proposed in this thesis. We divide the entire network into several disjoint and the same size cells and allocate each cell a segment of available IP-addresses. The first host appears in each cell becomes the role of coordinator which take over the available IP-addresses of the cell. A coordinator is responsible for assigning an IP-address to the new host and maintaining the IP-address pool of its own cell. Therefore, when a non-coordinator host enters any cell, it can easily get one IP-address from the coordinator. Since the distribution of the hosts is not uniform in the network, some coordinators may not have enough available IP-addresses for the new hosts. Thus, a dynamic IP-address redistribution mechanism is proposed to adjust the number of IP-addresses in each cell. With location information of each host, the scheme proposed in this thesis can avoid the problems of network partitioning and merger. The IP-addresses can be fully utilized and the latency time on invoking an IP-address is acceptable.

    1.Introduction........................................................1 2.Previous Works......................................................5 3.Location-based IP-address Assignment Protocol......................10 3.1 IP-address Assignment Phase.................................11 3.2 Dynamic IP-address Redistribution Phase.....................12 3.3 IP Maintenance Phase........................................17 4.Simulations and Experimental Results...............................21 4.1 Performance Comparison......................................22 4.2 Threshold Value h...........................................24 4.3 The Circling Way vs. The Lining Way.........................28 4.4 The Cell Size...............................................28 4.5 Control Packet Overhead vs. Mobility Speed..................31 5.Conclusions........................................................33 6.References........................................................34

    [1] A. Jones, “Mobile Computing to Go,” IEEE Concurrency, Vol. 7, No. 2, pp. 20-23, April-June 1999.
    [2] A. Krikelis, “Location-Dependent Multimedia Computing,” IEEE Concurrency, Vol. 7, No. 2, pp. 13-15, April-June 1999.
    [3] A. Misra, S. Das, A. Mcauley, and S. K. Das, “Autoconfiguration, Registration, and Mobility Management for Pervasive Computing,” IEEE Personal Communications Systems Magazine, Vol. 8, pp. 24-31, August 2001.
    [4] C. E. Perkins, E. M. Belding-Royer, and S. R. Das, “IP Address Autoconfiguration for Ad Hoc Networks,” Mobile Ad Hoc Networking Working Group - Internet Draft, January 2001.
    [5] C. Y. Chang and C. T. Chang, “Hierarchical Cellular-Based Management for Mobile Hosts in Wireless Ad Hoc Networks,” Journal of Computer Communications , Vol. 24, pp. 1554-1567, 2001.
    [6] H. Zhou, L. M. Ni, and M. W. Mutka, “Prophet Address Allocation for Large Scale MANETs,” in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 2, pp. 1304-1311, San Francisco, CA, USA, March, 2003.
    [7] I. Stojmenovic, A. P. Ruhil, and D.K. Lobiyal, “Voronoi Diagram and Convex Hull Based Geocasting and Routing in Wireless Networks”, in Proceedings of the IEEE Symposium on Computers and Communications, Ankara, Turkey, June 2003.
    [8] J. Eriksson, M. Faloutsos, and S. Krishnamurthy, “Scalable Ad Hoc Routing: The Case for Dynamic Addressing,” in Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 2, pp. 1108-1119, Hong Kong, China, March, 2004.
    [9] J. N. M. and I. T. Lu, “A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks,” Journal on Selected Areas in Communications, Vol. 17, pp. 1415-1425, August 1999.
    [10] J. S. Park, Y. J. Kim, and S. Woo, “Stateless Address Auto-configuration in Mobile Ad Hoc Networks Using Site-Local Address,” Mobile Ad Hoc Networking Working Group - Internet Draft, January 2002.
    [11] L. H. Chan, and S. C. Tu, and J. P. Sheu, “A Distributed IP Address Assignment Scheme for Ad Hoc Networks,” in Proceedings of the 11th international Conference on Parallel and Distributed Systems, Fukuoka, Japan, July, 2005.
    [12] M. Mohsin and R. Prakash, “IP Address Assignment in a Mobile Ad Hoc Network,” in Proceedings of Military Communications Conference, Vol. 2, pp. 856-861, Anaheim, California, USA, October 2002.
    [13] M. Fazio, M. Villari, and A. Puliafito, “Auto-configuration and maintenance of the IP address in ad-hoc mobile networks,” in Proceedings of Australian Telecommunications, Networks and Applications Conference, Sydney, Australia 2003.
    [14] R. Droms, “Dynamic Host Configuration Protocol,” Network Working Group – RFC 2131, March 1997.
    [15] S. Nesargi and R. Prakash, “MANETconf: Configuration of Hosts in a Mobile Ad Hoc Network,” in Proceedings of 21st Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 2, pp. 23-27, New York, USA, June 2002.
    [16] W. H. Liao, Y. C. Tseng, and J. P. Sheu, “GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks”, Journal of Telecommunication System, Vol. 18, pp. 37-60, September 2001.
    [17] W. H. Liao, Y. C. Tseng, K. L. Lo, and J. P. Sheu, “GeoGrid: A Geocasting Protocol for Mobile Ad Hoc Networks Based on Grid,” Journal of Internet Technology, Vol. 1, pp. 23-32, 2000.
    [18] X. Lin and I. Stojmenovic, “GEDIR: Loop-Free Location Based Routing in Wireless Networks,” in Proceedings of the International Conference on Parallel and Distributed Computing and System, November 1999.
    [19] X. Zeng, R. Bagrodia, and M. Gerla, “GloMoSim: A Library for the Parallel Simulation of Large-Scale Wireless Networks,” in Proceedings of 12th Workshop on Parallel and Distributed Simulation, pp. 154-161, Alberta, Canada, May 1998.
    [20] Y. B. Ko and N. H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” in Proceedings of the 4th ACM/IEEE International Conference on Mobile Computing and Networking, pp. 66-75, Dallas, Texas, USA, October 1998.
    [21] Y. B. Ko and N. H. Vaidya, “Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms,” in Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 101-110, New Orleans, Louisiana, USA, February 1999.
    [22] Y. C. Tseng, C. M. Chao, S. L. Wu, and J. P. Sheu, “Dynamic Channel Allocation with Location Awareness for Multi-hop Mobile Ad Hoc Networks”, Journal of Computer Communications, Vol. 25, pp. 676-688, May 2002.

    QR CODE
    :::