Routing In Wireless Ad-hoc Networks Research Articles

Mobile wireless ad-hoc network routing protocols comparison for real-time military application

Mobile wireless Ad-hoc has become more popular because it forms quickly, has an easy setup, and has easy extensibility. The mobile ad-hoc wireless networks can be further classified according to their applications as follows: Regular user ad-hoc networks are commercial communication that applies to vehicles to help avoid collisions and accidents and live connections to transfer data from car to car. Another application is disaster rescue ad-hoc networking, usually used when a normal infrastructure network is destroyed by storms, earthquakes, tsunamis, etc. Nowadays, a lot of applications, particularly those related to the military and emergency situations, rely on mobile ad hoc wireless networks, where security needs are more challenging to provide than in regular networks. We present the tactical network needs for the military. This platform attempts to assess the possible advantages of mobile ad hoc networks in tactical military applications. This work proposes route discovery using reactive (on-demand) routing protocols where nodes need to just transfer data. This eliminates the requirement for each node to store and maintain any routing tables. This study presents and contrasts the benefits and drawbacks of two fundamental mobile ad hoc routing systems (AODV and DSR). Both protocols are On-Demand routing techniques, and when data needs to be sent, the discovery phase begins. The results of the simulation, the AODV routing approach outperforms the DSV routing method under identical simulated conditions.

Joint congestion and contention avoidance in a scalable QoS-aware opportunistic routing in wireless ad-hoc networks.

Opportunistic routing (OR) can greatly increase transmission reliability and network throughput in wireless ad-hoc networks by taking advantage of the broadcast nature of the wireless medium. However, network congestion is a barrier in the way of OR's performance improvement, and network congestion control is a challenge in OR algorithms, because only the pure physical channel conditions of the links are considered in forwarding decisions. This paper proposes a new method to control network congestion in OR, considering three types of parameters, namely, the backlogged traffic, the traffic flows' Quality of Service (QoS) level, and the channel occupancy rate. Simulation results show that the proposed algorithm outperforms the state-of-the-art algorithms in the context of OR congestion control in terms of average throughput, end-to-end delay, and Packet Delivery Ratio (PDR). Due to the higher PDR at different traffic loads and different node densities, it can be concluded that the proposed algorithm also improves network scalability, which is very desirable given the recent changes in wireless networks.

Wireless Ad Hoc Network Routing Protocols Performance Evaluation under Security Attack

Abstract: A mobile ad hoc network is made up of portable wireless nodes (MANET). The communication between these mobile nodes is not managed centralized. A self-organizing, self-configuring network known as MANET allows mobile nodes to roam around at whim. The mobile nodes can act as a router by receiving and sending packets. Due to the significance of routing in MANET, this thesis also evaluates several routing systems' efficacy. We compared the three routing protocols AODV, DSR, OLSR, and DSDV. Throughput, network load, and latency are the three metrics used to gauge how well-performing different routing systems are. The three routing techniques are well described using metrics. Information is transmitted end-to-end and hop-by-hop over the connections to the destination nodes using the proactive and reactive protocols of MANET. In multi-hop mobile ad hoc networks, energy consumption at the mobile nodes' end and its effective use are crucial factors. Nodes and other routing resources in MANETs cannot afford to run out of battery power while carrying out mission-critical operations like military or rescue missions. The effectiveness of MANET protocols such AODV, DSDV, OLSR, and DSR is studied in this study. Throughput, packet delivery ratio, and energy use are included while computing the Mobile Ad-hoc Networks' performance parameters. The circumstances that were simulated using various simulators are included in the research. The related research compared the performance of several protocols in MANETs with varying node mobility, stop length, and node density while examining the NS-2 scenario. The optimum routing system for mobile ad hoc networks will be identified after a comparison and analysis of these protocols.

A novel congestion control approach for optimal routing in Wireless Adhoc Networks

