Minimizing interference of a wireless ad-hoc network in a plane

DOI10.1016/j.tcs.2008.03.003zbMath1156.68008OpenAlexW1977762076MaRDI QIDQ936528

Magnús M. Halldórsson, Takeshi Tokuyama

Publication date: 14 August 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.003

zbMATH Keywords

optimizationalgorithmwireless networkinterferencecomputational geometrysensor networkepsilon net

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Communication theory (94A05) Distributed algorithms (68W15)

Related Items

Directional Geometric Routing on Mobile Ad Hoc Networks ⋮ A note on interference in random networks ⋮ Low-interference networks in metric spaces of bounded doubling dimension ⋮ Minimizing interference in ad hoc networks with bounded communication radius ⋮ Approximation algorithm for receiver interference problem in dual power wireless sensor networks ⋮ Minimizing total interference in asymmetric sensor networks ⋮ Exact formulations for the minimum interference problem ink-connectedad hocwireless networks ⋮ Bounded-angle minimum spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\epsilon\)-nets and simplex range queries
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Computing and Combinatorics
• SOFSEM 2006: Theory and Practice of Computer Science
• Geometric discrepancy. An illustrated guide

This page was built for publication: Minimizing interference of a wireless ad-hoc network in a plane