CMPE 257 Spring 20051 CMPE 257: Wireless and Mobile Networking Spring 2005 Topology/Power Management II.

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
SELF-ORGANIZING MEDIA ACCESS MECHANISM OF A WIRELESS SENSOR NETWORK AHM QUAMRUZZAMAN.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
5/2/2015 Wireless Sensor Networks COE 499 Sleep-based Topology Control II Tarek Sheltami KFUPM CCSE COE
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network
S-MAC Sensor Medium Access Control Protocol An Energy Efficient MAC protocol for Wireless Sensor Networks.
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks ACM Wireless Networks Journal, 2002 BENJIE CHEN,
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
11/07/001 Power-Aware Ad Hoc Routing Mobicom98 paper “Power-Aware Routing in Ad Hoc Networks” by Singh, Woo, and Raghavendra Presentation by – Harkirat.
1-1 Topology Control. 1-2 What’s topology control?
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Topology Control.
CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 Topology/Power Management.
Power saving technique for multi-hop ad hoc wireless networks.
Geography-informed Energy Conservation for Ad Hoc Routing Ya Xu, John Heidemann, Deborah Estrin ISI & UCLA Presented by: Cristian Borcea.
MAC Layer Protocols for Sensor Networks Leonardo Leiria Fernandes.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Ad Hoc Wireless Routing COS 461: Computer Networks
1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore.
1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks The First ACM Conference on Embedded Networked Sensor Systems (SenSys 2003) November.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya University of Illinois.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Mobile Ad hoc Networks Sleep-based Topology Control
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
1 Power-Aware Routing in Mobile Ad Hoc Networks S. Singh, M. Woo and C. S. Raghavendra Presented by: Shuoqi Li Oct. 24, 2002.
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
1 An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Network Gang Lu, Bhaskar Krishnamachari, and Cauligi Raghavendra.
A Power Saving MAC Protocol for Wireless Networks Technical Report July 2002 Eun-Sun Jung Texas A&M University, College Station Nitin H. Vaidya University.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
Versatile Low Power Media Access for Wireless Sensor Networks Sarat Chandra Subramaniam.
Computer Network Lab. Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks SenSys ’ 03 Xiaorui Wang, Guoliang Xing, Yuanfang.
Wi-Fi. Basic structure: – Stations plus an access point – Stations talk to the access point, then to outside – Access point talks to stations – Stations.
A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.
Rami Melhem Sameh Gobriel & Daniel Mosse Modeling an Energy-Efficient MAC Layer Protocol.
We hope that it is more important to know where you are going than to get there quickly. SNU INC Lab. A Survey of Energy Efficient Network Protocols for.
SMAC: An Energy-efficient MAC Protocol for Wireless Networks
1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks Tijs van Dam, Koen Langendoen In ACM SenSys /1/2005 Hong-Shi Wang.
KAIS T Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Network Wei Ye, John Heidemann, Deborah Estrin 2003 IEEE/ACM TRANSACTIONS.
1/8/2016 Wireless Sensor Networks COE 499 Sleep-based Topology Control I Tarek Sheltami KFUPM CCSE COE
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
By Zhimin He Oct 1st,2003 Computer Science Department University of Virginia SPAN: An Energy-Efficient Coordination Algorithm for Topology Maintenance.
Link Layer Support for Unified Radio Power Management in Wireless Sensor Networks IPSN 2007 Kevin Klues, Guoliang Xing and Chenyang Lu Database Lab.
Self-stabilizing energy-efficient multicast for MANETs.
SPAN: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks Benjie Chen, Kyle Jamieson, Hari Balakrishnan, Robert.
Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
CS541 Advanced Networking 1 Contention-based MAC Protocol for Wireless Sensor Networks Neil Tang 4/20/2009.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Oregon Graduate Institute1 Sensor and energy-efficient networking CSE 525: Advanced Networking Computer Science and Engineering Department Winter 2004.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
IEEE Wireless LAN. Wireless LANs: Characteristics Types –Infrastructure based –Ad-hoc Advantages –Flexible deployment –Minimal wiring difficulties.
MAC Protocols for Sensor Networks
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
Sensor Networks Katia Obraczka Winter 2005 MAC II
SENSYS Presented by Cheolki Lee
Net 435: Wireless sensor network (WSN)
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Investigating Mac Power Consumption in Wireless Sensor Network
Speaker : Lee Heon-Jong
Protocols.
Adaptive Topology Control for Ad-hoc Sensor Networks
Protocols.
Presentation transcript:

CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 Topology/Power Management II

