P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LAN's," ACM Wireless Networks, vol. 3, pp. 91--102, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... [8] Lately, it is widely envisioned that the time varying nature of the wireless channel quality [15] 19] inevitable as it is, can potentially allow further exploitation to enhance the performance of the system [4] 22] As such, several channel adaptive protocols have also been reported [2]. However, for the MAC problem, existing channel adaptive protocols just blindly maximize the overall system throughput by always selecting the user device with the best channel quality and allowing such a user to seize the channel to transmit data [2] 8] A typical approach is to sort the users ....

.... protocols have also been reported [2] However, for the MAC problem, existing channel adaptive protocols just blindly maximize the overall system throughput by always selecting the user device with the best channel quality and allowing such a user to seize the channel to transmit data [2], 8] A typical approach is to sort the users in descending order of channel quality and then assign transmission time slots to the one user after another until all the time slots in the current multiple access frame are exhausted [8] The drawback of using such an approach is that the fairness ....

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using Channel State Dependent Packet Scheduling to Improve TCP Throughput over Wireless LANs," ACM/Baltzer Wireless Networks, vol. 3, no. 1, pp. 91-- 102, 1997.

....be much lower than that of flows going to a high quality link. This difference of service quality for different flows violates the fairness requirement that demands that every flow should be able to deliver the same amount of data to its receiver. Several base station packet scheduling schemes [5 10] that are based on link quality has been proposed to solve the problems of bandwidth efficiency and fairness. Some of these scheduling algorithms give packets going to higher quality links higher priority [5 6] to improve efficiency; others [6 10] give flows on lower quality links more bandwidth ....

....same amount of data to its receiver. Several base station packet scheduling schemes [5 10] that are based on link quality has been proposed to solve the problems of bandwidth efficiency and fairness. Some of these scheduling algorithms give packets going to higher quality links higher priority [5 6] to improve efficiency; others [6 10] give flows on lower quality links more bandwidth to compensate for their high loss rate to equalize the goodput of each flow. Although these methods can greatly improve bandwidth efficiency and fairness for shared wireless links, they impose a heavy burden on ....

[Article contains additional citation context not shown here]

Bhagwat, P., et al. Using channel state dependent packet scheduling to improve throughput over wireless channels. in IEEE INFOCOM.March, 1996.

....A popular approach is to adapt transmission parameters to the state of the channel depending on the QoS requirements of the flow. Some approaches study adaptive modulation, coding and power control [2, 3, 5, 6, 7, 8] others concentrate on channel aware (or state dependent) scheduling [1, 4, 5, 9, 12, 12, 13, 14, 17], trying to use the bad channel times (where any transmission would be lost) of one wireless terminals (WT) to send data to another one which is experiencing a good channel at the same time or, alternatively, to delay cancel the sending of packets that are of lesser importance to a multimedia ....

Bhagwat P, Bhattacharya P, Krishna A, and Tripathi S. Using channel state dependent packet scheduling to improve tcp throughput over wireless lans. Wireless Networks Journal, vol. (3)1, 1997.

.... local access schemes comparing both wireless LAN and wireless ATM technologies can be found in [24] Recently, there have been signi cant research e orts on packet scheduling to handle location dependent and bursty errors based on channel prediction mechanisms and packettransmission deferments [25 30]. Most of the work has focused on how to provide (long term) fair access to a wireless link in the presence of location dependent errors [26 30] Moreover, some of these have limitations, such as the issue of expediting the retransmission of packets was not addressed [26 28] We adopted two ....

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, \Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," ACM Wireless Networks, vol. 3, pp. 91-102, 1997.

....periodic probe packets to detect the recovery of a channel from the bad to good state; actual data packet transmissions were deferred during the bad state. A similar idea for energy efficient scheduling of packets from a base station to a set of downstream wireless hosts has been explored in [2], 15] 5] Ad hoc routing protocols aim to compute minimumcost paths; in contrast to generic (non ad hoc) routing protocols, they contain special features to reduce the signaling overheads and convergence problems caused by node mobility and link failures. So, ad hoc protocols, such as AODV ....

P. Bhagwat, P. Bhattacharya, A. Krishna, and S.K. Tripathi. Using channel state dependent packet scheduling to improve tcp throughput over wireless lans. Wireless Networks, 3(1), 1997.

....[20] 21] We simulate each wireless link (consisting of up to R(j) parallel code channels) as an independent discrete time Markov Chain with two states: good and bad . The two state model is a useful and accurate wireless channel characterization for the design of higher layer protocols [22], 23] 24] It may be obtained from a more complex channel model, which may incorporate adaptive error control techniques (see Section V E) using weak lumpability or stochastic bounding techniques [25] We assume that all 12 parallel code channels of a wireless link (to a particular client) ....

