S. Choi and K. G. Shin, "A Cellular Wireless Local Area Network with QoS Guarantees for Heterogeneous Traffic," Proceedings INFOCOM'97, pp. 1030-1037, Kobe, Japan, May 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to maintain the QoS of these applications, in the presence of user mobility with the use of resource reservation. QoS support in wireless networks has been attempted at various levels in the protocol hierarchy. Various MAC level protocols have been suggested for achieving QoS in wireless networks [1 3] aided by a large number of scheduling algorithms [4 6] Many of the MAC based algorithms that have been proposed use a centralized channel allocation scheme with the help of a base station and follow a rigid temporal structure which makes practical implementation complex. There are many QoS fair ....

....RSVP protocol, modified to recognize passive and active reservations. In fig. 2(a) the mobile is shown to be in Cell 1 in which the sender BS also resides. The BS sends PATH messages to the mobile and since the reservations are going to be used, it is indicated as an active reservation denoted as [1] in Fig. 2(a) The mobile responds with an active RESV message if it can accept the call (shown as [2] in fig 2(a) 8 Mahadevan and Sivalingam Architecture and Experimental Results . After this point, the sender of the application has made sure that resources are reserved for this ....

S. Choi and K. G. Shin, "A Cellular Wireless Local Area Network with QoS Guarantees for Heterogeneous Traffic," in Proc. IEEE INFOCOM, pp. 1032--1039, Apr. 1997.

....The QoS provisions of ATM fit quite well with the requirements of multimedia traffic. This provides much more possibilities for differentiating various media streams than an often used approach in QoS providing network systems with just two priority levels (real time versus non real time) [17], or even multiple priority levels [33] However, when adopting ATM in a wireless environment, we need a much more dynamic approach to resource usage. The small size packet structure and small header (in B ISDN ATM 48 bytes data and 5 bytes header) allows for a simple implementation. Small cells ....

Choi S., Shin K.G.: "A cellular wireless local area network with QoS guarantees for heterogeneous traffic", Mobile networks and applications 3, pp. 89-100, 1998.

....3 8 [9] Some TDMA protocols assume that individual bursts (talkspurts) in a CBR session are separate sessions of their own, which have to individually request bandwidth as they occur. With this approach, it may be possible to transmit non CBR traffic during silent periods of a CBR session [5]. One problem with such protocols is that they admit the possibility of a collision when the voice source resumes its talkspurt, and the station may lose its reservation in such a case. An alternative approach is to keep the CBR slot reserved for the entire duration of the actual voice session, ....

.... is the total number of contention minislots available in the upcoming frame, and is the number of contention minislots in the last frame. This backoff algorithm resembles the harmonic backoff algorithm (with retransmission probabilities ) 0 1 2 2 2 ) described in [5, 13], and additionally accounts for the variable size of the contention section. Other collision resolution protocols, e.g. deterministic ones based on the Binary Tree Algorithm [3, 13] may be good alternatives to ALOHA. Although the performance of DS TDMA CP may vary depending on the collision ....

S. Choi and K. G. Shin. A cellular wireless local area network with QoS guarantees for heterogeneous traffic. Mobile Networks and Applications, 3(1):89--100, 1998.

....signal intensity at the BS. In order to improve the throughput (and hence overall performance) of the wireless system one should use forward error correction (FEC) Of course there is a question of which codes to use and how many bits to allocate. Various studies have been addressed to this issue [15] [13] Any such appropriate solution can be used with our MAC algorithm to improve the performance. 18 Chapter 3 Simulation This chapter presents the simulation results of the scheduling algorithm. We have simulated CBR, VBR, ABR and UBR sources for UL as well as DL.The simulator has been ....

S. Choi and K. G. Shin,\A Cellular Wireless Local Area Network with QoS Guarantees for Heterogeneous trac,"INFOCOMM'97, pp. 1030-1037

....(DL) connections according to their requirements. Giving one carrier frequency for each may result in inefficient utilization of bandwidth. The MAC protocols proposed for Wireless ATM include DQRUMA [5] PRMA DA [6] DSA [8] MASCARA [7] RQMA [4] Other good related references are [2] and [3]. All these protocols use a single contention period for channel access. FAFS is unique in the sense that it provides two different contention slots (one for CBR (Constant Bit Rate) and VBR (Variable Bit Rate) other for ABR (Available Bit Rate) and UBR (Unavailable Bit Rate) and thus providing ....

....mobility of the source) In order to improve the throughput (and hence overall performance) of the wireless system one should also use forward error correction (FEC) Of course there is a question of which codes to use and how many bits to allocate. Various studies have addressed this issue [4] [3]. Any such appropriate solution can be used with our MAC algorithm to improve the performance. III. SIMULATION This section presents the simulation results of the scheduling algorithm. We have simulated CBR, VBR, ABR and UBR sources for UL as well as DL. The simulator has been written in C. The ....

S. Choi and K. G. Shin,"A Cellular Wireless Local Area network with QoS Guarantees for Heterogeneous Traffic," INFOCOMM '97, pp. 1030--1037.

....loss probability and minimum throughput, as users may also experience performance degradation due to properties of the wireless channel (e.g. from physical layer channel errors) and due to user mobility from handoffs. While sophisticated service disciplines [1 3] and medium access techniques [4, 5] may be used to mask the former problem, admission control and resource reservation must be used to address the latter problem [6 16] In particular, since a mobile user may handoff to neighboring cells during the lifetime of its call, network resources must be reserved even in cells other than ....

