一种基于位置和DHT的移动ad hoc网络服务发现方案  

A Location and DHT Based Service Discovery Scheme for Mobile ad hoc Networks

作　　者：袁锦绣[1] 钱雪忠[1] 汪锦岭[2] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122 [2]中国科学院软件研究所,北京100081

出　　处：《微电子学与计算机》2006年第9期129-131,134,共4页Microelectronics & Computer

摘　　要：移动adhoc网络中要求各节点间在缺乏预备知识的情况下进行相互通讯和协作,因此,对网络中各种服务的自动发现成为了其中的一个关键问题。将各节点的位置信息和DHT技术结合起来,提出了一种高效的面向移动adhoc网络的服务发现方案。首先直接基于网络的物理拓扑结构来构建一种分布式哈希表,从而有效地消除了现有DHT方案的拓扑结构不匹配问题。然后提出了一种维度映射的方案,以将多维的服务描述信息映射到二维的哈希键值空间上。最后提出一种区域搜索算法,以高效地支持对服务的条件查询。Nodes in a mobile ad hoc network are required to communicate with each other without a priori knowledge, so it is a key problem to automatically discover the available services in the network. An efficient service discovery scheme is proposed for mobile ad hoe networks, which combines the location information of nodes with the DHT technology. The scheme firstly builds a distributed hash table based on the physical topology of network, so that the topology mismatch problem of conventional DHT schemes can be eliminated. A dimension mapping solution is then proposed so that the multiple dimension service description information can be mapped to the 2-dimension hash key space. Finally, a regional search algorithm is proposed to efficiently support the conditional query of services.

关 键 词：移动AD HOC网络 服务发现 分布式哈希表 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]