Motivated by the concerns of cooperation security, this work examines selected principles of state-of-the-art reputation systems for multihop adhoc networks and their impact upon optimal strategies for rational nodes. An analytic framework is proposed and used for identification of effective cooperation-enforcement schemes. It is pointed out that an optimum rather than high reputation can be expected to be sought by rational nodes.

Nodal cooperation equilibrium analysis in multihop wireless ad hoc networks with a reputation system

Motivated by the concerns of cooperation security, this work examines selected principles of state-of-the-art reputation systems for multi-hop ad hoc networks and their impact upon optimal strategies for rational nodes. An analytic framework is proposed and used for identification of effective cooperation-enforcement schemes. It is pointed out that optimum rather than high reputation can be expected to be sought by rational nodes.

Nodal Cooperation Equilibrium Analysis in Multi-hop Wireless Ad Hoc Networks with a Reputation System

A novel, holistic approach to cooperation incentivization in multihop wireless ad hoc networks is introduced The concept utilizes a reputation metric to tailor a response to rational nodes’ behavior and thus promote cooperation while balancing network traffic among network nodes and protecting well-behaving nodes from excessive network load The solution aims at deterring selfish optimization techniques which may result in network-wide Path Delivery Ratio (PDR) degradation

Carrot and Stick: Incentivizing Cooperation Between Nodes in Multihop Wireless Ad Hoc Networks

We consider a type of game theoretic dynamics in a network model where all nodes act selfishly and will forward packets only if it is to their benefit. The model we present assumes that each node receives utility from successfully sending its own flow to its destination(s) and from receiving flow, while it pays a cost (e.g., battery energy) for its transmissions. Each node has to decide whether to relay flow as an intermediate node from other sources, as relaying incurs only costs. To induce nodes into acting as intermediaries, the model implements a reputation-based mechanism which punishes non-cooperative nodes by cutting off links to them, a decision that is made in a very local fashion. In our setting, the nodes know only the state of the network in their local neighborhood, and can only decide on the amount of the flow on their outgoing edges, unlike the previously considered models where users have full knowledge of the network and can also decide the routing of flow originating from them. Given the opportunistic nature of the nodes and their very limited knowledge of the network, our simulations show the rather surprising fact that a non-negligible amount of non-trivial flow (flow over at least two hops) is successfully transmitted.

/pdf/dynamics-of-a-localized-reputation-based-network-protocol-4mzsuj7kgp.pdf

Raminder Kharaud

Papers

Dynamics of a Localized Reputation-Based Network Protocol