A Mechanism Design Solution for DTN Routing
Zhi Lin, Shengling Wang, Chunchi Liu, Madiha Ikram · 2016
The routing in DTN (Delay/Disruption Tolerant Network) deals with network partition and the mobility of nodes. In order to motivate involvement in routing, several incentive schemes are created, one of them is by payment. Suppose the budget is limited, the question is how to make a routing plan based on payments. That is to say how a sender can decide the data amount assigned to one special next hop and the payment for it. This paper proposes a mechanism design approach to define the utility function of the sender and the next hops, then maximize the utility functions for all the participants, including the sender and next hops, using the tool of KKT (Karush-Kuhn-Tucker) conditions solving a nonlinear programming problem with one inequality constraint.