Optimal Peer-to-Peer Scheduling for Mobile Wireless Networks with Redundantly Distributed Data

This paper considers peer-to-peer scheduling for a network with multiple wireless devices. A subset of the devices are mobile users that desire specific files. Each user may already have certain popular files in its cache. The remaining devices are access points that typically have a larger set of files. Users can download packets of their requested file from an access point or from another user. A dynamic algorithm that opportunistically grabs packets from current neighbors is developed. Under a simple model where each user desires a single file with infinite length, the algorithm is shown to optimize utility while incentivizing participation. The algorithm extends as an efficient heuristic in more general cases with finite file sizes and random active and idle periods. Example simulations demonstrate the dramatic throughput gains enabled by wireless peering