Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

In recent research, link stability is getting tremendous attention in mobile adhoc networks (MANETs), because of several impediments that occur in a reliable and robust network. Link stability metric is used to improve network performance in terms of end-to-end delay, data success delivery ratio (DSDR) and available route time (ART). Energy consumption, bandwidth and communication delay of major concern in ad hoc networks. A high mobility of MANET nodes reduces the reliability of network communication. In a dynamic networks, high mobility of the nodes makes it very difficult to predict the dynamic routing topology and hence cause route/link failures. Multicast in MANETs is an emerging trend that effectively improves the performance while lowering the energy consumption and bandwidth usage. Multicast routing protocol transmits a packet to multicast a group at a given time instant to achieve a better utilization of resources. In this paper, node mobility is considered to map better their movement in the network. So, the links with long active duration time can be identified as a stable link for route construction. Variation in signal strength is used to identify whether the direction of the node is towards or away from estimating node. We consider signal strength as QoS metric to calculate link stability for route construction. Efforts are made to identify the link with highly probable longer lifetime as the best suitable link between two consecutive nodes. We predict the movement time of nodes that define the route path to the node destination. Exata/cyber simulator is used for network simulation. The simulation results of the proposed routing protocol are compared with on-demand multicast routing protocol and E-ODMRP, which works on minimum hop count path. Analysis of our simulation results has shown improvement of various routing performance metrics such as DSDR, ART, routing overhead and packet drop ratio.     

A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks

Greedy and contention-based forwarding schemes were proposed for mobile ad hoc networks (MANETs) to perform data routing hop-by-hop, without prior discovery of the end-to-end route to the destination. Accordingly, the neighboring node that satisfies specific criteria is selected as the next forwarder of the packet. Both schemes require the nodes participating in the selection process to be within the area that confronts the location of the destination. Therefore, the lifetime of links for such schemes is not only dependent on the transmission range, but also on the location parameters (position, speed and direction) of the sending node and the neighboring node as well as the destination. In this paper, we propose a new link lifetime prediction method for greedy and contention-based routing which can also be utilized as a new stability metric. The evaluation of the proposed method is conducted by the use of stability-based greedy routing algorithm, which selects the next hop node having the highest link stability.     

面向链路稳定性的MANET路径建立机制

为了适应拓扑动态变化的Ad hoc网络,该文提出了一种面向链路稳定性的路由机制,节点根据少量接收信号强度样本值建立牛顿插值多项式描述连续时间域上的信号强度,进而在不预测节点运动方向和速度等相关参数的情况下估计链路生存时间,按照链路生存时间和跳数两个约束条件,源节点逐跳建立稳定的端到端路径。仿真结果表明,所建立的牛顿插值多项式能够准确地逼近节点随机移动过程中的实际接收信号强度,并且该路由机制能够有效地减少路由重建次数,降低数据包丢弃概率。     

Provisioning of adaptability to variable topologies for routing schemes in MANETs

Frequent changes in network topologies caused by mobility in mobile ad hoc networks (MANETs) impose great challenges to designing routing schemes for such networks. Various routing schemes each aiming at particular type of MANET (e.g., flat or clustered MANETs) with different mobility degrees (e.g., low, medium, and high mobility) have been proposed in the literature. However, since a mobile node should not be limited to operate in a particular MANET assumed by a routing scheme, an important issue is how to enable a mobile node to achieve routing performance as high as possible when it roams across different types of MANETs. To handle this issue, a quantity that can predict the link status for a time period in the future with the consideration of mobility is required. In this paper, we discuss such a quantity and investigate how well this quantity can be used by the link caching scheme in the dynamic source routing protocol to provide the adaptability to variable topologies caused by mobility through computer simulation in NS-2.     

Status adaptive routing with delayed rebroadcast scheme in AODV-based MANETs

An efficient solution is proposed in this article to determine the best reliable route and to prolong the lifetime of the mobile Ad-hoc networks （MANETs）. In the proposed solution, the route discovery process of the Ad-hoc on-demand distance vector routing protocol （AODV） has been modified using a novel delayed rebroadcast scheme. It combines the shortest route selection criterion of AODV with the real network status including the wireless link quality, the remaining power capacity, as well as the traffic load at each node. Simulation results show that the proposed scheme can significantly extend the network lifetime and provide fewer packet losses than the conventional AODV protocol.     

