Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Brooke Shrader"'
Publikováno v:
MILCOM 2022 - 2022 IEEE Military Communications Conference (MILCOM).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::865a85567e1b746753a31020803b584b
https://doi.org/10.1109/milcom55135.2022.10017499
https://doi.org/10.1109/milcom55135.2022.10017499
Publikováno v:
ISIT
Prof. Modiano via Barbara Williams
Prof. Modiano via Barbara Williams
Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves optimalit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9286b14f74928fe6d6c8deb7e0e78f55
Publikováno v:
ISIT
arXiv
arXiv
We consider a system consisting of a single transmitter/receiver pair and $N$ channels over which they may communicate. Packets randomly arrive to the transmitter's queue and wait to be successfully sent to the receiver. The transmitter may attempt a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ee89a2d71a7acac283f8bca1cf52b84
Publikováno v:
MobiHoc
We study the problem of learning channel statistics in order to efficiently schedule transmissions in wireless networks subject to interference constraints. In particular, we focus on the primary interference model which requires that at any time the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8044d5ff9194288b86951e2e534bd567
https://doi.org/10.1145/3209582.3209586
https://doi.org/10.1145/3209582.3209586
Autor:
Randy Cogill, Brooke Shrader
Publikováno v:
IEEE Transactions on Mobile Computing. 14:964-974
We consider the problem of transmitting a collection of packets from a source node to a destination node across a relaynetwork. We analyze a simple random network coding scheme where each node transmits a random linear combination of packets each tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bba0ac18fb43938010e1936daf3b40a
https://doi.org/10.1109/tmc.2014.2339228
https://doi.org/10.1109/tmc.2014.2339228
Publikováno v:
WiOpt
Prof. Modiano
Prof. Modiano
In order to steer antenna beams towards one another for communication, wireless nodes with highly-directional antennas must track the channel state of their neighbors. To keep this overhead manageable, each node must limit the number of neighbors tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c456895180cd0ad14addac88ed5cbcf
https://doi.org/10.1109/wiopt.2016.7492931
https://doi.org/10.1109/wiopt.2016.7492931
Autor:
Anthony Ephremides, Brooke Shrader
Publikováno v:
IEEE Transactions on Information Theory. 58:421-429
We analyze the queueing delay performance when random linear coding is performed over packets randomly arriving at a source node for multicast transmission over packet erasure channels. We model random coding of packets as a bulk-service queueing sys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd787469e80c5a7c2a104a79dd7cb75c
https://doi.org/10.1109/tit.2011.2171516
https://doi.org/10.1109/tit.2011.2171516
Publikováno v:
IEEE Journal on Selected Areas in Communications. 29:1106-1117
This paper presents techniques for achieving high throughput in delay-constrained, multihop wireless communication networks with time-varying link connectivity. We develop a rate-controlled, multipath strategy using network coding, and compare its pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b717b311523f35d88905266ccbec7640
https://doi.org/10.1109/jsac.2011.110520
https://doi.org/10.1109/jsac.2011.110520
Autor:
Brooke Shrader, R Cogill
Publikováno v:
IEEE Journal on Selected Areas in Communications. 29:1075-1083
In this work we analyze the average queue backlog for transmission of a single multicast flow consisting of M destination nodes in a wireless network. In the model we consider, the channel between every pair of nodes is an independent identically dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af0fd28fa0e987d9d246cb94ddf3959c
https://doi.org/10.1109/jsac.2011.110517
https://doi.org/10.1109/jsac.2011.110517
Publikováno v:
IEEE Transactions on Information Theory. 57:267-281
This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb64146afef907835b6e54baa7d1a8a4
https://doi.org/10.1109/tit.2010.2090214
https://doi.org/10.1109/tit.2010.2090214