Multipath Wireless Network Coding: A Population Game Perspective

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages and 4 figures

Scientific paper

We consider wireless networks in which multiple paths are available between each source and destination. We allow each source to split traffic among all of its available paths, and ask the question: how do we attain the lowest possible number of transmissions to support a given traffic matrix? Traffic bound in opposite directions over two wireless hops can utilize the ``reverse carpooling'' advantage of network coding in order to decrease the number of transmissions used. We call such coded hops as ``hyper-links''. With the reverse carpooling technique longer paths might be cheaper than shorter ones. However, there is a prisoners dilemma type situation among sources -- the network coding advantage is realized only if there is traffic in both directions of a shared path. We develop a two-level distributed control scheme that decouples user choices from each other by declaring a hyper-link capacity, allowing sources to split their traffic selfishly in a distributed fashion, and then changing the hyper-link capacity based on user actions. We show that such a controller is stable, and verify our analytical insights by simulation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Multipath Wireless Network Coding: A Population Game Perspective 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 Multipath Wireless Network Coding: A Population Game Perspective, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multipath Wireless Network Coding: A Population Game Perspective will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-364202

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.