An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.

Slides:



Advertisements
Similar presentations
Medium Access Issues David Holmer
Advertisements

Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
S-MAC Sensor Medium Access Control Protocol An Energy Efficient MAC protocol for Wireless Sensor Networks.
EXPLORING POWER SAVING IN VOIP WIRELESS LINKS BY BHANUREDDY BATTAPURAM AND SRINIVAS MADLAPELLI.
– Wireless PHY and MAC Stallings Types of Infrared FHSS (frequency hopping spread spectrum) DSSS (direct sequence.
CSMA/CA in IEEE Physical carrier sense, and Virtual carrier sense using Network Allocation Vector (NAV) NAV is updated based on overheard RTS/CTS/DATA/ACK.
On Optimizing Backoff Counter Reservation and Classifying Stations for the IEEE Distributed Wireless LANs.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Nov 2011 Neng Xue Tianxu Wang.
Contention Window Optimization for IEEE DCF Access Control D. J. Deng, C. H. Ke, H. H. Chen, and Y. M. Huang IEEE Transaction on Wireless Communication.
1 Power Management in IEEE Yu-Chee 1. Possible Access Sequences for a STA in PS Mode 2. PS in Infrastructure Network 3. PS in Ad.
PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
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.
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
Distributed Fair Scheduling in a Wireless LAN Gautam Kulkarni EE206A (Spring 2001) Nitin Vaidya, Paramvir Bahl and Seema Gupta (appeared in Mobicom 2000.
Power Management in Presented by Sweta Sarkar June 17 th, 2002.
Power saving technique for multi-hop ad hoc wireless networks.
MAC Layer Protocols for Sensor Networks Leonardo Leiria Fernandes.
protocol continued. DCF The basic idea is non-persistent. Can do an optimization: For a new packet (Q len = 0), the sender needs only wait for.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
Delay Analysis of IEEE in Single-Hop Networks Marcel M. Carvalho, J.J.Garcia-Luna-Aceves.
Opersating Mode DCF: distributed coordination function
PLANETE group, INRIA Sophia-Antipolis July 1, 2003 Adaptive Channel allocation for QoS Enhancement in IEEE Wireless LANs Presented by: Mohammad.
MAC Protocols and Security in Ad hoc and Sensor Networks
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
1 Dynamic Adaption of DCF and PCF mode of IEEE WLAN Abhishek Goliya Guided By: Prof. Sridhar Iyer Dr. Leena-Chandran Wadia MTech Dissertation.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya University of Illinois.
LECTURE9 NET301. DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies the absence of other.
Computer and Data Communications Semester Mohd Nazri Mahmud Session 4a-12 March 2012.
ECE 256, Spring 2008 Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So & Nitin Vaidya.
IEEE Wireless LAN Standard. Medium Access Control-CSMA/CA IEEE defines two MAC sublayers Distributed coordination function (DCF) Point coordination.
1 An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Network Gang Lu, Bhaskar Krishnamachari, and Cauligi Raghavendra.
Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs K.Murugan, B.Dushyanth, E.Gunasekaran S.Arivuthokai, RS.Bhuvaneswaran, S.Shanmugavel.
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.
1 Chapter 8 Power Management in IEEE Yu-Chee 1. Possible Access Sequences for a STA in PS Mode 2. PS in Infrastructure Network 3.
An Energy Efficient MAC Protocol for Wireless LANs Eun-Sun Jung Nitin H. Vaidya IEEE INFCOM 2002 Speaker :王智敏 研二.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi- Channel Hidden Terminals Using a Single Transceiver (MMAC) Paper by Jungmin So and Nitin Vaidya.
Chapter 6 Multiple Radio Access
A SURVEY OF MAC PROTOCOLS FOR WIRELESS SENSOR NETWORKS
IEEE WLAN.
Multi-Power-Level Energy Saving Management for Passive Optical Networks Speaker: Chia-Chih Chien Advisor: Dr. Ho-Ting Wu Date: 2015/03/25 1.
Planning and Analyzing Wireless LAN
Rami Melhem Sameh Gobriel & Daniel Mosse Modeling an Energy-Efficient MAC Layer Protocol.
Chih-Min Chao and Kuo-Hsiang Lu Department of Computer Science and Engineering National Taiwan Ocean University IEEE Sensor Networks, Ubiquitous and Trustworthy.
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.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
ECE 256, Spring 2009 __________ Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver __________________.
Jingbin Zhang( 張靜斌 ) †, Gang Zhou †, Chengdu Huang ‡, Sang H. Son †, John A. Stankovic † TMMAC: An Energy Efficient Multi- Channel MAC Protocol for Ad.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
Medium Access Control in Wireless networks
1/49 Power Management in IEEE Yu-Chee Tseng.
CSMA/CA Simulation  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt.
© Robin Kravets, 2009 Energy Conservation in Wireless Networks.
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
1 A Power Control MAC Protocol for Ad Hoc Networks EUN-SUN JUNG, NITIN H. VAIDYA, Wireless Networks 11, 55–66, Speaker: Han-Tien Chang.
COE-541 LAN / MAN Simulation & Performance Evaluation of CSMA/CA
Oregon Graduate Institute1 Sensor and energy-efficient networking CSE 525: Advanced Networking Computer Science and Engineering Department Winter 2004.
A New MAC Protocol for Wi-Fi Mesh Networks Tzu-Jane Tsai, Hsueh-Wen Tseng, and Ai-Chun Pang IEEE AINA’06.
An Opportunistic Directional MAC Protocol for Multi-hop Wireless Networks with Switched Beam Directional Antennas Osama Bazan and Muhammad Jaseemuddin.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya Dept. of Computer.
Topics in Distributed Wireless Medium Access Control
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya Modified and Presented.
Presentation transcript:

An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州

Agenda Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion

Agenda Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion

Introduction Battery power is one of the critical resources in WLAN Power Limited!! Battery management Power control Energy-efficiency protocol Battery power is one of the critical resources in WLAN Power Limited!! Battery management Power control Energy-efficiency protocol

Introduction Wireless interface consumes significant power, and can be in either the awake or doze state In awake state, there are three different modes, transmit, receive, idle, and each consumes 1.65W, 1.4W, 1.15W respectively. As a contrast, in doze state consumes 0.045W thus power saving mechanism (PSM) is often putting wireless interface into a doze state Wireless interface consumes significant power, and can be in either the awake or doze state In awake state, there are three different modes, transmit, receive, idle, and each consumes 1.65W, 1.4W, 1.15W respectively. As a contrast, in doze state consumes 0.045W thus power saving mechanism (PSM) is often putting wireless interface into a doze state

Agenda Introduction Power Saving Mechanism in DCF New Power Saving Mechanism Simulation Conclusion Introduction Power Saving Mechanism in DCF New Power Saving Mechanism Simulation Conclusion

Power Saving Mechanism in DCF

Time is divided into beacon intervals At the beginning of beacon interval, there exists a specific time interval, called ATIM window (Ad-hoc Traffic Indication Message Window ) Time is divided into beacon intervals At the beginning of beacon interval, there exists a specific time interval, called ATIM window (Ad-hoc Traffic Indication Message Window )

Power Saving Mechanism in DCF ATIM window is utilized to announce any packets pending transmission to nodes in doze state and every node is awake during ATIM window When a node wants to transmit, it sends ATIM frame in ATIM window first, and then a destination node ready to receive, it replies an ATIM-ACK ATIM window is utilized to announce any packets pending transmission to nodes in doze state and every node is awake during ATIM window When a node wants to transmit, it sends ATIM frame in ATIM window first, and then a destination node ready to receive, it replies an ATIM-ACK

Power Saving Mechanism in DCF After the ATIM handshake, both source and destination node will be stay awake for the remaining beacon interval to perform the data transmission A node that ha not transmitted or received an ATIM frame may enter the doze state for saving energy after finishing its ATIM window After the ATIM handshake, both source and destination node will be stay awake for the remaining beacon interval to perform the data transmission A node that ha not transmitted or received an ATIM frame may enter the doze state for saving energy after finishing its ATIM window

Power Saving Mechanism in DCF During ATIM window, only ATIM and ATIM-ACK can be transmitted, real data transmission can only occur after the ATIM window Overhead in energy consumption is incurred for transmitting or receiving ATIM and ATIM-ACK, and there is overhead in time due to the ATIM window During ATIM window, only ATIM and ATIM-ACK can be transmitted, real data transmission can only occur after the ATIM window Overhead in energy consumption is incurred for transmitting or receiving ATIM and ATIM-ACK, and there is overhead in time due to the ATIM window

Power Saving Mechanism in DCF All nodes use the same (fixed) ATIM window size critically affects throughput and energy consumption, and a fixed ATIM window does not perform well in all situations If the ATIM window is chosen to be too small, there may not be enough time available to announce buffered packets, potentially degrading throughput. All nodes use the same (fixed) ATIM window size critically affects throughput and energy consumption, and a fixed ATIM window does not perform well in all situations If the ATIM window is chosen to be too small, there may not be enough time available to announce buffered packets, potentially degrading throughput.

Power Saving Mechanism in DCF If the ATIM window is too large, there would be less time for the actual data transmission, since data is transmitted after the end of the ATIM window, again degrading throughput at high loads

Agenda Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion

Dynamic Power Saving Mechanism Dynamic power saving mechanism (DPSM) is similar to the IEEE MAC protocol, we first describe how IEEE works IEEE MAC Protocol When a node S wants to transmit a packet to a node D it choose a “backoff” counter uniformly distributed in the interval [0,cw] Dynamic power saving mechanism (DPSM) is similar to the IEEE MAC protocol, we first describe how IEEE works IEEE MAC Protocol When a node S wants to transmit a packet to a node D it choose a “backoff” counter uniformly distributed in the interval [0,cw]

IEEE MAC Protocol cw = CW min, at the beginning and also after each successful transmission S waits until medium is idle, and then the backoff counter is decremented by 1 after each “slot time” When counter reaches 0, S transmit an RTS. After D receiving RTS, D replies a CTS to S if D can communicate with S at the present time IEEE MAC Protocol cw = CW min, at the beginning and also after each successful transmission S waits until medium is idle, and then the backoff counter is decremented by 1 after each “slot time” When counter reaches 0, S transmit an RTS. After D receiving RTS, D replies a CTS to S if D can communicate with S at the present time Dynamic Power Saving Mechanism

IEEE MAC Protocol Absence of the CTS is taken as an indication of congestion, and S doubles its cw, picks a new backoff counter uniformly distributed over [0,cw], and repeats the above procedure After RTS-CTS, S sends DATA to D and after D receiving DATA successfully, D sends an ACK to S IEEE MAC Protocol Absence of the CTS is taken as an indication of congestion, and S doubles its cw, picks a new backoff counter uniformly distributed over [0,cw], and repeats the above procedure After RTS-CTS, S sends DATA to D and after D receiving DATA successfully, D sends an ACK to S

Dynamic Power Saving Mechanism Key Features of DSPM Dynamic adjustment of ATIM window Longer dozing time (more energy saving) Key Features of DSPM Dynamic adjustment of ATIM window Longer dozing time (more energy saving)

Dynamic Power Saving Mechanism Dynamic adjustment of ATIM window In the proposed DPSM scheme, each node independently chooses an ATIM window size based on observed network conditions Dynamic adjustment of ATIM window In the proposed DPSM scheme, each node independently chooses an ATIM window size based on observed network conditions

Dynamic Power Saving Mechanism Longer dozing time In PSM specified in IEEE , when a node transmits or receives an ATIM frame during an ATIM window, it must stay awake during the entire beacon interval we allow a node to enter the doze state after completing any transmissions that are explicitly announced in the ATIM window Longer dozing time In PSM specified in IEEE , when a node transmits or receives an ATIM frame during an ATIM window, it must stay awake during the entire beacon interval we allow a node to enter the doze state after completing any transmissions that are explicitly announced in the ATIM window

Dynamic Power Saving Mechanism Longer dozing time there is a finite delay associated with the doze-to-awake transition, in addition to a higher energy consumption. Therefore, in our scheme, a node will not enter the doze state after completing packet transmissions if the remaining duration in the current beacon interval is “too small” Longer dozing time there is a finite delay associated with the doze-to-awake transition, in addition to a higher energy consumption. Therefore, in our scheme, a node will not enter the doze state after completing packet transmissions if the remaining duration in the current beacon interval is “too small”

Dynamic Power Saving Mechanism In DPSM Operation, following modifications are made Announce one ATIM frame per destination Increasing and decreasing ATIM window size Backoff algorithm for ATIM frame Packet marking Piggybacking of ATIM window size In DPSM Operation, following modifications are made Announce one ATIM frame per destination Increasing and decreasing ATIM window size Backoff algorithm for ATIM frame Packet marking Piggybacking of ATIM window size

Dynamic Power Saving Mechanism Announce one ATIM frame per destination When a node, say node A, successfully transmits an ATIM frame to another node, say node B, node A will not transmit another ATIM frame to the same destination in the same beacon interval Announce one ATIM frame per destination When a node, say node A, successfully transmits an ATIM frame to another node, say node B, node A will not transmit another ATIM frame to the same destination in the same beacon interval

Dynamic Power Saving Mechanism Announce one ATIM frame per destination If node A could not deliver all pending packets that were previously announced to node B, and the current beacon interval expires, nodes A and B both stay up in the next beacon interval, with B anticipating the remaining packets from node A, without node A having to send an ATIM frame to node B Announce one ATIM frame per destination If node A could not deliver all pending packets that were previously announced to node B, and the current beacon interval expires, nodes A and B both stay up in the next beacon interval, with B anticipating the remaining packets from node A, without node A having to send an ATIM frame to node B

Dynamic Power Saving Mechanism Increasing and decreasing ATIM window size We specify a finite set of ATIM window sizes that may be used by each node, with the smallest ATIM window size being denoted as ATIMmin. Each allowed window is called a level Increasing and decreasing ATIM window size We specify a finite set of ATIM window sizes that may be used by each node, with the smallest ATIM window size being denoted as ATIMmin. Each allowed window is called a level

Dynamic Power Saving Mechanism Backoff algorithm for ATIM frame while the backoff interval is being decremented, say, at node A, the ATIM window of node A might end. In this event, the node will attempt to send an ATIM frame for the corresponding destination again in the next beacon interval Backoff algorithm for ATIM frame while the backoff interval is being decremented, say, at node A, the ATIM window of node A might end. In this event, the node will attempt to send an ATIM frame for the corresponding destination again in the next beacon interval

Dynamic Power Saving Mechanism Packet marking If ATIM-ACK has not been received after three transmissions, the transmitted packet is “marked” and re-buffered for another try (also up to 3 times) in the next beacon interval after three attempts in a beacon interval, the ATIM frame for a given destination is only transmitted again in the next beacon interval Packet marking If ATIM-ACK has not been received after three transmissions, the transmitted packet is “marked” and re-buffered for another try (also up to 3 times) in the next beacon interval after three attempts in a beacon interval, the ATIM frame for a given destination is only transmitted again in the next beacon interval

Dynamic Power Saving Mechanism

Piggybacking of ATIM window size Each node piggybacks its own ATIM window size on all transmitted packets The packets pending to be transmitted are sorted by the size of the ATIM window at their destinations Piggybacking of ATIM window size Each node piggybacks its own ATIM window size on all transmitted packets The packets pending to be transmitted are sorted by the size of the ATIM window at their destinations

Dynamic Power Saving Mechanism Piggybacking of ATIM window size for implementing the above scheme consists of several queues, one queue corresponding to each allowed level of the ATIM window, the smallest value of the ATIM window being ATIMmin the packet is re-buffered in the queue corresponding to ATIM window size ATIMmin, to give a higher transmission priority to such packets Piggybacking of ATIM window size for implementing the above scheme consists of several queues, one queue corresponding to each allowed level of the ATIM window, the smallest value of the ATIM window being ATIMmin the packet is re-buffered in the queue corresponding to ATIM window size ATIMmin, to give a higher transmission priority to such packets

Dynamic Power Saving Mechanism Rules for Dynamic ATIM Window Adjustment Initially, each node begins with ATIM window size equal to ATIMmin Rules for Dynamic ATIM Window Adjustment Initially, each node begins with ATIM window size equal to ATIMmin

Dynamic Power Saving Mechanism Rules for increasing the ATIM window size Based on the number of pending packets that could not be announced during the ATIM window Based on overheard information Receiving a marked packet Receiving an ATIM frame after ATIM window Rules for increasing the ATIM window size Based on the number of pending packets that could not be announced during the ATIM window Based on overheard information Receiving a marked packet Receiving an ATIM frame after ATIM window

Dynamic Power Saving Mechanism

Rules for decreasing the ATIM window size During an ATIM window, if a node has successfully announced one ATIM frame to all destinations that have pending packets and no window increasing rule defined above is satisfied, it means that the current ATIM window size was big enough Rules for decreasing the ATIM window size During an ATIM window, if a node has successfully announced one ATIM frame to all destinations that have pending packets and no window increasing rule defined above is satisfied, it means that the current ATIM window size was big enough

Agenda Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion

Simulation Two metrics are used for evaluation Aggregate throughput over all flows in the network Aggregate throughput per unit of energy consumption Two metrics are used for evaluation Aggregate throughput over all flows in the network Aggregate throughput per unit of energy consumption

Simulation Simulation model Duration 25 sec Source node generates CBR traffic, Packet size of each flow is 512 bytes The initial energy for each nodes is 1000 joules so nodes do not run out of energy during the simulations The beacon interval 100 ms both PSM and NPSM Simulation model Duration 25 sec Source node generates CBR traffic, Packet size of each flow is 512 bytes The initial energy for each nodes is 1000 joules so nodes do not run out of energy during the simulations The beacon interval 100 ms both PSM and NPSM

Simulation Simulation model Wireless interface consumes 1.65W, 1.4W, 1.15W, and 0.045W in the transmit, receive, and idle modes and the doze state, respectively 800 μs as the doze-to-awake transition time and a node will consume twice as much power as the idle mode (i.e., 2.3W) Simulation model Wireless interface consumes 1.65W, 1.4W, 1.15W, and 0.045W in the transmit, receive, and idle modes and the doze state, respectively 800 μs as the doze-to-awake transition time and a node will consume twice as much power as the idle mode (i.e., 2.3W)

Simulation Wireless LAN scenario Network sizes are 8, 16, 32, 64 and half the nodes are source and the other half are destination Simulated network loads are 5%, 10%, 20%, 30%, 40%, and 50%, measured as a fraction of the channel bit rate of 2 Mbps With a total load of 10%, and 4 traffic sources, each traffic has a rate of 0.05 Mbps Wireless LAN scenario Network sizes are 8, 16, 32, 64 and half the nodes are source and the other half are destination Simulated network loads are 5%, 10%, 20%, 30%, 40%, and 50%, measured as a fraction of the channel bit rate of 2 Mbps With a total load of 10%, and 4 traffic sources, each traffic has a rate of 0.05 Mbps

Simulation (fixed network load)

Simulation (dynamic network load)

Agenda Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion Introduction Power Saving Mechanism in DCF Dynamic Power Saving Mechanism Simulation Conclusion

The ATIM window size in PSM in IEEE significantly affects the throughput and the amount of energy saving In PSM, if the ATIM window is too small, the throughput degrades as the network load becomes heavier. If the ATIM is too large, the energy gain from power saving mode become small, since each node must stay awake during the ATIM window In DPSM, a node also can power off its wireless network interface whenever it finishes packet transmission for the announced packets. Simulation results show that the proposed scheme can improve energy consumption without degrading throughput The ATIM window size in PSM in IEEE significantly affects the throughput and the amount of energy saving In PSM, if the ATIM window is too small, the throughput degrades as the network load becomes heavier. If the ATIM is too large, the energy gain from power saving mode become small, since each node must stay awake during the ATIM window In DPSM, a node also can power off its wireless network interface whenever it finishes packet transmission for the announced packets. Simulation results show that the proposed scheme can improve energy consumption without degrading throughput