Load Balancing Technique for Congestion Control Multipath Routing Protocol in MANETs

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can communicate without a central controller or fixed infrastructure. Due to node mobility, designing a routing protocol to provide an efficient and suitable method to route the data with less energy consumption, packet drop and to prolong the network lifetime has become a challenging issue in MANETs. In MANETs, reducing energy consumption and packet loss involves congestion control and load balancing techniques. Thus, this paper introduces an efficient routing technique called the multipath load balancing technique for congestion control (MLBCC) in MANETs to efficiently balance the load among multiple paths by reducing the congestion. MLBCC introduces a congestion control mechanism and a load balancing mechanism during the data transmission process. The congestion control mechanism detects the congestion by using an arrival rate and an outgoing rate at a particular time interval T. The load balancing mechanism selects a gateway node by using the link cost and the path cost to efficiently distribute the load by selecting the most desirable paths. For an efficient flow of distribution, a node availability degree standard deviation parameter is introduced. Simulation results of MLBCC show the performance improvements in terms of the control overhead, packet delivery ratio, average delay and packet drop ratio in comparison with Fibonacci sequence multipath load balancing, stable backbone-based multipath routing protocol and ad hoc on demand multipath distance vector routing. In addition, the results show that MLBCC efficiently balances the load of the nodes in the network.

     

A Minimum Interference Cross-Layer Routing Protocol for Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), channel contention and packet collision can seriously affect the performance of routing protocols, which will eventually affect the performance of the whole network. Besides, the arbitrary mobility of nodes makes contention and collision ever-changing and more complex. Thus, it is imperative to analyze the problem of contention and collision so as to build appropriate routes in MANETs. In this paper, by respectively predicting the durations of the contention and collision at every hop along the route, a minimum interference cross-layer routing protocol (MI-CLR) is proposed based on Random Waypoint (RWP) model. The new protocol classifies the interference in the network into two types; the first type of interference can only affect channel contention, while the other affects both channel contention and packet collision. Via taking the two types of interference together into account, we propose a new routing metric to build routes which guarantees that the established routes will not break frequently while having the minimum interference. Simulation results show that the MI-CLR protocol can significantly improve the network performance such as the average end-to-end delay, the packet loss ratio, the routing overhead and the throughput.     

基于可靠路径稳定性估计的MANET路由发现算法研究

提出一种基于可靠路径剩余生存期（RPL, residual path lifetime）估计的MANET路由发现算法（RLE-RPLP）,该算法充分考虑相邻链路剩余生存期相关性,建立优化的多跳路径RPL统计特性分析,提供了更可靠的路由稳定性评估。通过仿真分别与忽略链路RLL相关性的源路由协议及已有稳定性路由协议进行对比。仿真结果表明,RLE-RPLP算法能有效提高网络吞吐量并减少路由重建次数;当节点移动度较高或网络负载较大时,在吞吐量、路由开销等方面均优于已有的稳定性路由对比算法。     

无线网络中基于DSDV的最大化吞吐量的协作路由算法

为最大化无线自组织网络的吞吐量,提出一种自适应的协作路由算法。在算法中,协作分集技术与路由选择相结合,通过在路由的每一跳选择最佳的中继节点协作发送节点传输信息来改善网络吞吐量。首先通过目的序列距离矢量路由协议（DSDV）初步建立最短路由路径,在每条链路的发送节点和接收节点根据邻节点表选出公共邻居节点,建立候选中继集合;进一步,每一跳根据链路吞吐量,在候选中继集合中自适应选择最多两个中继来协助发送节点进行传输,并根据选出的中继节点数动态分配节点发射功率。在保证系统发射功率一定的情况下,最大化网络吞吐量。仿真结果表明,在相同的发射功率下,相对于非协作路由DSDV算法,采用固定数量中继的协作路由算法提高了整个网络的吞吐量,而自适应的协作路由算法可进一步提高吞吐量;同时仿真了网络吞吐量与网络规模和节点最大移动速度的变化关系。      

