无线自组网中一种高效的路由协议

无线自组网与传统的有线网不同,它由一些可移动的结点组成,这些结点的带宽、计算能力和能量都受到一定限制。针对这种网络,研究者们提出了按需路由协议,这些协议非常适合无线自组网这种拓扑结构,但是由于缺乏对全局拓扑和结点移动性的了解,可能达不到最优。因此提出了一种高效的路由协议ERNC,该协议基于已提出的SHORT路由协议[13],并对以前所提出的NAOR协议[14]进行了扩展,即利用网络编码技术来进一步提高路由协议的性能。最后,使用NS-2模拟器来评估ERNC的性能,结果显示ERNC在分组投递率和平均端到端时延等方面获得了比已有协议更好的性能。     

Dynamic backup routes routing protocol for mobile ad hoc networks

Mobile Ad Hoc Networks (MANETs), which provide data networking without infrastructure, represent one kind of wireless networks. A MANET is a self-organizating and adaptive wireless network formed by the dynamic gathering of mobile nodes. Due to the mobility of mobile nodes, the topology of a MANET frequently changes and thus results in the disability of originally on-the-fly data transmission routes. The dynamic properties of MANETs are therefore challenging to protocol design. To cope with the intrinsic properties of MANETs, Dynamic Backup Routes Routing Protocol (DBR²P), a backup node mechanism for quick reconnection during link failures, is proposed in this paper. DBR²P is an on-demand routing protocol and it can set up many routes to reach a destination node in a given period. Even when a link fails, those routes from the source node to the destination node can be analyzed to obtain backup routes to sustain quick reconnection. The information of backup routes can be saved in a specific on-the-route node and enables backup routes to be found immediately in situation regarding disconnection. As a result, DBR²P could more thoroughly improve the quality of routing protocol than those proposed in the past.     

An Efcient 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.     

A lightweight anonymous routing protocol without public key en/decryptions for wireless ad hoc networks

More attention should be paid to anonymous routing protocols in secure wireless ad hoc networks. However, as far as we know, only a few papers on secure routing protocols have addressed both issues of anonymity and efficiency. Most recent protocols adopted public key Infrastructure (PKI) solutions to ensure the anonymity and security of route constructing mechanisms. Since PKI solution requires huge and expensive infrastructure with complex computations and the resource constraints of small ad hoc devices; a two-layer authentication protocol with anonymous routing (TAPAR) is proposed in this paper. TAPAR does not adopt public key computations to provide secure and anonymous communications between source and destination nodes over wireless ad hoc networks. Moreover, TAPAR accomplishes mutual authentication, session key agreement, and forward secrecy among communicating nodes; along with integration of non-PKI techniques into the routing protocol allowing the source node to anonymously interact with the destination node through a number of intermediate nodes. Without adopting PKI en/decryptions, our proposed TAPAR can be efficiently implemented on small ad hoc devices while at least reducing the computational overhead of participating nodes in TAPAR by 21.75%. Our protocol is certainly favorable when compared with other related protocols.     

一种改进的无线传感器网络最小跳数路由协议

针对无线传感器网络最小跳数路由协议数据包多路径冗余传输,能量消耗不均衡等问题,提出了一种改进的无线传感器网络最小跳数路由协议。该协议通过引入侦听机制在网络中建立传输路径,同时采用一种新的能量均衡策略解决关键节点能耗过快的问题,以有效延长网络寿命。通过自主研发的无线传感器网络仿真平台进行仿真,比较最小跳数路由协议和改进协议的性能。实验结果表明:改进协议能够很好的均衡网络能量消耗,提高网络能量有效性,延长了网络寿命。     

A cross-layer multi-hop cooperative network architecture for wireless ad hoc networks

In this paper, a novel decentralized cross-layer multi-hop cooperative network architecture is proposed and presented. This cross-layer architecture introduces a new cooperative flooding scheme and two decentralized opportunistic cooperative forwarding mechanisms based on randomized coding, and a Routing Enabled Cooperative Medium Access Control (RECOMAC) protocol that enables cooperative forwarding, while incorporating physical, medium access control (MAC) and routing layers. RECOMAC employs randomized coding to realize cooperative diversity, so that relay selection and actuation mechanisms are alleviated and the MAC costs are reduced. The coded packets are routed in the network via the proposed cooperative forwarding schemes, which opportunistically form cooperative sets within a region, not needing a prior route to be established. Essentially, in the RECOMAC architecture, the routing layer functionality is submerged into the MAC layer to provide seamless cooperative communication, while the messaging overhead to set up routes, select and actuate relays is reduced. We evaluate the performance of RECOMAC in terms of network throughput, delay and MAC and routing overhead, in comparison to the conventional architecture based on the well-known IEEE 802.11 MAC and Ad hoc On Demand Distance Vector (AODV) routing protocols. RECOMAC is shown to provide quite significant improvement by an order of magnitude difference in all investigated performance metrics, under a variety of scenarios, considering different network sizes, static and mobile scenarios and networks with multiple flows.     

