Network Coding over a Noisy Relay: a Belief Propagation Approach (2008)
Abstract — In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes performing...
W. Main St, Sichao Yang, S. Orchard St
research was motivated by the rate allocation problem in communication networks. We consider the scenarios of strategic buyers purchasing rate along paths in a communication network. The network...
Hajek, Bruce, Mitzel, Kevin, Yang, Sichao
This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon...
Network Coding over a Noisy Relay : a Belief Propagation Approach (2007)
In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes performing network coding can...
Ying, Lei, Yang, Sichao, Srikant, R.
In this paper, we investigate the delay-throughput trade-offs in mobile ad-hoc networks under two-dimensional i.i.d. mobility models. We consider two mobility time-scales: (i) Fast mobility where...
Strategic Buyers in a Sum Bid Game for Flat Networks (2004)
This note addresses scenarios of buyers purchasing rate along paths in a nonhierarchical communication network. A sum bid game is proposed in which each buyer submits a bid, also equal to a payment,...
Strategic buyers in a sum-bid game for flat networks (2004)
This note addresses scenarios of buyers purchasing rate along paths in a nonhierarchical communication network. A sum bid game is proposed in which each buyer submits a bid, also equal to a payment,...
Bruce Hajek, Kevin Mitzel, Sichao Yang
This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discounted, infinite-horizon...