SummaryCongestion is a demanding issue in WANET owing to dynamic routing and resource constraints. Congestion controlling (CC) is a huge concern in attaining equality among e2e flow control and optimal utilization of network resources. In WANET, with distributed resources, if numerous senders compete for a similar bandwidth link, the data rates should be adjusted to avoid network overload that leads to compromises in QoS. This paper introduces a new routing approach with CC model that deployed MAODV for WANETs. Initially, the destination and source nodes are initialized, and subsequently, the MAODV find out the various routing path. Consequently, SGD‐DLNN recognizes all nodes' congestion status in revealed paths. Further, the MAODV assigns traffic in optimal congestion‐less paths if congestion occurs. Here, the black widow‐mutated cat swarm (BWM‐CS) model is deployed to choose the optimal paths based on traffic load density, life span of path, traffic load, remaining energy, link cost, and path distance. Eventually, the advantage of the suggested model is proven.

Fusion of ACO and PSO Technique Based Optimized Routing for Intellectual Routing in Wireless Ad hoc Networks

Wireless Ad hoc network (WANET) is an assortment of mobile nodes, which energetically custom a provisional network lacking the dependence of any infrastructure. In Dijkstra-Ant Colony Optimization Algorithm (ACO) forStraightas well asHarmlessEmigrationis applied to finding the shortest and safest path. However, this method cannot work perform when nodes are movable. In addition, ACO algorithm increases the power consumption and execution time. To solve the above problem in this work, Fusion of ACO and PSO technique based Optimized Routing (FAPO) for Intellectual Routing in WANET. This approachACOand Particle Swarm Optimization (PSO) technique is proposed to provide optimized routing and reduces link failures. The ACO and PSO techniquesinitiates with creating a greatquantity of mobile nodes in the search space and selects the route with high quality link. The function of the introducedtechnique is measured using the network simulator tool NS-2.

Enhancing Routing for Wireless Ad-Hoc Networks to Improve Quality of Service in Mobile Learning

Enhancing Routing for Wireless Ad-Hoc Networks to Improve Quality of Service in Mobile Learning

Dynamic energy efficient routing protocol in wireless sensor networks

Currently, IEEE 802.11 standard for ad-hoc wireless mode is inadequate for multi-hop network. Recent efforts for the advancement of 802.11 standards, such as 11e for QoS support and 11n for high data rates (> 100 Mbps), are still limited as they are dependent on the wired infrastructure backbone and single-hop wireless communication. One major challenge in quality-of-service (QoS) oriented routing in wireless ad-hoc networks is to find a route that satisfies multiple constraints including energy consumption minimization, delay, node failure and throughput maximization. In this paper, we propose a novel Dynamic Energy Efficient Routing (DEER) protocol that guarantees message delivery, maximum network lifetime and message flow. DEER uses those specific nodes on the fly which has maximum residual energy above a defined energy level for relaying message from a source to a destination. Our proposed approach has been evaluated using realistic channel model and it demonstrates improved session lifetime and efficient data flow compared to Probabilistic Energy Profile, Efficient Hop Count Routing, Dijkstra and Random/opportunistic algorithms. In addition, DEER can lend itself easily to battery-based sensor networks or energy-harvested based sensor networks.

Overview of Power Efficient Routing in Wireless Ad-Hoc Networks

Overview of Power Efficient Routing in Wireless Ad-Hoc Networks

Review on Secure Routing in Wireless Adhoc Networks

Adhoc network, because of dynamic behavior, self sustaining approach, and non-reliability of infrastructure has made this network a major communication approach for future usage. These networks are benefited by adaptive node integration and dynamic routing for data exchange. Adaptive routings has high significance of data exchange, with adaptive network performances such as high throughput, low power dissipation, less interference, and long lasting networks. However with the advantage of having dynamic routing behavior in adhoc network, optimal routing and its selection remains an open issue to solve. To achieve the objective of optimal routing based on node characteristic and network property, various methods were developed in past. This paper, outlines the methods developed towards secure routing for robust and reliable routing in wireless adhoc network. Keyword: Secure routing, Wireless adhoc network, Node characteristic, robust routing.

The Research of Ad Hoc Network Routing Protocols

