On the admission of dependent flows in powerful sensor networks

Authors:
Reuven Cohen;Ilia Nudelman;Gleb Polevoy
Affiliations:
Department of Computer Science, Technion-Israel, Institute of Technology, Haifa, Israel;Department of Computer Science, Technion-Israel, Institute of Technology, Haifa, Israel;Department of Computer Science, Technion-Israel, Institute of Technology, Haifa, Israel
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 17
Cited 0

Adaptive protocols for information dissemination in wireless sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Improved bounds for the unsplittable flow problem

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A directionality based location discovery scheme for wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Quadratic Knapsack Relaxations Using Cutting Planes

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for the Unsplittable Flow Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Exact Solution of the Quadratic Knapsack Problem

INFORMS Journal on Computing
Hardness of the undirected edge-disjoint paths problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Towards radar-enabled sensor networks

Proceedings of the 5th international conference on Information processing in sensor networks
Logarithmic hardness of the undirected edge-disjoint paths problem

Journal of the ACM (JACM)
Multi-user data sharing in radar sensor networks

Proceedings of the 5th international conference on Embedded networked sensor systems
Fast approximation algorithms for knapsack problems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
An end-user-responsive sensor network architecture for hazardous weather detection, prediction and response

AINTEC'06 Proceedings of the Second Asian international conference on Technologies for Advanced Heterogeneous Networks
Vector bin packing with multiple-choice

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The quadratic 0-1 knapsack problem with series-parallel support

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but we 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. We show that D-UFP is more difficult than NP-hard problems for which no good approximation is known. Then, we address two special cases of this problem: the case where all the sensors have a shared channel and the case where the sensors form a mesh and route to the gateway over a spanning tree.