CMPE 257 Spring Announcements Homework 1: Midterm on MAC. Unicast routing. Multicast routing.

CMPE 257 Spring Today Topology and power management. Topology management as power management strategy.

CMPE 257 Spring Where to place power management? Hardware-based solutions: turn-off display, slow down disk, etc. Software-based solutions: Different layers: MAC: power-controlled transmissions, idle time management. Routing: finding energy-efficient routes. Transport: idle time management. Power management interface to application. Application is able to control trade-off between power savings and performance-related requirements (delay).

CMPE 257 Spring Power-Controlled MAC [Monks01] Goal: Power-control for better channel utilization. Focus: Multi-hop wireless networks. CSMA/CA-based protocols.

CMPE 257 Spring Contention-Based CA Sender-receiver acquire floor before data transmission. RTS/CTS + carrier sensing. Node transmits only if does not sense carrier and is not deferring. Multiple concurrent transmissions in neighborhood not allowed.

CMPE 257 Spring Spatial reuse One approach: nodes acquire only a “minimum area” sufficient for correct data transmission. Problem: nodes need to use fixed power for symmetry, i.e., a node’s RTS/CTS must reach every node whose transmission may cause collision at that node; node must assume worst- case transmission power from other nodes. Even if power is controlled for data transmission (for power savings), for channel reuse, it’s like using fixed power.

CMPE 257 Spring Proposed approach Adaptive floor acquisition. Use signal strength of received control packet to bound transmission power. Transmitter (including hidden terminals) bounds transmission power as a function of received CTS strength.

CMPE 257 Spring PCMA protocol Power-Controlled Multiple Access. “Bounded-power” model. Request-power-to-send (RPTS)/acceptable-power- to-send (APTS). Determine minimum transmission power for successful reception. Exchange sequence: RPTS-APTS-DATA-ACK. Busy tone periodically pulsed by receiver on busy tone channel: maximum noise tolerance. Indicates upper bound on transmit power for other transmitters.

CMPE 257 Spring More on PCMA Idle node monitors busy tone channel to determine its power bound. Power bound = maximum power received on busy tone channel. When node has data to send, sends RPTS at its power bound on DATA channel. RPTS contains transmission and noise power at source. When destination receives RPTS, it measures receive power and computes channel gain using information in the packet.

CMPE 257 Spring PCMA (cont’d…) Receiver computes power level for APTS and data packet which it includes in the APTS. On receiving APTS, source sends data packet at power specified in APTS; if it times out before receiving APTS, backs off an starts over. Receiver starts sending busy tones on busy tone channel as it starts receiving data; busy tone’s power is such as to prevent nearby nodes from transmitting but not nodes farther away.

CMPE 257 Spring PCMA (cont’d…) When node senses busy tone, it computes its transmit power for that node accordingly; transmit power at node defined by most sensitive receiver (least transmission power tolerance). Narrow busy tones to avoid busy tone collisions. After successful data reception, receiver sends ACK. If ACK goes through, source resets backoff timer and back to idle; otherwise increases backoff and starts over.

CMPE 257 Spring Evaluation Single-hop network. Comparison with and ideal protocol (global knowledge of link gains, noise, transmission power bounds). PCMA shows improvement in channel utilization (2 times ’s aggregate bandwidth in dense networks). Overhead? Multi-hop? Mobility?

CMPE 257 Spring Topology Control

CMPE 257 Spring What’s topology control? When nodes are deployed, how do they organize into a network? Neighbor-discovery protocol. If neighborhood is sparse, use all neighbors. What if neighborhood is dense? Use a subset of neighbors. How?

CMPE 257 Spring Approaches to topology control Adjust transmit power. Turn nodes on/off.

CMPE 257 Spring Geography-Informed Energy Conservation for Routing [Xu01] Motivation: Ad hoc network nodes are typically energy constrained. Radio in overhearing, listening, or idle consumes reasonable amount of energy.

CMPE 257 Spring GAF Geographical Adaptive Fidelity. Designed to operate in concert with routing protocols. Energy conservation by turning off “redundant nodes”. Assumes nodes know their location. Use “node equivalence” to turn off radios.

CMPE 257 Spring Node equivalence Routing fidelity: uninterrupted connectivity between communicating nodes. Nodes are equivalent if a subset of them can be turned off without changing network connectivity. 1324

CMPE 257 Spring Node equivalence (cont’d) R Node equivalence varies with communication end-points. Example: for (1,4), 2 and 3 are equivalent for (1,5) only 3.

CMPE 257 Spring Virtual Grids Area where nodes are distributed divided into virtual grids. Given 2 adjacent grids, all nodes in one grid can communicate with all nodes in the other. Hence, all nodes in each grid are equivalent.

