Download now Free registration required
In this paper, the authors generalize the problem of network coded cooperative data exchange from a fixed broadcast topology to dynamic networks with mobile peers. In this problem a group of wireless clients are interested in obtaining a set of packets through cooperation, where each client initially holds a subset of packets. Unlike recent studies where cooperation is enabled through a fixed error free broadcast channel among fixed or stationary peers, they assume that peers move randomly between transmission rounds, have a limited transmission range and suffer from packet erasures. In this case giving an exact solution to the problem of minimum number of transmissions is difficult, if not impossible.
- Format: PDF
- Size: 91.08 KB