An efficient routing protocol for wireless networks

We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and secondto-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.This work was supported in part by the Advanced Research Projects Agency (ARPA) under contract F19628-93-C-0175 and by the Office of Naval Research under Contract No. N-00014-92-J-1807.     

一种基于分时的LEO卫星网络无环路由算法

在分析传统卫星网络路由算法的基础上，提出一种基于分时的LEO卫星网络无环路由算法(DTRA)。针对卫星在各时间片之间进行路由表切换时可能出现的路由环问题，算法采用平滑路由表切换策略消除由于切换前后网络状态信息不一致而产生环路的可能性，保证分组在任何时刻都能够沿无环最短时延路径被转发。同时，DTRA也能够通过使用无环备份路径处理可能出现的链路拥塞、节点失败等突发情况。通过复杂性分析可知，算法只需较小的星上存储开销和星上处理开销，而无需星问通信开销。仿真实验结果也表明算法能够提供数据最优传送，具有较好的端到端时延性能。     

一种非精确状态下满足多QoS约束的 动态组播路由算法

提出了一种非精确状态下满足多QoS约束的动态组播路由算法——DMIQ,该算法采用改进的BF算法作为路径搜索算法,WFQ作为分组调度机制,链路延迟不确定且服从均匀分布,能在非精确状态且满足带宽、延迟抖动和丢包率约束的前提下确定具有最小跳数和开销的动态组播路由.仿真实验表明,DMIQ能在非精确状态且满足多QoS约束的前提下建立动态组播路由,在路由请求平均成功率、平均延迟和平均跳数等衡量指标下表现出良好的性能.     

A protocol for scalable loop-free multicast routing

In network multimedia applications such as multiparty teleconferencing, users often need to send the same information to several (but not necessarily all) other users. To manage such one-to-many or many-to-many communication efficiently in wide-area internetworks, it is imperative to support and perform multicast routing. Multicast routing sends a single copy of a message from a source to multiple receivers over a communication link that is shared by the paths to the receivers. Loop-freedom is an especially important consideration in multicasting because applications using multicasting tend to be multimedia and bandwidth intensive, and loops in multicast routing duplicate looping packets. We present and verify a new multicast routing protocol, called multicast Internet protocol (MIP), which offers a simple and flexible approach to constructing both group-shared and shortest-paths multicast trees. MIP can be sender-initiated or receiver-initiated or both; therefore, it can be tailored to the particular nature of an application's group dynamics and size. MIP is independent of the underlying unicast routing algorithms used. MIP is robust and adapts under dynamic network conditions (topology or link cost changes) to maintain loop-free multicast routing. Under stable network conditions, MIP has no maintenance or control message overhead. We prove that MIP is loop-free at every instant, and that it is deadlock-free and obtains multicast routing trees within a finite time after the occurrence of an arbitrary sequence of topology or unicast changes     

Multi-hop routing with cooperative transmission: a cross-layer approach

Cooperative diversity techniques have received a lot of attention recently due to their ability to provide spatial diversity in fading wireless environment without the requirement of implementing multiple antenna on the same device. It increases link reliability, provides higher capacity, reduces transmit power, and extends transmission range for the same level of performance and modulation rate. In this paper, we study the achievable gain of cooperative communications from a wireless cross-layer point of view in multi hop networks. We propose two routing algorithms applicable for wireless ad hoc networks. First, we propose an edge node based on a greedy cooperative routing (ENBGCR) algorithm, where we modify the geographic routing algorithm to incorporate the cooperative transmission and extend the coverage range of the nodes. The main objective of ENBGCR algorithm is to minimize the number of hops that messages transverse to reach their destination. Then the energy-efficient cooperative routing algorithm is proposed to minimize the end-to-end total transmission power subject to end-to-end target data rate. Simulation results for both algorithms show that the proposed strategies have great improvement in terms of delay and power saving respectively for the same quality of service requirement as compared to traditional algorithms.     

Issues on loop prevention in MPLS networks

In multiprotocol label switching (MPLS) networks, data packets are forwarded through label-switched paths (LSPs) which are set up using a label distribution protocol. Since any label distribution protocol makes use of information obtained from the layer 3 routing protocol, and the routing protocol may not be loop-free, there is a possibility of an LSP forming a loop. This article focuses on MPLS loop prevention by which LSPs are prevented from forming loops. Especially, two loop prevention algorithms that have been proposed to the IETF are simulated to investigate the number of control messages required for setting up or reconfiguring LSPs over an actual routing protocol     

一种无线自组织网络动态路由协议

