Class-based Packet Scheduling Policies for Bluetooth
|
|
- Percival Miles
- 5 years ago
- Views:
Transcription
1 Class-based Packet Scheduling Policies for Bluetooth Vishwanath Sinha, D. Raveendra Babu Department of Electrical Engineering Indian Institute of Technology, Kanpur , INDIA vsinha@iitk.ernet.in, d raveendra@yahoo.com Abstract Bluetooth is a wireless ad-hoc network concept primarily intended to eliminate the cables between portable and/or fixed electronic devices. In this paper, a non-real-time communication service in Bluetooth is considered. Depending on its QoS (Qualityof-Service) requirements, the non-real-time traffic is divided in two classes: a) class: delay-tolerant traffic like and paging; and b) class: delaysensitive traffic like ftp and remote log-in. class is given priority over class. We propose two new scheduling policies with an attempt to provide high performance service in terms of delay and throughput to higher priority class while fairly distributing the link resources to lower priority class.. Introduction The Bluetooth technology was primarily developed to provide wireless interconnection between small mobile devices. In any communication system, it is important to support various traffic with QoS gaurantees. In this paper, we examine in detail the performance of non-real-time communication service in Bluetooth. Depending on its distinct characteristics and QoS requirements, the non-real-time traffic can be divided into two classes: a) class: delaytolerant traffic like paging and ; and b) class: delay-sensitive traffic like ftp and remote log-in. The main distinguishing factor between these classes is how delay sensitive the traffic is. To satisfy the QoS needs of different connections, nodes present in the network need to have priority and scheduling mechanisms. We propose two new scheduling policies that provide QoS gaurantess to class traffic. In our proposed methods, class traffic is given priority over class traffic.. Bluetooth Technology Bluetooth is a universal short range wireless communication system operating in the.45 GHz ISM band. The technology is based on FH-CDMA using 79 carriers MHz spaced []. Bluetooth channels use FH/TDD (Frequency Hop/Time Division Duplexing) scheme. Two or more units sharing the same channel form a piconet, where one unit acts as master and the other units act as slaves. Up to seven slaves can be active in a piconet. Bluetooth uses centralized TDD scheduling as the MAC (Media Access Control) protocol. There is a strict alternation of slots between the master and the slaves. The master packet transmission starts in even slots, while the slave transmission starts in odd slots. A Bluetooth packet can be,3 or 5 slot length. A slave may transmit the packet in the slave-to-master slot only if it is polled by the master in the preceding slot. Between any two devices, which are forming a master-slave pair, two types of links can be established. These are the (a) Synchronous Connection Oriented (SCO) link used for time bounded data, such as voice, and the (b) Asynchronous Connection Less (ACL) links for data. In practice, an SCO link is implemented by reserving duplex time slots at regular intervals. The ACL link works as traditional packet-switched network. In this paper, only the ACL type of link will be considered. Multiple piconets overlapping in the same area will form a scatternet. 3. Round-Robin Scheduling One of the conventional scheduling algorithms, Round-Robin (RR) scheduling can be used to schedule the data in a piconet. In RR scheduling amongst slaves, each master-slave (m-s) connection is alloted a pair of slots for the transmission of packets. Using RR scheduling it is possible to provide each m-s
2 pair, generating either class or class packets, a fair access to the channel. But a simple RR scheduling is not suitable for Bluetooth as it is unable to minimize dealy for interactive sessions like class. 4. Priority Queueing at master A PQ at master model is developed when the Bluetooth system is operating as infrastructure network. Here, in a piconet, master could be the Fixed Access point or the Base station. We consider downstream traffic in a piconet consisting of one master and seven slaves. In this PQ at master model, master maintains one priority queue, for all the slaves, for a class traffic and an individual output class queue for each slave, as shown in Figure. class ( λ ) traffic classifier packets class from ( λ ) higher layers master priority queue ms0 ms ms ms3 ms4 ms5 ms6 Base band queues at master scheduler MAC TX RX Figure : Illustration of downlink with a Priority Queueing (PQ) at master model. With this priority queueing model, the scheduling of packets is as follows: The master always gives priority to a packet from class queue which is nonempty in its transmission. Master keeps on serving the class packets in a FIFO (First-In-First-Out) manner until the priority queue becomes empty. So the service process at the priority queue is an exhaustive service process. Master will transmit a packet from class queues only if the priority queue becomes empty. It serves the class queues in roundrobin manner and the service process is limited- service. We assume that arrival processes of class and class packets to be Poisson with an effective arrival rates d and d, respectively. The overall packet arrival rate is defined to be d = d + d. Here the service time of a class (class) packet is defined as the effective service time during which master sends a class (class) packet in master-to-slave slot s0 slaves s6 s5 s s4 s s3 and receives a packet from the corresponding slave in slave-to-master slot. So the service time corresponds to duration of pair of slots which is random. Let X e and Xe be the first and second moments, respectively of the service time of a class packet. The vacation period is the service time of a class packet. Let V e and V e are the first and second moments, respectively of the vacation period. In the priority queueing discipline, the mean queueing delay of for class packets can be calculated analytically by modeling the class priority queue as M/G/ queue with vacations, if we assume the arrival process of class packets into the priority queue as Poisson and vacation intervals as the intervals during which master spends at a single class queue. Now the results for the M/G/ queue with server vacation model and exhaustive service discipline are used to obtain the mean delay for class packets, W d, in priority queue. Defining ρ d = d X e and if X and X, respectively, are the first and second moments of packet transmission time in a piconet, then W dxe V d = ( ρ d ) + e V e + X () 5. Priority Queueing (PQ) at master with Priority Polling (PP) With a Bluetooth system operating as a adhoc network, a Priority Queueing at master with Priority Polling is developed as the above PQ at master model minimizes the packet delay for traffic only in downlink. We consider a piconet composed of a master and seven slaves, where slaves are sending packets to other slaves in the piconet. Here, master acts as a router receiving packets from the slaves and forwarding them to the destination nodes. Since Bluetooth inherently doesn t support direct slave-to-slave connectivity at the link or radio link level, it will necessarily be done by routing via the designated master of the piconet. There has been a recently proposed algorithm in [4] for routing in Bluetooth system. The proposed algorithm uses Layer 3 header information for intra and inter piconet communication. Here, in a piconet of above type, a packet in slave-to-slave communication may be of class type or class type. To differentiate the packets according to their class, we have added one more bit called
3 Class of Service (CoS) bit in the Layer 3 header. If CoS =, the payload of the packet is of class type. The value CoS = 0 is meant for class. In this PQ at master with PP model, we divide the slaves into two groups. First group consists of p number of slaves out of seven slaves which are generating class type of data. Second group consists of remaining slaves generating class kind of data. The polling of slaves will be done in two ways: exhaustive polling and limited- polling. Exhaustive polling is done for slaves generating class traffic, i.e., once master starts polling the slave, it continuously polls the same slave until queue of the slave becomes zero. Whereas limited- polling is for slaves generating class traffic i.e., master polls the slave to receive only the first packet from that slave s queue. Here the polling refers to either explict polling or implicit polling. In this model also master maintains single priority queue for class packets destined for all slaves and a per slave class queue as shown in Figure. The scheduling of packets with PQ at master with PP model when p=, is explained in the following. We assume that the binary information regarding the status of the slave queue is available at the master. When a master polling the slaves, it always gives priority to class slave. It polls the class slave only if there is no backlog at class slave. When the master polling the class source exhaustively, all the packets master has received will be queued in priority queue at the master.if the queue of class source becomes zero then the master stops polling the source and starts sending all the packets, that are received during polling, to the destinations. After the priority queue at master becomes zero, master polls the class source only if it is backlogged. If it is not backlogged, master polls the class slaves in round-robin manner. In this model, the arrival process at the slave queues is assumed to be Poisson. Then, the queue of the class source can be modeled as a M/G/ queue with vacations in which first vacation period has a different distribution than the subsequent vacation periods. Here, the first vacation period corresponds to the period during which master sends the packets from it s priority queue to the destinations. The subsequent vacation periods are the periods during which master polls the class slave and receives a packet from corresponding slave. We assume, to be the effective arrival rates of class and class packets, respectively when p=. Here the service time of a class (class) packet is defined as the effective service time during which master polls the class (class) slave in master-to-slave slot and receives a packet from the corresponding slave in the slave-to-master slot. So the service time corresponds to the duration of a pair of master-to-slave and slaveto-master slots which is random. Let X e and Xe are the first and second moments, respectively of the service time of a class packet. The first vacation period is equal to the length of the Busy Period of class slave s queue. Let B and B are the first and second moments of the Busy Period of class slave s queue. The subsequent vacation periods are equal to the service times of class packets. Let V e and Ve are the first and second moments, respectively, of those vacation periods. Defining ρ = X e, from [5], the mean queueing delay of a class packet at class slave is given by- W Xe q = + ρ B +( ρ )Ve () ( ρ )BV e The mean queueing delay of a class packet at the priority queue of the master is equal to (B X e ). where, from [], B = X e ( ρ ) ; B = X e ( ρ ) 3 Therefore, the mean end-to-end delay for class packets is given by W = W q +(B X e )+X (3) In general, for p greater than one: master polls a backlogged class source in an exhaustive manner, i.e., until the queue of the source becomes zero, and receives the packets destined for other nodes in the piconet. Once the class source is unbacklogged, it stops polling and forwards all the packets, that are received, to the destinations. With the same process, master serves all the class sources present in piconet in a round-robin manner. When the master forwarding the packets of a particular class source, it may receive some class packets from destination nodes in the slave-to-master slots. These packets will be queued in the priority queue. Master will start polling the next class source, only if all the packets in the priority queue are cleared. Also,
4 master polling a class source can send a class packet destined for that source in the master-to-slave slot. This model can be explained logically as follows: Consider, two logical states 0 and for class sources and master. Class source remains in state 0 as long as it is unbacklogged. Master is also in state 0, if it s priority queue is empty. A class source will enter into state, if it is backlogged. The master will also enter into state if the priority queue is non-empty. Master maintains a separate counter corresponding to each class source whose values are also can be either zero or one. Initially assume that master is at state 0, since it only acts as router, and all the counters are also in zero state. Step: Now the master polls the class source whose state is until source enters into state 0. Once master started polling, the counter value corresponding to that source becomes. Step: Then the master will enter into state. Step3: Master keeps on sending the packets that are arrived at it s priority queue until it enters into state zero. Step4: Once the master enters into state 0, it polls the class source whose state is and whose counter value is zero. If two or more slaves with state are having counter values equal to zero, master will give equal priority to those slaves. Go to Step and the procedure follows. Here, note that if all the counters are at state, they will be reset to zero. Master polls the class slave if all the class slave-master pairs are in 0-0 state, i.e., if all the class sources are unbacklogged. It polls the class slaves following the round-robin manner. Here also, the polling can be explicit polling or implicit polling. Thus, a Priority Queueing at master with Priority Polling model can give end-to-end QoS gaurantees by effectively using the bandwidth. This model can be used to provide end-to-end QoS gaurantees in a Bluetooth scatternet. 6. Simulation Results Discrete Event Simulations have been performed for the scheduling policies proposed in the paper. 6.. Piconet with PQ at master model We simulate a piconet consisting of master and seven slaves. The data arrival process at the master and the slave queues is assumed to be Poisson. The overall packet arrival rate in the uplink is defined as u. The arrival rates (packets/sec) at the slaves are given by si = u =7, 0» i» 7. The offered load in the uplink is ρ u = u X. The overall packet arrival rate in the downlink is given by d. where, d = d + d. The offered load in the downlink is given by ρ d = d X. The data arrival rates at the class output queues at the master are msi = d =7, 0» i» 6. The service time of a data packet depends on the packet length. A packet size is chosen uniformly from, 3 and 5 slot lengths with equal probablity. We keep the buffer sizes sufficiently large to hold the packets. Discrete Event Simulations were run for 00 TDD slots. Figure shows the mean delays for both class and class packets in the downlink with PQ at master model when ρ d = ρ u. Here, half of the offered load in the downlink (ρ d ) is from class. From the figure, class s delay goes to infinity at around offered load ρ d = 0:68. This means that class traffic is rarely transmitted for ρ d greater than The class s delay is bounded even at ρ d equal to one. Figure Mean Delay (ms) Offered Load ( ρ ) d class Figure : Mean Delay Vs Offered Load for both class and class in downlink with PQ at master model. 3 shows the throughput values for both class and class in downlink with the model. Here, throughput is defined as defined as the rate (packets/sec) at which packets undergone service. From the figure, it can be observed that beginning at load ρ d =0:7,the throughput for class starts to decrease while that of class continues to increase. This is reasonable since half of the offered load is from class and the priority is given to class packet transmission.
5 Throughput class Mean End-to-End Delay (ms) class 0 Offered Load ( ρ ) d Figure 3: Throughput Vs Offered Load for both class and class in downlink with PQ at master model. 6.. PQ at master with PP We simulate a piconet consisting of master and p number of slaves out of seven slaves generating class traffic and other slaves generating class traffic. Slaves are communicating with other slaves through the master, where the master acting as a router. The data arrival process at the slaves is assumed to be Poisson. The arrival rates (packets/sec) at the slaves are equal and given by si = =7, 0» i» 6. The overall packet arrival rate in piconet is defined as. The offered load in the piconet is given by ρ = X. A packet size is chosen uniformly from,3 and 5 slot lengths with equal probability. Discrete Event Simulations were again run for 00 TDD slots. Figure 4 shows the delay performance for both class and class when p=3. In can be observed from the figure that the delay for class packets is increased as the offered load from class sources is more in this case. Figure 5 shows the throughput for both class and class when p=3. From the figure throughput for class continues to increase, whereas the throughput for class is decreasing starting at around ρ =0: Conclusion In this paper we have proposed two new scheduling policies with the aim of minimizing delay for interactive sessions like class. It is observed that a PQ at master with PP gives the end-to-end QoS guarantees. 0.0 Offered Load Figure 4: Mean End-to-End Delay Vs Offered Load for both class and class packets with PQ at master with PP model when p=3 Throughput class 0 Offered Load Figure 5: Throughput Vs Offered Load for both class and class with PQ at master with PP model when p=3 8. References [] J.C. Haartsen, The Bluetooth Radio System, IEEEPersonal Communications, pp. 8-36, Feb000. [] L. Kleinrock, Queueing Systems, Vol, Wiley 975. [3] D.Bertsekas and R. Gallager, Data Networks, Prentice Hall, 994. [4] P. Bhagwat and A. segall, A Routing Vector Method(RVM) for Routing in Bluetooth Scatternets, MoMuC 99, pp , 999. [5] D. Raveendra Babu Priority-based scheduling policies for Bluetooth, M.Tech Thesis, IIT Kanpur, June, 00.
A Routing Protocol and Energy Efficient Techniques in Bluetooth Scatternets
A Routing Protocol and Energy Efficient Techniques in Bluetooth Scatternets Balakrishna J. Prabhu and A. Chockalingam Department of Electrical Communication Engineering Indian Institute of Science, Bangalore
More informationBluetooth Time Division Duplex - Exact Analysis as a Polling System
CCIT Report 414, Technion Dept. of Electrical Engineering, Feb. 003. Bluetooth Time Division Duplex - Exact Analysis as a Polling System Gil Zussman 1, Adrian Segall 1, and Uri Yechiali 1 Department of
More informatione-pg Pathshala Quadrant 1 e-text
e-pg Pathshala Subject : Computer Science Module: Bluetooth Paper: Computer Networks Module No: CS/CN/37 Quadrant 1 e-text In our journey on networks, we are now exploring wireless networks. We looked
More informationTO APPEAR IN IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, On the Analysis of the Bluetooth Time Division Duplex Mechanism
TO APPEAR IN IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007 1 On the Analysis of the Bluetooth Time Division Duplex Mechanism Gil Zussman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali
More informationWireless Communications
4. Medium Access Control Sublayer DIN/CTC/UEM 2018 Why do we need MAC for? Medium Access Control (MAC) Shared medium instead of point-to-point link MAC sublayer controls access to shared medium Examples:
More informationWireless Sensor Networks
Wireless Sensor Networks 11th Lecture 29.11.2006 Christian Schindelhauer schindel@informatik.uni-freiburg.de 1 Bluetooth in WSN? There are several commercially available MAC protocol/products Wi-Fi Bluetooth
More informationOn the Analysis of the Bluetooth Time Division Duplex Mechanism
On the Analysis of the Bluetooth Time Division Duplex Mechanism Gil Zussman, Adrian Segall* and Uri Yechiali Abstract Efficient communication in Bluetooth networks requires design of intra and inter-piconet
More informationPolling in Bluetooth a Simplified Best Effort Case
Polling in Bluetooth a Simplified Best Effort Case Rachid Ait Yaiz University of Twente (Computer Science, TSS Group) Geert Heijenk University of Twente and Ericsson EuroLab Netherlands {yaiz,heijenk}@cs.utwente.nl
More informationLecture 9 November 12, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
Lecture 9 November 12, 2018 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2018-2019 Medium Access Control Scheduled access Classification of wireless
More informationSIMULATION BASED ANALYSIS OF BLUETOOTH NETWORKS. M. Subramani and M. Ilyas
SIMULATION BASED ANALYSIS OF BLUETOOTH NETWORKS M. Subramani and M. Ilyas College of Engineering Florida Atlantic University Boca Raton, Florida 33431 {msubrama@cse.fau.edu, ilyas@fau.edu} Abstract Many
More informationLecture 4: Wireless MAC Overview. Hung-Yu Wei National Taiwan University
Lecture 4: Wireless MAC Overview Hung-Yu Wei National Taiwan University Medium Access Control Topology 3 Simplex and Duplex 4 FDMA TDMA CDMA DSSS FHSS Multiple Access Methods Notice: CDMA and spread spectrum
More informationMedium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols
Medium Access Control MAC protocols: design goals, challenges, contention-based and contention-free protocols 1 Why do we need MAC protocols? Wireless medium is shared Many nodes may need to access the
More informationDelivering Voice over IEEE WLAN Networks
Delivering Voice over IEEE 802.11 WLAN Networks Al Petrick, Jim Zyren, Juan Figueroa Harris Semiconductor Palm Bay Florida Abstract The IEEE 802.11 wireless LAN standard was developed primarily for packet
More informationPerformance Evaluation of Scheduling Mechanisms for Broadband Networks
Performance Evaluation of Scheduling Mechanisms for Broadband Networks Gayathri Chandrasekaran Master s Thesis Defense The University of Kansas 07.31.2003 Committee: Dr. David W. Petr (Chair) Dr. Joseph
More informationCommunication Systems. WPAN: Bluetooth. Page 1
Communication Systems WPAN: Bluetooth Page 1 Outline Historical perspective Piconet Scatternet Lattency modes Applications Page 2 Bluetooth Bluetooth (BT) wireless technology is a short-range communications
More informationMesh Networks
Institute of Computer Science Department of Distributed Systems Prof. Dr.-Ing. P. Tran-Gia Decentralized Bandwidth Management in IEEE 802.16 Mesh Networks www3.informatik.uni-wuerzburg.de Motivation IEEE
More informationLecture Computer Networks
Prof. Dr. H. P. Großmann mit M. Rabel sowie H. Hutschenreiter und T. Nau Sommersemester 2012 Institut für Organisation und Management von Informationssystemen Lecture Computer Networks Networks for Multimedia
More informationLecture 14: M/G/1 Queueing System with Priority
Lecture 14: M/G/1 Queueing System with Priority Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE723: Telephony. Priority Queueing Systems Until the moment, we assumed identical
More informationLocal Area Networks NETW 901
Local Area Networks NETW 901 Lecture 6 IEEE 802.15.1 - Bluetooth Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 The 802.15 Family Target environment: communication of personal
More informationAn Integrated Approach to Scatternet Traffic Management in Bluetooth Ad Hoc Networks
Title An Integrated Approach to Scatternet Traffic Management in Bluetooth Ad Hoc Networks Author(s) Shek, LLY; Kwok, YK Citation Proceedings - Ieee Computer Society's International Computer Software And
More informationAn Adaptive Scheduling Algorithm for Bluetooth Ad-hoc Networks
An Adaptive Scheduling Algorithm for Bluetooth Ad-hoc Networks Raymond Y.L. Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering The University of British Columbia,Vancouver, BC,
More informationInside Bluetooth. Host. Bluetooth. Module. Application RFCOMM SDP. Transport Interface. Transport Bus. Host Controller Interface
Inside Bluetooth Application Host Application Host Audio (SCO) RFCOMM SDP Data (ACL) Control API and Legacy Support Modules Bluetooth HCI Driver Transport Interface Physical I/F Transport Bus Bluetooth
More informationMOBILE COMPUTING. Jan-May,2012. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.
WPAN: Bluetooth MOBILE COMPUTING Jan-May,2012 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com EM Spectrum ISM band 902 928 Mhz 2.4 2.4835 Ghz 5.725 5.85 Ghz LF MF
More informationOrder of Packet Transmission and Dropping
Laboratory 9 Queuing Disciplines Order of Packet Transmission and Dropping Objective The objective of this lab is to examine the effect of different queuing disciplines on packet delivery and delay for
More informationDelay Analysis of IEEE Wireless Metropolitan Area Network
Delay Analysis of IEEE 802.16 Wireless Metropolitan Area Network Zsolt Saffer Technical University of Budapest 1521 Budapest Hungary safferzs@hit.bme.hu Sergey Andreev State University of Aerospace Instrumentation
More informationSIMULATION FRAMEWORK MODELING
CHAPTER 5 SIMULATION FRAMEWORK MODELING 5.1 INTRODUCTION This chapter starts with the design and development of the universal mobile communication system network and implementation of the TCP congestion
More informationA simple adaptive MAC scheduling scheme for bluetooth scatternet
Title A simple adaptive AC scheduling scheme for bluetooth scatternet Author(s) Liu, C; Yeung, KL Citation Ieee Vehicular Technology Conference,, v. 58 n. 4, p. 65-69 Issued Date URL http://hdl.handle.net/7/4645
More informationImplementation of WiFiRe PHY Sectorization in OPNET
P Sreedhar Reddy Roll No. 06305024 24th July, 2007 Under the Guidance Of Prof. Sridhar Iyer Department Of Computer Science and Engineering Indian Institute Of Technology, Bombay Outline WiFiRe overview.
More informationSolving the Interference Problem due to Wireless LAN for Bluetooth Transmission Using a Non- Collaborative Mechanism. Yun-Ming, Chiu 2005/6/09
Solving the Interference Problem due to Wireless LAN for Bluetooth Transmission Using a Non- Collaborative Mechanism Yun-Ming, Chiu 2005/6/09 Outline Overview Survey of Bluetooth Structure of Bluetooth
More informationMaster. Slave. Master. Slaves. TCP/IP Traffic with Efficient Bluetooth Technology. Shafqat Hameed 1, Umar F.Khan 2, *Muhammad Saleem 3
/ Traffic with Efficient Bluetooth Technology Shafqat Hameed 1, Umar F.Khan 2, *Muhammad Saleem 3 1,3 National University of Sciences and Technology (NUST), Pakistan 2 University of Bradford, Bradford,
More informationOrder of Packet Transmission and Dropping
LAB 11 Queuing Disciplines Order of Packet Transmission and Dropping OBJECTIVES The objective of this lab is to examine the effect of various queuing disciplines on packet delivery and delay for different
More informationPriority Based Polling and Scheduling Algorithm for Intrapiconets in Bluetooth
Priority Based Polling and Scheduling Algorithm for Intrapiconets in Bluetooth R.Radhakrishnan and A.Lakshmi Department of Electronics & Communication Engineering, Kalasalingam University, Krishnankoil,
More informationWireless LANs/data networks
RADIO SYSTEMS - ETIN15 Lecture no: 12 Wireless LANs/data networks Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se 2016-05-03 Ove Edfors - ETIN15 1 Centralized and
More informationQueuing Disciplines. Order of Packet Transmission and Dropping. Laboratory. Objective. Overview
Laboratory 2 Queuing Disciplines Order of Packet Transmission and Dropping Objective The objective of this lab is to examine the effect of different queuing disciplines on packet delivery and delay for
More informationA Comparative Study of Different Queuing Scheduling Disciplines
RESEARCH ARTICLE OPEN ACCESS A Comparative Study of Different Queuing Scheduling Disciplines Sarhan M. Musa, Mahamadou Tembely, Matthew N. O. Sadiku, And Pamela Obliomon Roy G. Perry College of Engineering,
More informationCS263: Wireless Communications and Sensor Networks
CS263: Wireless Communications and Sensor Networks Matt Welsh Lecture 6: Bluetooth and 802.15.4 October 12, 2004 2004 Matt Welsh Harvard University 1 Today's Lecture Bluetooth Standard for Personal Area
More informationBhopal, , India 3 M.Tech Scholor,Department Of Computer Science, BIST Bhopal. Bhopal, , India
Indirect Mobile Data Transfer Under Bluetooth Protocol 1 Pramod Kumar Maurya, 2 Gireesh Dixit, 3 Jay Prakash Maurya 1 M.Tech Scholor, 2 HOD, Department Of Computer Science, MPM, Bhopal, Bhopal, 462021,
More informationChapter 4. The Medium Access Control Sublayer. Points and Questions to Consider. Multiple Access Protocols. The Channel Allocation Problem.
Dynamic Channel Allocation in LANs and MANs Chapter 4 The Medium Access Control Sublayer 1. Station Model. 2. Single Channel Assumption. 3. Collision Assumption. 4. (a) Continuous Time. (b) Slotted Time.
More informationMultiple Access Communications. EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department
Multiple Access Communications EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department 1 Multiple Access Satellite systems, radio networks (WLAN), ethernet segment
More informationCS4/MSc Computer Networking. Lecture 13: Personal Area Networks Bluetooth
CS4/MSc Computer Networking Lecture 13: Personal Area Networks Bluetooth Computer Networking, Copyright University of Edinburgh 2005 BlueTooth Low cost wireless connectivity for Personal Area Networks
More informationBy N.Golmie Presented by: Sushanth Divvela
By N.Golmie Presented by: Sushanth Divvela 1 Agenda Introduction WPAN WLAN Simulation Models Simulation results Concluding remarks 2 Introduc.on Coexistence of WPAN and WLAN Performance evaluation WLAN
More informationResource allocation in networks. Resource Allocation in Networks. Resource allocation
Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers
More informationECSE-4670: Computer Communication Networks (CCN) Informal Quiz 3
ECSE-4670: Computer Communication Networks (CCN) Informal Quiz 3 : shivkuma@ecse.rpi.edu Biplab Sikdar: sikdab@rpi.edu 1 T F Slotted ALOHA has improved utilization since the window of vulnerability is
More informationReal-Time Protocol (RTP)
Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of
More informationBy FaaDoOEngineers.com
ABSTRACT The seemingly endless entanglement of data wires connecting today s electronic devices has become slightly less jumbled with the introduction of Bluetooth technology and the creation of a wireless
More informationCapacity Assignment in Bluetooth Scatternets Optimal and Heuristic Algorithms
Capacity Assignment in Bluetooth Scatternets Optimal and Heuristic Algorithms Gil Zussman and Adrian Segall Department of Electrical Engineering Technion Israel Institute of Technology Haifa 32000, Israel
More informationTSIN01 Information Networks Lecture 3
TSIN01 Information Networks Lecture 3 Danyo Danev Division of Communication Systems Department of Electrical Engineering Linköping University, Sweden September 10 th, 2018 Danyo Danev TSIN01 Information
More informationChapter 6 Queuing Disciplines. Networking CS 3470, Section 1
Chapter 6 Queuing Disciplines Networking CS 3470, Section 1 Flow control vs Congestion control Flow control involves preventing senders from overrunning the capacity of the receivers Congestion control
More informationBasics (cont.) Characteristics of data communication technologies OSI-Model
48 Basics (cont.) Characteristics of data communication technologies OSI-Model Topologies Packet switching / Circuit switching Medium Access Control (MAC) mechanisms Coding Quality of Service (QoS) 49
More informationH3C S9500 QoS Technology White Paper
H3C Key words: QoS, quality of service Abstract: The Ethernet technology is widely applied currently. At present, Ethernet is the leading technology in various independent local area networks (LANs), and
More informationBluetooth: Short-range Wireless Communication
Bluetooth: Short-range Wireless Communication Wide variety of handheld devices Smartphone, palmtop, laptop Need compatible data communication interface Complicated cable/config. problem Short range wireless
More informationChapter 3 MEDIA ACCESS CONTROL
Chapter 3 MEDIA ACCESS CONTROL Distributed Computing Group Mobile Computing Winter 2005 / 2006 Overview Motivation SDMA, FDMA, TDMA Aloha Adaptive Aloha Backoff protocols Reservation schemes Polling Distributed
More informationLecture 21. Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov.
Lecture 21 Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov. 7 http://money.cnn.com/2011/11/07/technology/juniper_internet_outage/
More informationWireless Networks (CSC-7602) Lecture 8 (15 Oct. 2007)
Wireless Networks (CSC-7602) Lecture 8 (15 Oct. 2007) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark 1 Today Wireline Fair Schedulling Why? Ideal algorithm Practical algorithms Wireless Fair Scheduling
More informationImproving the performance of Bluetooth piconets with synchronous and asynchronous traffic
Improving the performance of Bluetooth piconets with synchronous and asynchronous traffic Vojislav B. Mišić, Jelena Mišić, and Ka Lok Chan Abstract The Bluetooth specification allows both asynchronous
More informationFeasibility of a Bluetooth Based Structural Health Monitoring Telemetry System
Feasibility of a Bluetooth Based Structural Health Monitoring Telemetry System Item Type text; Proceedings Authors Uchil, Vilas; Kosbar, Kurt Publisher International Foundation for Telemetering Journal
More informationEL Wireless and Mobile Networking Spring 2002 Mid-Term Exam Solution - March 6, 2002
Instructions: EL 604 - Wireless and Mobile Networking Spring 2002 Mid-Term Exam Solution - March 6, 2002 Be sure to write your name on your submission. This is an open book test. Use your class notes,
More informationLocal Area Networks NETW 901
Local Area Networks NETW 901 Lecture 4 Wireless LAN Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Contents What is a Wireless LAN? Applications and Requirements Transmission
More information4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802.
4.3 IEEE 802.11 Physical Layer 4.3.1 IEEE 802.11 4.3.2 IEEE 802.11b 4.3.3 IEEE 802.11a 4.3.4 IEEE 802.11g 4.3.5 IEEE 802.11n 4.3.6 IEEE 802.11ac,ad Andreas Könsgen Summer Term 2012 4.3.3 IEEE 802.11a Data
More informationModeling a MAC Scheduler: Experiences with a DOCSIS Cable
Modeling a MAC Scheduler: Experiences with a DOCSIS Cable Network Simulation Model Jim Martin Department of Computer Science Clemson University jim.martin@cs.clemson.edu Phone: 864 656 4529 Fax: 864 656
More informationAmarjeet Singh. February 7, 2012
Amarjeet Singh February 7, 2012 References Bluetooth Protocol Architecture v.1 www.bluetooth.org http://www.tutorial-reports.com/wireless/bluetooth/ Slides from last class uploaded on the course website
More informationUNIT 5 P.M.Arun Kumar, Assistant Professor, Department of IT, Sri Krishna College of Engineering and Technology, Coimbatore.
Communication Switching Techniques UNIT 5 P.M.Arun Kumar, Assistant Professor, Department of IT, Sri Krishna College of Engineering and Technology, Coimbatore. Bluetooth Techniques References 1. Wireless
More informationGUARANTEED END-TO-END LATENCY THROUGH ETHERNET
GUARANTEED END-TO-END LATENCY THROUGH ETHERNET Øyvind Holmeide, OnTime Networks AS, Oslo, Norway oeyvind@ontimenet.com Markus Schmitz, OnTime Networks LLC, Texas, USA markus@ontimenet.com Abstract: Latency
More informationLecture 23 Overview. Last Lecture. This Lecture. Next Lecture ADSL, ATM. Wireless Technologies (1) Source: chapters 6.2, 15
Lecture 23 Overview Last Lecture ADSL, ATM This Lecture Wireless Technologies (1) Wireless LAN, CSMA/CA, Bluetooth Source: chapters 6.2, 15 Next Lecture Wireless Technologies (2) Source: chapter 16, 19.3
More informationExtending or Interconnecting LANS. Physical LAN segment. Virtual LAN. Forwarding Algorithm 11/9/15. segments. VLAN2, Port3. VLAN1, Port1.
Physical LAN segment q Hosts connected on the same physical LAN segment q Same subnet; L2 forwarding q ARP (IPè MAC) L2 frame (S, D), send q Scale? Extending or Interconnecting LANS q q q Why not just
More informationCSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology
CSC344 Wireless and Mobile Computing Department of Computer Science COMSATS Institute of Information Technology Wireless Local Area Networks (WLANs) Part I Almost all wireless LANs now are IEEE 802.11
More information04/11/2011. Wireless LANs. CSE 3213 Fall November Overview
Wireless LANs CSE 3213 Fall 2011 4 November 2011 Overview 2 1 Infrastructure Wireless LAN 3 Applications of Wireless LANs Key application areas: LAN extension cross-building interconnect nomadic access
More informationMultiple Access Protocols
Multiple Access Protocols Computer Networks Lecture 2 http://goo.gl/pze5o8 Multiple Access to a Shared Channel The medium (or its sub-channel) may be shared by multiple stations (dynamic allocation) just
More informationConfiguring QoS CHAPTER
CHAPTER 34 This chapter describes how to use different methods to configure quality of service (QoS) on the Catalyst 3750 Metro switch. With QoS, you can provide preferential treatment to certain types
More informationLecture 16: QoS and "
Lecture 16: QoS and 802.11" CSE 123: Computer Networks Alex C. Snoeren HW 4 due now! Lecture 16 Overview" Network-wide QoS IntServ DifServ 802.11 Wireless CSMA/CA Hidden Terminals RTS/CTS CSE 123 Lecture
More informationPerformance Evaluation of WiFiRe using OPNET
Performance Evaluation of WiFiRe using OPNET Under the guidance of: Prof. Sridhar Iyer and Prof. Varsha Apte Dept. of CSE (KReSIT) July 16, 2007 Goal Goal Building. Finding minimum slot length to support
More informationOverview of Networks
CMPT765/408 08-1 Overview of Networks Qianping Gu 1 Overview of Networks This note is mainly based on Chapters 1-2 of High Performance of Communication Networks by J. Walrand and P. Pravin, 2nd ed, and
More informationQuality of Service (QoS)
Quality of Service (QoS) The Internet was originally designed for best-effort service without guarantee of predictable performance. Best-effort service is often sufficient for a traffic that is not sensitive
More informationImproving Simultaneous Voice and Data Performance in Bluetooth Systems
Improving Simultaneous Voice and Data Performance in Bluetooth Systems Abstract In the Bluetooth system, isochronous applications, such as voice and audio, are carried by Synchronous Connection Oriented
More informationQuality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel
Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel Semra.gulder@crc.ca, mathieu.deziel@crc.ca Abstract: This paper describes a QoS mechanism suitable for Mobile Ad Hoc Networks
More informationGuide to Wireless Communications, 3 rd Edition. Objectives
Guide to Wireless Communications, 3 rd Edition Chapter 5 Wireless Personal Area Networks Objectives Describe a wireless personal area network (WPAN) List the different WPAN standards and their applications
More informationMedium Access Control Sublayer Chapter 4
Medium Access Control Sublayer Chapter 4 Channel Allocation Problem Multiple Access Protocols Ethernet Wireless LANs Broadband Wireless Bluetooth RFID Data Link Layer Switching Revised: August 2011 & February
More informationA QoS aware Packet Scheduling Scheme for WiMAX
A QoS aware Packet Scheduling Scheme for WiMAX Mahasweta Sarkar and Harpreet Sachdeva ABSTRACT WiMAX is one of the most promising broadband wireless technologies today. The WiMAX standard-802.16-is designed
More information048866: Packet Switch Architectures
048866: Packet Switch Architectures Output-Queued Switches Deterministic Queueing Analysis Fairness and Delay Guarantees Dr. Isaac Keslassy Electrical Engineering, Technion isaac@ee.technion.ac.il http://comnet.technion.ac.il/~isaac/
More informationComparative Assessments for Different WiMAX Scheduling Algorithms
Proceedings of the World Congress on Engineering and Computer Science 9 Vol I WCECS 9, October -, 9, San Francisco, USA Comparative Assessments for Different WiMAX Scheduling Algorithms Ahmed H. Rashwan,
More informationDiffServ Architecture: Impact of scheduling on QoS
DiffServ Architecture: Impact of scheduling on QoS Abstract: Scheduling is one of the most important components in providing a differentiated service at the routers. Due to the varying traffic characteristics
More informationWEB OBJECT SIZE SATISFYING MEAN WAITING TIME IN MULTIPLE ACCESS ENVIRONMENT
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 014 WEB OBJECT SIZE SATISFYING MEAN WAITING TIME IN MULTIPLE ACCESS ENVIRONMENT Y. J. Lee Department of Technology
More informationQoS Configuration. Page 1 of 13
QoS Configuration Page 1 of 13 Contents Chapter 1 QoS Configuration...3 1.1 Brief Introduction to QoS...3 1.1.1 Traffic...3 1.1.2 Traffic Classification... 3 1.1.3 Priority...4 1.1.4 Access Control List...
More informationPacket multiple access and the Aloha protocol
Packet multiple access and the Aloha protocol Massachusetts Institute of Technology Department of Aeronautics and Astronautics Slide 1 Packet Multiple Access PMA SHARED UPLINK TERMINAL TERMINAL APPL TRANS
More informationWireless Local Area Networks (WLANs) Part I
Wireless Local Area Networks (WLANs) Part I Raj Jain Professor of CSE Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu These slides are available on-line at: http://www.cse.wustl.edu/~jain/cse574-08/
More informationETSN01 Exam. August 22nd am 1pm. Clearly label each page you hand in with your name and the page number in the bottom right hand corner.
ETSN01 Exam August 22nd 2015 8am 1pm Instructions Clearly label each page you hand in with your name and the page number in the bottom right hand corner. Materials allowed: calculator, writing material.
More informationEC Wireless Networks VIII - Semester Questions Bank
EC 6802 - Wireless Networks VIII - Semester Questions Bank UNIT I PART A 1. Find out the capacity of a single IS-95 cell that uses QPSK modulation and convolutional coding 3 db < Sr < 9 db, and bandwidth
More informationSimulation and Analysis of Impact of Buffering of Voice Calls in Integrated Voice and Data Communication System
Simulation and Analysis of Impact of Buffering of Voice Calls in Integrated Voice and Data Communication System VM Chavan 1, MM Kuber 2 & RJ Mukhedkar 3 1&2 Department of Computer Engineering, Defence
More informationCS 716: Introduction to communication networks. - 8 th class; 17 th Aug Instructor: Sridhar Iyer IIT Bombay
CS 716: Introduction to communication networks - 8 th class; 17 th Aug 2011 Instructor: Sridhar Iyer IIT Bombay Key points to consider for MAC Types/Modes of communication: Although the medium is shared,
More informationENHANCEMENT OF TCP FAIRNESS IN IEEE NETWORKS
ENHANCEMENT OF TCP FAIRNESS IN IEEE 802.11 NETWORKS Bhuvana LN 1, Divya PD 2 and Divya A 3 Department of Information Technology, Easwari Engineering College, Affiliated to Anna University, Chennai 1 bhuvana.n21@gmail.com
More informationSensor Application for Museum Guidance
Sensor Application for Museum Guidance Radka Dimitrova a a TU,Dresden, Germany, e-mail: dimitrova@ifn.et.tu-dresden.de Abstract - This article examines the conditions for successful communication and power
More informationCSCI Spring Final Exam Solution
CSCI 4211 16Spring Final Exam Solution 1. When an IP packet arrives a router, how the router decides what is the next router (output link) this packet to be forwarded to? What are the routing table and
More informationConfiguring QoS. Understanding QoS CHAPTER
29 CHAPTER This chapter describes how to configure quality of service (QoS) by using automatic QoS (auto-qos) commands or by using standard QoS commands on the Catalyst 3750 switch. With QoS, you can provide
More informationChapter 4 ATM VP-Based Ring Network
ATM VP-based network architecture is essentially a compromise of the SONET/STM and ATM network architectures: it takes a system simplicity concept from the SONET/STM network and keeps the flexibility of
More informationIEEE P Working Group for Wireless Personal Area Networks TM
IEEE P802.15 Working Group for Wireless Personal Area Networks TM SCORT - An Alternative to the Bluetooth SCO Link for Voice Operation in an Interference Environment Slide 1 Bluetooth SCO Link The Bluetooth
More informationSimulation of Bluetooth Network
Simulation of Bluetooth Network Lennart Lagerstedt Stockholm, 2003 Master of Science Thesis Project The Department of Microelectronics and Information Technology, Royal Institute of Technology (KTH) Lennart
More informationThe Medium Access Control Sublayer
The Medium Access Control Sublayer Chapter 4 Channel Allocation Problem Static channel allocation Assumptions for dynamic Assumptions for Dynamic Channel Allocation 1. Independent traffic 2. Single channel
More informationAn Efficient Scheduling Scheme for High Speed IEEE WLANs
An Efficient Scheduling Scheme for High Speed IEEE 802.11 WLANs Juki Wirawan Tantra, Chuan Heng Foh, and Bu Sung Lee Centre of Muldia and Network Technology School of Computer Engineering Nanyang Technological
More informationPower Laws in ALOHA Systems
Power Laws in ALOHA Systems E6083: lecture 7 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA predrag@ee.columbia.edu February 28, 2007 Jelenković (Columbia
More informationLecture 9. Quality of Service in ad hoc wireless networks
Lecture 9 Quality of Service in ad hoc wireless networks Yevgeni Koucheryavy Department of Communications Engineering Tampere University of Technology yk@cs.tut.fi Lectured by Jakub Jakubiak QoS statement
More information