....links experi ence location dependent, time varying, and bursty errors, which result in situations where the shared transmission capacity is temporarily available only to a subset of the clients. Another line of work addresses the efficiency of reliable data transfer over wireless links [43] [22]. Krunz and Kim [44] 45] study the packet delay and loss distributions as well as the effective bandwidth of an on off flow over a wireless link with automatic repeat request and forward error correction. We note that to our knowledge none of the existing schemes for providing OoS in wireless ....

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," ACM Wireless Networks, vol. 3, pp. 91 102, 1997.

.... local access schemes comparing both wireless LAN and wireless ATM technologies can be found in [24] Recently, there have been significant research efforts on packet scheduling to handle location dependent and bursty errors based on channel prediction mechanisms and packet transmission deferments [5], 16] 21] 23] 27] Most of the work has focused on how to provide (long term) fair access to a wireless link in the presence of location dependent errors [16] 21] 23] 27] Moreover, some of these have limitations, such as the issue of expediting the retransmission of packets was not ....

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," ACMWireless Networks, vol. 3, pp. 91--102, 1997.

....needed to achieve fair sharing of bandwidth, high link utilization and low queue occupancy. We demonstrate that Round Robin scheduling is unable to meet these requirements and propose three new scheduling algorithms which meet these criteria adequately. We also incorporate Channel State Dependency [7] in these algorithms in order to improve the performance in the presence of bursty wireless errors. In accordance with observations reported in earlier studies of packet loss behavior in wireless LANs [5] 6] 17] a two state Markov model has been used to model the errors in the wireless ....

....throughput (Section V D) Since wireless channels are characterized by bursty errors, repeated transmission attempts of the head of line (HOL) packets may fail, blocking the transmission of packets to other receivers. Since the wireless links to various destinations are statistically independent [7], 15] packets for other slaves could be successfully transmitted during this interval. We propose Channel State Dependent Packet (CSDP) scheduling [7] versions of our algorithms to improve the data throughput over lossy wireless links. Upon encountering a packet loss (indicated by receipt of a ....

[Article contains additional citation context not shown here]

P. Bhagwat, P. Bhattacharya, A. Krishna and K. Tripathi,"Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," Wireless Networks, pp. 91-102, 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LAN's," ACM Wireless Networks, vol. 3, pp. 91--102, 1997.

No context found.

P.Bhagw--W P. Bhattacharya, A. Krishna, K. Tripathi, Using channel state dependent packet scheduling to improve TCP throughput overwerSHkk LANs, Wireless Netwess 3 (1) (1997) 91--102.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," ACM Wireless Networks, vol. 3, pp. 91--102, 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using Channel State Dependent Packet Scheduling to Improve Throughput over Wireless LANs," IEEE INFOCOM '96, San Francisco, CA, Mar. 1996.

No context found.

Pravin Bhagwat, Partha Bhattacharya, Arvind Krishna, and Satish K. Tripathi. Using Channel State Dependent Packet Scheduling to Improve Throughput over Wireless LANs. In IEEE INFOCOM, March 1996.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. Tripathi. Using channel state dependent packet scheduling to improve tcp throughput over wireless LANs. Wireless Networks, 3:91--102, 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishma, S.K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," ACM Wireless Networks, March 1997, pp. 91 - 102. Available at: http://www.acm.org/pubs /articles/journals/wireless/1997-3-1/p91-bhagwat/p91bhagwat. pdf

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, et al., "Using Channel State Dependent Packet Scheduling to Improve TCP Throughput over Wireless LANs," ACM Wireless Networks, vol. 3, pp. 91-102, 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, S. K. Tripathi, Using Channel State Dependent Packet Scheduling to Improve TCP Throughput over Wireless LANs, Wireless Netwoks 3 (1) (1997) 91-102.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," ACM Wireless Networks, vol. 3, pp. 91--102, 1997.

No context found.

Bhagwat, P., Bhattacharya, P., Krishna A. and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs", ACM/Baltzer Wireless Networks Journal, (3)1, 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," ACM Wireless Networks, vol. 3, pp. 91--102, 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, S. K. Tripathi, Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs, ACM/Baltzer Wireless Networks Journal, Vol. 3, No. 1, January 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, S. K. Tripathi, Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs, ACM/Baltzer Wireless Networks Journal, Vol. 3, No. 1, January 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. Tripathi. Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs. A CM/Baltzer Wireless Networks Journal, pages 91-102, 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and S. K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs," ACM Wireless Networks 3, pp. 91-102, 1997.

No context found.

P. Bhagwat, P. Bhattacharya, A. Krishna, and K. Tripathi, "Using channel state dependent packet scheduling to improve TCP throughput over wireless LANs", Wireless Networks, pp. 91-102, 1997.

First 50 documents

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