1 / 42

I-Hong Hou , Yao Liu, and Alex Sprintson Dept. of ECE, TAMU

A Non-Monetary Protocol for P2P Content Distribution in Wireless Broadcast Networks with Network Coding. I-Hong Hou , Yao Liu, and Alex Sprintson Dept. of ECE, TAMU. Wireless P2P. Exchange data locally instead of getting all packets from the base station. A,B. A. B. A,B. Wireless P2P.

harken
Download Presentation

I-Hong Hou , Yao Liu, and Alex Sprintson Dept. of ECE, TAMU

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Non-Monetary Protocol for P2P Content Distribution in Wireless Broadcast Networks with Network Coding I-Hong Hou, Yao Liu, and Alex Sprintson Dept. of ECE, TAMU

  2. Wireless P2P • Exchange data locally instead of getting all packets from the base station A,B A B A,B

  3. Wireless P2P • Exchange data locally instead of getting all packets from the base station A,B A B A B A,B

  4. Wireless P2P • Exchange data locally instead of getting all packets from the base station A,B A B A A B B A,B

  5. Wireless P2P • Exchange data locally instead of getting all packets from the base station A A B A B B

  6. Wireless P2P • Exchange data locally instead of getting all packets from the base station A A A B B B

  7. Benefits of Wireless P2P • Exchange data locally requires less power • Reduce power consumption • Reduce interference • Increase spatial reuse and hence total system capacity • Reduce the amount of data from BS • Reduce cost

  8. Incentives in P2P • People benefit from “receiving” data, not “transmitting” data • A policy is needed to make people contribute • Tic-for-tacexchange between 2 peers Need: A Need: B B A

  9. Incentives in P2P • People benefit from “receiving” data, not “transmitting” data • A policy is needed to make people contribute • Tic-for-tacexchange between 2 peers Need: A Need: B B A A B

  10. Free Rider Problem • The broadcast wireless channels make it a little bit more tricky… Need: A Need: B B A ……. A ……. B

  11. Free Rider Problem • The broadcast wireless channels make it a little bit more tricky… B B A A A B

  12. Free Rider Problem • The broadcast wireless channels make it a little bit more tricky… B A B A B A Free Riders! B A

  13. Contributions • Propose a non-monetary protocol for wireless P2P networks • Address the free rider by incentivizing nodes to contribute • Derive closed-form Nash Equilibrium • Propose a distributed mechanism that converges to the Nash Equilibrium • Incorporate network coding

  14. A Model for Incentives For every packet I download, I want: • Make as few transmissions as possible • Minimize the inter-packet delay, or, equivalently, maximize download rate

  15. A Model for Incentives My cost function: gn{avg. transmissions per download} +wn{avg. inter-download delay} gn: price for transmission wn: price for waiting

  16. Protocol Illustration Time Time B A A B

  17. Protocol Illustration backoff Time Time B A backoff A B

  18. Protocol Illustration Time up Time Time B A Have: A Need: B backoff A B

  19. Protocol Illustration backoff Time Time B A backoff A B

  20. Protocol Illustration backoff Time Time B A Time up A B B

  21. Protocol Illustration B Time Time B A A B A B

  22. Protocol Illustration A B Time Time B A A B A B

  23. Protocol for Bilateral File Exchange • Two files, A and B, in the system • The protocol consists of rounds • In the beginning of a round, nodes need B secretly picks a backoff time • The node n with the smallest backoff time transmits a control packet after backoff • Nodes that need A secretly picks a backoff time • The node m with the smallest backoff time exchanges with n

  24. Why the Protocol Works? For every packet I download, I want: • Make as few transmissions as possible • Minimize the inter-packet delay, or, equivalently, maximize download rate If I pick a large backoff time • More likely that I don’t transmit • Longer delay

  25. Performance Analysis • Only two files in the system • Strategy of node n that needs A: Choose backoff time as an exponential variable with mean • Theorem: This strategy is a Nash Equilibrium • Average amount of time on backoff:

  26. Performance Analysis • Only two files in the system • Strategy of node n that needs A: Choose backoff time as an exponential variable with mean Need to know the parameters of all other nodes!

  27. A Distributed Mechanism • I don’t know other nodes’ strategies • I can estimate them by monitoring system history • Update my strategy accordingly Theorem • The mechanism converges to a Nash Equilibrium • Node’s cost decreases with each update

  28. Simulation Setup • 10 nodes need A, and 10 nodes need B • gn=1, wn uniformly distributed between [1,2] • Each node decides its initial policy by assuming that there are 100 nodes that need the same file as it does, and all nodes have the same value of wn as itself • Each node uses the mechanism to update its strategy

  29. Simulation Results

  30. Performance Analysis • Only two files in the system • Strategy of node n that needs A: Choose backoff time as an exponential variable with mean • Theorem: This strategy is a Nash Equilibrium • Average amount of time on backoff:

  31. Incorporating Network Coding for Multiple Files B A B A B C C A C A B C

  32. Incorporating Network Coding for Multiple Files B A B A backoff backoff backoff backoff B C C A backoff backoff C A B C

  33. Incorporating Network Coding for Multiple Files B A B A backoff Time up backoff backoff B C C A backoff backoff C A B C

  34. Incorporating Network Coding for Multiple Files B A B A Have: A, B Need: C B C C A C A B C

  35. Incorporating Network Coding for Multiple Files B A B A backoff backoff B C C A backoff backoff C A B C

  36. Incorporating Network Coding for Multiple Files B A B A backoff backoff B C C A backoff Time up C A B C

  37. Incorporating Network Coding for Multiple Files B A C C B A B C C A C A C B C

  38. Incorporating Network Coding for Multiple Files B A C C B A + A B B C C A C A B C

  39. Incorporating Network Coding for Multiple Files B A C C B A B B C - C A A A = + B B C A B C B

  40. Incorporating Network Coding for Multiple Files B A C C B A A B B C C A A - A + = B B A C A B C B

  41. Performance Analysis for Network Coding • Theorem: When there are multiple files with network coding employed, and every node chooses its backoff time as an exponential random variable, the Nash Equilibrium can be computed by solving a series of linear equations

  42. Conclusions • We propose a non-monetary protocol to address the free rider problem in wireless P2P networks • The core idea is to apply random backoff • Derive closed-form Nash Equilibrium • Propose a distributed mechanism for convergence • Extend the protocol to incorporate network coding

More Related