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
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
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 geometry—SoCG2002
Geometric Spanner Networks
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Minimizing interference for the highway model in wireless ad-hoc and sensor networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
An application of a self-organizing model to the design of urban transport networks
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Evolutionary neural networks for practical applications
Exact algorithms to minimize interference in wireless sensor networks
Theoretical Computer Science
Minimizing average interference through topology control
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Minimizing interference in ad-hoc networks with bounded communication radius
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Minimizing interference in ad hoc networks with bounded communication radius
Information Processing Letters
Bounding interference in wireless ad hoc networks with nodes in random position
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| 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.