S. Choi and K. Shin. A cellular wireless local area network with QoS guarantees for heterogeneous traffic. In Proceedings of IEEE INFOCOM '97, pages 1030--1037, Kobe, Japan, April 1997.

....probability and minimum throughput, as users may also experience performance degradation due to properties of the wireless channel (e.g. from physical layer channel errors) and due to user mobility from handoffs. While sophisticated service disciplines [9] 11] and medium access techniques [2] [4] may be used to mask the former problem, admission control must be used to address the latter problem [1] 3] 5] 7] 8] 10] 12] 13] 15] 17] In particular, since a mobile user may handoff to neighboring cells during the lifetime of its call, network resources must be reserved even ....

S. Choi and K. Shin. A cellular wireless local area network with QoS guarantees for heterogeneous traffic. In Proceedings of IEEE INFOCOM '97, pages 1030--1037, Kobe, Japan, April 1997.

.... guarantees, and so, the base station starts to serve the new connection beginning at the next frame. The basic idea of the admission test is the total reserved throughput for class I connections plus the redundancy of mini slots should be less than, or equal to, one. The readers are referred to [10] for a formal proof. Note that in Example 1, the summation in Eq. 3) is exactly one, implying that all of the slots be reserved for the three class I connections. It might sometimes be desirable to set aside a certain portion of throughput for class II traffic (say S) In such a case, Eq. 3) ....

S. Choi and K. G. Shin, "A cellular wireless local area network with QoS guarantees for heterogeneous traffic," Technical Report CSE-TR-300-96, University of Michigan, August 1996. Available at http://www.eecs.umich.edu/~shchoi/papers.html.

....K and T req is closely related to each other, and hence, they should be considered together so that there is no undesirable peak in the average delay. 6 Related Work Recently, there have been signi cant research e orts to support QoS guarantees in wireless networks. A wireless MAC protocol in [11] can be considered as a polling scheme using stop and go queueing for real time trac, and FIFO queueing for non real time trac. However, this scheme can support only a nite number of delay bounds due to the inherent limitation of stop and go queueing. The authors of [12] dealt with the scheduling ....

....it does not address how to bound packet delay bounds either. Finally, our real time scheduling is deadline driven, so it can bound delays without addressing the fair access issue explicitly, but fairness is also a main concern in our non real time scheduling. We adopted the polling scheme as in [11, 17, 18] for both real time and non real time trac with di erent polling and scheduling strategies. The D TDD technique in [11, 13, 18 20] was also used for more ecient and exible utilization of a frequency channel. We showed how to support the distinct QoS requirements of heterogeneous traf c (i.e. ....

[Article contains additional citation context not shown here]

S. Choi and K. G. Shin, \A cellular wireless local area network with QoS guarantees for heterogeneous trac," ACM Mobile Networks and Applications (MONET), vol. 3, no. 1, pp. 89-100, 1998.

....rate of an individual user can hardly be commensurate with the system bandwidth because of the spreading factor even with above mentioned multi rate CDMA techniques. In this regard, a carefully developed Time Division Multiple Access Time Division Duplexing (TDMA TDD) system like those found in [5, 21] may yield less delays for a small population of users generating very bursty traffic (e.g. a typical wireless LAN environment) For class I real time traffic, connection oriented transmission is achieved by assigning a set of mobile oriented 1 This technique seems to be less known compared to ....

....to error performance is supported by the combination of power control, error control codes, and Automatic Retransmission reQuest (ARQ) scheme (only for class II) A Forward Error Correction (FEC) scheme is used for class I due to the uncertain delivery delays of ARQ schemes. Our previous work [5] focused on how to make various QoS guarantees for heterogeneous traffic in wireless LANs by allocating mobiles time slots to control their access to the LANs. In an earlier version of this paper [4] we did not consider multipath fading, which is the most prominent characteristic of a wireless ....

S. Choi and K. G. Shin, "A cellular wireless local area network with QoS guarantees for heterogeneous traffic," ACM Mobile Networks and Applications (MONET), vol. 3, no. 1, pp. 89--100, 1998. special issue on Mobile Multimedia Communications.

.... guarantees, and so, the base station starts to serve the new connection beginning at the next frame. The basic idea of the admission test is the total reserved throughput for class I connections plus the redundancy of mini slots should be less than, or equal to, one. The readers are referred to [10] for a formal proof. Note that in Example 1, the summation in Eq. 3) is exactly one, implying that all of the slots be reserved for the three class I connections. It might sometimes be desirable to set aside a certain portion of throughput for class II traffic (say S) In such a case, Eq. 3) ....

S. Choi and K. G. Shin, "A cellular wireless local area network with QoS guarantees for heterogeneous traffic," Technical Report CSE-TR-300-96, University of Michigan, August 1996. Available at http://www.eecs.umich.edu/~shchoi/papers.html.

No context found.

S. Choi and K. G. Shin, "A Cellular Wireless Local Area Network with QoS Guarantees for Heterogeneous Traffic," Proceedings INFOCOM'97, pp. 1030-1037, Kobe, Japan, May 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC