research-article

Dice: a game theoretic framework for wireless multipath network coding

Authors:

Baochun LiAuthors Info & Claims

MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing

Pages 293 - 302

https://doi.org/10.1145/1374618.1374658

Published: 26 May 2008 Publication History

Abstract

Network coding has emerged as a promising approach that enables reliable and efficient end-to-end transmissions in lossy wireless mesh networks. Existing protocols have demonstrated its resilience to packet losses, as well as the ability to integrate naturally with multipath opportunistic routing. However, these heuristics do not take into account the inherent resource competition in wireless networks, thereby compromising the coding advantages. In this paper, we take a game-theoretic perspective towards optimized resource allocation for network coding based unicast protocols. We design decentralized mechanisms that achieve better efficiency-fairness tradeoff, for both cooperative and selfish users. Our framework features a modularized optimization of two subproblems: the multipath routing of coded information flows for each player, and the broadcast and coding rate allocation among competing players. We have implemented the framework on a wireless emulation testbed and demonstrated its high performance in terms of throughput and fairness.

References

[1]

J. Bicket, D. Aguayo, S. Biswas, and R. Morris, "Architecture and Evaluation of an Unplanned 802.11b Mesh Network", in Proc. of ACM MobiCom, 2005.

Digital Library

[2]

D. De Couto, D. Aguayo, J. Bicket, and R. Morris, "A High-throughput Path Metric for Multi-hop Wireless Routing", in Proc. of ACM MobiCom, 2003.

Digital Library

[3]

M. R. Pearlman, Z. J. Haas, P. Sholander, and S. Tabrizi, "On the Impact of Alternate Path Routing for Load Balancing in Mobile Ad Hoc Networks", in Proc. of ACM MobiHoc, 2000.

Digital Library

[4]

S. Biswas and R. Morris, "ExOR: Opportunistic Multi hop Routing for Wireless Networks", in Proc. of SIGCOMM, 2005.

Digital Library

[5]

S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading Structure for Randomness in Wireless Opportunistic Routing", in Proc. of ACM SIGCOMM, 2007.

Digital Library

[6]

D. S. Lun, M. Medard, and R. Koetter, "Network Coding for Efficient Wireless Unicast", in Proc. of IEEE International Zurich Seminar on Communications, 2006.

Digital Library

[7]

X. Lin, N. B. Shroff, and R. Srikant, "A Tutorial on Cross-Layer Optimization in Wireless Networks", IEEE Journal on Sel. Areas in Comm., vol. 24, no. 8, 2006.

Digital Library

[8]

Y. Xue, B. Li, and K. Nahrstedt, "Channel-Relay Price Pair: Towards Arbitrating Incentives in Wireless Ad Hoc Networks", Wirel. Commun. Mob. Comput., vol. 6, no. 2, 2006.

Digital Library

[9]

Z. Fang and B. Bensaou, "Fair Bandwidth Sharing Algorithms Based on Game Theory Frameworks for Wireless Ad-hoc Networks", in Proc. of IEEE INFOCOM, 2004.

[10]

L. Chen, T. Ho, S. Low, M. Chiang, and J. Doyle, "Optimization Based Rate Control for Multicast With Network Coding", in Proc. of IEEE INFOCOM, 2007.

Digital Library

[11]

Z. Li, "Min-Cost Multicast of Selfish Information Flows", in Proc. of IEEE INFOCOM, 2007.

[12]

B. Radunovic, C. Gkantsidis, P. Key, P. Rodriguez, and W. Hu, "An Optimization Framework for Practical Multipath Routing in Wireless Mesh Networks", Tech. Rep. MSR-TR-2007-83, Microsoft Research, July 2007.

[13]

T. Ho and H. Viswanathan, "Dynamic Algorithms for Multicast With Intra-session Network Coding", in Allerton, 2005.

[14]

K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, "Impact of Interference on Multi-hop Wireless Network Performance", in Proc. of ACM MobiCom, 2003.

Digital Library

[15]

F. Forgo, J. Szep, and F. Szidarovszky, "Introduction to the Theory of Games", Kluwer Academic, 1999.

[16]

H. Yaïche, R. R. Mazumdar, and C. Rosenberg, "A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Networks", IEEE/ACM Trans. Netw., vol. 8, no. 5, 2000.

Digital Library

[17]

N. Z. Shor, K. Kiwiel, and A. Ruszcayński, Minimization Methods for Non-differentiable Functions, Springer-Verlag, 1985.

Digital Library

[18]

A. Nedic and A. Ozdaglar, "Approximate Primal Solutions and Rate Analysis for Subgradient Methods, Tech. Rep., MIT LIDS, March 2007.

[19]

D. P. Bertsekas and J. N. Tsitsiklis, Parallel and "Distributed Computation: Numerical Methods", Prentice-Hall, 1989.

Digital Library

[20]

L. Chen, S. Low, M. Chiang, and J. Doyle, "Joint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks, in Proc. of IEEE INFOCOM, 2005.

[21]

L. Pavel, "An Extension of Duality to a Game-theoretic Framework", Automatica, vol. 43, no. 2, 2007.

Digital Library

[22]

J. Camp, J. Robinson, C. Steger, and E. Knightly, "Measurement Driven Deployment of a Two-tier Urban Mesh Access Network", in Proc. of MobiSys, 2006.

Digital Library

[23]

