Skip to Main Content
RPP is a distributed routing mechanism for wireless ad hoc networks with strategic agents. A strategic agent is rational but selfish and has its own incentive to route traffic for other agents. Forwarding data is definitely not the self-interest of an agent due to consumption of battery. However, if no agent is willing to forward data for others, the ad hoc network itself will break. In this paper, a routing mechanism is designed such that maximizing the benefit of each strategic agent leads to a global optimal system. In this mechanism, an agent accepts payments for forwarding data for other agents if the payment covers their costs. The payment is computed recursively to obtain a cost-efficient and truthful mechanism. The overpayment in current mechanisms is completely removed. Analysis and simulation results are also provided.