Study on Power Saving for Cellular Digital Packet Data over a Random Error/Loss Channel Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer.

Slides:



Advertisements
Similar presentations
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Advertisements

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Introduction 1 Lecture 13 Transport Layer (Transmission Control Protocol) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer.
1 SpaceWire Update NASA GSFC November 25, GSFC SpaceWire Status New Link core with split clock domains complete (Much faster) New Router core.
Lab Assignment 1 COP 4600: Operating Systems Principles Dr. Sumi Helal Professor Computer & Information Science & Engineering Department University of.
Data Communications and Computer Networks Chapter 3 CS 3830 Lecture 16 Omar Meqdadi Department of Computer Science and Software Engineering University.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Flow and Error Control. Flow Control Flow control coordinates the amount of data that can be sent before receiving acknowledgement It is one of the most.
Chapter 6 Errors, Error Detection, and Error Control.
Cs4411 – Operating Systems Practicum November 4, 2011 Zhiyuan Teo Supplementary lecture 4.
1 Chapter Six - Errors, Error Detection, and Error Control Chapter Six.
Channel Allocation for the GPRS Design and Performance Study Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science and Information Engineering.
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of.
Chapter 6 Errors, Error Detection, and Error Control
20101 The Data Link Layer Chapter Design Issues Controls communication between 2 machines directly connected by “wire”-like link Services Provided.
WXES2106 Network Technology Semester /2005 Chapter 8 Intermediate TCP CCNA2: Module 10.
Packet Data Over Cellular Networks: The CDPD Approach Svet Naydenov CS 556.
Networking. Protocol Stack Generally speaking, sending an message is equivalent to copying a file from sender to receiver.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
Project 4 Project 4 Supplemental Lecture Joe Mongeluzzi Jason Zhao Cornell CS 4411, October 26, 2012.
Performance Evaluation and Improvement of an Ad Hoc Wireless Network Takayuki Yamamoto Graduate School of Engineering Science, Osaka University, Japan.
Chapter 5 Peer-to-Peer Protocols and Data Link Layer PART I: Peer-to-Peer Protocols ARQ Protocols and Reliable Data Transfer Flow Control.
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.
1 Chapter Six - Errors, Error Detection, and Error Control Chapter Six.
Copyright © Lopamudra Roychoudhuri
1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:
Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility Huaping Shen, Mohan Kumar, Sajal K. Das, and Zhijun Wang P 邱仁傑.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Design and Analysis of Optimal Multi-Level Hierarchical Mobile IPv6 Networks Amrinder Singh Dept. of Computer Science Virginia Tech.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
Internet and Intranet Protocols and Applications The Internet: Delay, Errors, Detection February, 2002 Joseph Conron Computer Science Department New York.
Ασύρματες και Κινητές Επικοινωνίες Ενότητα # 11: Mobile Transport Layer Διδάσκων: Βασίλειος Σύρης Τμήμα: Πληροφορικής.
Chap 8. Cellular Digital Packet Data (CDPD) 네트워크 컴퓨팅 연구실 석사 1 학기 박호진 ( )
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Data Link Layer Flow and Error Control. Flow Control Flow Control Flow Control Specifies the amount of data can be transmitted by sender before receiving.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Principles of reliable data transfer 0.
COSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of Computer Science York University Section M Topics: 1.Flow Control and ARQ Protocols.
1 Flow&Error Control R. Supakorn. 2 Flow Control Flow control refers to a set of procedure used to restrict the amount of data that the sender can send.
Data Link Layer. Data link layer The communication between two machines that can directly communicate with each other. Basic property – If bit A is sent.
2005/12/14 1 Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Data Link Layer Part II – Sliding Window Protocols.
INF3190 – Home Exam 2. Goal The goal of this exercise is to provide network layer reliability for the monitoring/administration tool presented in “home.
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
Study on Window-Based Reliable Multicast Protocols for Wireless LANs Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science and Information.
Data Link Layer.
Chapter 3: The Data Link Layer –to achieve reliable, efficient communication between two physically connected machines. –Design issues: services interface.
PROTOCOL BASICS. 2 Introduction In chapter 3: Circuits and techniques can be employed to transmit a frame of information between 2 DTEs Error detection.
Fast Retransmit For sliding windows flow control we waited for a timer to expire before beginning retransmission of a packet TCP uses an additional mechanism.
Reliable Transmission
Data Link Layer Flow Control.
March 21, 2001 Recall we have talked about the Sliding Window Protocol for Flow Control Review this protocol A window of size I can contain at most I.
Data Communications and Networking Pipelined reliable data transfer
CMPT 371 Data Communications and Networking
Instructor Mazhar Hussain
CIS 321 Data Communications & Networking
Flow Control.
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
Flow and Error Control.
Protocol Basics.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
CS4470 Computer Networking Protocols
Zafer Sahinoglu, Ghulam Bhatti, Anil Mehta
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Lecture 4 Peer-to-Peer Protocols and Data Link Layer
Presentation transcript:

