Improved multipath muting with WNN for the open networks

Multipath routing mechanism is vital for reliable packet delivery, load balance, and flexibility in the open network because its topology is dynamic and the nodes have limited capability. This article proposes a new multipath switch approach based on traffic prediction according to some characteristics of open networks. We use wavelet neural network （WNN） to predict the node traffic because the method has not only good approximation property of wavelet, but also self-learning adaptive quality of neural network. When the traffic prediction indicates that the primary path is a failure, the alternate path will be occupied promptly according to the switch strategy, which can save time for the switch in advance The simulation results show that the presented traffic prediction model has better prediction accuracy; and the approach based on the above model can balance network load, prolong network lifetime, and decrease the overall energy consumption of the network.     

Rate allocation strategies for energy-efficient multipath routing in Ad-hoc networks towards B3G

Wireless mobile Ad-hoc network is a special network that all nodes can self-organize and work together. It is flexible to form a network and extend the coverage area dynamically without infrastructure, so Ad-hoc network is envisioned as cornerstones of future generation networking technologies (B3G or 4G). However, the dynamic network topology makes the communication cost not only the energy of source/destination nodes, but also the relay nodes. Another problem of the Ad-hoc network is it is hard to provide a stable and persistent quality of service (QoS), which is strongly required by the beyond 3rd generation (B3G) system. In this article, the authors establish a scenario that contains B3G cellular base station and Ad-hoc mobile nodes, and propose two algorithms minimum incremental rate algorithm and power feed-back rate allocation algorithm in multipath routing. The algorithms can maintain a constant total transmission rate and bit error ratio (BER) to provide the QoS guarantee and reach the minimum power consumption of the relay nodes by adjusting the rate of each path in the multipath routing.     

一种新的基于ACSA的ad hoc多径QoS路由方法

ad hoc网络中基于蚁群系统算法（ACSA）的路由协议已经被广泛地研究,但其中的大部分本质上都属于单径路由协议,使得源宿之间最短路径上的主机负担加重。另一方面,由于引入了蚂蚁的正反馈机制,使得协议本身比较差的鲁棒性受到进一步的削弱,多径路由能够更好地支持QoS。本文将ACSA和链路不相交的多径路由结合起来以解决上述问题。新提出的基于ACSA的多径QoS路由方法建立和利用多条链路不相交路径来并发发送数据,并且采用信息素来分散通信流量,因此能够适应网络的动态变化和更好的支持QoS,仿真结果表明该方法要优于其他相关的算法。     

Power-aware single- and multipath geographic routing in sensor networks

Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a significant effect on the power consumption of both the transmitting node and listeners. This paper first presents a Geographical Power Efficient Routing (GPER) protocol for sensor networks. Each sensor node makes local decisions as to how far to transmit: therefore, the protocol is power efficient, localized, highly distributed, and scalable. In GPER, given a final destination, each node first establishes a subdestination within its maximum radio range. The node, however, may decide to relay the packet to this subdestination through an intermediary node or alter the subdestination if this will preserve power. Traditional deterministic geographic routing algorithms aim at achieving close to the shortest weighted paths. However, they normally stick to the same paths for the same source/destination pairs. This may conversely drain the nodes on these paths and result in short network life when the communication in the network is unevenly distributed. Thus, we further investigate a set of probabilistic multipath routing algorithms, which generate braided multipaths based only on local information. The algorithms have less communication and storage overhead than conventional on-demand multipath routing algorithms, while providing greater resilience to node failures. Simulations on NS2 show that GPER almost halves the power consumption in the network relative to alternative geographic routing algorithms. Furthermore, in situations where the communication tasks are non-uniformly distributed, probabilistic multipath routing contributes up to an additional 30% to network lifetime.     

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

In wireless sensor network （MSN）, reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.     

跨越不同容量设置DWDM网络的动态IP/DWDM综合路由算法研究

IP/DWDM网络的综合路由中的一个重要的研究问题就是如何对跨越不同DWDM网络的IP路由进行综合路由,特别是当两个DWDM网络的容量设置不同时。本文着重解决的就是如何对从单波长带宽大的网络进入单波长带宽小的网络传输的IP业务的综合路由问题。根据尽量鼓励对波长链路的带宽进行完全使用,以减小波长链路带宽碎片的原则,我们提出了两种解决算法:1 n 算法和 m n算法。仿真结果对两种算法的效率和性能进行了测试。     

Admission control on multipath routing in 802.11-based wireless mesh networks

Admission control (AC) is a mechanism for meeting bandwidth requirements of data transmissions. Early research on admission control for wireless mesh networks (WMNs) was centered around single-path routing. Compared to single-path routing, parallel multipath routing may offer more reliable network services and better load balancing. Applying admission control to multipath routing could further improve service quality, but it also faces a number of challenges. For example, transmission on one path may affect transmission on a neighboring path. Addressing these challenges, this paper presents an AC algorithm on parallel multipath routing for WMNs. In particular, we formulate an optimization problem for achieving the best service based on available bandwidth and bandwidth consumption of to-be-admitted data sessions. While solving this problem is a complex task, we devise an optimal algorithm for selecting two node-disjoint paths with rate allocation, and propose a distributed multipath routing and admission control protocol to achieve a near-optimal solution. Simulations show that MRAC is efficient and effective in meeting bandwidth requirements.     

