Minimizing interference in ad hoc networks with bounded communication radius

DOI10.1016/j.ipl.2012.06.021zbMath1248.68064arXiv1102.2785OpenAlexW1564253143MaRDI QIDQ456109

Matias Korman

Publication date: 23 October 2012

Published in: Information Processing Letters, Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.2785

zbMATH Keywords

interferenceminimum spanning treead hoc networksbucketing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Packing plane spanning graphs with short edges in complete geometric graphs

Cites Work

• Constructing minimum-interference networks
• Minimizing interference of a wireless ad-hoc network in a plane
• On the complexity of minimizing interference in ad-hoc and sensor networks
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Euclidean minimum spanning trees and bichromatic closest pairs

This page was built for publication: Minimizing interference in ad hoc networks with bounded communication radius