How to net a lot with little: small &egr;-nets for disks and halfspaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
Reducing interference in ad hoc networks through topology control
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Constructing interference-minimal networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
On the complexity of minimizing interference in ad-hoc and sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Minimizing interference of a wireless ad-hoc network in a plane
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Directional Geometric Routing on Mobile Ad Hoc Networks
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Low-interference networks in metric spaces of bounded doubling dimension
Information Processing Letters
Maximum interference of random sensors on a line
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Strong minimum energy minimum interference topology in wireless sensor networks
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Minimizing interference in ad-hoc networks with bounded communication radius
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Strong minimum interference topology for wireless sensor networks
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
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
Do directional antennas facilitate in reducing interferences?
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Minimum interference strong bidirectional topology for wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 5.23 |
We consider interference minimization in wireless ad-hoc networks. This is formulated as assigning a suitable transmission radius to each of the given points in the plane, so as to minimize the maximum number of transmission ranges overlapping any point. Using ideas from computational geometry and @e-net theory, we attain an O(@D) bound for the maximum interference where @D is the interference of a uniform-radius ad-hoc network. This generalizes a result given in [P. von Rickenbach, S. Schmid, R. Wattenhofer, A. Zollinger, A robust interference model for wireless ad-hoc networks, in: Proc. 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), Denver, Colorado, USA, April 2005] for the special case of highway model (i.e., one-dimensional problem) to the two-dimensional case. We show how a distributed algorithm can achieve a slightly weaker bound. We also give a method based on quad-tree decomposition and bucketing that has another provable interference bound in terms of the ratio of the minimum distance to the radius of a uniform-radius ad-hoc network.