Study on Power Saving for Cellular Digital Packet Data over a Random Error/Loss Channel Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science and Information Engineering (CSIE) Nation Taiwan University of Science and Technology (NTUST) Wireless Communications and Networking Engineering (WCANE) Lab

6/23/2004 ICC 2004NTUST/WCANE Lab2 Outline Introduction Power Saving Mechanism (PSM) of CDPD Combination of SR-ARQ and PSM Numerical Examples and Discussions Conclusions

6/23/2004 ICC 2004NTUST/WCANE Lab3 Introduction CDPD is a data network overlaid over AMPS. Elements of CDPD  M-ES, MDBS, MD-IS A mobile end system (M-ES) is the user end terminal. A mobile data base station (MDBS) works analogously to the base station (BS) in AMPS. Mobile data intermediate system (MD-IS) is responsible for mobility management and routing to other MD-ISs or fixed end systems (F- ESs).

6/23/2004 ICC 2004NTUST/WCANE Lab4 Introduction The architecture of CDPD:

6/23/2004 ICC 2004NTUST/WCANE Lab5 Power Saving Mechanism Two timers are maintained:  T203 and T204 timers T203 timer: element inactivity timer T204 timer: TEI notification timer An M-ES triggers a T203 timer when it completes a frame transmission.  The timer then counts down to zero.  The timer should be reset when data frames require the M-ES to receive or send before it expires.  Once the timer expires, the M-ES then enters the sleep mode.

6/23/2004 ICC 2004NTUST/WCANE Lab6 Power Saving Mechanism To wake up the sleeping M-ES, T204 timer is maintained and periodically triggered by the MD-IS for each channel stream.  As T204 timer expires, the MD-IS broadcasts a frame containing TEIs with pending frames to be delivered but queued in their buffers at the MD-IS.  All M-ESs wake up to listen to the broadcast message during the broadcast period.

6/23/2004 ICC 2004NTUST/WCANE Lab7 Power Saving Mechanism If the TEI for a specific M-ES is found in the frame, then the M-ES leaves the sleep mode.  The M-ES then sends a receiver ready (RR) frame to the MD-IS to notify the MD-IS that it is ready to receive the pending frames. If an RR frame is not received by the MD-IS, the MD-IS triggers the T204 timer again. If its own TEI of the M-ES is not found in the frame, then it remains in the sleep mode.

6/23/2004 ICC 2004NTUST/WCANE Lab8 Power Saving Mechanism Listening Triggered

6/23/2004 ICC 2004NTUST/WCANE Lab9 Combination of SR-ARQ and PSM Events and actions for the MD-IS:  1) Arrival of data frames from other MD-IS or network: Put these frames into the buffer if there is available space Discard overflowed frames. If the T203 timer for the M-ES does not expire, then deliver frames queued in the buffer with sequence numbers to the M-ES (via MDBS) and set a frame timer for each frame until the maintained sending window is greater than the window size.

6/23/2004 ICC 2004NTUST/WCANE Lab10 Combination of SR-ARQ and PSM  2) Arrival of a data frame from an M-ES: Trigger the corresponding T203 timer. Check whether the frame is necessary to retransmit or not? If yes, send a NAK. Otherwise send an ACK and check whether the sequence number is within the receiving window?  If not, just discard the frame.  3) Timeout of T204 timer: Broadcast a TEI notification frame including all “sleeping” TEIs to all M-ESs. Trigger T204 timer again.

