Designer 1

8/8/2019 Designer 1

1/28

PRAVIN KUMAR(07EC75)SANTOSH KUMAR(07EC58)

PROJECT GUIDEDR. M. KULKARNIProfessor,Dept. of Electronics &

Communications,NITKSURATHKAL

8/8/2019 Designer 1

2/28

PRESENTATION PLAN

Friday, November 12, 2010National Institute of Technology, Surathkal2

1. AIM

2. APPROACH TOWARDS THE PROBLEM SOLVING

3. IMPLEMENTATION SCHEME

4. FUNCTIONAL BLOCK DIAGRAM5. SIMULATION RESULTS

6. TARGETS FOR NEXT SEM

7. REFERENCES

8. ACKNOWLEDGEMENT

8/8/2019 Designer 1

3/28

AIM


y To design an Energy Aware Hop based routing protocol forWireless Sensor Networks.

y

To minimize the residual energy consumption of sensornodes without considerable effect on performance usingData compression and Data Aggregation.

8/8/2019 Designer 1

4/28

APPROACH TOWARDS THE PROBLEM

SOLVING


y Papers on Energy Aware Routing for WSNs have beencollected and studied.

y

An analysis of various energy aware routing protocols hasbeen made.

8/8/2019 Designer 1

5/28

Energy-Aware Routing Protocol (EARP)

Raminder P. Mann et al


y The table retains all the paths that are less likely to be expired.

y The same path can be used, if the communication between thesame set of nodes have to be established

y Route check request (RCR) packet is sent

y If there is a break in the path Route Errorpacket will be sent

8/8/2019 Designer 1

6/28

Energy Efficient AODV

Uk-Pyo Han et al.


y Residual energy of the intermediate nodes will be considered

y Minimum Residual Energy (Min-RE) field in RREQ

y E=

Min- RE/k. No- Hopsy Path with maximum E is considered

8/8/2019 Designer 1

7/28

Minimum Residual Energy Aware

Protocol (MREAP)


y Deciding factor: Minimum residual energy(MRE) of thecritical node for selecting the optimal path among variouspaths available for data transmission.[7]

y

Advantage: Energy aware

Considers only those paths that have higher residual energy.

y Disadvantage:

Higher latency .Average lifetime may be good but some nodes may die too

early.

8/8/2019 Designer 1

8/28

Hop Based Normal AODV Protocol :


y Deciding factor : Minimum hop count between the nodesy Path is utilized till the MRE of the critical node falls below the

threshold for transmission/forwarding

y

Advantage: It is latency aware Considers only those paths that have less delay Faster transmission,hence good performance.y Disadvantage: Less energy aware Uses even a lower residual energy path if its hop no. less Lead to network partitioning

8/8/2019 Designer 1

9/28


Protocol(EEAODV)


Improvement over AODVDeciding factor: Value ofy Residual energy of the intermediate nodes will be considered[I].

y

Introduction of Minimum Residual Energy (Min-RE) field RREQpacket.

y After destination receiving the RREQ messages ,it computes thefactor

y = Min-RE/K. No-Hops-----------------(1)

y Path with the maximum will be selected as it includes pathwith maximum residual energy and minimum no. of hops.

8/8/2019 Designer 1

10/28


Protocol(EEAODV)


y Advantage: More energy aware and takes care of the performance as well.

Better than AODV

Better than the MREAP since it takes the delay factor intoaccount.

y Disadvantage: It again exhausts the path of the largest till that path is

removed from the list. Instead of being energy distributive from the beginning it is again

killing critical nodes of one of the paths much sooner than others.

8/8/2019 Designer 1

11/28

Energy Efficient Threshold Based Multi

hop Routing Algorithm(EETMHRA)


y Improvement on EEAODVy Deciding factor: Value of and Threshold comparisony

Introduction of variable thresholds.y Redistribution of energy consumption from the beginning

y As soon as the critical node goes below the first threshold thenext best path is selected while retaining the previous pathfor later consideration.

y When all the paths are exhausted once again the best pathwith highest value of the factor is used till it goes belowthe second threshold.

8/8/2019 Designer 1

12/28

ASSUMPTIONS


y NODES The nodes are randomly deployed. The nodes are in one of the two modes: Sleep mode: It only senses data and is in low energy consumption model with

no transmissions taking place.

Active mode: It is Transmitting/receiving/forwarding packets as well assensing. It is a high energy consumption mode. All nodes maintain a byte sequence of 1s and 0s for their one hop neighbor. All

the nodes at a distance of one hop are neighbors of that node. A 1 signifieshealthy status of the node while a zero signifies weak/dead status of node.

y BASE STATION

Base station calculates all possible routes, their hop count, their factor anddecides the thresholds.

Base Station has the information of the neighbors of each node and theirresidual energies.

8/8/2019 Designer 1

13/28

ASSUMPTIONS


