Energy efficient Routing Protocol in Manets

1

ENERGY EFFICIENT ROUTING PROTOCOL IN MANET’s-GND

PROTOCOL

Team members,R.Saranya (100105605091) M.Vignesh (100105605115)E.K. Sujay (110405605020)M.Tharanya (110405605021)

Supervised By, D.Jayachandran M.E.,[Ph.D]

3-Apr-14

2

INTRODUCTION

• High mobility of nodes in MANET creates frequent path failures, route discoveries overhead and Energy consumption

• Neighbor coverage based probabilistic rebroadcast protocol for reducing routing overhead in MANETs

• Novel rebroadcast delay to find the rebroadcast order, and the more accurate additional coverage ratio by sensing neighbor coverage knowledge

• To reduce the routing overhead, and improve the routing performance

• Using GNDA to make the energy efficient network and avoid selfishness Problem

3-Apr-14

3

EXISTING SYSTEM

• Challenges of MANETs is the design of dynamic routing protocols with good Energy efficient and less overhead

• The conventional on-demand routing protocols use flooding to discover a route

• Obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge.

• Decrease the no of retransmissions to reduce the routing overhead, improve the routing performance

• They broadcast a RREQ and RREP packets to the networks

3-Apr-14

4

DISADVANTAGES

• Broadcast a Route REQuest packet, leads to a considerable number of packet collisions, in dense networks

• Node mobility in MANETs, frequent link breakages may lead to frequent path failures and route discoveries

• Increase the energy consumption in nodes• No Awareness about Energy levels of Nodes• Chance for Partial and Fully selfishness Problem.• Node Failure

3-Apr-14

5

PROPOSED SYSTEM

• Make a energy efficient Network• Combines the advantages of the neighbor coverage knowledge

and the probabilistic mechanism• Reduces the routing overhead , delay by decrease the number of

retransmissions• GNDA-Good Node Detecting Algorithm is used to overcome

the Energy problems.• The node’s energy level is calculated based on the strength of

Route Reply.• GNDA select the node of high energy, packets are sent through

the high energy nodes among the neighbor nodes• Avoid the selfishness Problem by selecting higher energy nodes3-Apr-14

6

ADVANTAGES

• Limiting the number of rebroadcasts can effectively optimize the broadcasting

• The neighbor knowledge methods perform better than the area based ones and the probability based ones

• Avoid the selfishness Problem by using GNDA• Using GNDA algorithm, reducing the energy consumption of

Nodes• Increase Network Lifetime • Reduce the possibility of Link Breakage often.

3-Apr-14

7

ARCHITECTURE

Node Deployment

Source transmits route request packets

Data transmission

y

Route discovery based on NCPR

with energy calculation using

GNDA

Destination transmits Route

Reply

Performance Analysis

3-Apr-14

8

MODULES

• Node Deployment• Route Discovery based on GNDA• Data transmission• Performance Analysis

3-Apr-14

9

NODE DEPLOYMENT

• Node Deployment is the first module of the Project.

• The mobile nodes are to be deployed.

3-Apr-14

10

NODE DEPLOYMENT

NODE DEPLOYMENT

SET THE POSITION FOR NODES

3-Apr-14

11

CODING

• # Node Selection

for {set i 0} {$i < $val(nn) } {incr i} {set node_($i) [$ns_ node]$node_($i) random-motion 0 ;# disable random motion

}

$ns_ at 0.00 "$node_(0) setdest 10.364418416244 600.438009831261 0" # node initial position

$ns_ at $t "$node_(0) setdest [expr 10.364418416244+$xa] 600.438009831261 $s" #node movement

3-Apr-14

12

SCREEN SHOT

3-Apr-14

SCREEN SHOT FOR NODE DEPLOYMENT:

13

ROUTE DISCOVERY

• Route Discovery through – NCPR• GNDA - select the energy efficient node to

transmit the data.• Two nodes exists Same energy – Calculate

Distance• Choose high priority – select the node

3-Apr-14

14

ROUTE DISCOVERYROUTE DISCOVERY BASED ON ENERGY CALCULATION

IF(SAME ENERGY)

YESCALCULATE THE DISTANCE

SET THE PRIORITY

IF(HIGH PRIORITY)

SELECT THE NODE AS INTERMEDIATE NODE

YES

YES

NO

OMIT THAT NODE

3-Apr-14

15

CODING

• $ns_ attach-agent $node_(0) $udp_(0)set null_(0) [new Agent/Null]$ns_ attach-agent $node_(8) $null_(0)$ns_ connect $udp_(0) $null_(0)$udp_(0) set fid_ 2set cbr_(0) [new Application/Traffic/CBR]$cbr_(0) attach-agent $udp_(0)$cbr_(0) set type_ CBR$cbr_(0) set packet_size_ $ps$cbr_(0) set rate_ $dr$cbr_(0) set random_ false$ns_ at 1 "$cbr_(0) start"