CMPE 257 Spring Sizing Virtual Grids r Maximum distance between nodes <= R, or: r 2 +(2r) 2 <= R 2 or r <= R/(5) 1/ R

CMPE 257 Spring GAF Operation Nodes in sleeping, discovery, and active states. Nodes start in discovery: radio on, find other nodes within grid. Nodes exchange (node id, grid id, timer). Node uses its location and grid size to determine grid id. Timer (T d ) determines when node sends out discovery message and switches to active.

CMPE 257 Spring GAF (cont’d) In active mode, nodes periodically broadcast discovery message. While in active, timer (T a )determines when node goes back to discovery. While in discovery or active, node can sleep if it finds equivalent nodes. Timer (T s ) determines when node wakes up and enters discovery.

CMPE 257 Spring Tuning GAF Ideally, only one node active per grid. Node ranking: Who handles routing? “Active” node ranked higher that “discovery” node. Nodes with longer lifetime are ranked higher. Discovery interval can also be influenced by node’s lifetime (rank). Highly ranked nodes suppressing others. Sleep interval can be set to current active interval.

CMPE 257 Spring GAF and Routing GAF runs atop MANET routing. It decides nodes’ duty cycle and routing needs to adjust accordingly. Routing could be informed a priori so it could adjust before routes break.

CMPE 257 Spring GAF and Mobility Use “expected node grid time” to influence nodes’ sleep time. Expected node grid time: time node expects to leave grid; propagated in discovery message. Sleep time is min (active time, expected node grid time).

CMPE 257 Spring GAF’s Performance Simple analytical model for idealized energy conservation case. m = A / (R/5 1/2 ) 2, where m is number of grids, A is the area, and R the range. Under the uniform node distribution assumption, each grid has n/m nodes or (n*R 2 )/5*A, which is the maximum number of times lifetime is extended.

CMPE 257 Spring GAF’s Performance (cont’d…) Simulation experiments. Metrics: energy savings and reliability. From paper…

CMPE 257 Spring Span [Chen02] Span and GAF have common goals: Energy conservation by turning off “redundant” nodes. But in Span, no geographical information used. Basic approach: Distributed, localized algorithm for selecting subset of nodes (coordinators) that stay up, while others sleep.

CMPE 257 Spring Span Overview Coordinators are adaptively selected among participating nodes. Coordinators stay up and perform routing/forwarding. Other nodes sleep.

CMPE 257 Spring Span goals Enough coordinators so that every node is in-range of at least one coordinator. Rotates coordinators for load balancing. Minimize number of coordinators. Use only local information.

CMPE 257 Spring Span in Protocol Stack Runs atop MAC and below routing. Routing Span MAC

CMPE 257 Spring Basic operation Nodes exchange periodic HELLO messages. Containing current state, current coordinators, current neighbors. Non-coordinator nodes periodically wake-up and decide what their role should be.

CMPE 257 Spring Becoming coordinator Coordinator eligibility: non-coordinator should become coordinator if 2 of its neighbors cannot reach each other directly or via 1 or 2 coordinators. Not optimal. Tries to ensure at least 1 coordinator in each populated radio neighborhood. Transmission of coordinator announcements randomized to prevent synchronization.

CMPE 257 Spring Coordinator withdrawal Each coordinator periodically checks if it should withdraw. Coordinator withdraws if every pair of nodes can reach each other directly or through 1 or 2 coordinators. Nodes stay as coordinators for time inversely proportional to their remaining battery time. Coordinators become tentative coordinators to give other nodes opportunity to become coordinators without loosing connectivity.

CMPE 257 Spring Power-Aware Routing

CMPE 257 Spring Power-aware routing metrics [Singh98] Traditional metrics (e.g.,smallest number of hops, shortest delay, etc.) may impact battery life negatively Routes between 1 and 3, 2 and 4.

CMPE 257 Spring Energy-efficient metrics Examples: Residual battery power. Minimize energy consumed/packet. Maximize time to network partition.

CMPE 257 Spring Incorporating new metrics Shortest-path routing can directly incorporate some of the proposed metrics. Cost function redefined to account for right metric. Hybrid routing. Change metrics over time. Change metrics based on packets.

CMPE 257 Spring Power-Aware Routing Tries to extend network lifetime by finding energy-efficient routes. How? Incorporate energy as routing metric.

CMPE 257 Spring Power-aware routing metrics Traditional metrics (e.g.,smallest number of hops, shortest delay, etc.) may impact battery life negatively Routes between 1 and 3, 2 and 4.

