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.

     

Up-Down Links Dualpath Greedy Routing Protocol for Wireless Sensor Networks

Greedy geographic routing is attractive in wireless sensor networks because of its efficiency and scalability. This paper presents an up-down links dualpath greedy routing (UDLDGR) protocol for wireless sensor networks. The routing protocol not only reserves the features of greedy forwarding algorithm, which is simple, efficient, but also uses different relay nodes to serve as routing nodes for up and down routing paths, makes the energy consumption more balanced. The greatest advantage of UDLDGR is it trades off only small cost for the source node to obtain two different transmission paths information. The multipath strengthens the network reliability, such as load balancing and robustness to failures. Our simulation results show that UDLDGR can improve system lifetime by 20–100% compared to single path approaches.     

Survey of Secure Routing Protocols for Wireless Ad Hoc Networks

The mobile ad hoc network is a type of wireless network characterized by mobile nodes without a centralized administration. Frequent variations of the topology and the nature of the radio links have a negative impact on the stability of the links. Indeed, the link quality deteriorates rapidly and link breaks become frequent. To overcome these problems, new forms of routing protocols are used as the MultiPath routing. In addition, routing protocols require the knowledge of the nodes neighborhood to build and manage routes. The neighbor discovery process is performed by a Hello protocol. The Hello protocol typically involves several parameters such as the packet’s period; node’s transmit power, node’s position and node’s battery level. The purpose of this paper is to change the behavior of ad hoc On demand Multi-path Distance Vector (AOMDV) routing protocol by considering the density of the nodes as well as the interference of the neighboring nodes. This selection of paths goes through two stages. In the first step, we study the impact of the neighbor discovery process to select a set of paths having a minimum number of neighboring nodes to diminish contention problems and interference rate. In the second step, the Interference Ratio (IR) metric is used to select the paths in which the nodes are surrounded by a minimum of interference. We choose for our study two proposed approaches based on AOMDV routing protocol. The first is called AOMDV_neighbor and considers the density parameter as a path metric. The second is called AOMDV_neighbor_IR which considers the interference rate (IR) between each node and its neighborhood as a path metric. We evaluate the proposed routing protocols performance under various NS2 simulation scenarios in a shadowing environment.

     

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

Sensor node energy conservation is the primary design parameters in wireless sensor networks (WSNs). Energy efficiency in sensor networks directly prolongs the network lifetime. In the process of route discovery, each node cooperates to forward the data to the base station using multi‐hop routing. But, the nodes nearer to the base station are loaded more than the other nodes that lead to network portioning, packet loss and delay as a result nodes may completely loss its energy during the routing process. To rectify these issues, path establishment considers optimized substance particle selection, load distribution, and an efficient slot allocation scheme for data transmission between the sensor nodes in this paper. The selection of forwarders and conscious multi‐hop path is selected based on the route cost value that is derived directly by taking energy, node degree and distance as crucial metrics. Load distribution based slot allocation method ensures the balance of data traffic and residual energy of the node in areal‐time environment. The proposed LSAPSP simulation results show that our algorithm not only can balance the real‐time environment load and increase the network lifetime but also meet the needs of packet loss and delay.     

Detection of Wormhole Attack and Secure Path Selection in Wireless Sensor Network

In Wireless Sensor Network (WSN), securable data transmission is one of the most challenges. During the transmission between the source and a destination node, routing information of the particular path may be misbehaved by the particular nodes which are known as wormhole nodes/attackers. The paths which include the wormhole nodes are known as wormhole attacked paths. For improving security in WSN, these wormhole attacked paths should be identified. To achieve this, wormhole attack detection method and optimal or secure path selection are presented in this paper. Initially, ‘K’ paths or multiple paths are generated between source and destination using Ad-hoc On demand Multipath Distance Vector (AOMDV) routing protocol. Then, the source node identifies the wormhole attacked path by verifying the Detection Packet (DP) and Feedback Packet (FP) from the destination. After detecting the wormhole attacked paths, the source node selects the optimal path among the attacker free paths using Particle Swarm Optimization (PSO) algorithm. Simulation results show that the performance of the proposed approach improves energy efficiency and network lifetime of the network.

     

Queue‐based multiple path load balancing routing protocol for MANETs