3-Apr-14

16

CODING if (($5=="---" && $7=="tcp") || ($5=="---" && $7=="cbr")) {

old_data=old_data + $6

print $2, old_data*42.0/$2/100000

}

Distance Calculation set nbr [open Neighbor a]

set x1 [expr int([$n1 set X_])]set y1 [expr int([$n1 set Y_])]

set x2 [expr int([$n2 set X_])] set y2 [expr int([$n2 set Y_])] set d [expr int(sqrt(pow(($x2-$x1),2)+pow(($y2-$y1),2)))]

if {$d<300} {

if {$nd2!=$nd1} {puts $nbr "\t$nd1\t\t$nd2\t\t$x1\t\t$y1\t\t$x2\t\t$y2\t\t$d“ }

3-Apr-14

17

SCREEN SHOT

3-Apr-14

SCREEN SHOT FOR ROUTE DISCOVERY:

18

DATA TRANSMISSION

• After reaches the destination node – Sends Route reply packets to source node

• Transmit the data from source node to destination node through energy efficient intermediate nodes.

• If any path failure occurs again starts route discovery

3-Apr-14

19

DATA TRANSMISSION

Route Discovery based on GNDA

Data Transmission

IF(PATH FAILURE)

Data Transmission

YES

3-Apr-14

20

CODING

• $ns_ attach-agent $node_(0) $udp_(0)set null_(0) [new Agent/Null]$ns_ attach-agent $node_(8) $null_(0)$ns_ connect $udp_(0) $null_(0)$udp_(0) set fid_ 2set cbr_(0) [new Application/Traffic/CBR]$cbr_(0) attach-agent $udp_(0)$cbr_(0) set type_ CBR$cbr_(0) set packet_size_ $ps$cbr_(0) set rate_ $dr$cbr_(0) set random_ false$ns_ at 1 "$cbr_(0) start"

3-Apr-14

21

SCREEN SHOT

3-Apr-14

SCREEN SHOT FOR DATA TRANSMISSION:

22

PERFORMANCE ANALYSIS

Finally we analyze the performance between NCPR and GNDA based on

»Delay»Overhead» Throughput

3-Apr-14

23

PERFORMANCE ANALYSIS

GRAPH GENERATION FOR NCPR

GRAPH GENERATION FOR GNDA

COMPARE THOSE GRAPHS

3-Apr-14

24

CODING• wireless-out.tr > throughput1_GNDP

exec xgraph throughput1_GNDP -x "Time" -y "Throughput(kbps)" &exec awk -f graph3.awk wireless-out.tr > Delayexec xgraph GNDP_Delay -x "Time" -y "Delay(bytes)" &

• BEGIN{sim_end = 30;i=0;while (i<=sim_end) {sec[i]=0; i+=1;};

}

{if ($1=="D" && $7=="cbr") {sec[int($2)]+=$8;};

}

END{i=0;while (i<=sim_end) {print i " " sec[i]*8; i+=1;};

}

3-Apr-14

25

SCREEN SHOTComparison between NCPR and GNDP based on Delay:

3-Apr-14

26

Comparison between NCPR and GNDP based on Overhead:

3-Apr-14

27

Comparison between NCPR and GNDP based on Throughput:

3-Apr-14

28

SYSTEM SPECIFICATION

SOFTWARE REQURIEMENTS:• Tools : NS2.34• Os    : Linux (Ubuntu 10.04)

LANGUAGE:    • TCL (Tool Command  Language)

HARDWARE REQUIREMENTS:•    Hard Disk Space          :  Minimum of 20 GB•    RAM        :  Minimum of 512 MB• Processor : Intel Core 2 Duo

3-Apr-14

REFERENCES

[1] Xin Ming Zhang, Member, IEEE , En Bo Wang, Jing Jing Xia and Dan Keun Sung, Senior Member, IEEE, “A neighbor Coverage-Based Probabilistic

Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks,” Proc. of IEEE Vol 12,No 3, 03,2013

[2] X. Wu, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, “Routing Overhead as A Function of Node Mobility: Modeling Framework and Implications on Proactive Routing,” Proc. of IEEE MASS’07, pp. 1-9, 2007

[3] J. Kim, Q, Zhang, and D. P. Agrawal, “Probabilistic Broadcasting Based on Coverage Area and Neighbor Confirmation in Mobile Ad hoc Networks,” Proc. of IEEE GLOBECOM’04, 2004

[4] B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc’02, pp. 194-205, 2002

Queries

Thank you