CRISP: collusion-resistant incentive-compatible routing and forwarding in opportunistic networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
| Hi-index | 0.00 |
This paper deals with a generalized maximum flow problem with concave gains, which is a nonlinear network optimization problem. Optimality conditions and an algorithm for this problem are presented. The optimality conditions are extended from the corresponding results for the linear gain case. The algorithm is based on the scaled piecewise linear approximation and on the fat path algorithm described by Goldberg, Plotkin and Tardos for linear gain cases. The proposed algorithm solves a problem with piecewise linear concave gains faster than the naive solution by adding parallel arcs.