A strategy to reduce the control packet load of MANETs with bidirectional links using DSR

Dynamic source routing (DSR) is a robust protocol commonly applied to multi‐hop wireless mobile ad hoc networks (MANETs). In this paper, an algorithm is proposed for modifying the basic DSR protocol to enhance its performance by reducing the number of redundant route reply packets (RREPs). In the modified DSR (MDSR), for a source destination pair, the destination responds to the first received route request packet (RREQ) with an RREP, and the subsequently received RREQs, bearing the same request ID, are responded to only if the hop count is less than that of all the previously received RREQs. The performance of MDSR has been compared with that of the basic DSR for different network densities and for different mobility of nodes. Simulation results show that MDSR gives fewer control packets, less latency and a higher packet delivery ratio than DSR. Copyright © 2007 John Wiley & Sons, Ltd.     

An energy aware algorithm for OLSR clustering

One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.     

New Approaches to Routing in Mobile Ad hoc Networks

Worldwide Interoperability for Microwave Access (Wimax) is power station through which mobile network, commonly known as A Mobile Ad-hoc Network (MANET) is used by the people. A MANET can be described as an infrastructure-less and self-configure network with autonomous nodes. Participated nodes in MANETs move through the network constantly causing frequent topology changes. Designing suitable routing protocols to handle the dynamic topology changes in MANETs can enhance the performance of the network. In this regard, this paper proposes four algorithms for the routing problem in MANETs. First, we propose a new method called Classical Logic-based Routing Algorithm for the routing problem in MANETs. Second is a routing algorithm named Fuzzy Logic-based Routing Algorithm (FLRA). Third, a Reinforcement Learning-based Routing Algorithm is proposed to construct optimal paths in MANETs. Finally, a fuzzy logic-based method is accompanied with reinforcement learning to mitigate existing problems in FLRA. This algorithm is called Reinforcement Learning and Fuzzy Logic-based (RLFLRA) Routing Algorithm. Our proposed approaches can be deployed in dynamic environments and take four important fuzzy variables such as available bandwidth, residual energy, mobility speed, and hop-count into consideration. Simulation results depict that learning process has a great impact on network performance and RLFLRA outperforms other proposed algorithms in terms of throughput, route discovery time, packet delivery ratio, network access delay, and hop-count.

     

An Efficient and Scalable Routing for MANETs

Recently, Distributed-Hash-Table (DHT)-based routing protocols have been proposed for large scale mobile ad hoc networks (MANETs). The motive behind using DHT is to avoid/reduce network wide flooding in MANETs in route discovery phase leading to achieve more scalable network. The challenge of deploying DHT at network layer for routing purpose in MANETs is to achieve more matching between logical and physical networks. The paper describes that existing DHT-based routing protocols for MANETs lack this feature. The paper presents a new DHT based scheme [called an efficient and scalable routing for MANETs (ESR)] which reduces the ill-matching between logical and physical networks. This is achieved be distributing the logical identifier (LID) space of DHT structure among the nodes such that the physical neighbors have consecutive LID space portions, i.e. all physical neighbors of a node are also the logical neighbors of the node. Therefore the logical ID space portion of a node may be non-contiguous. Based on this logical structure, a node builds up binary-search-tree (BST) using both logical ID space portion of itself and its neighbors. This BST at the node is traversed to find the next hop for a query/message. Through simulation, the paper shows the proposed approach (ESR) performs better than the existing one in term of routing overhead, average end-to-end delay, path-stretch values and false-negative ratio.     

无线网络中一种高QoS保证的路由协议研究

随着多媒体及实时应用的普及,在移动自组网中为业务流提供服务质量保证现已成为研究热点.提出一种在大规模移动自组网中提供服务质量保证的分段式路由协议.该协议采用直线逼近的方法,逐段建立满足带宽要求且延迟小的路径,并选择到源节点和目的节点连线距离最近的节点作为转发节点.通过分段、独立地维护路由,减小了路由维护的代价,提高了可扩展性.模拟结果表明该路由协议具有路由成功率高、路径短和延迟小等特点.     

