Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arya, S., Mount, D.: Approximate Range Searching. Compututational Geometry: Theory & Applications 17(3–4), 135–152 (2000)
Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does Topology Control Reduce Interference? In: Proc. 5th ACM Int. Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 9–19 (2004)
Callahan, P.B., Kosaraju, S.R.: A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields. Journal of the ACM 42, 67–90 (1995)
Chan, T.M.: Random Sampling, Halfspace Range Reporting, and Construction of (≤k)-Levels in Three Dimensions. SIAM J. on Computing 30(2), 561–575 (2000)
Gudmundsson, J., Hammar, M., van Kreveld, M.: Higher Order Delaunay Triangulations. Computational Geometry: Theory & Appl. 23(1), 85–98 (2002)
Gudmundsson, J., Narasimhan, G., Smid, M.: Distance-Preserving Approximations of Polygonal Paths. In: FST & TCS, pp. 217–228 (2003)
Haverkort, H.J., de Berg, M., Gudmundsson, J.: Box-Trees for Collision Checking in Industrial Installations. Computational Geometry: Theory & Applications 28(2-3), 113–135 (2004)
Lee, D.T.: On k-Nearest Neighbor Voronoi Diagrams in the Plane. IEEE Transactions on Computing 31, 478–487 (1982)
Moaveni-Nejad, K., Li, X.-Y.: Low-Interference Topology Control for Wireless Ad Hoc Networks. Ad Hoc & Sensor Wireless Networks (2004) (Accepted for publ.)
Matoušek, J.: Range Searching with Efficient Hierarchical Cuttings. Discrete Computational Geometry 10, 157–182 (1993)
Moffat, A., Takaoka, T.: An All Pairs Shortest Path Algorithm with Expected Time O(n 2 logn). SIAM Journal on Computing 16(6), 1023–1031 (1987)
Narasimhan, G., Smid, M.: Approximating the Stretch Factor of Euclidean Graphs. SIAM Journal of Computing 30(3), 978–989 (2000)
Prakash, R.: Unidirectional Links Prove Costly in Wireless Ad-Hoc Networks. In: Proc. 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), pp. 15–22 (1999)
Prim, R.C.: Shortest Connection Networks and Some Generalisations. Bell Systems Technical Journal, 1389–1410 (1957)
Ramos, E.A.: On Range Reporting, Ray Shooting and k-Level Construction. In: Proc. 15th Symp. on Computational Geometry, pp. 390–399 (1999)
von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A Robust Interference Model for Wireless Ad-Hoc Networks. In: Proc. 5th Int. Worksh. Alg. for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), CD ROM (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A. (2006). Constructing Interference-Minimal Networks. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_14
Download citation
DOI: https://doi.org/10.1007/11611257_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31198-0
Online ISBN: 978-3-540-32217-7
eBook Packages: Computer ScienceComputer Science (R0)