Performance Evaluation of DISTANCE Routing Algorithm in MANET

• Download source files - 200 Kb

Introduction

Performance Evaluation of DISTANCE Routing Algorithm in MANET  

A mobile ad-hoc network (MANET) consists of wireless mobile hosts (nodes) that communicate with each other over wireless link, in the absence of a fixed infrastructure. Routes between two hosts in MANET may consists of hops through other hosts in the network, due to the limitation of broadcasting range of each host Movement of hosts results in a change of routes. Therefore various algorithms, to find  & maintain routes in MANET is difficult and important task for efficient routing, minimize exchange of routing information, avoid routing loop as well as to reduce route discovery overheads.

In the present work, we propose to evaluate the performance of the Distance Based Routing Algorithms.

(1)   Geographic Distance Routing (GEDIR) :

                                         In GEDIR, a Source Node forwards a message to one of its neighbors that is closest to the Destination Node.  A Node is closest to the destination means it has least Euclidian distance from the destination with respect to the distance between other nodes and destination.

(2)   Location Aided Routing (LAR) algorithms: 

There are two types of LAR Protocols.

 (a) LAR-1 

(b) LAR-2

(a) LAR-1 :   

  In this protocol a Source Node forwards the message to all the nodes that are within the Request Zone. Request Zone is one, that contains the Expected Zone and location of the sender node. Expected Zone is determined as a region that is expected to hold the current location of the Destination Node, by using old location information and average speed of Destination Node.

(b)LAR-2:  

  In this protocol a Source Node forwards the message to all those neighbors that have their distance from destination smaller than the distance between Source Node and Destination Node.

 The following parameters are used for Performance Evaluation:--

                                                    (∑ HopCountForAllTask )

 1.Total Hope Counts =                   -----------------------------------

                                                              N*(N-1)  

                                                    (∑ HopCountForSuccessfullDelivery)

2.Total Successful Hop Counts =    ------------------------------------------------

                                                     (∑ NumberOfSuccessfullDelivery)

3.Total Delivered Number =            Hop Count Of Total Delivered Number.

                                                           (∑ SuccessfullDeliveredNumber)

4.Delivery Rate =                             --------------------------------------------

                                                                N*(N-1)

Here N = Total number of NODES

All these protocols will be implemented in C++ and will be incorporated in NS-2, a Network Simulator that will be used for Simulation. The simulation will consider a network size (number of nodes n) of 100,200 &300, and average network degree (d) of 5,8,10,15 & 20.

The network will be spread over an area of 1000X 1000 Meters. An experiment will be carried out for each pair (n,d) by transmitting messages between 100  randomly selected source-destination pairs. For each (n, d) pairs an experiment will be repeated 20 simulations run.