Wireless Ad Hoc network routing algorithm is one of the core technologies of wireless Ad Hoc networks. Ad Hoc network is dynamic topology on characteristic, mainly reflected on the network node number and node movement, which lead to network topology changes, in order to study the Ad Hoc network size and topology changes influence on packet delivery, time delay and routing control, through experiment it is concluded that, the dynamic source routing protocol is an ideal choice.

Fast Route Convergence in Dynamic Power Controlled Routing for Wireless Ad-hoc Networks

Previous work in wireless ad-hoc network routing has given rise to dynamic power controlled routing, which in turn enables variable-range transmissions. However, one limitation found in such protocols is the inclusion of at most one redirector in the route at each iteration. The work presented here introduces a redirector discovery algorithm which reaches the final route in less iterations, by including the possibility of adding two redirectors in each iterations. With this faster route convergence, greater power savings may be achieved, with the corresponding advantages this brings.

BDD-based Algorithm for the Minimum Spanning Tree in Wireless Ad-hoc Network Routing

Dynamic power controlled routing has become a viable alternative to traditional routing protocols in wireless ad hoc networks, particularly with the goal of making a more efficient power management. The existing schemes in this approach tend to converge to a route comprised of a minimum spanning tree between the source and destination nodes. However, this final route is found by an iterative procedure. In the current paper, a proposal is made which builds the final route in one step, by calculating the corresponding minimum spanning tree using a low complexity algorithm based on BDDs.

A Survey of Geographical Routing in Wireless Ad-Hoc Networks

Geographic routing offers a radical departure from previous topology-dependent routing paradigms through its use of physical location in the routing process. Geographic routing protocols eliminate dependence on topology storage and the associated costs, which also makes them more suitable to handling dynamic behavior frequently found in wireless ad-hoc networks. Geographic routing protocols have been designed for a variety of applications ranging from mobility prediction and management through to anonymous routing and from energy efficiency to QoS. Geographic routing is also part of the larger area of context-awareness due to its usage of location data to make routing decisions and thus represents an important step in the journey towards ubiquitous computing. The focus of this paper, within the area of geographic routing is on wireless ad-hoc networks and how location information can benefit routing. This paper aims to provide both a comprehensive and methodical survey of existing literature in the area of geographic routing from its inception as well as acting as an introduction to the subject.

Effect of Channel Fading on the Performance of Wireless Ad Hoc Network Routing Protocols

In this paper the application spectrum of wireless ad hoc network is a typical battle field monitoring system for the public safety purpose and military sector where the sensor network simulator architecture is used to provide support for sensing capabilities in network nodes for different mobility conditions. Rayleigh and Rician fading (K=3) model is used for the effect of channel fading in the network scenario. The channel fading incurs extra network overhead in the PHY, MAC and Network layer. A comprehensive study on the performance of ad hoc network routing protocols under realistic network scenarios with the effect of channel fading models is presented.

Error Performance Analysis Using Cooperative Contention-Based Routing in Wireless Adhoc Networks

In Wireless Ad hoc network, cooperation of nodes can be achieved by more interactions at higher protocol layers, particularly the MAC (Medium Access Control) and network layers play vital role. MAC facilitates a routing protocol based on position location of nodes at network layer specially known as Beacon-less geographic routing (BLGR) using Contention-based selection process. This paper proposes two levels of cross-layer framework -a MAC network cross-layer design for forwarder selection (or routing) and a MAC-PHY for relay selection. Wireless networks suffers huge number of communication at the same time leads to increase in collision and energy consumption; hence focused on new Contention access method that uses a dynamical change of channel access probability which can reduce the number of contention times and collisions. Simulation result demonstrates the best Relay selection and the comparative of direct mode with the cooperative networks. And also demonstrates the Performance evaluation of contention probability with Collision avoidance.

Cross-layering between physical layer, medium access control, and routing in wireless ad-hoc networks

