Optimal Selection of Power Saving Classes in IEEE 802.16e Lei Kong, Danny H.K. Tsang Department of Electronic and Computer Engineering Hong Kong University.

Slides:



Advertisements
Similar presentations
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Advertisements

Reducing Network Energy Consumption via Sleeping and Rate- Adaption Sergiu Nedevschi, Lucian Popa, Gianluca Iannaccone, Sylvia Ratnasamy, David Wetherall.
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.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
EXPLORING POWER SAVING IN VOIP WIRELESS LINKS BY BHANUREDDY BATTAPURAM AND SRINIVAS MADLAPELLI.
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
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.
Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.
CAC for Multimedia Services in Mobile Cellular Networks : A Markov Decision Approach Speaker : Xu Jia-Hao Advisor : Ke Kai-Wei Date : 2004 / 11 / 18.
Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.
Scheduling Algorithms for Wireless Ad-Hoc Sensor Networks Department of Electrical Engineering California Institute of Technology. [Cedric Florens, Robert.
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing Y.Thomas Hou, Yi Shi, Jianping Pan, Scott F.Midkiff Mobile.
On the Energy Efficient Design of Wireless Sensor Networks Tariq M. Jadoon, PhD Department of Computer Science Lahore University of Management Sciences.
Power saving technique for multi-hop ad hoc wireless networks.
1 Target-Oriented Scheduling in Directional Sensor Networks Yanli Cai, Wei Lou, Minglu Li,and Xiang-Yang Li* The Hong Kong Polytechnic University, Hong.
Energy Models David Holmer Energy Model  Captures the effect of the limited energy reserves of mobile devices (i.e. batteries)  Models.
Delay Efficient Sleep Scheduling in Wireless Sensor Networks Gang Lu, Narayanan Sadagopan, Bhaskar Krishnamachari, Anish Goel Presented by Boangoat(Bea)
WiseMAC: An Ultra Low Power MAC Protocol for the Downlink of Infrastructure Wireless Sensor Networks Presented by Angel Pagan November 27, 2007 A. El-Hoiydi.
Resource Allocation for E-healthcare Applications
1 SenMetrics’05, San Diego, 07/21/2005 SOSBRA: A MAC-Layer Retransmission Algorithm Designed for the Physical-Layer Characteristics of Clustered Sensor.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Energy-Efficient Video Multicast in 4G Wireless Systems Ya-Ju Yu 1, Pi-Cheng Hsiu 2,3, and Ai-Chun Pang 1,4 1 Graduate Institute of Networking and Multimedia,
Adaptive Waiting Time Threshold Estimation Algorithm for Power Saving in Sleep Mode of IEEE e Khyati Sanghvi, Piyush Kumar Jain, Debabrata Das International.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
Enhanced power efficient sleep mode operation for IEEE e based WiMAX Shengqing Zhu, and Tianlei Wang IEEE Mobile WiMAX Symposium, 2007 IEEE Mobile.
Advanced Mechanisms for Sleep Mode Optimization of VoIP Traffic over IEEE m IEEE Globecom 2010 Ritesh K. Kalle, Maruti Gupta, Aran Bergman, Elad.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Delay-Throughput Tradeoff with Correlated Mobility in Ad-Hoc Networks Shuochao Yao*, Xinbing Wang*, Xiaohua Tian* ‡, Qian Zhang † *Department of Electronic.
AN ENERGY CONSUMPTION ANALYTIC MODEL FOR WIRELESS SENSOR MAC PROTOCOL ERIC MAKITA SEPTEMBRE
1 Call Admission Control for Multimedia Services in Mobile Cellular Networks : A Markov Decision Approach Jihyuk Choi; Taekyoung Kwon; Yanghee Choi; Naghshineh,
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
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.
Energy-Saving Scheduling in IEEE e Networks Chia-Yen Lin, and Hsi-Lu Chao Department of Computer Science National Chiao Tung University.
Maximizing Unavailability Interval for Energy Saving in IEEE e Wireless MANs Tuan-Che Chen ( 陳端哲 ), Ying-Yu Chen ( 陳盈佑 ), and Jyh-Cheng Chen ( 陳志成.
An optimal power-saving class II for VoIP traffic and its performance evaluations in IEEE e JungRyun Lee School of Electrical and Electronics Eng,Chung-Ang.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
Smart Merging Strategy for Configuring Power Saving Parameters in IEEE Mobile WMANs Shiann-Tsong Sheu, Chih-Cheng Yang, Shao-Jung Lu Department.
A Delay-aware Auto Sleep Mode Operation for Power Saving WiMAX 1 Shengqing Zhu, 1 Xiaoyu Ma, and 2 Lujian Wang ( 南京大學. 計算機科學 ) ( 浙江大學城市學院. 信息工程 ) 1 Department.
SIMPLE: Stable Increased Throughput Multi-hop Link Efficient Protocol For WBANs Qaisar Nadeem Department of Electrical Engineering Comsats Institute of.
1 Service Charge and Energy- Aware Vertical Handoff in Integrated IEEE e/ Networks Youngkyu Choi and Sunghyun Choi School of Electrical Engineering.
1 The Design of the Power Saving Mechanisms in IEEE e Networks (Defense) Student: Lei Yan ( 嚴雷 ) Advisor: Dr. Ho-Ting Wu ( 吳和庭 ) Date: 2009/07/23.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled WSNs under real-time constraints Fei Yang, Isabelle Augé-Blum National Institute of.
Hybrid Power Saving Mechanism for VoIP Services with Silence Suppression in IEEE e Systems Hyun-Ho Choi, Jung-Ryun Lee, and Dong-Ho Cho IEEE Communications.
BOUNDS ON QOS- CONSTRAINED ENERGY SAVINGS IN CELLULAR ACCESS NETWORKS WITH SLEEP MODES - Sushant Bhardwaj.
Turkmen Canli ± and Ashfaq Khokhar* Electrical and Computer Engineering Department ± Computer Science Department* The University of Illinois at Chicago.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
1 Energy-efficient Sleep- mode Operations for Broadband Wireless Access Systems You-Lin Chen and Shiao-Li Tsao IEEE 64th Vehicular Technology Conference,
An Energy Efficient Sleep Scheduling Considering QoS Diversity for IEEE e Wireless Networks Speaker: Wun-Cheng Li IEEE ICC 2010 Jen-Jee Chen, Jia-Ming.
A Cooperative ONU Sleep Method for Reducing Latency and Energy Consumption of STA in Smart-FiWi Networks Speaker: Chia-Chih Chien Advisor: Dr. Ho-Ting.
Energy-efficient Sleep-mode Operations for Broadband Wireless Access Systems You-Lin Chen and Shiao-Li Tsao Department of Computer Science, National Chiao.
On Mitigating the Broadcast Storm Problem with Directional Antennas Sheng-Shih Wang July 14, 2003 Chunyu Hu, Yifei Hong, and Jennifer Hou Dept. of Electrical.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Wireless Packet Scheduling With Soft Deadlines Aditya Dua and Nicholas Bambos Department of Electrical Engineering Stanford University ICC 2007.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
TOWARDS ENERGY EFFICIENT VOIP OVER WIRELESS LANS VINOD NAMBOODIRI, LIXIN GAO. ACM MOBIHOC Youngbin Im
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Javad Ghaderi, Tianxiong Ji and R. Srikant
Presentation transcript:

Optimal Selection of Power Saving Classes in IEEE e Lei Kong, Danny H.K. Tsang Department of Electronic and Computer Engineering Hong Kong University of Science and Technology IEEE Wireless Communication & Network Conference ( WCNC 2007 )

Outline Introduction Proposed Algorithm – System model – Cost metric and Delay metric – Policy Optimization Simulation Conclusion

Introduction According to the mobility extension, – IEEE e defines the sleep mode operation for the power saving which is one of the most important features for MSSs to extend their lifetime. In order to support different service connections – IEEE e offers several sleep mode types, called Power Saving Classes (PSCs)

Introduction – e sleep mode operations Power Saving Class of Type I Power Saving Class of Type II Power Saving Class of Type III … T S_init (Initial sleep window) 2 x T S_init TLTL 4 x T S_init T S_max Incoming packet TLTL TSTS Incoming packets … TSTS normal operation sleep windows listening windows MOB_TRF-IND

Relative Work Sleep mode in IEEE e has been generally recognized as effective in discontinuous reception. However, their model only applies for PSCs of type I and does not capture the new characteristics of PSCs of type II.

Relative Work Lei Kong and Danny H. K. Tsang, “Performance Study of Power Saving Classes of Type I and II in IEEE e”, To appear in the Proc. of of the 31st IEEE Conference on Local Computer Networks, Tampa, Florida, US, November – The original models have captured the inherent properties of two PSCs accurately and also show the energy delay trade-offs on different PSCs

Motivation The static timeout policy may solve the problem of when to perform the sleep mode switching, but it cannot resolve the issue on PSCs selection.

Goal Our main goal is to find the optimal selection for PSC of types that achieves the minimum energy cost or traffic delay under different traffic requirements.

Assumptions We assume that packet arrival rate λ ( packets/frame ). We also denote μ ( packets/frame ) as the service rate between BS and MSS. In PSC of type I, we assume the energy for device to switch on and off in T L is negligible

Assumptions In PSC of type II, we assume that MSS would remain in sleep mode if the arriving packets from the pervious sleep interval is less than or equal to the maximum number of packets that it could transmit during T L. TLTL TSTS Incoming packets

System model Definitions – I = { S N, S I, S II } representing normal mode, sleep mode of type I and type II – A = { s_N, s_I, s_II } with the intuitive meaning of ”switching to normal mode”, ”switching to type I” and ”switching to type II”, respectively – S I (k) represent the multi-sleep state of type I, where 0 ≤ k ≤ w and w is the final sleep stage – P k is the probability that there is packet arrival at BS in sleep stage S I (k) – Q is the transition probability that PSC of type II to normal mode – R i is a decision epoch in state i

System model

Examples s_N Stay On Normal mode The next decision takes place when the system endures a busy period and becomes idle again.

Examples s_I Switch to PSC I The next decision takes place when the system endures normal mode and becomes sleep mode again.

Examples s_II Switch to PSC II The next decision takes place when the system endures normal mode and becomes sleep mode again.

Cost metric and Delay metric Definition – τ i (a) = the expected time duration until the next decision epoch if action a is chosen in state i. – c i (a) = the expected power consumption incurred until the next decision epoch if action a is chosen in state i. – d i (a) = the expected packet delay if action a is chosen in the present state i Goal

Cost metric and Delay metric Definitions – Denote P B, P I, P S, P L as the power consumption level of busy period B, idle period I, sleep interval and listen interval T L, respectively. – E [B], E [I] is means busy period duration and idle period duration – S is the random variable of service time for each packet and E [S] = 1 /μ

Cost and Delay in Normal mode Expected time duration for normal mode Expected power consumption for normal mode

The mean waiting time for the packet – E[W] is the mean waiting time for the packet arrival during the busy period. – ρ=λ/μ is traffic intensity – E[R] = E[S 2 ]/(2E[S]) is the residual processing time – According to Pollaczek-Khintchine(PK-) mean value formula [5], E[W] is Cost and Delay in Normal mode

Expected packet delay for Normal mode

Cost and Delay in PSC I Packet arrival Probability for PSC I – P k is the probability that there is packet arrival at BS in sleep stage S I (k)

Cost and Delay in PSC I The Vacation time and busy period for PSC I – V k is the vacation time (i.e. the sleep window size plus the listen interval) at stage k – is the mean time of exceptional busy period to transmit previously buffered traffic accumulated in sleep stage k and can be derived from the following equation:

Cost and Delay in PSC I Expected time duration until vacations k – is the expected duration until the next decision epoch after sleeping for k vacations

Cost and Delay in PSC I Expected time duration for PSC I

Cost and Delay in PSC I Expected Power consumption until vacations k – is the total expected energy consumption when system wakes up after k vacation cycles and becomes idle. – ε i = P S 2 i T 0 + P L T L is the power consumption at the sleep stage i

Cost and Delay in PSC I Expected Power consumption for PSC I – E sw denotes the power consumption in switch-on and switch-off the transceiver at physical layer.

Cost and Delay in PSC I Expected packet delay for PSC I – is the total expected packet delay when system wakes up after k vacation cycles. ρ=λ/μ is traffic intensity

Cost and Delay in PSC II Packet arrival Probability for PSC II – V II is the vacation time for PSC of type II (i.e. the sleep window size plus the listen interval) – d is maximum number of packets that it could transmit during T L – (1 − Q) is the transition probability that MSS keeps in state S II

Cost and Delay in PSC II Expected time duration for PSC II

Cost and Delay in PSC II Expected power consumption for PSC II

Cost and Delay in PSC II Expected packet delay for Type II

Policy Optimization Let x i (a) are the expected number of times that the system is in state i and command a is issued. We define in our model that every decision epoch only takes place as soon as MSS becomes idle in S N. In other words, x i (a) = 0, ∀ a and i ∈ {S I, S II }.

Policy Optimization We formulate two probabilistic constrained optimization problems: – power optimization under delay constraint maximal expected delay with a upper bound δ.

Policy Optimization – delay optimization under power constraint meaning that the battery life time would be extended σ times in the long run

Simulation P B = 750mW, P I = P L = 170mW and P s = 50mW, and for switching cost E sw = 1.5J

Simulation A. Cost Metric Comparison

Simulation B. The Space of Optimal Policies (delay 20 frame)

Simulation B. The Space of Optimal Policies (delay one frame)

Conclusion In this paper, we propose a semi-Markov Decision Processes (Semi-MDP) method into the sleep mode operation in IEEE e. We find out the optimal selection for PSC and efficiently under different traffic conditions that minimize energy consumption for MSS