Optimal time data gathering in wireless networks with multidirectional antennas
DOI10.1016/J.TCS.2013.03.017zbMATH Open1358.68048OpenAlexW2148157898MaRDI QIDQ392209FDOQ392209
Authors: Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro, Stéphane Pérennes
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.017
Recommendations
interferencesensor networksradio networksdata gatheringmultidirectional antennaspersonalized broadcasting
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
Cited In (7)
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
- Data gathering in wireless networks
- Fast algorithm for multicast and data gathering in wireless networks
- Gathering with Minimum Delay in Tree Sensor Networks
- Round weighting problem and gathering in radio networks with symmetrical interference
- Optimal coloring for data collection in tree-based wireless sensor networks
- An Approximation Algorithm for the Wireless Gathering Problem
This page was built for publication: Optimal time data gathering in wireless networks with multidirectional antennas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392209)