机动突击中的自组网多路径路由技术

随着作战样式的变化和武器装备的变革,装甲车辆机动突击作战中协同控制的重要性不断增强,对网络通信的各项性能指标提出了更高要求,而自组织网络所具备的一些优良特性能够较好地适应这一需求。在网络通信中,稳定性是衡量网络路由性能的重要因素。机动突击作战中,车辆移动、障碍物阻挡等因素将导致网络拓扑变化迅速,给路由稳定性带来严重影响,极大地降低了网络通信质量。基于AODV协议,设计并仿真了一种链路不相交的多路径被动式路由协议,以路由回复消息中携带的路由信息为基础,实现两条不相交链路作为通信路由并互为备份。仿真结果表明,该协议在数据包到达率及平均时延方面较AODV协议均有一定提高。     

移动通信中的组播路由策略

终端移动或加入、退出组播组时，路由生成树应随之动态变化。对比多种组播路由策略后，在IntServ模型中融入CSM协议，希望在不增加网络负荷的前提下降低终端越区切换带来数据报的收发中断时间。     

Geometric spanners for routing in mobile networks

We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible; and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR.     

Secure routing in mobile wireless ad hoc networks

We discuss several well known contemporary protocols aimed at securing routing in mobile wireless ad hoc networks. We analyze each of these protocols against requirements of ad hoc routing and in some cases identify fallibilities and make recommendations to overcome these problems so as to improve the overall efficacy of these protocols in securing ad hoc routing, without adding any significant computational or communication overhead.     

Hierarchical routing overhead in mobile ad hoc networks

Hierarchical techniques have long been known to afford scalability in networks. By summarizing topology detail via a hierarchical map of the network topology, network nodes are able to conserve memory and link resources. Extensive analysis of the memory requirements of hierarchical routing was undertaken in the 1970s. However, there has been little published work that assesses analytically the communication overhead incurred in hierarchical routing. This paper assesses the scalability, with respect to increasing node count, of hierarchical routing in mobile ad hoc networks (MANETs). The performance metric of interest is the number of control packet transmissions per second per node (/spl Phi/). To derive an expression for /spl Phi/, the components of hierarchical routing that incur overhead as a result of hierarchical cluster formation and location management are identified. It is shown here that /spl Phi/ is only polylogarithmic in the node count.     

Stable routing algorithm for mobile ad hoc networks using mobile agent

Wireless ad hoc networks are growing important because of their mobility, versatility, and ability to work with fewer infrastructures. The mobile ad hoc network is an autonomous system consisting of mobile nodes connected with wireless links. Establishing a path between two nodes is a complex task in wireless networks. It is still more complex in the wireless mobile ad hoc network because every node is no longer as an end node and an intermediate node. In this paper, it focuses on design of connectionless routing protocol for the wireless ad hoc networks based on the mobile agent concept. The proposed model tries to discover the best path taking into consideration some concerns like bandwidth, reliability, and congestion of the link. The proposed model has been simulated and tested under various wireless ad hoc network environments with the help of a different number of nodes. The results demonstrate that the proposed model is more feasible for providing reliable paths between the source and destination with the minimum control message packets over the network. It has delivered more number of packets to the destination over the network. Copyright © 2012 John Wiley & Sons, Ltd.     

一个移动Ad Hoc网络中AODV-HC路由协议

提出了移动Ad Hoc网络中路由协议AODV-HC,该协议通过到目的节点的跳数,在链路中断时,能快速有效地修复路由路径,并通过到基础路径的跳数有效地减少广播风暴.实验结果表明AODV-HC比AODV有较少的平均延时和较少的路径节点跳数.     

Primate-inspired adaptive routing in intermittently connected mobile communication systems

