An IP Address Configuration Algorithm for Zeroconf . Mobile Multi-hop Ad-Hoc Networks
An IP Address Configuration Algorithm for Zeroconf . Mobile Multi-hop Ad-Hoc Networks
复制标题
作者：
M. Günes
移动多跳自组织网络为建立通信连接提供了一种高效且非常灵活的方式。这类网络的一个方面是它们的便利性，这一点在研究中有时被忽视了。特别是对于民用应用，这方面的自组织网络需要更多的关注。预计用户既不需要了解太多网络，也不需要执行复杂的配置任务来建立连接。因此，这类网络不仅要处理非常困难的环境，而且必须非常容易使用。联网的基本要求之一是网络中的每个节点都有唯一的标识，也称为地址。在互联网和局域网中，IP地址很常见。移动自组织网络也应该使用IP地址，因此设备将是相同的，并且还允许自组织网络与互联网的互连。如何在移动多跳自组织网络中为节点提供IP地址是一个悬而未决的问题。在这项工作中，我们提出了一种新的移动多跳自组网的动态IP地址配置算法。此外，我们通过ns-2的仿真结果展示了所提出的寻址算法的性能，并将其与其他方法进行了比较。∗发表在法国索菲亚·安提波利斯2002年9月的《宽带无线自组织网络和服务国际研讨会》上。1动机自组织网络由几个移动节点组成，这些节点通过无线电通信，不需要任何固定的通信基础设施。自组织网络适用于只需要临时通信，并且不可能或不希望建立通信基础设施的情况。作为自组织网络的一个例子，我们可以想象一个会议，其中成员想要交换数据。与会人员对网络配置不愿下大力气，可能是用户技术不过硬。此外，用户希望通过一种便捷的方式进行合作。与只存在一条无线链路的GSM和WLAN等其他无线网络不同，数据必须在自组织网络中的几个中间节点上进行中继。这种类型的通信对于也称为移动多跳自组织网络的自组织网络来说是典型的。由于节点的移动性，网络拓扑结构不断变化。不存在总是可到达并因此可以提供重要服务的特殊节点。此外，不可能对节点动作做出可靠的预测。节点可以在它们希望的时候附加和分离到自组织网络。也可以将自组织网络分成几个较小的网络，或者加入并创建一个新的大网络。自组织网络中的主要问题是寻找源和目的地之间的路径。
Mobile multi-hop ad-hoc networks promise an efficient and very flexible way of establishing a communication connection. One aspect of these kind of networks is their convenience, which is sometimes neglected in research. Especially for civil applications, this aspect of ad-hoc networks need more attention. It is expected that users neither need to know much of networks nor perform complex configuration tasks to establish a connection. Therefore this kinds of networks have to not only handle a very difficult environment, but also have to be very easy to use. One of the basic requirement of networking is that each node in the network has a unique identification, also called an address. In the internet and in local area networks IP addresses are common. Mobile ad-hoc networks should also use IP addresses thus the devices will be same and also to allow the interconnection of ad-hoc networks to the internet. It is an open question how to provide IP addresses to nodes in mobile multi-hop ad-hoc networks. In this work we introduce a new dynamic IP address configuration algorithm for mobile multi-hop ad-hoc networks. Further we show through simulation results, made with ns-2, the performance of the proposed addressing algorithm and compare it with other approaches. ∗Published in ”International Workshop on Broadband Wireless Ad-Hoc Networks and Services, Sophia Antipolis, France, September, 2002” 1 Motivation An ad-hoc network consists of several mobile nodes which communicate over radio and do not need any fixed communication infrastructure. Adhoc networks are suitable for situations where only temporary communication is needed, and establishing a communication infrastructure is either not possible or not desirable. As an example for an ad-hoc network, we can imagine a meeting in which the members want to interchange data. The participants do not want to make high efforts for the network configuration, perhaps the users are not technically skilled. In addition the users wish a convenient way for their cooperation. In contrast to other radio networks, like GSM and WLAN, where only one radio link exists, data must be relayed over several intermediate nodes in ad-hoc networks. This kind of communication is typical for ad-hoc networks, which are also referred to as mobile multi-hop ad-hoc networks. As a consequence of node mobility the network topology changes continuously. There are no special nodes which are always reachable and could therefore offer important services. Furthermore, it is not possible to make reliable predictions about node actions. Nodes may attach and detach to the ad-hoc network if and when they wish to. It is also possible that the ad-hoc network splits into several smaller networks or join and create a new big network. The main problem in ad-hoc networks is finding a path between the source and the destina-