---
_id: '17663'
abstract:
- lang: eng
  text: '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:
- first_name: R.
  full_name: Cohen, R.
  last_name: Cohen
- first_name: I.
  full_name: Nudelman, I.
  last_name: Nudelman
- first_name: Gleb
  full_name: Polevoy, Gleb
  id: '83983'
  last_name: Polevoy
citation:
  ama: Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful
    Sensor Networks. <i>Networking, IEEE/ACM Transactions on</i>. 2013;21(5):1461-1471.
    doi:<a href="https://doi.org/10.1109/TNET.2012.2227792">10.1109/TNET.2012.2227792</a>
  apa: Cohen, R., Nudelman, I., &#38; Polevoy, G. (2013). On the Admission of Dependent
    Flows in Powerful Sensor Networks. <i>Networking, IEEE/ACM Transactions On</i>,
    <i>21</i>(5), 1461–1471. <a href="https://doi.org/10.1109/TNET.2012.2227792">https://doi.org/10.1109/TNET.2012.2227792</a>
  bibtex: '@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent
    Flows in Powerful Sensor Networks}, volume={21}, DOI={<a href="https://doi.org/10.1109/TNET.2012.2227792">10.1109/TNET.2012.2227792</a>},
    number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R.
    and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }'
  chicago: 'Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent
    Flows in Powerful Sensor Networks.” <i>Networking, IEEE/ACM Transactions On</i>
    21, no. 5 (2013): 1461–71. <a href="https://doi.org/10.1109/TNET.2012.2227792">https://doi.org/10.1109/TNET.2012.2227792</a>.'
  ieee: R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows
    in Powerful Sensor Networks,” <i>Networking, IEEE/ACM Transactions on</i>, vol.
    21, no. 5, pp. 1461–1471, 2013.
  mla: Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.”
    <i>Networking, IEEE/ACM Transactions On</i>, vol. 21, no. 5, 2013, pp. 1461–71,
    doi:<a href="https://doi.org/10.1109/TNET.2012.2227792">10.1109/TNET.2012.2227792</a>.
  short: R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21
    (2013) 1461–1471.
date_created: 2020-08-06T15:22:05Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2012.2227792
extern: '1'
intvolume: '        21'
issue: '5'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Logic gates
- Radar
- Vectors
- Wireless sensor networks
- Dependent flow scheduling
- sensor networks
language:
- iso: eng
page: 1461-1471
publication: Networking, IEEE/ACM Transactions on
publication_identifier:
  issn:
  - 1063-6692
status: public
title: On the Admission of Dependent Flows in Powerful Sensor Networks
type: journal_article
user_id: '83983'
volume: 21
year: '2013'
...