Multiconstrained QoS multipath routing in wireless sensor networks

Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach. This work was supported in part by the U.S. National Science Foundation under grant DBI-0529012, the National Science Foundation Faculty Early Career Development Award under grant ANI-0093241 and the Office of Naval Research under Young Investigator Award N000140210464. Xiaoxia Huang received her BS and MS in the Electrical Engineering from Huazhong University of Science and Technology in 2000 and 2002, respectively. She is completing her Ph.D. degree in the Department of Electrical and Computer Engineering at the University of Florida. Her research interests include mobile computing, QoS and routing in wireless ad hoc networks and wireless sensor networks. Yuguang Fang received a Ph.D. degree in Systems Engineering from Case Western Reserve University in January 1994 and a Ph.D degree in Electrical Engineering from Boston University in May 1997. He was an assistant professor in the Department of Electrical and Computer Engineering at New Jersey Institute of Technology from July 1998 to May 2000. He then joined the Department of Electrical and Computer Engineering at University of Florida in May 2000 as an assistant professor, got an early promotion to an associate professor with tenure in August 2003 and to a full professor in August 2005. He holds a University of Florida Research Foundation (UFRF) Professorship from 2006 to 2009. He has published over 200 papers in refereed professional journals and conferences. He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002. He has served on several editorial boards of technical journals including IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, IEEE Transactions on Mobile Computing and ACM Wireless Networks. He have also been activitely participating in professional conference organizations such as serving as The Steering Committee Co-Chair for QShine, the Technical Program Vice-Chair for IEEE INFOCOM’2005, Technical Program Symposium Co-Chair for IEEE Globecom’2004, and a member of Technical Program Committee for IEEE INFOCOM (1998, 2000, 2003–2007).     

时间依赖的混合型网络的分布式路由协议

提出了时间依赖的混合型网络模型(HTDN 模型),有效地描述了网络中链路权值随时间变化的特性,并且网络中的节点可以采用不同的等待策略;并给出了 HTDN 模型的路径优化理论。在此基础上设计了有效的分布式路由协议 DMDRP,能计算出 HTDN 模型中所有节点对之间的最短延时路径,并证明了协议的正确性。最后通过仿真试验,给出了 DMDRP 协议与传统路由方案的性能对比分析。     

SPREAD: Improving network security by multipath routing in mobile ad hoc networks

We propose and investigate the SPREAD scheme as a complementary mechanism to enhance secure data delivery in a mobile ad hoc network. The basic idea is to transform a secret message into multiple shares, and then deliver the shares via multiple paths to the destination so that even if a certain number of message shares are compromised, the secret message as a whole is not compromised. We present the overall system architecture and discuss three major design issues: the mathematical model for the generation and reconstruction of the secret message shares, the optimal allocation of the message shares onto multiple paths in terms of security, and the multipath discovery techniques in a mobile ad hoc network. Our extensive simulation results justify the feasibility and the effectiveness of the SPREAD approach.

Multi-path routing based on load-balance for cognitive packet networks

Quality of service(QoS)routing algorithms have been hardly discussed in the scientific community,most previous work on QoS routing concentrates on the performance of the single route.Cognitive packet network(CPN)has been designed for providing QoS routing.In this paper,to balance the loads among networks,we present a multi-path routing algorithm based on load-balance(MPRLB),which is carried out in two steps.The algorithm with low computational complexity is firstly applied to establish multi path routing for each source and destination node pairs(SD-pair)nodes in the network.Then,we propose the hopfield neural network algorithm,which is applied to improve the efficiency of the flow deviation method for fast flow allocation among the links of the network based on load balance.Extensive simulation results demonstrate that the proposed scheme significantly improves the performance compared with the existing scheme that ignores load balancing.     

An energy efficient clustering routing algorithm for wireless sensor networks

~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A…     

有/无线ATM网的组播选路算法

本文提出一种组播选路算法,在组播连接路由树的代价函数中计入了移动成员的越区切换发生概率,使为移动成员服务的接入节点（ＡＰ）尽可能成为组播路由树的树叶节点。当移动成员发生越区切换以后,可减去原来为之服务的ＡＰ和相应的树枝通道链路,从而保证了网络资源得以有效地利用。数值模拟分析的结果表明,我们提出的算法达到了这一目的。     

WDM光网络中固定路由的优化算法

通过研究WDM光网络中固定路由策略的选取对网络性能的影响，提出了一种新的用于优化固定路由的算法-综合代价法。该算法综合考虑了链路负载和路由跳数这两个因素，以综合代价为策略进行路由优化。计算机仿真结果表明，针对不同的网络负载情况，综合代价法能够有效地降低网络的阻塞率，提高网络的性能。     

Energy-efficient utility maximization for wireless networks with/without multipath routing

