Optimizing Power Control And Clustering In Ad Hoc


Published on

Published in: Technology, Business
  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Optimizing Power Control And Clustering In Ad Hoc

  1. 1. Optimizing power control and clustering in Ad Hoc Network<br />presented by: SaumyaranjanMohapatra<br />Branch:Computer science and eng.<br />Redg No.0601209103<br />
  2. 2. Something About Ad Hoc network<br />A 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.<br />There are different types of wireless Ad Hoc network based on their application.<br /><ul><li> Mobile Ad hoc network(MANETs)
  3. 3. Wireless mesh network
  4. 4. Wireless sensor Network </li></li></ul><li>Mobile Ad Hoc Network<br />It is a self-configuring network of mobile devices connected by wireless links having a particular infrastructure.(Also called as mobile mesh network)<br /> MANETs usually have a routeable networking environment on top of a link layer ad hoc network.<br /> Here each node may be connected directly to other nodes or through mobile routers.<br />Some Examples:VANET,iVANET,imVANET<br />
  5. 5. Power control In Mobile Ad Hoc network<br />Chief 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.<br />Here power control will be a main factor for maximizing the throughput of MANETs . It will be worse if nodes are non-homogeneously dispersed.<br />The choice of transmit power ,and thus the range affects the traffic-carrying capacity of the network.<br />Power control also affects packet end-to-end latency.<br />
  6. 6. Power control in Non-Homogenous dispersed network<br />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.<br />
  7. 7. Power control in Non-Homogenous dispersed network(Contd…)<br />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.<br />Also power level is responsible for routing , since power level dictates what links are available for routing.<br />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.<br />
  8. 8. Goals to be achieved…<br />Power control in conjunction with routing.<br />Providing dynamic and implicit clustering of node.<br /> 1.without election of leader and gateway nodes.<br />􀁺Propose three solutions:<br /> 􀁺Maximize network capacity<br />􀁺CLUSTERPOW<br />􀁺TunnelledCLUSTERPOW<br />􀁺Minimize energy consumption<br />􀁺MINPOW<br />
  9. 9. The clusterpow control protocol<br />It has been designed for power control , clustering and routing in non-homogenous networks.<br />A route in CLUSTERPOE generally consists of hops of different power level such that the clustered structure of the network is respected.<br />
  10. 10.
  11. 11. Clusterpow architecture<br />
  12. 12. Routing table for clusterpow<br />
  13. 13. Properties of clusterpow<br />Provides implicit , adaptive , and distributed clustering based on transmit power.<br />The routes discovered consists of a non-increasing sequence of transmit power levels.<br />COMPOW is a special case of CLUSTERPOW.<br />It can be used in any routing protocol , reactive or proactive.<br />CLUSTERPOW is loop-free.<br />
  14. 14. Modifying the CLUSTERPOW protocol <br />Recursive look-up of routing tables<br /> Here we consider numerous lower power level hops than that of fewer higher hops.<br />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.<br />
  15. 15. A Counter Example : Infinite Loops<br />
  16. 16. Tunneled CLUSTERPOW Protocol<br />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.<br />
  17. 17. The MINPOW Routing And Power Control Protocol<br />To minimize the total power consumption.<br />Total power consumption as the cost instead of the hop count metric<br />Any Shortest path algorithm can be used.<br />Using “HELLO” packet without requiring support from the physical layer.<br />It optimizes the energy consumed for communication, i.e. , for transmission and reception of packets , and the associated processing.<br />
  18. 18. Link Cost<br />
  19. 19. The Software Architecture of MINPOW <br />
  20. 20. Properties of MINPOW<br />Provides a globally optimal solution with respect to total power consumed in communication.<br />MINPOW provides loop free routes.<br />No measurement support is needed from the physical layer<br />It works for both proactive(table driven) , as well as reactive(on-demand) routing protocols.<br />The link cost technique also works with diverse hardware as well.<br />