Congestion in the network is the main cause for packet drop and increased end‐to‐end transmission delay of packet between source and destination nodes. Congestion occurs because of the simultaneous contention for network resources. It is very important to efficiently utilize the available resources so that a load can be distributed efficiently throughout the network. Otherwise, the resources of heavily loaded nodes may be depleted very soon, which ultimately affects network performances. In this paper, we have proposed a new routing protocol named queue‐based multiple path load balancing routing protocol. This protocol discovers several node‐disjoint paths from source to destination nodes. It also finds minimum queue length with respect to individual paths, sorts the node‐disjoint paths based on queue length, and distributes the packets through these paths based on the minimum queue length. Simulation results show that the proposed routing protocol distributes the load efficiently and achieves better network performances in terms of packet delivery ratio, end‐to‐end delay, and routing overhead. Copyright © 2016 John Wiley & Sons, Ltd.     

A fast and reliable routing technique for wireless mesh networks

In wireless mesh networks (WMNs), real time communications (e.g., Voice over IP (VoIP) and interactive video communications) may often be interrupted as packets are frequently lost or delayed excessively. This usually happens due to the unreliability of wireless links or buffer overflows along the routing paths. The mesh connectivity within the WMN enables the capability to enhance reliability and reduce delay for such applications by using multiple paths for routing their packets. The vital components in multi‐path routing for achieving this are the pre‐determined formation of paths and the technique that the paths are deployed for packet traversal. Therefore, we propose a novel multi‐path routing protocol by introducing a new multi‐path organization and a traffic assignment technique. The designed technique dubbed as FLASH (Fast and reLiAble meSH routing protocol) discovers one primary path between a pair of source and destination based on a new proposed metric, and thereafter selects mini‐paths, which connect pairs of intermediate nodes along the primary path. The primary path and mini‐paths are concurrently deployed, as multiple copies of packets are routed through. This technique compensates for possible outage at intermediate wireless nodes or their corresponding wireless links along the primary path. Routing along mini‐paths is performed in such a way that redundant copies do not cause an excessive congestion on the network. The effectiveness of the proposed scheme is evaluated analytically and through extensive simulations under various load conditions. The results demonstrate the superiority of the proposed multi‐path organization in terms of reliability and satisfactory achievements of the protocol in enhancing delay and throughput compared to the existing routing protocols, especially for long distances and in congested conditions. Copyright © 2010 John Wiley & Sons, Ltd.     

An adaptive‐aware energy and queue improvement of AOMDV

Because the node energy and network resources in the wireless sensor network (WSN) are very finite, it is necessary to distribute data traffic reasonably and achieve network load balancing. Ad hoc on‐demand multipath distance vector (AOMDV) is a widely used routing protocol in WSN, but it has some deficiencies: establishes the route by only using hop counts as the routing criterion without considering other factors such as energy consumption and network load; forwards route request in fixed delay resulting in building the nonoptimal path; and cannot update the path status after built paths. For the deficiency of AOMDV, this paper proposes a multipath routing protocol adaptive energy and queue AOMDV (AEQAOMDV) based on adaptively sensing node residual energy and buffer queue length. When sending a routing request, the forwarding delay of the routing request is adaptively adjusted by both the residual energy and the queue length of the intermediate node; when establishing routes, a fitness is defined as a routing criterion according to the link energy and the queue load, predicting the available duration of the node based on the energy consumption rate and adjusting the weight of the routing criterion by the available duration of the node; after the routes are established, the path information status are updated via periodically broadcasting Hello that carries the path information with the minimum fitness, making the source node update the path information periodically. By using NS‐2, simulations demonstrate that compared with AOMDV, AEQAOMDV has obvious improvements in increasing packet delivery ratio, reducing network routing overhead, reducing route discovery frequency, and decreasing the network delay. And AEQAOMDV is more suitable for WSN.     

基于位置感知和代理的WSN多径路由方案

针对无线传感器网络(WSN)中多径路由的可靠性和能量效率问题,提出了一种基于代理和位置感知的多径路由发现方案(LABMR).事件节点根据位置信息,动态寻找其到Sink节点之间的特殊中间节点,来构建多径路由.利用移动代理来收集多径路由的局部拓扑结构信息,Sink节点根据代理收集的路由参数来计算路径权值,以此选择最优不相交路径.同时,对于信息的重要性差异,Sink节点选择单条或多条路径来传输数据,在保证传输可靠性的同时减少能耗.与现有的基于代理的多径路由(ABMR)方法相比,LABMP在数据包投递率、能量消耗、额外开销和延迟方面具有更好的性能.     

一种集中调控的分布式服务路径选择算法

在可重构网络多态路由模型中,通常存在多条满足业务需求的服务路径。针对最优服务路径选择问题,该文设计了一种集中调控的分布式服务路径选择算法,各节点根据服务请求中的第1个元能力和目的节点生成路由表,控制器实时监控网络,调控代价过高路径并平衡网络的带宽和负载。性能分析和仿真结果表明,分布式路由表能够生成有效的服务路径,表项规模、收敛时间与元能力个数成正比,在30%的集中调控比例下,路径代价和负载均衡度性能良好,与其他算法相比,对服务请求的响应时延降低约50%。     