无线传感器网络最小跳数路由算法的研究

最小跳数路由协议根据普通节点到Sink的距离和节点的通讯半径,将网络划分为一簇同心圆环。在数据采集和传输阶段,传播的方向是向着Sink收敛的,而在Sink节点命令发送阶段,则可逐层对外扩散。以此为基础,对最小跳数路由算法组网和数据传播阶段加以改进,并在OMNET++环境下进行网络仿真,比较洪泛算法和改进前后的两种算法在数据传输上的性能差异,仿真结果验证了改进方案的可行性。     

一种新的多路径自组网路由算法

传统的单路径路由使自组网路由性能一直不能获得太大的突破。因此,设计有效的和稳定的多路径路由成为最受关注的问题。为此提出了一种新的多路径路由算法,其在路由发现阶段使用了一种新的多路径转发策略。在基于稳定性因子的基础上,该算法计算路径间海明距离并据此选择多条相似的稳定不相交多路由,从而进一步提高该路由算法的性能。模拟结果显示,与经典的多路径路由相比较,该算法是一个有效的多路径自组网路由算法。     

Triangle-based routing for mobile ad hoc networks

Routing protocols for Mobile ad hoc networks (MANETs) have been studied extensively in the past decade. Routing protocols for MANETs can be broadly classified as reactive (on-demand), proactive, hybrid and position-based. Reactive routing protocols are attractive because a route between a source and a destination is established only when it is needed. Such protocols, unlike proactive protocols, do not have high overhead for route maintenance and are especially suitable for networks in which not all nodes communicate frequently. One problem with existing reactive routing protocols is the propagation of redundant route request messages during route discovery. In this paper, we present a low-overhead reactive routing protocol which reduces propagation of redundant route request messages. We also compare its performance with the well-known reactive routing protocol AODV.     

A stable weight-based on-demand routing protocol for mobile ad hoc networks

A mobile ad hoc network (MANET) consists of a set of mobile hosts that can communicate with each other without the assistance of base stations. In MANETs, the high mobility of mobile nodes is a major reason for link failures. In this paper, we propose a stable weight-based on-demand routing protocol (SWORP) for MANETs. The proposed scheme uses the weight-based route strategy to select a stable route in order to enhance system performance. The weight of a route is decided by three factors: the route expiration time, the error count, and the hop count. Route discovery usually first finds multiple routes from the source node to the destination node. Then the path with the largest weight value for routing is selected. Simulation results show that the proposed SWORP outperforms DSR, AODV, and AODV-RFC, especially in a high mobility environment.     

自私无线Ad Hoc网络中一个低开销的诚实能效路由协议

一种激励自私无线Ad Hoc网络中节点合作的方法,向提供报文传输服务的节点提供不低于其传输成本的报酬。低开销诚实路由协议LOTER引入了VCG机制,节点在路由发现阶段收集邻居节点的信息,目标节点选择多条RREP路径,位于RREP路径上的节点将邻居节点信息沿RREP路径报告给源节点,源节点完成LCP路由选择和VCG报酬的计算。LOTER协议以低的报文开销收集网络拓扑信息,有效实现了自私无线Ad Hoc网络中的诚实能效路由。仿真结果表明,与现有协议比较,该协议具有更好的性能。     

Virtual node based adaptive routing in wireless ad hoc networks

It is a challenge to make the routes quickly adapt to the changed network topology when nodes fail in a wireless ad hoc network. In this paper, we propose an adaptive routing protocol, which groups the network nodes into virtual nodes according to their data transfer capabilities and creates virtual-node-based routes. The protocol can accommodate the routes to node failures by adaptively pdating the virtual nodes and just-in-time using available nodes during data transmission. The simulations indicate that the proposed protocol can keep the routes failed-node-freewhen the available virtual node members cover the failed nodes scattering area.     

自组网路由协议综述

在分析影响自组网路由协议设计的因素的基础上,对路由协议中的关键技术问题进行了研究和总结,包括路由环路避免、对网络动态性的适应、控制开销、节能问题以及路由协议与定位技术的结合问题。最后指出了目前路由协议研究中存在的问题,如协议需求、协议的评估方法等。     

Ad hoc网络稳定路由协议

Ad hoc网络有着广泛的应用前景。选择高速稳定的路径进行通信十分重要。在常用位置辅助（LAR）路由算法的基础上,提出了一种新的路由算法（NSLAR）。该算法引入节点稳定度这一参数,并以此作为路径选择的依据,从而增强了所选择路径的稳定性,减少了因为路径失效带来的重新路由次数。仿真结果表明,与LAR和QR算法相比,NSLAR算法具有更好的性能。     

Performance evaluation of a mesh-evolving quality-of-service-aware multicast routing protocol for mobile ad hoc networks

