Sanjay K. Dhurandher, Mohammad S. Obaidat, Fellow of IEEE and Fellow of SCS, Siddharth Goel and...

Post on 18-Jan-2016

230 views 0 download

Tags:

Transcript of Sanjay K. Dhurandher, Mohammad S. Obaidat, Fellow of IEEE and Fellow of SCS, Siddharth Goel and...

Sanjay K. Dhurandher, Mohammad S. Obaidat, Fellow of IEEE and Fellow of SCS, Siddharth Goel and Abhishek Gupta

CAITFS, Division of Information Technology, Netaji Subhas Institute of Technology, University of Delhi, New Delhi, India

Department of Computer Science & Software Engineering, Monmouth University, NJ, USA

IEEE Globecom 2011

Optimizing Energy through Parabola Based Routing in Underwater Sensor Networks

OutlineIntroductionParabola Based Routing AlgorithmSimulation Analysis and ResultsConclusions

IntroductionOcean researchers have already started with the tasks

of follows:Ocean samplingEnvironmental monitoringPollution monitoringTactical surveillanceDisaster prevention

IntroductionIt is necessary to transmit information in the water

mediumThe existing terrestrial routing algorithm cannot work

on underwater sensor networksRadio waves

Higher attenuationsAcoustic sound waves

Large propagation delay Small bandwidth Poor link quality Large energy consumption

GoalProposed an energy efficient routing protocol that

overcomes all of those problems associated with underwater channels

Parabola Based Routing AlgorithmAssumption

High density scenarioSensor nodes and receiver nodes are fixedEach node is aware of its own coordinates

Parabola Based Routing AlgorithmDescription of PBR Algorithm

1. Sender node broadcast a HELLO packet2. Relay node reply a LOC packet3. Sender node maintains a table for all the nodes falling

inside the region4. Choosing the largest distance from the sender node as the next_node5. Check the energy value whether less than the predefined threshold energy or not

Parabola Based Routing Algorithm

(0,a)

B

A

C

D

x=2x=-2

y=4E

F

H

I

G

Sender

Relay nodes

Hello

Hello LOC

LOC

Hello

sender location, sender ID, packet ID

LOC

relay location, relay ID, energy value

0)(4)( 12

1 yyaxx

J

K

L

M

N

Data

Data ACK

ACK

ACK

packet ID

Hello

Hello LOC

LOC Hello

Hello

Parabola Based Routing Algorithm

Relay

Node ID

X Y dEnergy

value

A-

0.52.5

2.54

35

B 2 3.54.03

51

C -1 11.41

26

D 0 33.00

10

E-

1.56

6.18

25

F -1 77.07

43

G 1 88.06

8

H -3 88.50

86

I 1.5 6.56.67

72

Sender(0,0)

(0,a)

B

A

C

D

x=2x=-2

y=4E

F

H

I

G

Maintained by a node on receiving LOC packet

Simulation Analysis and ResultsSimulation Setup

Scenarios Static and mobile

Grid topology 900 m * 900 m

N nodes 81, 100, 169, 256, 289

Transmission power

3.0 dBm

Packet generate time

480 ms

Packets 100

Packet length 512 bytes

Energy consumed Transmitting data, HELLO, LOC, ACK packets 1JCalculating distance, updating table 0.5 J

Simulation Analysis and ResultsPacket Delivery Ratio-Static Scenario

Simulation Analysis and ResultsEnergy Consumption-Static Scenario

Simulation Analysis and ResultsPacket Delivery Ratio-Mobile Scenario

Simulation Analysis and ResultsEnergy Consumption-Mobile Scenario

Simulation Analysis and ResultsAverage Time-Mobile Scenario

ConclusionsThis paper proposed a new algorithm which uses the

properties of a “Parabola” in order to transmit data packets from source to destination

The simulation results show the superior quality of PBR than DSR in static as well as mobile scenarios

~Thanks for your attention~