Research on multicast routing protocols for mobile ad-hoc networks

A mobile ad-hoc network (MANET) is composed of mobile nodes without any infrastructure. Mobile nodes self-organize to form a network over radio links. The goal of MANETs is to extend mobility into the realm of autonomous, mobile and wireless domains, where a set of nodes form the network routing infrastructure in an ad-hoc fashion. The majority of applications of MANETs are in areas where rapid deployment and dynamic reconfiguration are necessary and wired network is not available. These include military battlefields, emergency search, rescue sites, classrooms and conventions, where participants share information dynamically using their mobile devices. These applications lend themselves well to multicast operations. In addition, within a wireless medium, it is crucial to reduce the transmission overhead and power consumption. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Hence, reliable multicast routing plays a significant role in MANETs. However, to offer effective and reliable multicast routing is difficult and challenging. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and employ different recovery mechanisms. To provide a comprehensive understanding of these multicast routing protocols and better organize existing ideas and work to facilitate multicast routing design for MANETs, we present the taxonomy of the multicast routing protocols, their properties and design features. This paper aims to aid those MANETs researchers and application developers in selecting appropriate multicast routing protocols for their work.     

Network coding based reliable disjoint and braided multipath routing for sensor networks

This paper presents network coding based reliable disjoint and braided multipath routing (NC-RMR ) for sensor networks, which forms multipath by hop-by-hop method and only maintains local path information of each node without establishing end-to-end paths. Neighbors of each local node are divided into groups according to their hops to sink nodes to improve the network load balancing. For further performance improvement of NC-RMR with disjoint multipath model, local nodes select their own backup nodes in neighbor nodes to form additional logical paths, which implement a braided multipath model. Security advantages of NC-RMR with multipath and network coding mechanisms are analyzed. Analytical and simulation results prove that braided multipath routing model has better performance over disjoint model, and NC-RMR protocol can reduce the required number of transmission paths, ensure load balance of sensor network system, reduce the energy consumption of nodes.     

An anonymous distributed routing protocol in mobile ad-hoc networks

This paper proposes an efficient anonymous routing protocol for mobile ad hoc networks (MANETs). This protocol considers symmetric and asymmetric links during the wireless communication of MANETs. A MANET is one type of self-organized wireless network that can be formed by several wireless devices such as laptops, tablet PCs, and smartphones. Different wireless transmission ranges of different mobile devices lead to a special communication condition called an asymmetric link. Most research on this topic focuses on providing security and anonymity for the symmetric link without considering the asymmetric link. This paper proposes a novel distributed routing protocol beyond the symmetric and asymmetric links. This protocol guarantees the security, anonymity, and high reliability of an established route by avoiding unreliable intermediate nodes. The routes generated by the proposed protocol are shorter than previous research. The proposed protocol enhances MANET performance in assuring security and anonymity.     

Search: A routing protocol for mobile cognitive radio ad-hoc networks

Recent research in the emerging field of cognitive radio (CR) has mainly focussed on spectrum sensing and sharing, that allow an opportunistic use of the vacant portions of the licensed frequency bands by the CR users. Efficiently leveraging this node level channel information in order to provide timely end-to-end delivery over the network is a key concern for CR based routing protocols. In addition, the primary users (PUs) of the licensed band affect the channels to varying extents, depending on the proportion of the transmission power that gets leaked into the adjacent channels. This also affects the geographical region, in which, the channel is rendered unusable for the CR users. In this paper, a geographic forwarding based SpEctrum Aware Routing protocol for Cognitive ad-Hoc networks (SEARCH), is proposed that (i) jointly undertakes path and channel selection to avoid regions of PU activity during route formation, (ii) adapts to the newly discovered and lost spectrum opportunity during route operation, and (iii) considers various cases of node mobility in a distributed environment by predictive Kalman filtering. Specifically, the optimal paths found by geographic forwarding on each channel are combined at the destination with an aim to minimize the hop count. By binding the route to regions found free of PU activity, rather than particular CR users, the effect of the PU activity is mitigated. To the best of our knowledge, SEARCH takes the first steps towards a completely decentralized, CR routing protocol for mobile ad-hoc networks and our approach is thoroughly evaluated through analytical formulations and simulation study.     

Standardisation advancements in the area of routing for mobile ad-hoc networks

Mobile Ad hoc Networks (MANETs) are self-organized and fully distributed networks that rely on the collaboration of participating devices to route data from source to destination. The MANET paradigm is expected to enable ubiquitous mobile communication and thus the proliferation of pervasive applications. The MANET Working Group (WG) of the Internet Engineering Task Force (IETF) is responsible for standardizing an appropriate Internet Protocol (IP) based routing protocol functionality for both static (mesh) and dynamic (mobile) wireless ad hoc network topologies. In this paper, we provide a background on the possibility to use MANETs for enabling future pervasive internet and innovative ubiquitous services. We also describe the work achieved by the MANET WG thus far on the area of secure unicast and multicast routing for MANETs. We also examine non-IETF work on this area, chiefly based on adaptive and hybrid routing. The paper then presents comparative performance evaluations of discussed routing protocols. It is mainly observed that there is a need for adaptive hybrid routing approaches in order to support future innovative and pervasive applications. Consequently, we present our conclusions.     

