34 search results - page 2 / 7 » Complexity of scheduling with analog network coding |
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
IWCMC
2006
ACM
13 years 11 months ago
2006
ACM
We study the diversity-multiplexing tradeoff in cooperative diversity systems involving multiple relays. We focus on low complexity architectures that do not require simultaneous...
ICN
2007
Springer
13 years 11 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
–This paper addresses the efficient multicast dissemination of bulk data from a single server to numerous clients. The challenge is complex: a client may commence reception at ar...