Optimal time data gathering in wireless networks with multidirectional antennas

DOI10.1016/j.tcs.2013.03.017zbMath1358.68048OpenAlexW2148157898MaRDI QIDQ392209

Jean-Claude Bermond, Adele A. Rescigno, Ugo Vaccaro, Luisa Gargano, 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

zbMATH Keywords

interferencesensor networksradio networksdata gatheringmultidirectional antennaspersonalized broadcasting

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Round weighting problem and gathering in radio networks with symmetrical interference ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity

Cites Work

• Unnamed Item
• An approximation algorithm for the wireless gathering problem
• Collision-free path coloring with application to minimum-delay gathering in sensor networks
• Optimal gathering protocols on paths under interference constraints
• Data Gathering in Wireless Networks

This page was built for publication: Optimal time data gathering in wireless networks with multidirectional antennas