Survey of multipath routing protocols for mobile ad hoc networks

This survey investigates multipath routing protocols for mobile ad hoc networks (MANETs). The main objectives of multipath routing protocols are to provide reliable communication and to ensure load balancing as well as to improve quality of service (QoS) of MANETs. These multipath protocols are broadly classified into five categories based on their major goals. The goals are to improve delay, provide reliability, reduce overhead, maximize network life and support hybrid routing. Multipath routing protocols address issues such as multiple paths discovery and maintaining these paths. Issues, objectives, performances, advantages and disadvantages of these protocols are investigated and summarized. A checklist is provided as a guideline so that a network designer can choose an appropriate multipath routing protocol to meet the network's application objectives.     

All-to-all disjoint multipath routing using cycle embedding

In this paper, we evaluate the performance of disjoint multipath routing approaches for all-to-all routing in packet-switched networks with respect to packet overhead, path length, and routing table size. We develop a novel approach based on cycle embedding to obtain two node-disjoint paths between all source–destination pairs with reduced number of routing table entries maintained at a node (hence the reduced lookup time), small average path length, and less packet overhead. We study the trade-off between the number of routing table entries maintained at a node and the average length of the two disjoint paths by: (a) formulating the cycle-embedding problem as an integer linear program; and (b) developing a heuristic. We show that the number of routing table entries at a node may be reduced to at most two per destination using cycle-embedding approach if the average length of the disjoint paths are allowed to exceed the minimum by 25%.     

Constructing disjoint paths for failure recovery and multipath routing

Applications such as Voice over IP and video streaming require continuous network service, requiring fast failure recovery mechanisms. Proactive failure recovery schemes have been recently proposed to improve network performance during the failure transients. These proactive failure recovery schemes need extra infrastructural support in the form of routing table entries, extra addresses etc. In this paper, we study if the extra infrastructure support can be exploited to build disjoint paths in those frameworks, while keeping the lengths of the recovery paths close to those of the primary paths. Our evaluations show that it is possible to extend the proactive failure recovery schemes to provide support for nearly-disjoint paths which can be employed in multipath routing for load balancing and QoS.     

Cryptographic techniques for mobile ad-hoc networks

In this paper, we propose some cryptographic techniques to securely set up a mobile ad-hoc network. The process is fully self-managed by the nodes, without any trusted party. New nodes can join the network and are able to obtain the same capabilities as initial nodes; further, each node can obtain a pair of secret/public keys to secure and authenticate its communication. Two additional features of our system are that it allows to implement threshold operations (signature or decryption) involving subgroups of nodes in the network and that any subgroup with a small number of nodes (between 2 and 6) can obtain a common secret key without any communication after the set up phase.     

Stochastic routing in ad-hoc networks

We investigate a network routing problem where a probabilistic local broadcast transmission model is used to determine routing. We discuss this model's key features, and note that the local broadcast transmission model can be viewed as soft handoff for an ad-hoc network. We present results showing that an index policy is optimal for the routing problem. We extend the network model to allow for control of transmission type, and prove that the index nature of the optimal routing policy remains unchanged. We present three distributed algorithms which compute an optimal routing policy, discuss their convergence properties, and demonstrate their performance through simulation.     

一种基于蚂蚁算法的Ad Hoc路由算法

Ad Hoc网络已成为当前网络发展的热点,本文提出了一种基于蚂蚁算法的Ad Hoc网络路由算法.本算法保持了蚂蚁算法的本身所具有的优点,并在反馈和启发信息中都考虑到Ad Hoc网络的带宽受限和电源剩余量不足的特点:基于带宽的考虑和跳数限制的设置提供了较好的QoS保证.     

Linear time distributed construction of colored trees for disjoint multipath routing

Disjoint multipath routing (DMPR) is an effective strategy to achieve robustness in networks where data is forwarded along multiple link- or node-disjoint paths. DMPR poses significant challenges in terms of obtaining loop-free multiple (disjoint) paths and effectively forwarding data over the multiple paths, the latter being particularly significant in datagram networks. One approach to reduce the number of routing table entries for disjoint multipath forwarding is to construct two trees, namely red and blue, rooted at a destination node such that the paths from a source to the destination on the two trees are link/node-disjoint. This paper develops the first distributed algorithm for constructing the colored trees whose running time is linear in the number of links in the network. The paper also demonstrates the effectiveness of employing generalized low-point concept rather than traditional low-point concept in the DFS-tree to reduce the average path lengths on the colored trees.     

Dynamic fuzzy logic and reinforcement learning for adaptive energy efficient routing in mobile ad-hoc networks

