TY - JOUR
T1 - Minimizing interference of a wireless ad-hoc network in a plane
AU - Halldórsson, Magnús M.
AU - Tokuyama, Takeshi
N1 - Funding Information:
The first author’s work was done at the University of Iceland and he was partially supported by grants of the Icelandic Research Fund. The second author was partially supported by the project New Horizons in Computing, Grant-in-Aid for Scientific Research on Priority Areas, MEXT Japan.
PY - 2008/7/28
Y1 - 2008/7/28
N2 - 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 ε{lunate}-net theory, we attain an O (sqrt(Δ)) bound for the maximum interference where Δ 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.
AB - 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 ε{lunate}-net theory, we attain an O (sqrt(Δ)) bound for the maximum interference where Δ 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.
KW - Algorithm
KW - Computational geometry
KW - Epsilon net
KW - Interference
KW - Optimization
KW - Sensor network
KW - Wireless network
UR - http://www.scopus.com/inward/record.url?scp=46049108366&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=46049108366&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2008.03.003
DO - 10.1016/j.tcs.2008.03.003
M3 - Article
AN - SCOPUS:46049108366
VL - 402
SP - 29
EP - 42
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - 1
ER -