A reputation-based service differentiation scheme for mobile ad hoc networks

Providing a guaranteed quality of service is a challenging task in mobile ad hoc networks. However, relative guarantees can be achieved without resource reservations, admission control or traffic policing. A differentiated services approach can be employed to provide relative guarantees for different classes of services. Existing proposals for enforcing cooperation in mobile ad hoc networks (MANETs) do not provide service differentiations. Without distinguishing between various classes of nodes in the network, the provision of equal services to all participating nodes does not guarantee full cooperation in the network. In this paper, we propose a service differentiation mechanism for MANETs based on reputation ratings. The basic idea is to encourage nodes to cooperate by providing better services to more cooperative nodes. The proposed scheme has been evaluated in a simulation environment using various performance metrics. The simulation results show that the proposed scheme can successfully motivate non-cooperating nodes, achieve service differentiation objective and improve the performance of both individual nodes and the overall network.

[1]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[2]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[3]  Samuel Pierre,et al.  Stability and Resource Consideration Algorithm for Clustering in Mobile Ad Hoc Networks , 2004, International Conference on Wireless Networks.

[4]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[5]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[6]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[7]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[8]  Divyakant Agrawal,et al.  A game theoretic framework for incentives in P2P systems , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[9]  Raouf Boutaba,et al.  The degree of participation concept in ad hoc networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[10]  Mieso K. Denko.  Analysis of Clustering Algorithms in Mobile Ad Hoc Networks , 2003, International Conference on Wireless Networks.

[11]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Birgitta König-Ries,et al.  Stimulating Cooperative Behavior of Autonomous Devices: An Analysis of Requirements and Existing Approaches , 2003, Wireless Information Systems.

[13]  Nitin H. Vaidya,et al.  Priority Scheduling in Wireless Ad Hoc Networks , 2002, MobiHoc '02.

[14]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..

[15]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.