@article{
 title = {Relay-assisted user scheduling in wireless networks with hybrid ARQ},
 type = {article},
 year = {2009},
 identifiers = {[object Object]},
 keywords = {[Hybrid automatic repeat request (HARQ), Priority-},
 volume = {58},
 id = {ecd80e2d-787c-3df1-a4e5-d324d4e608d7},
 created = {2016-09-06T19:47:47.000Z},
 file_attached = {false},
 profile_id = {be62f108-1255-3a2e-9f9e-f751a39b8a03},
 last_modified = {2017-03-24T19:20:02.182Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {This paper studies the problem of relay-assisted user scheduling for downlink wireless transmission. The base station or access point employs hybrid automatic repeat request (HARQ) with the assistance of a set of fixed relays to serve a set of mobile users. By minimizing a cost function of the queue lengths at the base station and the number of retransmissions of the head-of-line packet for each user, the base station can schedule an appropriate user in each time slot and an appropriate transmitter to serve it. It is shown that a priority-index policy is optimal for a linear cost function with packets arriving according to a Poisson process and for an increasing convex cost function where packets must be drained from the queues at the base station. ? 2009 IEEE.},
 bibtype = {article},
 author = {Lo, C.K. and Hasenbein, J.J. and Vishwanath, S. and Heath Jr., R.W.},
 journal = {IEEE Transactions on Vehicular Technology},
 number = {9}
}

{"_id":"JZ3BNMm8Xf26g3bHN","bibbaseid":"lo-hasenbein-vishwanath-heathjr-relayassisteduserschedulinginwirelessnetworkswithhybridarq-2009","authorIDs":[],"author_short":["Lo, C.","Hasenbein, J.","Vishwanath, S.","Heath Jr., R."],"bibdata":{"title":"Relay-assisted user scheduling in wireless networks with hybrid ARQ","type":"article","year":"2009","identifiers":"[object Object]","keywords":"[Hybrid automatic repeat request (HARQ), Priority-","volume":"58","id":"ecd80e2d-787c-3df1-a4e5-d324d4e608d7","created":"2016-09-06T19:47:47.000Z","file_attached":false,"profile_id":"be62f108-1255-3a2e-9f9e-f751a39b8a03","last_modified":"2017-03-24T19:20:02.182Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":false,"abstract":"This paper studies the problem of relay-assisted user scheduling for downlink wireless transmission. The base station or access point employs hybrid automatic repeat request (HARQ) with the assistance of a set of fixed relays to serve a set of mobile users. By minimizing a cost function of the queue lengths at the base station and the number of retransmissions of the head-of-line packet for each user, the base station can schedule an appropriate user in each time slot and an appropriate transmitter to serve it. It is shown that a priority-index policy is optimal for a linear cost function with packets arriving according to a Poisson process and for an increasing convex cost function where packets must be drained from the queues at the base station. ? 2009 IEEE.","bibtype":"article","author":"Lo, C.K. and Hasenbein, J.J. and Vishwanath, S. and Heath Jr., R.W.","journal":"IEEE Transactions on Vehicular Technology","number":"9","bibtex":"@article{\n title = {Relay-assisted user scheduling in wireless networks with hybrid ARQ},\n type = {article},\n year = {2009},\n identifiers = {[object Object]},\n keywords = {[Hybrid automatic repeat request (HARQ), Priority-},\n volume = {58},\n id = {ecd80e2d-787c-3df1-a4e5-d324d4e608d7},\n created = {2016-09-06T19:47:47.000Z},\n file_attached = {false},\n profile_id = {be62f108-1255-3a2e-9f9e-f751a39b8a03},\n last_modified = {2017-03-24T19:20:02.182Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {This paper studies the problem of relay-assisted user scheduling for downlink wireless transmission. The base station or access point employs hybrid automatic repeat request (HARQ) with the assistance of a set of fixed relays to serve a set of mobile users. By minimizing a cost function of the queue lengths at the base station and the number of retransmissions of the head-of-line packet for each user, the base station can schedule an appropriate user in each time slot and an appropriate transmitter to serve it. It is shown that a priority-index policy is optimal for a linear cost function with packets arriving according to a Poisson process and for an increasing convex cost function where packets must be drained from the queues at the base station. ? 2009 IEEE.},\n bibtype = {article},\n author = {Lo, C.K. and Hasenbein, J.J. and Vishwanath, S. and Heath Jr., R.W.},\n journal = {IEEE Transactions on Vehicular Technology},\n number = {9}\n}","author_short":["Lo, C.","Hasenbein, J.","Vishwanath, S.","Heath Jr., R."],"bibbaseid":"lo-hasenbein-vishwanath-heathjr-relayassisteduserschedulinginwirelessnetworkswithhybridarq-2009","role":"author","urls":{},"keyword":["[Hybrid automatic repeat request (HARQ)","Priority-"],"downloads":0},"bibtype":"article","creationDate":"2020-10-14T23:11:31.675Z","downloads":0,"keywords":["[hybrid automatic repeat request (harq)","priority-"],"search_terms":["relay","assisted","user","scheduling","wireless","networks","hybrid","arq","lo","hasenbein","vishwanath","heath jr."],"title":"Relay-assisted user scheduling in wireless networks with hybrid ARQ","year":2009}