The tremendous amount of multimedia applications running across the wireless communication medium makes quality of service (QoS) a fundamental requirement for mobile ad hoc networks. However, it is not easy to incorporate QoS into these networks. Moreover, the growing number of group-oriented applications also necessitates the efficient utilisation of network resources. The multicast model is a promising technique which can achieve this efficiency by facilitating the inherent broadcast capability of the wireless medium. The mesh-evolving ad hoc QoS multicast (MAQM) routing protocol is developed to address the resource efficiency and QoS problems with one, integrated solution. MAQM achieves multicast efficiency by tracking the availability of resources for each node within its neighbourhood. The QoS status is monitored continuously and announced periodically to the extent of QoS provision. Using these features, MAQM nodes can make their decisions on joining a new multicast session based on the sustainability of their perceived QoS. MAQM also evolves the initial multicast tree into a mesh during the course of an ongoing session to achieve a more robust network topology. Thus, MAQM integrates the concept of QoS-awareness into multicast routing in mobile ad hoc networks. Since ad hoc networks require the protocol control overhead to be as small as possible, we analyse the multicast session establishment process of MAQM to see its impact on the protocol performance in terms of system control overhead. We also evaluate the performance of MAQM through computer simulations using various qualitative and quantitative criteria. The simulation results validate our mathematical analysis of the control overhead and show that MAQM significantly improves multicast efficiency through its QoS-aware admission and routing decisions with an acceptably small overhead. Thus, MAQM shows that QoS is not only essential for, but also applicable to mobile ad hoc networks.     

Energy efficient multicast routing in ad hoc wireless networks

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. Each node in the network is assumed to have a fixed level of transmission power. The problem of our concern is: given an ad hoc wireless network and a multicast request, how to find a multicast tree such that the total energy cost of the multicast tree is minimized. We first prove this problem is NP-hard and it is unlikely to have an approximation algorithm with a constant performance ratio of the number of nodes in the network. We then propose an algorithm based on the directed Steiner tree method that has a theoretically guaranteed approximation performance ratio. We also propose two efficient heuristics, node-join-tree (NJT) and tree-join-tree (TJT) algorithms. The NJT algorithm can be easily implemented in a distributed fashion. Extensive simulations have been conducted to compare with other methods and the results have shown significant improvement on energy efficiency of the proposed algorithms.     

负载均衡的多组跳数场路由决策机制

因为节点的随机撒布及无线传感器网络的流量不均匀特性,使得跳数场路由中的节点负载极不均衡。在充分论证跳数场路由性质基础上,针对此问题提出负载均衡的多组跳数场路由协议。该协议通过引入组内及组间均衡机制,较为有效地均衡了节点间的负载,从而较大程度地延长了网络生存期。模拟实验显示,改进后网络寿命较之前平均延长80%。     

基于收方参与的移动自组网TCP增强的路由协议

移动自组网多跳、动态拓扑的特性,使得路由信息易老化,源节点在路由失败后不能及时启动路由发现,造成TCP有效吞吐率随移动速度增加而下降。在DSR路由协议的基础上,提出一种新的基于接收方参与启动路由发现的新路由协议RP DSR,它通过接收方的ACK确认包启动路由发现,主动为发送方提供最新的路由信息,从而提高了自组网的TCP的性能。仿真结果表明,在节点快速移动环境中,RP DSR协议的TCP性能明显优于DSR协议。     

A distributed fault identification protocol for wireless and mobile ad hoc networks

This paper considers the problem of self-diagnosis of wireless and mobile ad hoc networks (MANETs) using the comparison approach. In this approach, a network (MANET) consists of a collection of n   independent heterogeneous mobile or stationary hosts interconnected via wireless links, and it is assumed that at most σ$\sigma$ of these hosts are faulty. In order to diagnose the state of the MANET, tasks are assigned to pairs of hosts and the outcomes of these tasks are compared. The agreements and disagreements between the hosts are the basis for identifying the faulty ones. The comparison approach is believed to be one of the most practical fault identification approaches for diagnosing hard and soft faults. We develop a new distributed self-diagnosis protocol, called Dynamic-DSDP, for MANETs that identifies both hard and soft faults in a finite amount of time. The protocol is constructed on top of a reliable multi-hop architecture. Correctness and complexity proofs are provided and they show that our Dynamic-DSDP performs better, from a communication complexity viewpoint, than the existing protocols. We have also developed a simulator, that is scalable to a large number of nodes. Using the simulator, we carried out a simulation study to analyze the effectiveness of the self-diagnosis protocol and its performance with regards to the number of faulty hosts. The simulation results show that the proposed approach is an attractive and viable alternative or addition to present fault diagnosis techniques in MANET environments.     

Time-parallel simulation of wireless ad hoc networks with compressed history

Time-parallel simulation (TPS) is a technique which partitions the timespan of the simulation into independently executed simulation segments. Unless the simulated process is regenerative, the output of TPS is only an approximation of the corresponding serial simulation. Previously we have adapted TPS to the simulation of wireless ad hoc networks. By prefixing the measured simulation segment with a warmup interval which can be dynamically extended, we were able to achieve arbitrary accuracy. In general, higher accuracy requires a longer warmup interval, which decreases the speedup.