Sarita Singh Bhadauria

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.

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.

Agent based Bandwidth Reservation Routing Technique in Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), inefficient resource allocation causes heavy losses to the service providers and results in inadequate user proficiency. For improving and automating the quality of service of MANETs, efficient resource allocation techniques are required. In this paper, we propose an agent based bandwidth reservation technique for MANET. The mobile agent from the source starts forwarding the data packets through the path which has minimum cost, congestion and bandwidth. The status of every node is collected which includes the bottleneck bandwidth field and the intermediate node computes the available bandwidth on the link. At the destination, after updating the new bottleneck bandwidth field, the data packet is feedback to the source. In resource reservation technique, if the available bandwidth is greater than bottleneck bandwidth, then bandwidth reservation for the flow is done. Using rate monitoring and adjustment methodologies, rate control is performed for the congested flows. By simulation results, we show that the resource allocation technique reduces the losses and improves the network performance.

Artificial neural network design of stub microstrip band-pass filters

In this paper, an artificial neural network (ANN) design technique for a stub microstrip band-pass filter is presented. Essential dimensions of the microstrip filter layout are used to get the relationship of the input-outputs for ANN model. This paper presents the design and analysis of stub microstrip band-pass filter at mid-band frequency 1.8 GHz, which produced improved bandwidth and minimum insertion loss of –0.5899 dB and return loss of –36.67 dB. Artificial neural network architecture has been proposed to determine the magnitude variation of scattering parameters (S-parameters) of the microstrip band-pass filters for various dimensions. The ANN model produced has been exposed to be as exact and veracious as an EM simulator and it is computationally more effective in the design. The simulation is performed using the commercial software IE3D 14.1 and ANN training of S-parameters are performed in MATLAB 7.1.

Designing Stepped Impedance Microstrip Low-Pass Filters Using Artificial Neural Network at 1.8 GHz

In this paper a design technique for a Stepped impedance Micro strip Low-pass filters is presented by using the artificial neural network (ANN) modeling method. Required dimensions of the micro strip filter layout are used to get the input-output relationships in the ANN model. This paper presents the design and analysis of Stepped impedance Micro strip Low-pass filters at cut-off frequency 1.8 GHz which gives insertion loss (S21) of-3 dB at cut-off point. Subsequently an artificial neural network model is developed to find out the Magnitude variation of scattering parameters (S-parameters) of Micro strip Low-pass filters at 1.8 GHz for different dimensions. After developing the ANN model of micro strip low-pass filter, it is computationally more efficient in the design and it has been displayed to be as accurate as an Electromagnetic simulator. The simulation is performed using the commercial software IE3D 14.1 and MATLAB programming language GUI Tools are used for ANN Training.

TCP and UDP Based Analysis of AODV and OLSR in Mobile Ad-Hoc Networks

A mobile ad hoc network (MANET) is a network consisting of a set of wireless mobile nodes that communicate with each other without centralized control or established infrastructure. Routing is a critical task in MANET as the nodes are moving. We compare the performance of two prominent routing protocols in MANET: Ad hoc On-Demand Distance Vector Routing (AODV) and Optimized Link State Routing (OLSR) protocol. The performance differentials are analyzed using various metrics like packet delivery ratio, packet lost and routing overhead are simulated using NS2. The paper describes all the parameters used for the simulations in detail. Under certain circumstances it is observed that AODV outperforms extremely well.

Agent Based Congestion Control Routing for Mobile Ad-hoc Network

In Mobile Ad hoc Networks (MANETs) congestion occurs due to the packet loss and it can be effectively reduced by involving congestion control scheme which includes routing algorithm and a flow control at the network layer. In this paper, we propose to design and develop an agent based congestion control technique for MANETs. In our technique, the information about network congestion is collected and distributed by mobile agents (MA). The nodes are classified into four categories based on its traffic class. The MA measures the queue length of the various traffic classes and the channel contention and estimates the total congestion metric to find the minimum congestion level in the network. The congestion metric is applied in the routing protocol to select the minimum congested route. By simulation results, we show that our proposed technique attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

Framework and Implimentation of an Agent Based Congestion Control Technique for Mobile Ad-hoc Network

In Mobile Ad hoc Networks (MANETs) obstruction occurs due to the packet failure and it can be successfully reduced by involving congestion control scheme which includes routing algorithm and a flow control at the network layer. In this paper, we propose to framework and implimentationan agent based congestion control technique for MANETs. In our technique, the information about network obstruction is collected and disseminated by mobile agents (MA). The nodes are classified into four categories based on its traffic class. The MA measures the get in line length of the various traffic classes and the channel disagreement and estimates the total congestion metric to find the minimum congestion level in the network. The congestion metric is applied in the routing protocol to select the minimum congested route. By simulation results, we show that our proposed technique attains high delivery ratio and throughput with reduced delay when compared with the presented technique.

A Temporal Database Compression with Differential Method

days it is very tedious job to keep files for personal as well as commercial computing. There are various type of compressing technique used, but one step ahead from them available technique is described here. Almost every application the backend used is database. That why my technique is dedicated to this type of databases. In this proposed technique we consider every type of compression, but when comes to date and time based database, not much compression technique deals with it. For text type compression there are many techniques same for images. But here we are proposing mainly for time and date type data bases. The practical use for this compression may useful for LIC policies, Stock Exchange, Railways Reservations databases etc. It may also useful for Employees working in a firm, maintaining daily database for salary purposes like Time in and Time out. For this type of database the proposed technique will give a big amount of compressions than any other type of techniques. We have techniques regarding database compression are character, memo, number, date, time compression which can work for individual fields in a database. In this paper main concentration has been given for time compressions. We suggested one example in tabular form on that our differential and time method has been applied.