Ad hoc网络中不相关多路由源端寻路算法

路由方案是Ad hoc网络中一个热点研究领域。其中,按需路由算法由于其有效性在带宽受限的Ad hoc网络中得到比较大的发展。然而大部分的按需路由算法,建立并只使用单条路由,当前使用的路径的链路断开时,路由算法必须执行一个路由修复过程。提出了不相关多路由源端路由算法（DMSR）,建立并利用多条最大不相关路由。算法中,中间节点等待一段时间以得到多个路由请求包（RREQ）,然后在这个RREQ中,选择相关性最小的多路径,并将这些信息写入一个RREQ中,并将它广播出去。从仿真结果可以看出本文的算法提高了数据包的正确传输率和业务均衡性。     

无线多媒体传感器网络中一种改进路由算法

随着网络负载增加,经典的TPGF( Two-Phase geographic Greedy Forwarding)算法难以找到节点分离路径,会导致网络吞吐量、投递率以及端到端时延性能下降。此外,当网络拓扑变动不大时, TPGF中每条路径所包含节点要消耗比其他节点更多的能量,会导致其过快死亡,从而影响网络性能。为此,将联合网络编码技术引入 TPGF,提出一种编码与能量感知的 TPGF 路由算法( NE-TPGF)。该算法综合考虑节点的地理位置、编码机会、剩余能量等因素,同时利用联合网络编码技术进一步扩展编码结构,充分利用网络编码优势来建立相对最优的传输路径。仿真结果表明, NE-TPGF能够增加编码机会,提高网络吞吐量和投递率,降低端到端时延,并且还有利于减少和平衡节点的能量消耗。     

Secure routing in MANETs using local times

We present a new approach to secure routing in mobile ad-hoc networks based solely on the relative transmission times of overhead packets. Unlike most previous works aimed at securing route computation, we eliminate a key vulnerability (explicitly stated routing metrics) altogether. We introduce the Secure Time-Ordered routing Protocol (STOP), which uses time-based orderings to ensure the establishment of multiple loop-free paths between a source and a destination. STOP is the first routing protocol to use performance-based path selection without source routing, path vectors, or complete topology information, making it far more efficient that similar approaches. We prove that adversaries cannot take any action to manipulate the time-based ordering so as to unfairly gain control of the forwarding topology and, by design, nodes which drop data packets will be avoided. Furthermore, at convergence, traffic load is evenly distributed over the well-performing paths, so adversaries cannot gain complete control over the data flow through temporary good behavior. Simulation results show that the countermeasures in STOP are effective against a variety of attacks from independent and colluding adversaries, and that this improved security does not come at the expense of routing performance.     

A Cross Layer Routing Protocol for Multihop Cellular Networks

We propose a cross-layer routing protocol for a Code Division Multiple Access (CDMA) Multihop Cellular Network (MCN). In designing the routing protocol for MCN, multiple constraints are imposed on intermediate relay node selection and end-to-end path selection. The constraints on relay nodes include willingness for cooperation, sufficient neighbourhood connectivity and the level of interference offered on the path. Path constraints include end-to-end throughput and end-to-end delay. A facile incentive mechanism is presented to motivate the cooperation between nodes in call forwarding. In addition, we present a route resilience scheme in the event of dynamic call dropping. In particular, a fast neighbour detection scheme for route resilience is proposed. Instead of using periodic HELLO messages as in traditional ad-hoc routing, the proposed neighbour detection scheme adopts an explicit handshake mechanism to reduce neighbour detection latency. We conclude the paper by demonstrating the superior performance of the proposed routing protocol compared with the other well known routing algorithms.     

Path selection algorithms for fault tolerance in wireless mesh networks

Recently Wireless Mesh Networks (WMNs) have emerged as a key technology for providing high-bandwidth networking among peer nodes over a specific coverage area. Features such as low cost, ease of deployment, self-configuration and self-healing make them one of the most promising global telecommunication systems. Despite their advantages, however, several research challenges remain in all protocol layers. In this paper, we address the main challenging issues related to the routing aspects in a WMN. Routing in such networks is performed through multi-hop paths where intermediate nodes cooperatively make forwarding decisions based on their knowledge regarding the network topology. However, in an unideal dynamic environment due to frequent or rare node failures/misbehavior, traditional ad-hoc routing protocols suffer from high routing overhead or energy consumption. Motivated by this, we propose several path selection algorithms which adapt to such topology dynamics. The main objective of these routing schemes is to provide fault tolerance without sacrificing the energy and computational complexity efficiency. Numerical investigations, based on extensive simulations, validate the effectiveness of our proposals even when faulty nodes subsist in the environment.     

