Energy-Efficient Localized Routing in Random Multihop Wireless Networks

PRESENTED BY K.RAMACHANDRAN 1168009 M.E- COMMUNICATION ENGINEERING GUIDED BY MRS.P.CHITRA.,M.E., ASSOSIATE PROFESSOR DEPARTMENT OF ELECTRONICS AND COMMUNICATION CIT

Introduction
Ad hoc networks:

Ad hoc networks are infrastructureless networks. There is no central base station and thus they are decentralized networks.

Publication of International Journal on Since all the nodes in the network are under mobility, the Modeling & Simulation
network topology is dynamic in nature.
ROUTING:

It is the process of selecting paths in a network along which to send network traffic.
2

Introduction
MANET Rapidly deployable, self configuring.

No need for existing infrastructure.

Wireless links. Nodes are mobile, topology can be very dynamic.

Publication of International Journal on Nodes must be able to relay traffic since communicating nodes Modeling & Simulation
might be out of range. A MANET can be a standalone network or it can be connected to external networks (Internet).

Available Protocols
Table driven Frequent updates Global information

Transmission delay to mobility matching.

No scalability 10-15% overheads

Alternates

of Uses only International local information to make routing decisions. Journal on No complete topology information is needed. Modeling & Simulation Any low power GPS system is use to locate the nodes.
Overheads are reduced considerably.

Publication Localized Routing

Greedy Routing

Publication of International closest to the destination. Journal on Modeling & Simulation Disadvantages

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

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.

Face Routing

Publication of International by the line segment between the source and the destination. Journal on Disadvantages Modeling & Simulation The path found may not be neither shortest nor energy efficient.
Number of hops may be increased.

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

LEARN Routing
LEARN selects the neighbor inside a restricted neighborhood (defined by a parameter ) that has the largest Publication of energy mileage (i.e., the distance traveled Per unit energy consumed) as the next hop node.

International Journal on Energy mileage is the ratio between the transmission distance and the energy consumption of such transmission, i.e (x /c(x)). Modeling & Simulation 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.
8

LEARN Routing

Publication of International Journal on Modeling & Simulation

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.

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.

REFFERENCE
[1] Yu Wang, Xiang-Yang Li, Wen-Zhan Song, Energy-Efficient Localized RoutingPublication in Random Multihop Networks, IEEE TRANSACTIONS ofWireless International Journal on ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 22, NO. 8, Modeling & Simulation AUGUST 2011 [2] T. Melodia, D. Pompili, and I. F. Akyildiz, Optimal local topology knowledge for energy efficient geographical routing in sensor networks, 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 Hoc Networks, 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
11

Publication of International Journal on Modeling & Simulation

THANK YOU

12