Laxmi Shrivastava

Performance Evaluation of Routing Protocols in MANET with Different Traffic Loads

The performance of the routing protocols in mobile Ad hoc networks degrades with increasing traffic load. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc On-demand Distance Vector (AODV), Destination-Sequenced Distance-Vector Routing protocol (DSDV), Dynamic Source Routing Protocol (DSR). In this paper we present our observations regarding the performance comparison of the above protocols for varying traffic load in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. Our studies have shown that reactive protocols perform better than proactive protocols.

Comparitive Study of Three Mobile Ad-hoc Network Routing Protocols Under Different Traffic Source

Ad hoc network is a network formed without any central administration which consists of nodes that use a wireless interface to send packet data. Since the nodes in a network of this kind can serve as routers and hosts, they can forward packets on behalf of other nodes and run user applications. A mobile ad hoc network (MANET) is probably the most well-known example of this networking paradigm having been around for over twenty years, mainly exploited to design tactical networks. Furthermore, the multi-hop ad hoc networking paradigm is often used for building sensor networks to study, control, and monitor events and phenomena. To exploit these potentialities, simulation modeling and theoretical analyses have to be complemented by real experiences (e.g., experiences/measurements on real prototypes), which provide both a direct evaluation of ad hoc networks and, at the same time, precious information for a realistic modeling of these systems. In this paper we will simulate the environment used for analyzing, evaluating and implementing AODV, DSR and DSDV routing protocols in MANET, to analyze the performance of above said protocols based on Packet Delivery Fraction, Average End-to-End Delay and Number of dropped data packets. We have compared these three protocols on the basis of two traffic sources and these are TCP and CBR. For our simulation we had used a discrete event simulator known as NS2 (i.e. Network Simulator Ver.2.27)

Load Balanced Congestion Adaptive Routing for Randomly Distributed Mobile Adhoc Networks

In mobile ad hoc networks, congestion occurs due to limited sources of the network, which leads to packet losses, bandwidth degradation and wastes time and energy on congestion recovery. Various techniques have been developed in attempt to minimize congestion in uniformly distributed networks. In this paper, a load balanced congestion adaptive routing algorithm has been proposed for randomly distributed networks. In the proposed algorithm two metrics: traffic load density and life time associated with a routing path, have been used to determine the congestion status and weakest node of the route. The route with low traffic load density and maximum life time is selected for packet transmission.

Load Balanced Congestion Adaptive Routing for Mobile Ad Hoc Networks

In mobile ad hoc networks the congestion is a major issue, which affects the overall performance of the networks. The load balancing in the network alongside the congestion is another major problem in mobile ad hoc network (MANET) routing due to difference in link cost of the route. Most of the existing routing protocols provide solutions to load balancing or congestion adaptivity separately. In this paper, a congestion adaptive routing along with load balancing, that is, load balanced congestion adaptive routing (LBCAR), has been proposed. Transferring of load from congested nodes to less busy nodes and involvement of other nodes in transmission that can take part in route can improve the overall network life. In the proposed protocol two metrics, traffic load density and link cost associated with a routing path, have been used to determine the congestion status. The route with low traffic load density and maximum life time is selected for packet transmission using this protocol. Performance of the network using LBCAR has been analyzed and compared with congestion adaptive routing protocol (CRP) for packet delivery ratio, average end-to-end delay, and normalized routing overhead.

Secure Congestion Adaptive Routing Using Group Signature Scheme

In this paper security concerns in load balanced congestion adaptive routing (LBCAR) algorithm in mobile ad hoc network has been taken care of by using new concept of group signature for secure communication in the network. The performance of network using secure packets in the network has not degraded and has provided security. The proposed algorithm determines congestion status and weakest node of the route with low traffic load density and maximum life time is selected for packet transmission. The results show that it is promising to apply group formation strategy in MANET. The performance of LBCAR algorithm has been analyzed and compared with AODV and DSR and has resulted in reduced packet loss with increased throughput and packet delivery ratio.

Corrective action planning for power system load frequency control

The main objective of Load Frequency Control (LFC) is to maintain reasonably uniform frequency, to divide the load between generators, and to control the tie-line interchange schedules. The LFC is one of the most important issues in power system operation and control for supplying sufficient power of good quality with certain reliability. The control strategies guarantee that the steady state error of frequencies maintained in a given tolerance limit. This paper presents an artificial neural network based on Levenberg-Marquardt algorithm (LMNN) for load frequency control of a power system. A comparison of the efficiency of the proposed ANN based corrective action planning with the conventional integral controller shows the superiority of proposed approach for different loading conditions in wide range.

Effect of Number of CBR Connections on the Performance of a Load Balanced Congestion Adaptive Routing for MANET

Various techniques have been developed in attempt to minimize congestion in uniformly distributed networks. In this paper, a new algorithm, load balanced congestion adaptive routing (LBCAR) algorithm has been proposed for randomly distributed networks in which two metrics: traffic load density and life time associated with a routing path, have been used to determine the congestion status and weakest node of the route and the route with low traffic load density and maximum life time is selected for packet transmission. The proposed algorithm has been simulated on Qualnet 4.5 simulator.

Impact of Antenna Model with the Variation of Speed for Reactive and Hybrid Routing Protocols in Mobile Ad-Hoc Networks

The collection of the many mobile nodes forming a short lived infrastructure with the help of any centralized administration. Since theres a random and dynamic modification in topology due to the quality of host, so the requirement for a study dynamic routing protocol is needed. Mobile ad-hoc network have the attributes like wireless affiliation, continuously dynamic topology, distributed operation and simple deployment. It establishes a short lived affiliation wherever nodes will be part of or leave the network at any time. Communication takes place by routing protocols in effective and economical manner in wireless network. Economical protocols are accustomed forward information packets while not a lot of packet loss. The target of the present paper is to boost the performance of the reactive and hybrid routing protocols with different directional antenna i.e. Omni and Pattern antenna. The performance metrics in the research paper is PDR, NRL, Throughput and Routing Overhead.

A wireless ad-hoc network: Design and performance evaluation of dynamic routing model

This paper describes the identification of potential problems with ad hoc routing protocol that contribute to the overall performance. Another major factor that contributes to routing protocol performance is when wireless nodes move out of coverage area of the other nodes and thus lose connection, or the opposite, where other wireless nodes join the network while on the move and require a dynamic route to a destination; this is defined as the mobility factor. The multimedia model shows how well the routing protocol can handle real-world traffic and guarantee Quality of Service, QoS, for this type of data. The circular model attempts to address for potential problems with ad-hoc routing where there is only one destination node. Lastly, the dynamic model attempts to address problems with an extremely dynamic topology where nodes leave and join the network continually, putting extreme strain on the routing protocol, and network overheads. The main objectives of this project were to investigate these models and appraise their performance after implementation using network simulator, ns-2, and investigate which models work well in which situations.

Performance Evaluation of AODV Using Fuzzy Logic to Reduce Congestion in MANET

Mobile ad-hoc network is an infrastructure less network as it doesn’t follow any particular network topology. In MANET congestion is a major problem in small size networks congestion’s effect is low as compared to the large size networks. Congestion degrades the performance of overall network drastically. Many algorithms have been proposed to handle the congestion famous one are the active que management algorithms (AQMs). But still there is no universally accepted solution for it. In this paper a congestion control solution is devised using fuzzy logic controller. In this node density and load are taken as input and packet drop probability as output, which is effective to control congestion in large networks.