介绍了一种基于稀疏树的无线自组织网络动态路由协议,该协议采用了稀疏树路径生成算法来减少路由更新的数据量并减少网络链路的冗余,采用增量更新来降低路由协议开销并降低对传输带宽的占用,支持单向信道,采用快速路径查找算法消除网络拓扑动态变化过程中的环路与无穷计数问题。仿真结果显示它具有收敛快,开销小等特性,能够较好地适应窄带无线通信环境的需要。     

Protocol for Dynamic Ad-Hoc Networks Using Distributed Spanning Trees

A dynamic ad-hoc network consists of a collection of mobile hosts with frequently changing network topology. We propose a distributed algorithm that adapts to the topology by utilizing spanning trees in the regions where the topology is stable, and resorting to an intelligent flooding-like approach in highly dynamic regions of the network. Routing is performed using the spanning trees based a hold-and-forward or shuttling mechanisms. We introduce the notion of connectivity-through-time and the parameter holding-time as new fundamental concepts that can be used by ad-hoc routing algorithms. For various network connectivity scenarios we evaluate the impact of these concepts on the performance of ad-hoc routing algorithms. Using simulation, we study the throughput, reachability and message–reachability ratio of the proposed schemes under various connection/disconnection rates and holding times.     

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.     

A power quality online monitoring system oriented ZigBee routing optimization strategy

For ZigBee Cluster-Tree routing protocol in the power system applications existing not optimal routing and not real-time problems, the actual demand from on-line monitoring power quality of substation point of view, considering hops, link busy status and the residual energy, a ZigBee Cluster-Tree improved routing algorithm is proposed, calculating the hops of all neighbor nodes to the destination node and introducing an alternative node. Several NS2.34 simulation experiments show that the improved routing optimization algorithm reduces the number of hops and end to end delay, improves power quality monitoring in real time, saves overall network energy consumption, and prolongs the network life cycle.     

一种适合于移动Ad Hoc网络的路由协议WPRP

针对无线Ad Hoc网络特点,提出了一种无线路径发现路由协议(Wireless Path Finding Routing Protocol,WPRP)。对WPRP协议进行了简要概述,分别介绍了采用最短路径算法(Short Path Algorithm,SPA)查找最短路径;递归环路检测算法(Recursive Loop Check Algorithm,RLCA)消除路由环路;路由校验实现节点间路由同步;自适应时间调节机制进一步减少网络冲突、降低网络开销等方法以及实现过程。OPNET仿真结果表明,与OLSR协议相比,WPRP具有较小的路由开销和较快的收敛速度,是一种动态路由协议,适用于无线Ad Hoc网络。     

Energy‐efficient multihop routing in WSN using the hybrid optimization algorithm

The technical growth in the field of the wireless sensor networks (WSNs) has resulted in the process of collecting and forwarding the massive data between the nodes, which was a major challenge to the WSNs as it is associated with greater energy loss and delay. This resulted in the establishment of a routing protocol for the optimal selection of the multipath to progress the routing in WSNs. This paper proposes an energy‐efficient routing in WSNs using the hybrid optimization algorithm, cat–salp swarm algorithm (C‐SSA), which chooses the optimal hops in progressing the routing. Initially, the cluster heads (CHs) are selected using the low‐energy adaptive clustering hierarchy (LEACH) protocol that minimizes the traffic in the network. The CHs are engaged in the multihop routing, and the selection of the optimal paths is based on the proposed hybrid optimization, which chooses the optimal hops based on the energy constraints, such as energy, delay, intercluster distance, intracluster distance, link lifetime, delay, and distance. The simulation results prove that the proposed routing protocol acquired minimal delay of 0.3165 with 50 nodes and two hops, maximal energy of 0.1521 with 50 nodes and three hops, maximal number of the alive nodes as 39 with 100 nodes and two hops, and average throughput of 0.9379 with 100 nodes and three hops.     

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.     

调制跳跃系统同步性研究：一个同步方案

In order to achieve fast synchronization of the modulation hopping system, a synchronization scheme called short code to guide long code is adopted, and the initial synchronization hops and service hops are designed in detail. According to the system requirements for short code in the properties of time-varying, safety and balance, an algo- rithm to design wide-gap chaos short code based on TOD is proposed. Synchronization performance analysis shows that the algorithm has good performance, the initial synchronization time and the later entering network synchronization time are short, additionally, maximum synchronization time difference and synchronization maintaining time are long, all of which meet the needs of normal communications, and further verify the synchronization scheme feasible.     

On-demand loop-free routing with link vectors