Secure multicast routing protocols in mobile ad‐hoc networks

A mobile ad‐hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi‐hop radio network. Routing protocols in MANETs define how routes between source and destination nodes are established and maintained. Multicast routing provides a bandwidth‐efficient means for supporting group‐oriented applications. The increasing demand for such applications coupled with the inherent characteristics of MANETs (e.g., lack of infrastructure and node mobility) have made secure multicast routing a crucial yet challenging issue. Recently, several multicast routing protocols (MRP) have been proposed in MANETs. Depending on whether security is built‐in or added, MRP can be classified into two types: secure and security‐enhanced routing protocols, respectively. This paper presents a survey on secure and security‐enhanced MRP along with their security techniques and the types of attacks they can confront. A detailed comparison for the capability of the various routing protocols against some known attacks is also presented and analyzed. Copyright © 2013 John Wiley & Sons, Ltd.     

基于移动预测的VANETs广播路由协议

针对车载自组织网络（VANETs）的通信特点,基于移动预测的广播路由协议（MPBP）可以有效的提高网络的性能。MPBP的核心思想是根据车辆的位置信息和相对速度来预测节点和的链的路生存期,即连接的持续时间,由此来选择可靠高效的下一跳,即为选择了最稳定的路由路径,由此提高路由性能。仿真结果表明,无论在低速或高速场景下,MPBP协议能够实现可靠的数据递交率和较小的数据传榆时延。     

Opportunistic Routing in Wireless Ad Hoc Networks: Upper Bounds for the Packet Propagation Speed

Classical routing strategies for mobile ad hoc networks operate in a hop by hop ?push mode? basis: packets are forwarded on pre-determined relay nodes, according to previously and independently established link performance metrics (e.g., using hellos or route discovery messages). Conversely, recent research has highlighted the interest in developing opportunistic routing schemes, operating in "pull mode": the next relay can be selected dynamically for each packet and each hop, on the basis of the actual network performance. This allows each packet to take advantage of the local pattern of transmissions at any time. The objective of such opportunistic routing schemes is to minimize the end-to-end delay required to carry a packet from the source to the destination. In this paper, we provide upper bounds on the packet propagation speed for opportunistic routing, in a realistic network model where link conditions are variable. We analyze the performance of various opportunistic routing strategies and we compare them with classical routing schemes. The analysis and the simulations show that opportunistic routing performs significantly better. We also investigate the effects of mobility and of random fading. Finally, we present numerical simulations that confirm the accuracy of our bounds.     

Interference aware routing for mobile ad hoc networks based on node＇s sending and receiving capabilities

How to efficiently build routes among nodes is increasing important for mobile ad hoc networks （MANETs）. This paper puts forward an interference aware routing protocol called Interference aware cross layer routing protocol （IA-CLR） for MANETs based on the IEEE 802.11 medium access layer （MAC）. By defining the node＇s sending and receiving capabilities, IA-CLR can indicate the interference strength of the link in a real and comprehensive way. Further more, in order to choose the route with minimum bottleneck link interference, a new routing metric is proposed by combining the MAC layer and the network layer for cross layer design. Simulation results show that IA-CLR can significantly improve the performances of network such as the average end-to-end delay, the packets loss ratio and the throughput.     

Adaptive reliable and congestion control routing protocol for MANET

In mobile ad hoc networks (MANETs), the packet loss can be caused either by link failure or by node failure. Moreover, the techniques for selecting the bypass route and avoiding congestion in the bypass route are rarely handled. To overcome these, in this paper, we propose an adaptive reliable and congestion control routing protocol to resolve congestion and route errors using bypass route selection in MANETs. The multiple paths are constructed. Among which, the shortest paths are found for efficient data transmission. The congestion is detected on the basis of utilization and capacity of link and paths. When a source node detects congestion on a link along the path, it distributes traffic over alternative paths by considering the path availability threshold and using a traffic splitting function. If a node cannot resolve the congestion, it signals its neighbors using the congestion indication bit. By using simulation, we show that that the proposed protocol is reliable and achieves more throughput with reduced packet drops and overhead.