Sensitivity Analysis in Stochastic Second Order Cone Programming for Mobile Ad Hoc Networks

Abstract In this paper sensitivity analysis is adopted in order to understand the randomness of a stochastic second order cone program for mobile ad hoc networks [3]. The algorithm looks for a destination node and sets up a route by means of the expected zone, the region where the sender node expects to find the destination node and the requested zone defined by the sender node for spreading the route request to the destination node. Sensitivity analysis is performed by considering different costs of flooding and latency penalty. Evaluation of EVPI and VSS [2]-[4] allows us to find the range of values in which it is safe to save time by using a deterministic approach instead of a stochastic one.