We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad hoc networks based on link-state information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively for each destination in the form of complete paths, and each node creates a labeled source graph based on the paths advertised by its neighbors. A node originates a broadcast route request (RREQ) to obtain a route for a destination for which a complete path does not exist in its source graph. When the original path breaks, a node can select an alternative path based on information reported by neighbors, and a node can send a unicast RREQ to verify that the route is still active. A node that cannot find any alternate path to a destination sends route errors reliably to those neighbors that were using it as next hop to the destination. Using simulation experiments in ns2, OLIVE is shown to outperform dynamic source routing, ad hoc on-demand distance vector, optimized link-state routing protocol, and topology broadcast based on reverse-path forwarding, in terms of control overhead, throughput, and average network delay, while maintaining loop-free routing with no need for source routes.     

Interconnecting high-speed LANs and backbones

Transparent source routing, an algorithm that exploits the best features of the transparent spanning tree and source routing algorithms for medium-access-control (MAC) bridges used in local area network (LAN) interconnections, is presented. The scheme uses optimal routes, is transparent to end stations, and reduces bridge processing overheads. Aspects of the existing transparent spanning tree and source routing algorithms are described. A comparison of the new scheme with the two existing schemes is presented     

LEO星座中基于不完全信息的路由联盟博弈策略

针对LEO卫星网络在多跳转发数据包时流量分布不均问题,提出了一种基于不完全信息的最优收益路由联盟博弈算法.各节点协同联盟邻居节点,共同确定数据报文当前最优转发路径,从而分配和平衡节点间流量负载.仿真结果表明,与最短路径卫星路由DSP或智能路由TLR相比,本文算法的平均数据传输延迟降低了18.5%,节点流量负载均衡度提高了65.6%.     

WDM光网络多跳业务量疏导算法

针对具有多跳疏导能力的WDM光网络进行了研究,提出了一种基于固定备选路由的多跳业务量疏导算法（FO-HC-MH）。该算法对备选路由的跳数进行限制,因而可以节约使用网络的收发器资源。仿真实验表明,与FO-MH算法相比,在网络负载较低的情况下该算法节约效果明显。     

三层动态网络联合优化选路算法

 IP/MPLS over WDM被认为是下一代互联网络的最理想解决方案,但是在目前以及以后的很长一段时间内,网络结构仍然是IP/MPLS over SDH over WDM这样三层网络共存的情况。为了能够有效降低三层动态网络中的业务阻塞率,本文提出了三层动态网络联合优化选路算法。该算法分为两种模式,在模式1中,上层网络中被阻塞的业务可以开放的利用下层网络的空闲资源;在模式2中,将三层网络整合成为一个网络,在这个综合网络中为每一个业务进行选路。为了能够实时的传输每一个到达的动态业务,在这两种模式中采用蚁群策略为动态业务进行选路,提出了一个新的前向蚂蚁路径选择概率模型以及路径质量评判参数,使得所选的路径能兼顾链路利用率和路径跳数。仿真实验表明,同其他算法相比,本文提出的算法可以有效地降低三层动态网络的阻塞率。     

Robust and Improved Channel Estimation Algorithm for MIMO-OFDM Systems

Multiple-input multiple-output (MIMO) system using orthogonal frequency division multiplexing (OFDM) technique has become a promising method for reliable high data-rate wireless transmission system in which the channel is dispersive in both time and frequency domains. Due to multiple cochannel interferences in a MIMO system, the accuracy of channel estimation is a vital factor for proper receiver design in order to realize the full potential performance of the MIMO-OFDM system. A robust and improved channel estimation algorithm is proposed in this paper for MIMO-OFDM systems based on the least squares (LS) algorithm. The proposed algorithm, called improved LS (ILS), employs the noise correlation in order to reduce the variance of the LS estimation error by estimating and suppressing the noise in signal subspace. The performance of the ILS channel estimation algorithm is robust to the number of antennas in transmit and receive sides. The new algorithm attains a significant improvement in performance in comparison with that of the regular LS estimator. Also, with respect to mean square error criterion and without using channel statistics, the ILS algorithm achieves a performance very close to that of the minimum mean square error (MMSE) estimator in terms of the parameters used in practical MIMO-OFDM systems. A modification of the ILS algorithm, called modified ILS (MILS), is proposed based on using the second order statistical parameters of channel. Analytically, it is shown that the MILS estimator achieves the exact performance of the MMSE estimator. Due to no specific data sequences being required to perform the estimation, in addition to the training mode, the proposed channel estimation algorithms can also be extended and used in the tracking mode with decision-aided method.