移动自组网基于动态蜂窝的QoS路由协议

本文为移动自组网提出了一个基于动态蜂窝的QoS路由协议，它利用移动跟踪技术实现了一个分布式动态蜂窝生成协议；采用一个多Qos路由探测算法选择一条能够最大满足QoS要求的路由，并在这条路由上建立端．端主动资源预留；使用移动预测和被动资源预留技术预测源结点和目的结点可能进入的蜂窝集合，并在这些蜂窝集合与目的结点和源结点之间提前进行端．端被动资源预留；融合蜂窝动态检测技术与QoS路由修补技术自动发现和修补断裂的QoS路由．由于该路由协议模仿了固定蜂窝网络中的操作，所以，大大改善了QoS路由的性能．仿真结果表明：在满足QoS条件下，它明显提高了包传输率，减轻了路由负载．     

基于拥塞程度和能量状态的DSR路由协议的改进

无线Ad Hoc网络是由一些无线主机所组成的具有多跳、临时性等特征的网络,这些无线主机还带有无线收发装置;每个无线终端具有路由器和主机两种功能.网络中所有的节点地位平等.无线Ad Hoc网络组网的无基础设施性和自组织性,使它在特定的救灾抢险、军事指挥作战、野外科学考察等特殊场合下得到了广泛的应用.DSR路由协议具有使用源路由机制和路由缓存技术,并且支持中间节点路由回复应答,减少了路由开销等优点.文中主要解决了DSR路由协议节点拥塞、负载不均以及在选择路径时没有考虑节点的能量等问题,经仿真分析比原DSR路由协议在节点的拥塞状态和能量状态方面得到较大的改善.     

基于能量感知的Ad Hoc路由算法研究

针对移动adhoc网络终端能量资源受限对全网路由的影响,提出一种具有终端节点能量感知的路由协议(EARP,energy-awareroutingprotocol).该协议能够根据单个节点能量的使用情况以及全路径的能量消耗情况选择不同的传输路径,在路径断裂时,增加本地维护策略,有效减少了由此引起的发包重传情况,提高了路由效率.通过节点能级的设定,防止链路传输过程中由于能量耗尽而导致的路由断裂情况.经过NS2仿真实验与其他相关路由协议进行比较,结果表明在相同的实验环境下,该路由协议能够有效均衡负载,保护低能量节点,延长网络生存时间     

Shortest Path Evaluation in Wireless Network Using Fuzzy Logic

Evaluation of the shortest path in a wireless network is to ensure the fast and guaranteed delivery of the data over the established wireless network. Most of the wireless protocols are using a shortest path evaluation technique which is based on the random weights assigned to the network nodes. This alone may not be sufficient to get the accurate shortest path for routing process. Most of the shortest path evaluation algorithms perform the blind search to find the shortest routes for routing, this eventually increase the complexity of the whole process itself. This article puts some light on facts of using real time estimated routing delay from source node to other nodes by broadcasting a “knock” message. And this delay is being used to evaluate the shortest path for routing using fuzzy logic. This process is enhanced with its improved inference engine model and furnished fuzzy crisp patterns to deploy the shortest routing path in real time wireless nodes.     

SGMR: A spatial geometry–based multipath routing method on overlay networks

Multipath transmission (MT) promotes transmission quality effectively. Path diversity (PD) impacts MT quality by aggregating capabilities of paths with little correlation. Enough PD contributes to improving concurrent link utilization and weakening negative impacts from a single path so that abilities of congestion and failure tolerance are enhanced. However, PD is hard to guarantee on overlay networks due to little awareness of underlay networks and few evaluation methods. In this paper, we propose the spatial geometry–based multipath routing (SGMR) method to improve PD for MT on overlay networks. Considering that paths are composed of overlay nodes and network coordinates effectively characterize node diversity (ND), we employ some geometric mechanisms on the spatial coordinate–based view to convert ND to PD. Firstly, coordinates are generated to match the overlay and underlay networks and meanwhile to characterize ND. Then, for generating multiple paths, transmission direction facilitates the path convergence, transmission surface constrains intermediate nodes, and deviation angle guarantees link diversity. Simulation and real‐world evaluations demonstrate that SGMR guarantees PD better, and the multipath transmission quality is improved thanks to enough PD.