CMPE 257 Spring Energy-efficient metrics Minimize energy consumed/packet. Tends to route around congested regions. Still may cause nodes to die before others. Maximize time to network partition. Need to determine minimum set of nodes that if removed, cause network partition. Routing must load balance routing task among these nodes.

CMPE 257 Spring More energy-efficient metrics Minimize node power variance. Ensures nodes consume energy uniformly. Keeps all nodes up for as long as possible. Minimize cost/packet. Define cost such that nodes with low energy levels are more expensive, or, node’s reluctance to forward packets.

CMPE 257 Spring Incorporating new metrics Shortest-path routing can directly incorporate some power-aware routing metric. Hybrid routing. Change metrics over time. Change metrics based on packets.

CMPE 257 Spring Energy Drain Rate [Kim et al.] Considering only residual battery life is not enough. Why? Approach: drain rate. Measures energy dissipation rate at node. Node monitors its energy consumption over time. Communication-related tasks. Accounts for overhearing.

CMPE 257 Spring Computing the Drain Rate Exponential weighted moving average. DR i = alpha*DR old + (1-alpha)*Dr sample  Alpha is currently set to 0.3.  What des that mean?

CMPE 257 Spring Routing Cost Metric Ratio between residual energy and the drain rate. For node i, C i = RBP i /Dr i  For a given route r, the maximum lifetime of the route is given by the minimum C i over the whole route.

CMPE 257 Spring Route Selection From set of all possible routes between source and destination, select the one with highest lifetime. Dynamics? Proactive versus reactive routing.

CMPE 257 Spring Implementation Issues Access to residual battery power at nodes. Assume it is available from on-board battery monitoring systems. For the drain rate (DR), consider only energy consumed by communication- related tasks. Accurate?

CMPE 257 Spring Energy Model for DR NIC’s energy consumption modeled by: E = m*p+n, where p is packet size and m and n are constants that are operation-specific.

CMPE 257 Spring Implementation (cont’d…) Extension to DSR. Needs to refresh routes for updated energy consumption information. Source collects all ROUTE REPLIES. ROUTE REPLY collects minimum C i over nodes on the path.

CMPE 257 Spring Evaluation Simulations using ns-2. Metrics: Lifetime: time until first node dies. Also, delay, throughput. Dense versus sparse networks. Mobility. Comparison with existing power-aware mechanisms.

CMPE 257 Spring Results From paper…

CMPE 257 Spring Power management at transport layer [Kravets98] Goal: reduce power consumption. Mechanism: turns off communicaton device during idle times. Transport layer protocol to control communication device on/off operation. Challenges: When to suspend/restart communication. Tradeoff between power consumption and delay. Avoid wasting power at hosts trying to communicate with suspended host.

CMPE 257 Spring Application knows best… Transport-layer power control interface allows application to make power management decisions based on its needs.

CMPE 257 Spring Proposed approach Mobile host controls power management: decides when to suspend communication device. Controls delay versus power savings tradeoff. Power management protocol wakes up periodically by application’s request and decides whether to re-start communication.

CMPE 257 Spring No Power Management (Wireless) card when not in TX mode is left in RX mode.

CMPE 257 Spring Proposed Technique Suspension of network interface during idle communication periods. Issues: Monitor MH communication pattern. Additional delay. BS buffer overflow.

CMPE 257 Spring Power management protocol Controls interaction between base station (BS) and mobile (MH). MH is master and BS slave. BS can only send data to MH if explicitly requested (WAKE_UP message). If data to send but in SLEEP mode, data is buffered.

CMPE 257 Spring MH States Sleeping. Can wake up by wakeup timer or data to send. If timer, wakes up and send WAKE_UP message to BS. If data, can send it or buffer it. Waiting to hear from BS if it has data to send, and Transmission/reception.

CMPE 257 Spring Timers When should card be suspended? Input from application. Timer. If timer expires and no communication occurred, go to sleep. Tradeoffs in setting timer. For how long? Tradeoff? Multiple applications. Device transition states.

CMPE 257 Spring Implementation Linux. Suspend WaveLAN card: suspend system call to kernel. Wake up the card: system call to kernel to restart driver.

CMPE 257 Spring Evaluation Experimental evaluation. Lucent WaveLAN card. Transmit, receive, suspend modes. No MAC-layer power-management. 2 communicating machines: MH and BS. Multimeter samples voltage and current. Different communication patterns: interactive (web and collaboration) and non-interactive ( ).

CMPE 257 Spring Results Considerable power savings. Especially in power-constrained devices. Additional delay is tolerable considering non-interactive and even some interactive applications.