An intermittently connected mobile ad hoc network is a special type of wireless mobile network without fully connected path between the source and destination most of the time. In some related works on mobility models, the missing realism of mobility model has been discussed. However, very few routing protocols based on realistic mobility models have been proposed so far. In this paper, we present a primate-inspired mobility model for intermittently connected mobile networks. Such a mobility model can represent and reflect the mobile features of humans. Traditional routing schemes in intermittently connected mobile networks fail to integrate the mobility model with routing strategy to fully utilize the mobility features. To overcome such a drawback, we propose a new routing scheme called primate-inspired adaptive routing protocol (PARP), which can utilize the features of the primate mobility to assist routing. Furthermore, our proposed protocol can determine the number of message copies and the routing strategy based on the walking length of the mobility model. The predictions of the walking lengths are implemented by a particle filter based algorithm. Our results demonstrate that PARP can achieve a better performance than a few typical routing protocols for intermittently connected mobile ad hoc networks.     

Relocation routing for energy balancing in mobile sensor networks

Wireless sensor networks (WSNs) have been widely investigated in the past decades because of its applicability in various extreme environments. As sensors use battery, most works on WSNs focus on energy efficiency issues (e.g., local energy balancing problems) in statically deployed WSNs. Few works have paid attention to the global energy balancing problem for the scenario that mobile sensor nodes can move freely. In this paper, we propose a new routing protocol called global energy balancing routing protocol (GEBRP) based on an active network framework and node relocation in mobile sensor networks. This protocol achieves global energy efficiency by repairing coverage holes and replacing invalid nodes dynamically. Simulation and experiment results demonstrate that the proposed GEBRP achieves superior performance over the existing scheme. In addition, we analyze the delay performance of GEBRP and study how the delay performance is affected by various system parameters.Copyright © 2013 John Wiley & Sons, Ltd.     

Energy efficient broadcast routing in mobile ad hoc networks

In this paper, we address the problem of broadcast routing in mobile ad hoc networks from the viewpoint of energy efficiency. In an ad hoc wireless network, each node runs on a local energy source which has a limited energy lifespan. Thus, energy conservation is a critical issue in ad hoc networks. One approach for energy conservation is to establish routes which require lowest total energy consumption. This optimization problem is referred as the minimum‐energy broadcast routing problem (MEBRP). In this paper, we propose new efficient algorithms for the construction of energy‐efficient trees for broadcast in mobile ad hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy‐efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEBRP. Copyright © 2004 John Wiley & Sons, Ltd.     

Localized energy efficient routing in mobile ad hoc networks

We consider the problem of localized energy aware routing in mobile ad hoc networks. In localized routing algorithms, each node forwards a message based on the position of itself, its neighbors and the destination. The objective of energy aware routing algorithms is to minimize the total power for routing a message from source to destination or to maximize the total number of routing tasks that a node can perform before its battery power depletes. In this paper we propose new localized energy aware routing algorithms called OLEAR. The algorithms have very high packet delivery rate with low packet forwarding and battery power consumption. In addition, they ensure good energy distribution among the nodes. Finally, packets reach the destination using smaller number of hops. All these properties make our algorithm suitable for routing in any energy constrained environment. We compare the performance of our algorithms with other existing energy and non‐energy aware localized algorithms. Simulation experiments show that our algorithms present comparable energy consumption and distribution to other energy aware algorithms and better packet delivery rate. Copyright © 2006 John Wiley & Sons, Ltd.     

Multipath multihop routing analysis in mobile ad hoc networks

This paper proposes an analytical modeling framework to investigate multipath routing in multihop mobile ad hoc networks. In this paper, a more generalized system has been considered and mathematically analyzed to observe some of the related performance measures of the ad hoc network. Each node in the network is assumed to have finite buffer. The single-path model is approximated to be a multi-node M/M/1/B tandem network, and the multi-path model as a set of multiple parallel paths. This proposed model allows us to investigate issues such as end-to-end delivery delay, throughput and routing reliability in mobile ad hoc networks. Theoretical results have been verified by numerical results. An optimal path selection strategy has been proposed to select a minimized delay path among the available multiple paths between source-destination pair.     

Scalable routing protocols for mobile ad hoc networks

The growing interest in mobile ad hoc network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. We survey the routing protocols that address scalability. The routing protocols included in the survey fall into three categories: flat routing protocols; hierarchical routing approaches; GPS augmented geographical routing schemes. The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs     

Weighted cooperative routing for wireless mobile Ad-hoc network