Routing is a key issue in wireless ad-hoc networks. The goal of an efficient routing strategy is to set up routes so that the overall quality of communications will be the best possible. While the Open Systems Interconnection (OSI) reference model advocates for a clear separation of routing, access, and physical layers, in this paper we show that in scenarios with strongly faded communications, cross-layer interactions have to be carefully considered. More precisely, we compare the performance of the Ad-hoc On-demand Distance Vector (AODV) routing algorithm with that of one of its physical layer-oriented variants, denoted as AODV. It will be clearly shown that no single routing strategy is always optimal and that an intelligent information fusion at the Medium Access Control (MAC) level can be very beneficial.

VCG with Communities on Random Ad Hoc Networks

We study game-theoretic mechanisms for routing in wireless ad hoc networks. Our major results include a combination of theoretical bounds and extensive simulations, showing that VCG-based routing in wireless ad-hoc networks exhibits small frugality ratio with high probability. Game-theoretic mechanisms capture the noncooperative and selfish behavior of nodes in a resource-constrained environment. There have been some recent proposals to use these mechanisms (in particular VCG) for routing in wireless ad-hoc networks, and some frugality bounds are known when the connectivity graph is essentially complete. We are the first to show frugality bounds for random geometric graphs, a well-known model for ad-hoc wireless connectivity. In addition, we generalize the model of agent behavior by allowing sets of nodes to form communities to maximize total profit. We are the first to analyze the performance of VCG under such a community model. While some recent truthful protocols for the traditional (individual) agent model have improved upon the frugality of VCG by selecting paths to minimize not only the cost but the overpayment, we show that extending such protocols to the community model requires solving NP-complete problems which are provably hard to approximate.

Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

In this paper, we first propose three centralized learning automata-based heuristic algorithms for approximating a near optimal solution to the minimum weight Steiner connected dominating set (WSCDS) problem. Finding the Steiner connected dominating set of the network graph is a promising approach for multicast routing in wireless ad-hoc networks. Therefore, we present a distributed implementation of the last approximation algorithm proposed in this paper (Algorithm III) for multicast routing in wireless mobile ad-hoc networks. The proposed WSCDS algorithms are compared with the well-known existing algorithms and the obtained results show that Algorithm III outperforms the others both in terms of the dominating set size and running time. Our simulation experiments also show the superiority of the proposed multicast routing algorithm over the best previous methods in terms of the packet delivery ratio, multicast route lifetime, and end-to-end delay.

Turning heterogeneity into an advantage in wireless ad-hoc network routing

With increasing diversity of wireless devices, heterogeneity in transmission power is expected to commonly appear in ad-hoc networks. We observe that the existence of high-power nodes may adversely affect the performance of traditional ad-hoc routing protocols such as AODV and DSR. A simple fallback strategy (i.e. high-power nodes transmitting at low-power levels) may solve the problem, but may not be efficient since it ignores the extra capability of high-power nodes. In this work, we view different levels of power heterogeneity as different tiers in the network. We propose a Tier-based RoutIng Framework (TRIF) which tackles the asymmetric link problem while taking advantage of long-range transmissions by high-power nodes. In contrast to other approaches that require periodic beaconing, TRIF allows the source to discover paths with symmetric links on the fly. By avoiding dependence on periodic beaconing, TRIF requires low overhead and is robust to network dynamics. TRIF does not require changes to the MAC layer, and can be utilized by any wireless devices that support dynamic transmission power control. TRIF can be leveraged to compute the optimal transmission power level over each link in order to reduce interference. Our simulation results show that TRIF can significantly outperform traditional ad-hoc routing protocols in heterogeneous environments.

Load-balanced broadcast routing in wireless Ad-hoc networks

In wireless Ad-hoc networks, where mobile hosts are powered by batteries, the entire network may be partitioned because of the drainage of a small set of batteries. Therefore, the crucial issue is to improve the energy efficiency, with an objective of balancing energy consumption. A greedy algorithm called weighted minimum spanning tree (WMST) has been proposed, in which time complexity is O( n 2). This algorithm takes into account the initial energy of each node and energy consumption of each communication. Simulation has demonstrated that the performance of the proposed algorithm improves the load balance and prolongs the lifetime.