一种新型Ad Hoc网络分层路由协议及性能评价

分层结构已经被引入到有线网络.然而,由于在Ad Hoc网络中所有的终端都是移动的,所以引入分层结构很困难.为解决此问题,提出了一个基于自治分簇策略的新型分层路由协议:Layered-TORA.其能够将终端分成多个自治的簇,数据通过在簇间执行按需路由协议而簇内执行表路由协议达到目的结点.并通过实验对Layered-TORA和TORA进行了比较和分析.证明了,Layered-TORA可有效解决在AdHoc网络中引入分层结构的问题.     

一种基于改进RTS/CTS的MANET高效报文转发策略

MANET网络由可自主移动的无线节点组成。节点的自主移动导致了链路路由的改变,因此需要有一个机制维护和发现路由信息。目前人们已经针对MANET网络提出了几种路由协议,但这些路由协议都是基于IP的且路由维护的代价高,这严重影响了MANET网络的稳定性、可扩展性和用户有效带宽。本文提出了一种基于改进RTS/CTS的MANET高效报文转发策略。该策略对标准IEEE 802.11协议进行了修改,利用改进的RTS/CTS报文信息,进行报文转发,从而避免了使用MANET网络路由协议给网络性能带来的影响。使用改进的NS-2模拟了基于改进RTS/CTS的MANET高效报文转发策略。模拟结果表明:该策略可以有效地降低路由维护的开销并降低报文传输的延迟。     

Ad Hoc网络中一种基于环状分层结构的组密钥协商协议

移动ad hoc网络是一种新型的移动多跳无线网络.其自身的特征,如网络规模庞大、动态的拓扑结构、有限的计算、通信和存储能力等,使得传统的密钥分配和管理机制无法直接应用于该网络.提出了一种新的适用于移动 ad hoc网络的组密钥协商协议.该协议在环状分层结构上基于多线性映射进行组密钥的协商和分配,使得节点在密钥协商过程中具有低计算开销与低通信开销的优势,较好地解决了在移动ad hoc网络中进行组密钥协商时所遇到的节点能量受限问题,适用于移动ad hoc网络.     

LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks

Performance of ad hoc networks dramatically declines as network grows. Cluster formation in which the network hosts are hierarchically partitioned into several autonomous non-overlapping groups, based on proximity, is a promising approach to alleviate the scalability problem of ad hoc networks. In this paper, we propose a localized learning automata-based clustering algorithm for wireless ad hoc networks. The proposed clustering method is a fully distributed algorithm in which each host chooses its cluster-head based solely on local information received from neighboring hosts. The proposed algorithm can be independently localized at each host. This results in a significantly reduction in message overhead of algorithm, and allows cluster maintenance can be locally performed only where it is required. To show the performance of proposed algorithm, obtained results are compared with those of several existing clustering methods in terms of the number of clusters, control message overhead, clustering time, and load standard deviation.     

Robust self-stabilizing weight-based clustering algorithm

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists of partitioning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organization to the network that facilitates network management and that increases its scalability.In a weight-based clustering algorithm, the clusterheads are selected according to their weight (a node’s parameter). The higher the weight of a node, the more suitable this node is for the role of clusterhead. In ad hoc networks, the amount of bandwidth, memory space or battery power of a node could be used to determine weight values.A self-stabilizing algorithm, regardless of the initial system configuration, converges to legitimate configurations without external intervention. Due to this property, self-stabilizing algorithms tolerate transient faults and they are adaptive to any topology change.In this paper, we present a robust self-stabilizing weight-based clustering algorithm for ad hoc networks. The robustness property guarantees that, starting from an arbitrary configuration, after one asynchronous round, the network is partitioned into clusters. After that, the network stays partitioned during the convergence phase toward a legitimate configuration where the clusters verify the “ad hoc clustering properties”.     

移动自组网中一种面向群组移动性的位置服务协议

基于位置信息的路由协议被广泛认为是一种可扩展的移动自组网路由解决方案.大多数此类协议假定可通过位置服务协议获取结点的位置信息.研究人员现已提出多种位置服务协议.但是,它们在大规模网络环境中的可扩展性不好,或者在高动态网络环境中可靠性不高.本文提出了一种适用于大规模移动自组网的面向群组移动性的可扩展及可靠的位置服务协议.模拟结果表明此协议比SLURP协议更适合于具有群组移动性的大规模移动自组网.     

一种基于地理定位信息的Ad Hoc分簇算法

Ad hoc网络的分簇机制目的是为了利用网络的分级结构来管理众多的移动设备。为了创建和维持一个当节点高速移动时仍然有效的分级结构,必须满足下面的需求:(1)分级结构中每个移动设备能够根据本地信息自动转换它的角色;(2)分级结构的管理负载要小,每个簇内的节点数目要尽可能地相同。该文提出了一个基于地理定位系统的自适应的多跳分簇机制,试验结果表明新的算法不依赖于节点的移动速度和传播范围,满足上面两个要求。     

Distributed Hashing for Scalable Multicast in Wireless Ad Hoc Networks