A novel weighted cooperative routing algorithm (WCRA) is proposed in this article, which was on the basis of a weighted metric with maximal remaining energy (MRE) of the relays and the maximal received SNR (MRS) of the nodes. Moreover, a cooperative routing protocol was implemented on the basis of WCRA. Then simulation is done on network simulation (NS-2) platform to compare the performances of MRS, MRE and WCRA with that of noncooperative destination-sequenced destination-sequenced distance-vector (DSDV) protocol. The simulative results show that WCRA obtains a performance tradeoff between MRE and MRS in terms of delivery ratio and network lifetime, which can effectively improve the network lifetime at an acceptable loss of delivery ratio.     

移动Ad Hoc网络路由协议分析

文章首先简单介绍了无线自组网(Ad Hoc网络),然后分析了Ad Hoc网络与现存的一些通信系统在路由选择上的主要区别,介绍了Ad Hoc网络路由协议的分类以及几类典型的Ad Hoc网络路由协议,最后提出了Ad Hoc网络路由协议今后的主要研究方向.     

A distributed routing algorithm for mobile wireless networks

We present a loop-free, distributed routing protocol for mobile packet radio networks. The protocol is intended for use in networks where the rate of topological change is not so fast as to make flooding the only possible routing method, but not so slow as to make one of the existing protocols for a nearly-static topology applicable. The routing algorithm adapts asynchronously in a distributed fashion to arbitrary changes in topology in the absence of global topological knowledge. The protocol's uniqueness stems from its ability to maintain source-initiated, loop-free multipath routing only to desired destinations with minimal overhead in a randomly varying topology. The protocol's performance, measured in terms of end-to-end packet delay and throughput, is compared with that of pure flooding and an alternative algorithm which is well-suited to the high-rate topological change environment envisioned here. For each protocol, emphasis is placed on examining how these performance measures vary as a function of the rate of topological changes, network topology, and message traffic level. The results indicate the new protocol generally outperforms the alternative protocol at all rates of change for heavy traffic conditions, whereas the opposite is true for light traffic. Both protocols significantly outperform flooding for all rates of change except at ultra-high rates where all algorithms collapse. The network topology, whether dense or sparsely connected, is not seen to be a major factor in the relative performance of the algorithms.The work of A. Ephremides was supported in part by the National Science Foundation under grants D-CDR-8803012 and EEC94-02384.     

基于移动自组织网络的路由技术研究

分析移动自组网路由协议特点,提出路由协议设计时所需具备的相关要求。根据当前路由协议发展及研究现状,从路由策略角度分四大类对移动自组网路由协议进行详细阐述。结合传统单路径路由协议在工作过程中表现出的诸多不足,阐述多路径路由协议工作原理、分类及优势,提出未来移动自组网路由协议将向多路径路由协议发展。详细分析并对比当前常见几个多路径路由协议,指出还需对多路径路由协议进行有效研究并与实际应用相结合,进而拓展并提升移动自组网在社会工作生活中的实际应用。     

A routing architecture for mobile integrated services networks

A drawback of the conventional Internet routing architecture is that its route computation and packet forwarding mechanisms are poorly integrated with congestion control mechanisms. Any datagram offered to the network is accepted; routers forward packets on a best-effort basis and react to congestion only after the network resources have already been wasted. A number of proposals improve on this to support multimedia applications; a promising example is the Integrated Services Packet Network (ISPN) architecture. However, these proposals are oriented to networks with fairly static topologies and rely on the same conventional Internet routing protocols to operate. This paper presents a routing architecture for mobile integrated services networks in which network nodes (routers) can move constantly while providing end-to-end performance guarantees. In the proposed connectionless routing architecture, packets are individually routed towards their destinations on a hop by hop basis. A packet intended for a given destination is allowed to enter the network if and only if there is at least one path of routers with enough resources to ensure its delivery within a finite time. Once a packet is accepted into the network, it is delivered to its destination, unless resource failures prevent it. Each router reserves resources for each active destination, rather than for each source–destination session, and forwards a received packet along one of multiple loop-free paths towards the destination. The resources and available paths for each destination are updated to adapt to congestion and topology changes. This mechanism could be extended to aggregate dissimilar flows as well. This revised version was published online in June 2006 with corrections to the Cover Date.