In wireless networks, end-to-end communication depends on link capacities which, in turn, are determined by transmit powers of interfering links. Optimal network performance and energy efficiency can be achieved by jointly optimizing congestion control and power control. In this paper, we study this joint optimization problem by formulating it into convex programming, i.e., we maximize a compound function which is a network utility function minus a factor, named tradeoff factor, of the associated power cost. We prove that this tradeoff factor is essential for good energy efficiency while maintaining the network throughput at a satisfactory level. The problem is solved by a distributed dual-decomposition based algorithm energy efficient jointly optimal congestion and power control (EJOC). EJOC tackles the power control problem in a recursive manner, operating as easily as the steepest descent method but converging much faster. This optimization framework is further extended to networks where each data source may have multiple alternative paths to its destination. Simulation results show that the proposed algorithm converges faster than other algorithm and is capable of significantly improving the energy efficiency of the network.     

On-demand coding-aware routing in wireless Mesh networks

Network coding,which exploits the broadcast nature of wireless medium,is an effective way to improve network performance in wireless multi-hop networks,but the first practical wireless network coding system COPE cannot actively detect a route with more coding opportunities and limit the coding structure within two-hop regions.An on-demand coding-aware routing scheme(OCAR)for wireless Mesh networks is proposed to overcome the limitations specified above by actively detecting a route with more coding opportunities along the entire route rather than within two-hop regions.Utilizing more coding opportunities tends to route multiple flows 'close to each other' while avoiding interference requires routing multiple flows 'away from each other'.OCAR achieves a tradeoff by adopting RCAIA as routing metric in route discovery,which is not only coding-aware but also considers both inter and intra flow interference.Simulation results show that,compared with Ad-hoc on-demand distance vecfor routing(AODV)and AODV+COPE,OCAR can find more coding opportunities,thus effectively increase network throughput,reduce end to end delay and alleviate network congestion.     

Virtual channel load-balanced routing algorithm for Torus networks

In order to improve the network performance furthermore,a routing algorithm for 2D-Torus is investigated from the standpoint of load balance for virtual channels.The 2D-Torus network is divided into two virtual networks and each physical channel is split into three virtual channels.A novel virtual channel allocation policy and a routing algorithm are proposed,in which traffic load is distributed to those three virtual channels in a more load-balanced manner by introducing a random parameter.Simulations of the proposed algorithm are developed with a SystemC-based test bench.The results show that compared with the negative first for Torus networks(NF-T) algorithm,the proposed algorithm can achieve better performance in terms of network latency and throughput under different traffic patterns.It also shows that a routing algorithm with load balance for virtual channels can significantly improve the network performance furthermore.     

A token-based routing mechanism for GMPLS-controlled WDM networks

This paper analyzes destination initiated reservation for Generalized Multi-Protocol Label Switching (GMPLS) based wavelength division multiplexing (WDM) networks and determines, via simulation, probabilities of both forward blocking and backward blocking. During light traffic load, any degradation in performance is due to backward blocking, whereas during heavy traffic load forward blocking dominates. In order to minimize performance degradation due to blocking, this paper proposes a token based routing scheme that is capable of searching for the availability of more than one route from source to destination, meeting the desired quality of service (QoS). Extensive simulation results show that the proposed technique significantly improves the blocking performance and setup delay.     

Integrated dynamic distributed routing and admission control in ATM networks

A node-by-node admission control and routing scheme for ATM networks is devised. The scheme is based on the subdivision of traffic into a number of classes, characterized by different performance requirements. At each network node, for all outgoing links, link capacity partitions are periodically assigned to the traffic classes, as the result of an optimization problem over a fixed time interval. Local access control rules compute the maximum number of connections of each class that a link can accept within the assigned capacity. Incoming call connection requests are forwarded in a hop-by-hop fashion. Each node traversed, first checks the presence of resources needed to accept a new connection and guarantee all quality of service (QoS) requirements. This is done by using the local access control rule. Then, it chooses the next node along the path on the basis of a distributed routing strategy. This minimizes a cost function accounting for local instantaneous information, as well as for aggregate information that is passed periodically among adjacent nodes. Two routing strategies are introduced. In the first scheme, a new call is rejected if, at a certain node along the path, there are not enough resources to guarantee QoS requirements, and no recovery mechanism is implemented. In the second scheme, an alternative path is looked for after the first failure. Simulation results are presented which show a comparison between the two proposed routing strategies. Comparison is also made between the proposed scheme and the other approaches. © 1997 John Wiley & Sons, Ltd.     

Fluctuation control for many-to-one routing in wireless sensor networks

This paper presents a distributed and adaptive fluctuation control scheme for many-to-one routing(FCM) in wireless sensor networks.Unlike well-known topology control schemes,the primary design objective is to reduce the fluctuation which happens due to overload of sensors in a data collection tree.More specifically,an estimation model of a sensor available capacity based on the number of its neighbors is proposed.In addition,this paper proposes a parent selection mechanism by three-way handshake.With such model and the selection mechanism,it is ensured that the load of a sensor does not exceed its available capacity.Finally,an adaptive maintenance mechanism is proposed to adjust the estimation of a sensor available capacity as the network environment changes.Simulation results demonstrate the effectiveness of the scheme.