In this paper, a dynamic fuzzy energy state based AODV (DFES-AODV) routing protocol for Mobile Ad-hoc NETworks (MANETs) is presented. In DFES-AODV route discovery phase, each node uses a Mamdani fuzzy logic system (FLS) to decide its Route REQuests (RREQs) forwarding probability. The FLS inputs are residual battery level and energy drain rate of mobile node. Unlike previous related-works, membership function of residual energy input is made dynamic. Also, a zero-order Takagi Sugeno FLS with the same inputs is used as a means of generalization for state-space in SARSA-AODV a reinforcement learning based energy-aware routing protocol. The simulation study confirms that using a dynamic fuzzy system ensures more energy efficiency in comparison to its static counterpart. Moreover, DFES-AODV exhibits similar performance to SARSA-AODV and its fuzzy extension FSARSA-AODV. Therefore, the use of dynamic fuzzy logic for adaptive routing in MANETs is recommended.     

传感器网络中基于轨迹的多路径容错路由算法

基于轨迹提出一种新的多路径构造算法,其基本思想是源节点根据目的节点位置信息选择几条合适的转发路径,中间节点根据不同的贪婪转发策略建立相应的动态转发表转发报文。和其他算法相比,新算法具有分布式特性,路径建立只需局部信息即可;算法实现简单,无须大量的计算。理论分析和模拟实验也表明,新算法具有较好的容错性。     

传感器网络分层多路径路由协议

传感器网络节点在能量、存储空间和计算能力方面都受到严格限制,要延长节点的生存时间,必须设计出高效的路由协议.文章首先描述现存的传感器网络路由协议,提出基于星树结构的分层多路径路由协议(LAMP),并与其它分簇路由协议(如LEACH)作了比较.结果表明,此协议减少了节点的能量消耗,延长了网络寿命;可以很容易地形成多条互不相交的路径,提高了网络的容错能力.文章最后提出双Hash函数链方法,为LAMP协议提供安全的广播消息认证.     

Ad Hoc网络链路质量QoS多路径按需路由协议

传统的MANET路由协议是基于最小跳数的路由,没有考虑链路质量,不能适应网络拓扑的动态变化。针对这一问题,提出了一种Ad Hoc网络链路质量QoS多路径按需路由协议（QMORP）。QMORP采用移动预测来计算链路的生存时间,应用能量模型获得链路的剩余能量,综合链路生存时间和剩余能量两种因素来计算链路质量。选择链路质量大的路径转发分组。仿真实验表明,相比AOMDV协议,QMORP协议提高了网络的生命周期,降低了网络的平均端对端延迟、提高了网络的发包率和吞吐率。     

基于生命期预测的移动Ad hoc网络多径路由策略

在移动自组网中,由于网络节点的移动性和拓扑结构的多态性,多路径路由在稳定性,均衡负载方面优于单路径路由,非常适合Ad hoc网络。考虑到移动自组网中节点能量的局限性,在DSR协议的基础上提出了一种新型的多径路由算法。该算法结合节点路径的能量消耗率,预测出链路的生命期,以求找到多条有效路径并进行传输。仿真结果表明,该协议比DSR具有更好的吞吐量和端到端延迟。     

Profile based routing in vehicular ad-hoc networks

One of the main problems in the VANET(vehicular ad-hoc network)routing algorithms is how to establish the stable routes.The link duration in these networks is often very short because of the frequent changes in the network topology.Short link duration reduce the network efficiency.Different speeds of the vehicles and choosing different directions by the vehicles in the junctions are the two reasons that lead to link breakage and a reduction in link duration.Several routing protocols have been proposed for VANET in order to improve the link duration,while none of them avoids the link breakages caused by the second reason.In this paper,a new method for routing algorithms is proposed based on the vehicles trips history.Here,each vehicle has a profile containing its movement patterns extracted from its trips history.The next direction which each vehicle may choose at the next junction is predicted using this profile and is sent to other vehicles.Afterward each vehicle selects a node the future direction of which is the same as its predicted direction.Our case study indicates that applying our proposed method to ROMSGP(receive on most stable group-path)routing protocol reduces the links breakages and increases the link duration time.     

Utility maximization for communication networks with multipath routing

In this paper, we study utility maximization problems for communication networks where each user (or class) can have multiple alternative paths through the network. This type of multi-path utility maximization problems appear naturally in several resource allocation problems in communication networks, such as the multi-path flow control problem, the optimal quality-of-service (QoS) routing problem, and the optimal network pricing problem. We develop a distributed solution to this problem that is amenable to online implementation. We analyze the convergence of our algorithm in both continuous-time and discrete-time, and with and without measurement noise. These analyses provide us with guidelines on how to choose the parameters of the algorithm to ensure efficient network control.     

无线多媒体传感器网络能量敏感多路径路由

针对节点能量分布不均匀的无线多媒体传感器网络中大数据量传输问题,提出一种无线多媒体传感器网络能量敏感多路径路由算法EACM。该算法通过平衡路由节点间剩余能量差异,调节多路径聚集程度来均衡网络能耗减少数据包在路径上的延迟。仿真结果表明EACM算法能有效地延长网络生存期,减少数据包在路径上的时延。