Several multicast protocols for mobile ad hoc networks have been proposed, which build multicast trees by using location information that is available from the Global Positioning System (GPS) or localization algorithms and use geographic forwarding to forward packets down the multicast trees. These stateless multicast protocols carry encoded membership, location, and tree information in each packet and are more efficient and robust than stateful protocols (for example, ADMR and ODMRP), as they avoid the difficulty of maintaining distributed state in the presence of frequent topology changes. However, current stateless multicast protocols are not scalable to large groups because of the per-packet encoding overhead, and the centralized group membership and location management. We present the hierarchical rendezvous point multicast (HRPM) protocol, which significantly improves the scalability of stateless multicast with respect to the group size. HRPM consists of two key design ideas: 1) hierarchical decomposition of a large group into a hierarchy of recursively organized manageable-sized subgroups and 2) the use of distributed geographic hashing to construct and maintain such a hierarchy at virtually no cost. Our detailed simulations demonstrates that HRPM achieves significantly enhanced scalability and performance due to hierarchical organization and distributed hashing.     

SAAMAN: Scalable Address Autoconfiguration in Mobile Ad Hoc Networks

Address autoconfiguration is one of the fundamental issues in mobile ad hoc networks (MANET). A node must need some form of identity before participating in any sort of communication. So each host in a MANET needs to be uniquely addressed so that the packets can be relayed hop-by-hop and delivered ultimately to the desired destination. Moreover, nodes in the MANET are free to move and organize themselves in an arbitrary fashion. Therefore any fixed infrastructure based solution for assigning identity (i.e. IP address) is not directly applicable to MANET. Under this infrastructureless and sporadic nature of the mobile nodes, several protocols of address autoconfiguration in the mobile ad hoc networks (MANET) have been proposed. Although some of these protocols perform decently in sparse and small networks, but exhibit poor performance (e.g., single point of failure, storage limitation, large protocol overhead and so on) when the network is either dense or very large. In this paper, we propose an efficient and scalable address autoconfiguration protocol that automatically configures a network by assigning unique IP addresses to all nodes with a very low overhead and minimal cost. Evenly distributed Duplicate-IP address Detection Servers are used to ensure the uniqueness of an IP address during IP address assignment session. In contrast to some other solutions, the proposed protocol does not exhibit any problems pertaining to leader election or centralized server-based solutions. Furthermore, grid based hierarchy is used for efficient geographic forwarding as well as for selecting Duplicate-IP address Detection Servers. Through simulation results we demonstrate scalability, robustness, low latency, fault tolerance and some other important aspects of our protocol.     

多跳移动Ad Hoc无线网络中UPMA协议的仿真

基于有效竞争预约接人、无冲突轮询传输的思想,该文改进了支持节点移动性和多跳网络结构的依据用户妥善安排的多址接人（UPMA）协议,然后利用网络仿真工具OPNET构建了UPMA协议的仿真框架,并仿真了由自组织分群算法所获得群的群内无线传输情况。该仿真框架为UPMA协议详细配置了物理层和数据链路层模型,可以设置不同的信道特性以及应用场景。在此基础上,该文分析了UPMA协议的信道吞吐量、平均消息时延和平均消息丢弃率,并将其与带冲突避免的载波侦听多址接人协议（CSMA／CA）、轮询协议进行了性能比较。仿真结果表明,UPMA协议可以提供较高的吞吐量、较低的平均消息时延和较小的平均消息丢弃率。     

一个基于分层结构的Ad Hoc网络路由协议

分层结构已经被引入到有线网络。然而,由于在AdHoc网络中所有的终端都是移动的,所以引入分层结构很困难。解决此问题,本文提出了一个基于自治分簇策略的新型分层路由协议:Hi-TORA。Hi-TORA包含分簇策略和节点间的路由协议,它应用了TORA的思想,但也有所不同。在文章最后,对Hi-TORA和DSDV、DSR、ZRP、TORA等协议做了比较。     

Ad Hoc无线网络及其路由选择协议

AdHoc无线网络是一组无线移动主机组成的一个没有任务建立好的基础调和或集中管理设备的临时网络。文中介绍了adhoc无线网络的特点和设计，并根据表驱动和按需路由两大类重点介绍了adhoc无线网络的路由选择协议。     

Quorum-based power-saving multicast protocols in the asynchronous ad hoc network

The asynchronous PS (Power-Saving) unicast protocol was designed for two PS wireless hosts to transmit the unicast message in the ad hoc network even their clocks are asynchronous. However, as regard to transmit a multicast message among more than two PS hosts, the protocol could not guarantee that all PS hosts can wake up at the same time. Some PS hosts may be in the PS mode when the multicast message is transmitted. Thus, the multicast message should be retransmitted again and again until all PS hosts receive the message. It will increase the energy consumption and the usage of the bandwidth. In this paper, we propose quorum-based PS multicast protocols for PS hosts to transmit multicast messages in the asynchronous ad hoc network. In those protocols, PS hosts use quorums to indicate their wakeup patterns. We introduce the rotation m-closure property to guarantee that m different quorums have the intersection even quorums are rotated due to asynchronous clocks. Thus, m PS hosts adopting m quorums satisfying the rotation m-closure property could wake up simultaneously and receive the multicast message even their clocks are asynchronous. We propose two quorum systems named the uniform k-arbiter and the CRT (Chinese Remainder Theorem) quorum system, which satisfy the rotation m-closure property. As shown in our analysis results, our quorum-based PS multicast protocols adopting those quorum systems can save more energy to transmit multicast messages.     

