Constructing minimum-interference networks

DOI10.1016/J.COMGEO.2007.06.004MaRDI QIDQ929744zbMATH OpenOpenAlexFDO

Authors Marc Benkert, Joachim Gudmundsson, Alexander Wolff, Herman Haverkort

Publication date 18 June 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2007.06.004

zbMATH Keywords

connectivityspannerswell-separated pair decomposition\(d\)-hop networkinterference networksorder-\(j\) Voronoi diagramsending-link-based interference

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• SOFSEM 2006: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 4141826
• On the construction of minimal broadcast networks
• scientific article; zbMATH DE number 3948154
• A new method for constructing minimal broadcast networks
• A new method for constructing minimal broadcast networks
• Network design under general wireless interference
• Minimum total node interference in wireless sensor networks

Cites work

• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• A note on two problems in connexion with graphs
• An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
• Approximate range searching
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• Geometric Spanner Networks
• Higher order Delaunay triangulations
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
• Range searching with efficient hierarchical cuttings

Cited in

(16)

• Minimizing interference for the highway model in wireless ad-hoc and sensor networks
• Computing and Combinatorics
• A model to simplify 2D triangle meshes with irregular shapes
• SOFSEM 2006: Theory and Practice of Computer Science
• Spanning trees with edge conflicts and wireless connectivity
• Minimizing interference of a wireless ad-hoc network in a plane
• Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
• Exact formulations for the minimum interference problem in \(k\)-connected \textit{ad hoc} wireless networks
• scientific article; zbMATH DE number 3948154 (Why is no real title available?)
• Ad-hoc networks: fundamental properties and network technologies. With CD-ROM.
• Minimum redundancy array structure for interference cancellation
• Exact algorithms to minimize interference in wireless sensor networks
• A note on interference in random networks
• Low-interference networks in metric spaces of bounded doubling dimension
• Network design under general wireless interference
• Efficient \(\varepsilon\)-net construction for an application to ad-hoc network

This page was built for publication: Constructing minimum-interference networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q929744)