标题: 阶层式行动网路下之位址分配、封包绕送、以及资讯存取机制
Addressing, Routing, and Information Provisioning Mechanisms for Hierarchical Mobile Networks
作者: 徐元瑛
Yuan-Ying Hsu
曾建超
Chien-Chao Tseng
资讯科学与工程研究所
关键字: 多点绕送无线网路;行动随意网路;移动网路;位址分配;封包绕送;漫游;自动组态;资讯阶层;multi-hop wireless network;MANET;network mobility;addressing;routing;roaming;auto configuration;information hierarchy
公开日期: 2004
摘要: 由于无线网路以及无线装置的技术更新,依不同的需求已有各式各样的无线网路因应而生,例如行动随意网路(mobile ad-hoc networks)、无线感测网路(wireless sensor networks)、无线网状网路(wireless mesh networks)、以及移动网路(mobile networks)。一无线网路可以整体移动,也可与其他无线网路重叠进而形成阶层式移动网路。阶层式移动网路提供移动节点一个弹性的方式使其可以利用适合的无线存取技术连接到基础网路。但是,当移动节点在阶层式移动网路中漫游时,仍有许多技术问题需要解决。在这篇论文中,我们提出了一些在阶层式移动网路中位址分配、封包绕送、以及资讯存取的方法。

现有的位址分配技术通常采用广播的方式来寻求位址或检查是否有重复使用,但广播会在多点跳跃的网路中造成相当大的负担。我们提出了一个称为Prime DHCP的位址分配方式使得在分配位址的过程中不需要在整个网路中广播讯号。Prime DHCP 将网路中每个节点设为DHCP代理伺服器,并且独自执行提出的质数位址配置演算法计算出各自独有的位址群。DHCP代理伺服器以及质数位址配置演算法可以共同排除广播的必要性。

根据Prime DHCP分配的位址结果,我们提出了一个基于质数原则的自我组态绕送协定,此协定可让每个节点自行找到绕送路径到其他内部节点。此方法让每个节点只需要依据目的节点的位址即可找到绕送路径,不需要定期与其他节点交换路由资讯或发送讯息给目的节点询问路径。当有封包需要送到外部网路时,我们在每一个网路中设定至少一个闸道伺服器用以负责绕送进出外部网路的封包。除此之外,我们修改了Mobile IP的方法以支援节点的移动。同时我们也提出了一个负担平衡的绕送协定来平衡多个闸道伺服器的外部网路流量。
除了网路位址以及绕送的机制以外,我们也提出了在阶层式网路下资讯存取的方法。当一个闸道伺服器需要服务许多移动节点时,闸道伺服器外部的网路频宽势必会被所有的节点一同分摊而形成瓶颈。为此我们提出了一个双模网路架构以及一考量负载的排程机制以安排传输顺序。此外,使用者的资讯有可能在阶层式行动网路中存在各式各样的装置中。因此我们学习记忆体阶层的方式提出了个人资讯阶层(Personal Information Hierarchy,PIH)以及相对应的存取机制来存放使用者的个人资讯。

我们已针对所有提出的方法进行效能评估。评估的结果显示Prime DHCP可以明显地降低在分配位址时的时间以及所造成的讯号花费;基于质数原则的自我组态绕送协定可以减少绕送路径的设定时间;PIH 的架构以及机制可以增加存取的空间以及使用者存取资料的速率。
With the advance of wireless and terminal technologies, various wireless networks, such as mobile ad-hoc networks, wireless sensor networks, wireless mesh networks, and mobile networks, are designed for different purposes. A wireless network may move as a whole and furthermore may overlay with one another to form a hierarchical mobile network. Hierarchical mobile netoworks provide a flexible approach for mobile nodes to access Infrastruture networks with any appropriate wireless technologies. However, many technical issues need to be resolved for mobile nodes to roam within a hierarchical mobile network environment. In this thesis, we propose several mechanisms for network addressing, routing and information provisioning in hierarchical mobile networks.

Current address allocations usually involve broadcasting, which introduces huge overhead in multi-hop environments, for address solicitation or duplicate address detection. We propose a Prime DHCP scheme that can allocate addresses to hosts without broadcasting over the whole network. Prime DHCP makes each host a DHCP proxy and run a prime numbering address allocation algorithm individually to compute unique addresses. The concept of DHCP proxies and the prime numbering address allocation algorithm together eliminate the needs for broadcasting.

Based on the address allocation result by Prime DHCP, we propose a prime-based self-configured routing protocol for each node to route data packets to other local nodes within the same network. With the proposed routing protocol, each node can derive a routing path to a local node according to the node’s address without periodically exchanging routing information with other nodes. Furthermore, the node need not send a routing request to the destined node before forwarding packets to the local node, either. For packets destined to external networks, we configure at least one gateway in each wireless network, and have the gateways responsible for routing packets from/to external networks. To support host mobility, we adopt mobile IP with minor modifications, and we also propose a load-balanced routing protocol to balance external traffic between multiple gateways.

Besides network addressing and routing mechanisms, we also propose information provisioning mechanisms for hierarchical mobile networks. When a gateway needs to serve a lot of mobile nodes, the external bandwidth would be shared by all the mobile nodes beneath the gateway. We propose a two-tier proxy architecture and a load-based scheduling mechanism to schedule traffic according to data sizes. Furthermore, personal information of a user might be stored in various devices. Therefore we also propose a personal information hierarchy (PIH) to store personal information and corresponding information accessing policies for PIH by adapting the successful experience of memory hierarchy.

We have conducted performance evaluation for all proposed mechanisms. Performance results show that prime DHCP can significantly reduce the signal overhead and the latency for hosts to acquire addresses; prime-based self-configured routing protocol can significantly decrease path setup time and signal overhead; and the PIH architecture and accessing policies together can significantly increase the storage capacity with a negligible decrease in access speed a user can experience in personal information management.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT008917804
http://hdl.handle.net/11536/77657
显示于类别:Thesis


文件中的档案:

  1. 780401.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.