基于分簇结构的无线移动网络多播路由协议

移动自组网（MANET,Mobile Ad hoc Networks）是一种特殊的、应用前景广阔的新型移动无线网络。特有的网络特性使它在诸如灾难救助、战场、传感器网络、分布式计算等领域有着广泛的应用前景。结合在移动自组网络中应用最为广泛的分层结构——簇结构的特点,提出了一种基于簇结构的移动自组网多播波路由协议。协议通过对移动自组网进行簇划分,形成由簇头、簇间节点和簇内节点构成的分簇网络结构,并且在由簇头和簇间节点形成的虚拟骨干网基础上,对其进行回路检测和冗余剪枝算法处理,最终得到一个能满足多播要求的多播树,从而实现在移动自组网中的多播路由。通过对仿真实验结果的分析,该协议具有稳定的数据包发送率和较低的路由建立时间。     

一种间歇性连接移动网络自适应路由协议

为提高间歇性连接移动网络的消息发送效率,提出一种基于移动自组网OLSR协议的自适应路由协议ARPBO。ARPBO在网络连通时通过OLSR协议快速转发消息;在网络中断时对OLSR协议进行扩展,从消息发送节点的局部连通网络中有效选择下一跳节点,然后通过延迟容忍网络的"存储-携带-转发"机制转发消息。实验结果表明,该路由协议能够在网络存在间歇性连接时获得较高的传递成功率和较低的传递时延。     

An efficient hop count routing protocol for wireless ad hoc networks

An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.     

移动Ad Hoc网络中一种多播路由协议算法实现

MANET是一个多跳,节点无中心、自组织、互相通信而不依赖于预先架设的固定基础设施无线移动网络。本文提出了采用按需路由发现策略的移动Ad Hoc多播路由算法。此算法不需要维护全局的路由信息,通过按需路由发现过程,动态更新路由信息和建立多播转发组。多播数据包在转发组成员间进行有限泛洪,能够降低带宽的占用及减少路由更新信息的传播。仿真实验显示多播算法在带宽较低、多播组成员数量变化较大的移动分组无线网环境中,具有较好的可靠性和工作效率。     

Mosaic-Net: a game theoretical method for selection and allocation of replicas in ad hoc networks

Due to the continuous mobility of hosts, an ad hoc network suffers from frequent disconnections. This phenomenon is undesirable when mobile hosts are accessing data from each other, and thus, data accessibility is lower than that in conventional fixed networks. Because one cannot control network disconnections, an alternative solution to this problem is to replicate data objects onto mobile hosts so that when disconnections occur, mobile hosts can still access data. In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. We prove that this problem in general is NP-complete and propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative environment to improve data accessibility by replicating data objects. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity, and communication costs. In the proposed scheme, players (mobile hosts) compete through bids in a non-cooperative environment to replicate data objects that are beneficial to themselves and the system as a whole. To cater for the possibility of cartel type behavior of the players, the scheme uses the Vickrey payment protocol that leaves the players with no option than to bid in such a fashion that is beneficial to the system as a whole. The paper also identifies some useful properties of the proposed scheme and the necessary conditions of optimality. The proposed technique is extensively evaluated against some well-known ad hoc network replica allocation methods, such as: (a) randomized, (b) extended static access frequency, (c) extended dynamic access frequency and neighborhood, and (d) extended dynamic connectivity grouping. The experimental results reveal that the proposed approach outperforms the four techniques in solution quality and projects a competitive execution time.     

按需式ad hoc移动网络路由协议的研究进展

Ad hoc移动网络是一种完全由移动主机构成的网络，网络拓扑易变，带宽，能源有限是ad hoc移动网络的主要特点，针对这些特点，目前设计的ad hoc路由协议大多采用按需查找方式，该文介绍了这方面研究的最新进展，对几种典型的按需路由协议进行了说明，分析和综合比较，文中分析了目前协议存在的一些问题并提出了相应的改进方法，最后指出了下一步研究方向。     

A distributed group mobility adaptive clustering algorithm for mobile ad hoc networks

This paper proposes a distributed group mobility adaptive (DGMA) clustering algorithm for mobile ad hoc networks (MANETs) on the basis of a revised group mobility metric, linear distance based spatial dependency (LDSD), which is derived from the linear distance of a node’s movement instead of its instantaneous speed and direction. In particular, it is suitable for group mobility pattern where group partitions and mergence are prevalent behaviors of mobile groups. The proposed clustering scheme aims to form more stable clusters by prolonging cluster lifetime and reducing the clustering iterations even in highly dynamic environment. Simulation results show that the performance of the proposed framework is superior to two widely referenced clustering approaches, the Lowest-ID clustering scheme and the mobility based clustering algorithm MOBIC, in terms of average clusterhead lifetime, average resident time, average number of clusterhead changes, and average number of cluster reaffiliations.