Wireless Peer-to-Peer Scheduling in Mobile Networks

Details Wireless Peer-to-Peer Scheduling in Mobile Networks Wireless Peer-to-Peer Scheduling in Mobile Networks

2012-02-19

arxiv.org/abs/1202.4451v1

Computer Science

Networking and Internet Architecture

This material will be presented in part at the 46th Annual Conference on Information Sciences and Systems (CISS), Princeton, N

Scientific paper

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 access to a larger set of files. Users can download packets of their requested file from an access point or from a nearby user. Our prior work optimizes peer scheduling in a general setting, but the resulting delay can be large when applied to mobile networks. This paper focuses on the mobile case, and develops a new algorithm that reduces delay by opportunistically grabbing packets from current neighbors. However, it treats a simpler model where each user desires a single file with infinite length. An algorithm that provably optimizes throughput utility while incentivizing participation is developed for this case. The algorithm extends as a simple heuristic in more general cases with finite file sizes and random active and idle periods.

Affiliated with

Also associated with

No associations

Rating

Wireless Peer-to-Peer Scheduling in Mobile Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Wireless Peer-to-Peer Scheduling in Mobile Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Wireless Peer-to-Peer Scheduling in Mobile Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-419689