6/23/2004 ICC 2004NTUST/WCANE Lab11 Combination of SR-ARQ and PSM  4) Timeout of T203 timer: Record the status of the corresponding TEI as “sleeping”.  5) Timeout of a frame timer: If T203 timer does not expire, then resend the frame and set the frame timer.  6) Receipt of RR: Trigger the corresponding T203 timer. Deliver frames queued in the buffer with sequence numbers to the M-ES (via MDBS) and set a frame timer for each frame until the maintained sending window is greater than the window size.

6/23/2004 ICC 2004NTUST/WCANE Lab12 Combination of SR-ARQ and PSM  7) Receipt of an ACK or a NAK: Trigger the corresponding T203 timer. If an ACK is received, then remove all frames in the queue whose sequence numbers are smaller than the sequence number indicating by the ACK and update the sending window. If a NAK is received, then resend the expected frame. Finally deliver affordable frames in the buffer to the M-ES and set frame timers until the maintained sending window is greater than the window size.

6/23/2004 ICC 2004NTUST/WCANE Lab13 Combination of SR-ARQ and PSM Events and actions for the M-ES:  1) Arrival of a data frame from the MD-IS: Check whether the frame is necessary to retransmit or not? If yes, send a NAK. Otherwise send an ACK and check whether the sequence number is within the receiving window?  If not, just discard the frame (a duplicated frame is received!). Finally trigger the T203 timer.

6/23/2004 ICC 2004NTUST/WCANE Lab14 Combination of SR-ARQ and PSM  2) Time to wake up: Listen to the broadcast frame from the MD-IS. If its TEI is found in the frame, then send an RR frame to the MD-IS and trigger the T203 timer.  3) Timeout of T203 timer: The M-ES then enters the sleep mode.  4) Timeout of a frame timer: Resend the frame Set the frame timer and T203 timer.

6/23/2004 ICC 2004NTUST/WCANE Lab15 Combination of SR-ARQ and PSM  5) Receipt of an ACK or a NAK: If an ACK is received, then remove all frames in the queue whose sequence numbers are smaller than the sequence number indicating by the ACK and update the sending window. If a NAK is received, then resend the expected frame. Finally deliver affordable frames in the buffer to the MD-IS and set frame timers and the T203 timer until the maintained sending window is greater than the window size.

6/23/2004 ICC 2004NTUST/WCANE Lab16 Numerical Examples Simulation modeling and assumptions  One MD-IS and M-ES pair  Data frames for an M-ES are generated by a Poisson process (rate lambda) with uniform distributed number of frames (1~10)  Bit errors or frame losses are modeled by two independent Bernoulli random variables.  No error correcting code is employed.  Tft = 0.1 sec., T203 = 30 sec., T204 = 60 sec.  Buffer size is 10 or 30 times of data frames Performance measures  Dropping prob., sleeping ratio and waiting time (not shown in the slides)

6/23/2004 ICC 2004NTUST/WCANE Lab17 Numerical Examples: Effect of SR-ARQ window size 1. BER=0.01, FLP=0, Buffer=10 2. SR-ARQ window size affects little to the PSM. 3. We then set window size to 4.

6/23/2004 ICC 2004NTUST/WCANE Lab18 Numerical Examples: Effect of frame errors 1. BER>0.01 results in profound performance deviation 2. This says that the channel condition when BER>0.01 is indeed worse enough and retransmission turns into the main burden

6/23/2004 ICC 2004NTUST/WCANE Lab19 Numerical Examples: Effect of frame errors 1. Increase of both BER and buffer size causes the sleeping ratio to drop down. 2. About 50% more sleeping ratio when BER=0.001 is gained as compared to BER=0.01.

6/23/2004 ICC 2004NTUST/WCANE Lab20 Numerical Examples Effect of frame losses FLP<0.1

6/23/2004 ICC 2004NTUST/WCANE Lab21 Conclusions System performance is insensitive to the SR-ARQ window size; hence, we suggest that 4 is suitable. Even with the SR-ARQ, the channel with bit error rate higher than 0.01 or the channel with frame loss probability larger than 0.1 deteriorates the system performance much. For BER <= 0.01 and FLP <= 0.1, the sleeping ratio of an M-ES is affected little by incorporating the SR-ARQ. Thus, SR-ARQ with proper parameters can recover frame errors or losses and retain lower power consumption for the typical channel condition, i.e., BER<=0.01 and FLP<=0.001.

6/23/2004 ICC 2004NTUST/WCANE Lab22 Thank You!