Social Norm Incentives for Network Coding in Manets
Pages 1761 - 1774
Abstract
The performance of mobile ad hoc network transmissions subject to disruption, loss, interference, and jamming can be significantly improved with the use of network coding NC. However, NC requires extra work for forwarders, including additional bandwidth consumption due to transmitting overheads for redundant NC packets and additional processing due to generating the NC packets. Selfish forwarders may prefer to simply forward packets without coding them to avoid such overhead. This is especially true when network coding must be protected from pollution attacks, which involves additional, often processor intensive, pollution detection procedures. To drive selfish nodes to cooperate and encode the packets, this paper introduces social norm-based incentives. The social norm consists of a social strategy and a reputation system with reward and punishment connected with node behavior. Packet coding and forwarding are modeled and formalized as a repeated NC forwarding game. The conditions for the sustainability or compliance of the social norm are identified, and a sustainable social norm that maximizes the social utility is designed via selecting the optimal design parameters, including the social strategy, reputation threshold, reputation update frequency, and the generation size of network coding. For this game, the impacts of packet loss rate and transmission patterns on performance are evaluated, and their impacts on the decision of selecting the optimal social norm are discussed. Finally, practical issues, including distributed reputation dissemination and the existence of altruistic and malicious users, are discussed.
References
[1]
R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
[2]
R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
[3]
S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
[4]
S.-H. Lee, M. Gerla, H. Krawczyk, K.-W. Lee, and E. A. Quaglia, "Quantitative evaluation of secure network coding using homomorphic signature/hashing," in Proc. NetCod, Beijing, China, Jul. 2011, pp. 1-10.
[5]
Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An efficient signature-based scheme for securing network coding against pollution attacks," in Proc. IEEE INFOCOM, Apr. 2008, pp. 1409-1417.
[6]
J. Joy, Y. Yu-Ting, V. Perez, D. Lu, and M. Gerla, "A new approach to coding in content-based MANETs," in Proc. Int. Conf. Comput., Netw. Commun. (ICNC), Honolulu, HI, USA, Feb. 2014, pp. 173-177.
[7]
S. Bhadra, S. Shakkottai, and P. Gupta, "Min-cost selfish multicast with network coding," IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 5077-5087, Nov. 2006.
[8]
J. Price and T. Javidi, "Network coding games with unicast flows," IEEE J. Sel. Areas Commun., vol. 26, no. 7, pp. 1302-1316, Sep. 2008.
[9]
X. Zhang and B. Li, "Dice: A game theoretic framework for wireless multipath network coding," in Proc. MobiHoc, 2008, pp. 293-302.
[10]
J. R. Marden and M. Effros, "A game theoretic approach to network coding," in Proc. IEEE Inf. Theory Workshop Netw. Inf. Theory, Jun. 2009, pp. 147-151.
[11]
J. R. Marden and M. Effros, "The price of selfishness in network coding," in Proc. 5th Workshop Netw. Coding Theory Appl., Jun. 2009, pp. 18-23.
[12]
M. Kandori, "Social norms and community enforcement," Rev. Econ. Stud., vol. 59, no. 1, pp. 63-80, Jan. 1992.
[13]
S. Marti, T. J. Giuli, K. Lai, and M. Baker, "Mitigating routing misbehavior in mobile ad hoc networks," in Proc. ACM MOBICOM, 2000, pp. 255-265.
[14]
S. Buchegger and J.-Y. Le Boudec, "Self-policing mobile ad hoc networks by reputation systems," IEEE Commun. Mag., vol. 43, no. 7, pp. 101-107, Jul. 2005.
[15]
L. Buttyán, L. Dóra, M. Félegyházi, and I. Vajda, "Barter trade improves message delivery in opportunistic networks," Ad Hoc Netw., vol. 8, no. 1, pp. 1-14, Jan. 2010.
[16]
C. Dellarocas, "Research note--How often should reputation mechanisms update a trader's reputation profile?" Inf. Syst. Res., vol. 17, no. 3, pp. 271-285, Sep. 2006.
[17]
Y. Zhang and M. van der Schaar, "Peer-to-peer multimedia sharing based on social norms," Image Commun., vol. 27, no. 5, pp. 383-400, May 2012
[18]
S. Buchegger and J.-Y. Le Boudec, "A robust reputation system for P2P and mobile ad-hoc networks," in Proc. P2PEcon, Cambridge, MA, USA, 2004, pp. 1-6.
[19]
M. Feldman, K. Lai, I. Stoica, and J. Chuang, "Robust incentive techniques for peer-to-peer networks," in Proc. 5th ACM Conf. Electron. Commerce (EC), New York, NY, USA, 2004, pp. 102-111.
[20]
S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, "The Eigentrust algorithm for reputation management in P2P networks," in Proc. 12th Int. World Wide Web Conf., 2003, pp. 640-651.
[21]
Y. Zhu and H. Shen, "TrustCode: P2P reputation-based trust management using network coding," in Proc. 15th Int. Conf. High Perform. Comput., Bangalore, India, Dec. 2008.
[22]
P. Golle, K. Leyton-Brown, I. Mironov, and M. Lillibridge, "Incentives for sharing in peer-to-peer networks," in Proc. 3rd ACM Conf. Electron. Commerce, Oct. 2001, pp. 75-87.
[23]
K. G. Anagnostakis and M. B. Greenwald, "Exchange-based incentive mechanisms for peer-to-peer file sharing," in Proc. 24th Int. Conf. IEEE Distrib. Comput. Syst., Mar. 2004, pp. 524-533.
[24]
J. Park and M. van der Schaar, "Pricing and incentives in peer-to-peer networks," in Proc. INFOCOM, Mar. 2010, pp. 1-9.
[25]
U. Shevade, H. H. Song, L. Qiu, and Y. Zhang, "Incentive-aware routing in DTNs," in Proc. IEEE ICNP, Orlando, FL, USA, Oct. 2008, pp. 238-247.
[26]
J. Xu and M. van der Schaar, "Designing incentives for wireless relay networks using tokens," in Proc. 10th Int. Symp. Modeling Optim. Mobile, Ad Hoc Wireless Netw. (WiOpt), May 2012, pp. 169-176.
[27]
N. Ben Salem, L. Buttyán, J.-P. Hubaux, and M. Jakobsson, "A charging and rewarding scheme for packet forwarding in multi-hop cellular networks," in Proc. ACM MOBICOM, 2003, pp. 13-24.
[28]
M. Jakobsson, L.-P. Hubaux, and L. Buttyán, "A micro-payment scheme encouraging collaboration in multi-hop cellular networks," in Proc. Financial Crypto, 2003, pp. 15-33.
[29]
S. Zhong, J. Chen, and Y. R. Yang, "Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks," in Proc. INFOCOM, Mar./Apr. 2003, pp. 1987-1997.
[30]
Y. Xu and K. Sakurai, "Cooperatively securing network coding against pollution attacks with incentive mechanism," in Proc. ICUIMC, 2012, Art. no. 52.
[31]
C. Zhang, X. Zhu, Y. Song, and Y. Fang, "C4: A new paradigm for providing incentives in multi-hop wireless networks," in Proc. IEEE INFOCOM, Apr. 2011, pp. 918-926.
[32]
F. Milan, J. J. Jaramillo, and R. Srikant, "Achieving cooperation in multihop wireless networks of selfish nodes," in Proc. Workshop Game Theory Commun. Netw., Pisa, Italy, Oct. 2006, Art. no. 3.
[33]
J. J. Jaramillo and R. Srikant, "DARWIN: Distributed and adaptive reputation mechanism for wireless ad-hoc networks," in Proc. MOBICOM, Montreal, QC, Canada, Sep. 2007, pp. 87-98.
[34]
T. Chen, F. Wu, and S. Zhong, "FITS: A finite-time reputation system for cooperation in wireless ad hoc networks," IEEE Trans. Comput., vol. 60, no. 7, pp. 1045-1056, Jul. 2010.
[35]
W. J. Adams, G. C. Hadjichristofi, and N. J. Davis, "Calculating a node's reputation in a mobile ad hoc network," in Proc. 24th IEEE Int. Perform., Comput., Commun. Conf. (IPCCC), Apr. 2005, pp. 303-307.
[36]
S. Buchegger and J.-Y. L. Boudec, "A robust reputation system for mobile ad-hoc networks," EPFL, Lausanne, Switzerland, Tech. Rep. EPFL-IC-LCA, 2003.
[37]
T. Chen and S. Zhong, "INPAC: An enforceable incentive scheme for wireless networks using network coding," in Proc. IEEE INFOCOM, Mar. 2010, pp. 1828-1836.
[38]
T. Chen, A. Bansal, and S. Zhong, "A reputation system for wireless mesh networks using network coding," J. Netw. Comput. Appl., vol. 34, no. 2, pp. 535-541, Mar. 2011.
[39]
C. Wu, M. Gerla, and M. van der Schaar, "Social norm incentives for secure network coding in MANETs," in Proc. IEEE NetCod, Jun. 2012, pp. 179-184.
[40]
J. Dong, R. Curtmola, and C. Nita-Rotaru, "Practical defenses against pollution attacks in wireless network coding," ACM Trans. Syst. Inf. Secur., vol. 14, no. 1, May 2011, Art. no. 7.
[41]
E. Kehdi and B. Li, "Null keys: Limiting malicious attacks via null space properties of network coding," in Proc. INFOCOM, Apr. 2009, pp. 1224-1232.
[42]
A. Newell and C. Nita-Rotaru, "Split null keys: A null space based defense for pollution attacks in wireless network coding," in Proc. IEEE Commun. Soc. Conf. Sensor, Mesh, Ad Hoc Commun. Netw. (SECON), Jun. 2012, pp. 479-487.
[43]
V. N. Talooki et al., "Security concerns and countermeasures in network coding based communication systems: A survey," Int. J. Comput. Telecommun. Netw., vol. 83, pp. 422-445, Jun. 2015.
[44]
M. Srivatsa, L. Xiong, and L. Liu, "TrustGuard: Countering vulnerabilities in reputation management for decentralized overlay networks," in Proc. 14th Int. Conf. World Wide Web, May 2005, pp. 422-431.
[45]
Y. Yang, Y. L. Sun, S. Kay, and Q. Yang, "Defending online reputation systems against collaborative unfair raters through signal modeling and trust," in Proc. 24th ACM Symp. Appl. Comput., Mar. 2009, pp. 1308-1315.
- Social Norm Incentives for Network Coding in Manets
Recommendations
Opportunistic MANETs: mobility can make up for low transmission power
Opportunistic mobile ad hoc networks (MANETs) are a special class of sparse and disconnected MANETs where data communication exploits sporadic contact opportunities among nodes. We consider opportunistic MANETs where nodes move independently at random ...
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide good delivery performance and low end-to-end delay in a ...
Efficient Broadcasting Using Network Coding and Directional Antennas in MANETs
In this paper, we consider the issue of efficient broadcasting in mobile ad hoc networks (MANETs) using network coding and directional antennas. Network coding-based broadcasting focuses on reducing the number of transmissions each forwarding node ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2017.
Publisher
IEEE Press
Publication History
Published: 01 June 2017
Published in TON Volume 25, Issue 3
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 52Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in