On the admission of dependent flows in powerful sensor networks

Reuven Cohen; Ilia Nudelman; Gleb Polevoy

doi:https://doi.org/10.1109/INFCOM.2012.6195621

On the admission of dependent flows in powerful sensor networks

Reuven Cohen, Ilia Nudelman, Gleb Polevoy

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2012 Proceedings IEEE INFOCOM, INFOCOM 2012
Pages	2336-2344
Number of pages	9
DOIs	https://doi.org/10.1109/INFCOM.2012.6195621
State	Published - 2012
Event	IEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States Duration: 25 Mar 2012 → 30 Mar 2012

Publication series

Name	Proceedings - IEEE INFOCOM

Conference

Conference	IEEE Conference on Computer Communications, INFOCOM 2012
Country/Territory	United States
City	Orlando, FL
Period	25/03/12 → 30/03/12

All Science Journal Classification (ASJC) codes

General Computer Science
Electrical and Electronic Engineering

Access to Document

https://doi.org/10.1109/INFCOM.2012.6195621

Cite this

@inproceedings{b48c3b1625e448e0a3802d8ad5644218,

title = "On the admission of dependent flows in powerful sensor networks",

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.",

author = "Reuven Cohen and Ilia Nudelman and Gleb Polevoy",

year = "2012",

doi = "https://doi.org/10.1109/INFCOM.2012.6195621",

language = "الإنجليزيّة",

isbn = "9781467307758",

series = "Proceedings - IEEE INFOCOM",

pages = "2336--2344",

booktitle = "2012 Proceedings IEEE INFOCOM, INFOCOM 2012",

note = "IEEE Conference on Computer Communications, INFOCOM 2012 ; Conference date: 25-03-2012 Through 30-03-2012",

}

TY - GEN

T1 - On the admission of dependent flows in powerful sensor networks

AU - Cohen, Reuven

AU - Nudelman, Ilia

AU - Polevoy, Gleb

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84861608138&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/INFCOM.2012.6195621

DO - https://doi.org/10.1109/INFCOM.2012.6195621

M3 - منشور من مؤتمر

SN - 9781467307758

T3 - Proceedings - IEEE INFOCOM

SP - 2336

EP - 2344

BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012

T2 - IEEE Conference on Computer Communications, INFOCOM 2012

Y2 - 25 March 2012 through 30 March 2012

ER -

On the admission of dependent flows in powerful sensor networks

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this