On the Admission of Dependent Flows in Powerful Sensor Networks
In this paper, the authors define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). They present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but they believe it has important applications on the admission of large flows in other networks as well. In order to optimize the selection of flows transmitted to the gateway, D-UFP takes into account possible dependencies between flows. They show that D-UFP is more difficult than NP-hard problems for which no good approximation is known.