A reputation system for wireless mesh networks using network coding

Authors:
Tingting Chen;Ankur Bansal;Sheng Zhong
Affiliations:
Computer Science and Engineering Department, State University of New York, Buffalo, Amherst, NY 14260, USA;Computer Science and Engineering Department, State University of New York, Buffalo, Amherst, NY 14260, USA;Computer Science and Engineering Department, State University of New York, Buffalo, Amherst, NY 14260, USA
Venue:
Journal of Network and Computer Applications
Year:
2011

Citing 17
Cited 3

Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
A high-throughput path metric for multi-hop wireless routing

Proceedings of the 9th annual international conference on Mobile computing and networking
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

Proceedings of the 9th annual international conference on Mobile computing and networking
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Architecture and evaluation of an unplanned 802.11b mesh network

Proceedings of the 11th annual international conference on Mobile computing and networking
XORs in the air: practical wireless network coding

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Reputation in self-organized communication systems and beyond

Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Sustaining cooperation in multi-hop wireless networks

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Trading structure for randomness in wireless opportunistic routing

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Symbol-level network coding for wireless mesh networks

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Incentive-compatible opportunistic routing for wireless networks

Proceedings of the 14th ACM international conference on Mobile computing and networking
INPAC: an enforceable incentive scheme for wireless networks using network coding

INFOCOM'10 Proceedings of the 29th conference on Information communications
Network information flow

IEEE Transactions on Information Theory
Self-policing mobile ad hoc networks by reputation systems

IEEE Communications Magazine

Online reputation management for improving marketing by using a hybrid MCDM model

Knowledge-Based Systems
Benefits of using parallelized non-progressive network coding

Journal of Network and Computer Applications
On the credit evolution of credit-based incentive protocols in wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using network coding, wireless mesh networks can significantly improve their performance. However, since many wireless mesh networks have user contributed devices as their nodes, to guarantee the cooperation of such selfish nodes is a highly challenging problem. In this paper, we study how to stimulate selfish nodes to cooperate in wireless mesh networks using network coding. We propose a simple, practical reputation system that rewards cooperative behavior in routing and packet forwarding and penalizes non-cooperative behavior. Simulation results verify that our reputation system is very efficient and that it effectively stimulates cooperation.