1 / 1

An Adaptive Sleep Algorithm for Efficient Power Management in Wireless Local Area Networks

This paper presents an adaptive sleep algorithm designed to optimize power management in WLANs by determining the optimal sleep duration while adhering to a given delay constraint. The study addresses the balance between power savings and the latency introduced by sleep states. By categorizing sleep durations and employing a cut-through service policy, the algorithm enhances service efficiency during downlink traffic. This research provides insights into packet arrival dynamics and service policies to ensure optimal performance while minimizing energy consumption.

uriah
Download Presentation

An Adaptive Sleep Algorithm for Efficient Power Management in Wireless Local Area Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Adaptive “Sleep” Algorithm for Efficient Power Management in WLANs Mahasweta Sarkar and Rene L Cruz CAL(IT)2 Student Spectrum October 25th, 2004 The System Model • The Problem • Sleeping increases delay • Sleeping decreases power consumption • Hence, the obvious question is: • What is the optimal “sleep duration” for a given delay constraint, that maximizes power saving ? Another Service Order Besides RR Nodes are served as and when they wake up. At every slot, sleep durations are arranged in ascending order. Service policy is the same Calculate NextSleepDuration similarly, except definition of waking up “early” changes. Tx Buffer • Timedivided into equal unit • length slots • Bernoulli Packet Arrival at the • beginning of a slot with rate = p • Deterministic service rate • [1 packet/slot] • Cut-through service policy • Perfect channel condition • Downlink traffic only • Pa >> Ps Rx1 Rx2 Rx3 Sleep Psa Awake RR scheme -At time t=0 At time t=Sa..Calculate Next Sleep Duration Ps Pa A Psa 1 Calculate Da –(CD)a = a which can take the following values: a =0, a >0, a <0 AP 2 B 3 C Allocate random sleep durations to each node (say…Sa, Sb, Sc ) Buffers are empty • At time t=Sa…..Service Policy • Gated Time limited Service Policy • Occasionally Exhaustive Policy • What if B doesn’t wake up? • What if C wakes up?

More Related