An all pairs shortest path algorithm with expected time O(n2logn)
SIAM Journal on Computing
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Computational Geometry: Theory and Applications
Approximating the Stretch Factor of Euclidean Graphs
SIAM Journal on Computing
Higher order Delaunay triangulations
Computational Geometry: Theory and Applications
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Box-trees for collision checking in industrial installations
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Distance-preserving approximations of polygonal paths
Computational Geometry: Theory and Applications
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Distance-preserving approximations of polygonal paths
Computational Geometry: Theory and Applications
Minimizing interference of a wireless ad-hoc network in a plane
Theoretical Computer Science
Towards a definition of higher order constrained Delaunay triangulations
Computational Geometry: Theory and Applications
Optimal higher order Delaunay triangulations of polygons
Computational Geometry: Theory and Applications
Optimal higher order Delaunay triangulations of polygons
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Minimum edge interference in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Hi-index | 0.00 |
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of radio signals. The interference caused by a link between two nodes u and v can be defined as the number of other nodes that may be disturbed by the signals exchanged by u and v. Given the position of the nodes in the plane, links are to be chosen such that the maximum interference caused by any link is limited and the network fulfills desirable properties such as connectivity, bounded dilation or bounded link diameter. We give efficient algorithms to find the links in two models. In the first model, the signal sent by u to v reaches exactly the nodes that are not farther from u than v is. In the second model, we assume that the boundary of a signal’s reach is not known precisely and that our algorithms should therefore be based on acceptable estimations. The latter model yields faster algorithms.