R. Jain, D. Chiu, and W. Hawe, "A Quantitative Measure of Fairness and Discrimination For Resource Allocation in Shared Computer Systems", Tech. Rep. TR-301, DEC Research, September 1984.

Cited By

Wang YZhou CLiu XYang Y(2024)Attitude-Aware Based Geographical Opportunity Routing Protocol for Floating Wireless Sensor NetworkWireless Sensor Networks10.1007/978-981-97-1010-2_3(29-41)Online publication date: 1-Mar-2024
https://doi.org/10.1007/978-981-97-1010-2_3
Ahmad KFathima MHossen MAhamed JAhmad K(2023)Opportunistic Networks: An Empirical Research of Routing Protocols and Mobility ModelsSN Computer Science10.1007/s42979-023-02054-y4:5Online publication date: 28-Aug-2023
https://doi.org/10.1007/s42979-023-02054-y
Dalal RKhari MAnzola JGarcia-Diaz V(2022)Proliferation of Opportunistic Routing: A Systematic ReviewIEEE Access10.1109/ACCESS.2021.313692710(5855-5883)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2021.3136927
Show More Cited By

Index Terms

Dice: a game theoretic framework for wireless multipath network coding
1. Networks
  1. Network architectures
  2. Network protocols

Recommendations

Toward practical opportunistic routing with intra-session network coding for mesh networks

We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multipath routing. We present a novel optimization framework for opportunistic routing based on network ...
O3: optimized overlay-based opportunistic routing
MobiHoc '11: Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing

Opportunistic routing achieves significant performance gain under lossy wireless links. In this paper, we develop a novel approach that exploits inter-flow network coding in opportunistic routing. A unique feature of our design is that it systematically ...
On selection of forwarding nodes for long opportunistic routes

Opportunistic routing is a promising routing paradigm which increases the network throughput. It forces the sender's neighbors, who successfully overheard the transmitted packet, to participate in the packet forwarding process as intermediate forwarding ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing

May 2008

474 pages

ISBN:9781605580739

DOI:10.1145/1374618

General Chair:
Xiaohua Jia
City University of Hong Kong, Hong Kong
,
Program Chairs:
Ness B. Shroff
Ohio State University, USA
,
Peng-Jun Wan
Illinois Institute of Technology, USA

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 May 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MobiHoc08

Sponsor:

MobiHoc08: The Ninth ACM International Symposium on Mobile Ad Hoc Networking and Computing

May 26 - 30, 2008

Hong Kong, Hong Kong, China

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

63
Total Citations
View Citations
753
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang YZhou CLiu XYang Y(2024)Attitude-Aware Based Geographical Opportunity Routing Protocol for Floating Wireless Sensor NetworkWireless Sensor Networks10.1007/978-981-97-1010-2_3(29-41)Online publication date: 1-Mar-2024
https://doi.org/10.1007/978-981-97-1010-2_3
Ahmad KFathima MHossen MAhamed JAhmad K(2023)Opportunistic Networks: An Empirical Research of Routing Protocols and Mobility ModelsSN Computer Science10.1007/s42979-023-02054-y4:5Online publication date: 28-Aug-2023
https://doi.org/10.1007/s42979-023-02054-y
Dalal RKhari MAnzola JGarcia-Diaz V(2022)Proliferation of Opportunistic Routing: A Systematic ReviewIEEE Access10.1109/ACCESS.2021.313692710(5855-5883)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2021.3136927
Hasselquist DLindström CKorzhitskii NCarlsson NGurtov A(2022)QUIC Throughput and Fairness over Dual ConnectivityComputer Networks10.1016/j.comnet.2022.109431219(109431)Online publication date: Dec-2022
https://doi.org/10.1016/j.comnet.2022.109431
Hasselquist DLindström CKorzhitskii NCarlsson NGurtov A(2021)QUIC Throughput and Fairness over Dual ConnectivityModelling, Analysis, and Simulation of Computer and Telecommunication Systems10.1007/978-3-030-68110-4_12(175-190)Online publication date: 29-Jan-2021
https://doi.org/10.1007/978-3-030-68110-4_12
Adat Vasudevan VTselios CPolitis I(2020)On Security Against Pollution Attacks in Network Coding Enabled 5G NetworksIEEE Access10.1109/ACCESS.2020.29757618(38416-38437)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2975761
Wu CGerla Mvan der Schaar M(2017)Social Norm Incentives for Network Coding in ManetsIEEE/ACM Transactions on Networking10.1109/TNET.2017.265605925:3(1761-1774)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1109/TNET.2017.2656059
Jadhav PSatao R(2016)A Survey on Opportunistic Routing Protocols for Wireless Sensor NetworksProcedia Computer Science10.1016/j.procs.2016.03.07679(603-609)Online publication date: 2016
https://doi.org/10.1016/j.procs.2016.03.076
Wang WChen XLu MWang JZhang XWu J(2016)Code pruning in opportunistic routing through bidirectional coding traffic comparisonWireless Communications & Mobile Computing10.1002/wcm.251416:3(279-299)Online publication date: 25-Feb-2016
https://dl.acm.org/doi/10.1002/wcm.2514
Pappi KDiamantoulakis POtrok HKaragiannidis G(2015)Cloud Compute-and-Forward With Relay CooperationIEEE Transactions on Wireless Communications10.1109/TWC.2015.240554714:6(3415-3428)Online publication date: Jun-2015
https://doi.org/10.1109/TWC.2015.2405547
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents