Round weighting problem and gathering in radio networks with symmetrical interference

DOI10.1142/S179383091650035XzbMath1366.90034OpenAlexW2299285091MaRDI QIDQ3178168

Cristiana Huiban, Patricio Reyes, Jean-Claude Bermond

Publication date: 8 July 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091650035x

zbMATH Keywords

boundsgridsinterferenceapproximation algorithmswireless networksgatheringradio networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal time data gathering in wireless networks with multidirectional antennas
• Data gathering and personalized broadcasting in radio grids with interference
• On the complexity of the flow coloring problem
• Optimal gathering in radio grids with interference
• On the complexity of bandwidth allocation in radio networks
• 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
• Gathering with Minimum Delay in Tree Sensor Networks
• Link scheduling in polynomial time
• GATHERING RADIO MESSAGES IN THE PATH

This page was built for publication: Round weighting problem and gathering in radio networks with symmetrical interference