y Each node sends this information only when it has a 1 changing tozero event to Base station to update its Adjacency matrix.

y Total energy in forwarding each packet is 0.1 J on normalizedscale such that the base station has energy as 1.000.

y Source node has enough energy to send message packetsdesired by the base station. Because if it is so then it isan unavoidable situation in which no protocol canwork.

y Energy for Transmission is 0.06J and that of reception is 0.04J.y Nodes below thresholds at different stages suggest they are dead

for the time being and hence not used.

8/8/2019 Designer 1

14/28

Data Transmission


y The transmitting node will send a control packet to sinknode containing the number of packet needed to transmit.

y Sink node checks whether all packets can be transmitted by

the same path or not.y If not, it will inform the source node about the next best

path ( as sink node has all information about all other nodes).

8/8/2019 Designer 1

15/28

ALGORITHM


8/8/2019 Designer 1

16/28

Energy Efficient Threshold Based Multi

hop Routing Algorithm(EETMHRA)


y Advantage: It is more energy aware and takes care of the performance as well. Better than AODV Better than the MREAP

Better than Energy Efficient AODV Even consumption of energy from all the paths so nodes have

higher average lifetime and network life is more.y Disadvantage: Delays will be more since path calculations are done after the first

and second thresholds. As we increase the no. of thresholds the energy distribution of

consumption improves but the delay term goes on increasing

8/8/2019 Designer 1

17/28

RESULTS


8/8/2019 Designer 1

18/28


8/8/2019 Designer 1

19/28


8/8/2019 Designer 1

20/28


8/8/2019 Designer 1

21/28


8/8/2019 Designer 1

22/28

CONTRIBUTION


y LITERARY SURVEY-Study of papers /books on

WSN & routing protocols- Santosh Kumar & pravin

kumar

y ALGORITHM DEVELOPMENT: pravin kumar

y MATLAB CODE DEVELOPMENT AND

SIMULATION:Santosh Kumar & pravin kumar

y PPT PREPARATION:Santosh kumar

8/8/2019 Designer 1

23/28

TARGETS FOR NEXT SEM


To devise a proper Energy EfficientRouting Algorithm

2 MONTHS

Improvement of the already developedalgorithm and simulation of the same.

1 MONTH

Study & implementation of Compression &data aggregation algorithm

1 MONTH

Real Time Environment Simulation on Qual-Net or NS-2

1 MONTH

Hardware implementation on FPGA 1 MONTH

8/8/2019 Designer 1

24/28

REFERENCES

Friday, November 12, 2010National Institute of Technology, Surathkal

24

y Published Papers

y Uk-Pyo Han, Sang-Eon Park, Young-Jun Chung, An EfficientEnergy AwareRouting Protocol for Wireless Sensor Networks

Courtesy:http://iec.cugb.edu.cn/WorldComp2006/ICW4674.pdf

y I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, Wireless SensorNetworks:A Survey, ComputerNetworks, vol. 38, no. 4, 2002, pp. 393-422.

y R Vidhyapriya, DrP T Vanathi, Energy Aware Routing for Wireless Sensor

Netw

orks, International Conference on Signal Processing, CommunicationsandNetworking, ICSCN 2007.

y Sinem Coleri Ergen and Pravin Varaiya, On Multi-Hop Routing for EnergyEfficiency, IEEE Communications Letters, Vol. 9, No. 10, October 2005

8/8/2019 Designer 1

25/28

REFERENCES


25

y Jisul Choe, Keecheon Kim, EADD: Energy Aware DirectedDiffusion for WirelessSensor Networks, International Symposium on Parallel and Distributed Processing withApplications, IEEE ComputerSociety, 2008

y RaminderP. Mann, Kamesh R. Namuduri, Ravi Pendse, Energy-Aware RoutingProtocol forAd HocWireless Sensor Networks, EURASIPJournal on WirelessCommunications and Networking 2005:5, 635644

y CurtSchurgers, Mani B. Srivastava, Energy EfficientRouting in Wireless SensorNetworks [Courtesy:www.citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.11

y AndrewS Tanenbaum, Computer Networks, 4e,Pearson Education,2003

y http://www.tmcnet.com/usubmit/-bluetooth-low-energy-forecast-dominate-wireless-sensor-network-/2010/07/01/4880244.htm Author-Q2 2010 Report(M2 PressWIRE ViaAcquire Media NewsEdge) Dublin-Research and markets.

8/8/2019 Designer 1

26/28


26

8/8/2019 Designer 1

27/28

ACKNOWLEDGEMENT


27

SPECIAL THANKS TO

OUR PROJECT GUIDE-Dr. M.KulkarniDept.of Electronics and Communications ,NITK Surathkal

y Research Scholar-Mr. K S Shivaprakasha

8/8/2019 Designer 1

28/28


28

Documents

Designer 1