con Ram ppt.ppt

7/28/2019 con Ram ppt.ppt

1/12

PRESENTED BY

K.RAMACHANDRAN

1168009

M.E- COMMUNICATION ENGINEERING

GUIDED BY

MRS.P.CHITRA.,M.E.,

ASSOSIATE PROFESSOR

DEPARTMENT OF ELECTRONICS AND

COMMUNICATION

CIT

Energy-Efficient Localized Routing in

Random Multihop Wireless Networks


2/12

Publication of International Journal on

Modeling & Simulation

2

Introduction

Ad hoc networks are infrastructureless networks.

There is no central base station and thus they aredecentralized networks.

Since all the nodes in the network are under mobility, the

network topology is dynamic in nature.

Ad hoc networks:

ROUTING:

It is the process of selecting paths in a network along which

to send network traffic.


3/12



3

Introduction

Rapidly deployable, self configuring.

No need for existing infrastructure.

Wireless links.

Nodes are mobile, topology can be very dynamic.

Nodes must be able to relay traffic since communicating nodes

might be out of range.

A MANET can be a standalone network or it can be connected

to external networks (Internet).

MANET


4/12

Available Protocols

Table driven

Frequent updates

Global information

Transmission delay to mobility matching.

No scalability

10-15% overheads


5/12

Publication of

International

Journal on

Modeling &Simulation

Alternates

Uses only local information to make routing decisions.

No complete topology information is needed.

Any low power GPS system is use to locate the nodes.

Overheads are reduced considerably.

5

Localized Routing


6/12

Publication of

International

Journal on


Greedy Routing

Geographic location of a mobile destination may not be known

Message gets stuck in a local minimum.

If nodes are not equipped with a GPS, it cant find its location.

6

In Greedy routing messages are always forwarded to the neighbor that is

closest to the destination.

Disadvantages


7/12

Publication of

International

Journal on


Face Routing

The path found may not be neither shortest nor energy efficient.

Number of hops may be increased.

7

The idea of face routing is to walk along the faces which are intersected

by the line segment between the source and the destination.

Disadvantages


8/12

Publication of

International

Journal on


LEARNRouting

8

LEARN selects the neighbor inside a restricted neighborhood (defined bya parameter) that has the largest energy mileage (i.e., the distance traveled

Per unit energy consumed) as the next hop node.

Energy mileage is the ratio between the transmission distance and the

energy consumption of such transmission, i.e (x /c(x)).

For destination node t, an intermediate node u will only select a neighbor

v such that vut for a parameter < /3 in our LEARN method.

For >/3 our LEARN method will not be able to find an energy efficient

neighbor.

When no node v satisfy that vut , then greedy routing is applied

afterward, then the routing protocol is called LEARN-G. If the Face routing

is used, then the routing protocol is called LEARN-GF.


9/12

Publication of

International

Journal on


LEARNRouting

9

r0 is the value such that r0/c(r0) = maxx (x /c(x)). i.e maximum energy

mileage.

To extend the LEARN routing completely instead of Greedy and Face

routing is the goal.


10/12

Future work

The proposed routing is extended into three-dimensional (3D) networks

(such as underwater sensor networks).

The classical greedy routing, LEARN routing protocol can be applied in

3D networks not directly but with some modifications.

But the restricted region now is a 3D cone with volume D.


11/12



11

REFFERENCE

[1] Yu Wang, Xiang-Yang Li, Wen-Zhan Song, Energy-Efficient LocalizedRouting in Random Multihop WirelessNetworks, IEEE TRANSACTIONS

ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 22, NO. 8,

AUGUST 2011

[2] T. Melodia, D. Pompili, and I. F. Akyildiz, Optimal local topology

knowledge for energy efficient geographical routing in sensornetworks, in

IEEE INFOCOM, 2004.

[3] Xiaoyang Guan, Face Routing in Wireless Ad-hoc Networks,

University of Toronto,2009.

[4] Yu Wang, Wen-Zhan Song, Weizhao Wang, Xiang-Yang Li, Teresa A.

Dahlberg. Localized Energy Aware Restricted Neighborhood Routing for

Ad HocNetworks, Illinois Institute of Technology, Chicago[5] Roland Flury, Sriram V. Pemmaraju, Roger Wattenhofer, Greedy

Routing with Bounded Stretch, ETH Zurich, Switzerland The University of

Iowa, USA


12/12

Publication of

International

Journal on


12

THANK YOU

Documents

con Ram ppt.ppt