Optimizing Power Control And Clustering In Ad Hoc

Optimizing power control and clustering in Ad Hoc Network

presented by Saumyaranjan MohapatraBranchComputer science and eng

Redg No0601209103

Something About Ad Hoc networkA wireless Ad hoc network is a decentralized

wireless network It is called Ad Hoc network because Each node is willing to forward data for other nodes and so the determination of which nodes forward data is made dynamically based on the network connectivity

There are different types of wireless Ad Hoc network based on their application

Mobile Ad hoc network(MANETs) Wireless mesh network Wireless sensor Network

Mobile Ad Hoc NetworkIt is a self-configuring network of mobile

devices connected by wireless links having a particular infrastructure(Also called as mobile mesh network)

MANETs usually have a routeable networking environment on top of a link layer ad hoc network

Here each node may be connected directly to other nodes or through mobile routers

Some ExamplesVANETiVANETimVANET

Power control In Mobile Ad Hoc networkChief limiting factor for current mobile devices is

the battery power Usually battery has a lifetime of 1-2 hours in work loads and 1-2 days of standby capacity

Here power control will be a main factor for maximizing the throughput of MANETs It will be worse if nodes are non-homogeneously dispersed

The choice of transmit power and thus the range affects the traffic-carrying capacity of the network

Power control also affects packet end-to-end latency

Power control in Non-Homogenous dispersed network

If the nodes are homogenously dispersed in space then selecting a common power transfer level is not a problem But if it is non-homogenously dispersed then the lowest common power level for network connectivity is hostage to the outlying nodes which are far from each other

Power control in Non-Homogenous dispersed network(Contdhellip)One solution to this type of problems is clustering

Here nodes are being clustered at power level k forming a cluster at power level k+1

Also power level is responsible for routing since power level dictates what links are available for routing

We have to consider a better routing algorithm which will minimize the power consumed in transmitting a packet from the source to the destination while trying to maximize the lifetime of the network by avoiding nodes that have a shorter lifetime remaining

Goals to be achievedhellipPower control in conjunction with

routingProviding dynamic and implicit

clustering of node 1without election of leader and

gateway nodes1048698Propose three solutions 1048698Maximize network capacity 1048698CLUSTERPOW

1048698TunnelledCLUSTERPOW 1048698Minimize energy consumption 1048698MINPOW

The clusterpow control protocol

It has been designed for power control clustering and routing in non-homogenous networks

A route in CLUSTERPOE generally consists of hops of different power level such that the clustered structure of the network is respected

Clusterpow architecture

Routing table for clusterpow

Properties of clusterpowProvides implicit adaptive and distributed

clustering based on transmit powerThe routes discovered consists of a non-

increasing sequence of transmit power levelsCOMPOW is a special case of CLUSTERPOWIt can be used in any routing protocol

reactive or proactiveCLUSTERPOW is loop-free

Modifying the CLUSTERPOW protocol

Recursive look-up of routing tables Here we consider numerous lower power

level hops than that of fewer higher hops

Here we consider is to recursively lookup the next hop in lower power level routing tables until we get to the lowest power level routing table at which the next hop is reachable

A Counter Example Infinite Loops

Tunneled CLUSTERPOW Protocol Recursive look-up scheme can be made free

from infinite loop by tunnelling the packet to its next hop using lower power levels instead of sending packet directly

The MINPOW Routing And Power Control ProtocolTo minimize the total power consumptionTotal power consumption as the cost instead

of the hop count metricAny Shortest path algorithm can be usedUsing ldquoHELLOrdquo packet without requiring

support from the physical layerIt optimizes the energy consumed for

communication ie for transmission and reception of packets and the associated processing

Link Cost

The Software Architecture of MINPOW

Properties of MINPOW

Provides a globally optimal solution with respect to total power consumed in communication

MINPOW provides loop free routesNo measurement support is needed from the

physical layerIt works for both proactive(table driven) as

well as reactive(on-demand) routing protocols

The link cost technique also works with diverse hardware as well