A novel geometric diagram and its applications in wireless networks

Wireless networks have a lot of geometric properties since the signal strength corresponds directly to the distance. Earlier research findings in geometry, such as Voronoi diagram, have found a lot of applications in wireless networks. In this paper, a new geometric diagram, referred to as the umbrella diagram, is proposed. The umbrella diagram is comparable to the Voronoi diagram. The Voronoi diagram deals with a set of points, whereas the umbrella diagram deals with a set of different networks. The umbrella diagram of a set of hexagonal networks is to divide the plane into regions such that the points in a region have a larger distance to one network than to the other networks. Unlike the Voronoi diagram, the regions in the umbrella diagram are not necessarily convex. The paper gives an efficient solution to compute the umbrella diagram of n networks with the same cell size and orientation. Like the Voronoi diagram, the umbrella diagram has potential to be used in many areas. To illustrate its usefulness, the paper further gives two applications in wireless networks: the optimal network deployment and the maximum base station reuse. The optimal network deployment intends to find the best position to fix the network such that the network is closest to all existing base stations. The maximum base station reuse problem is to maximize the number of base stations that can be reused under a given bound.

[1]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[2]  Jaekyun Moon,et al.  A Systematic Approach To Signal Space Detection , 1997 .

[3]  Qinghua Li,et al.  On a geometric view of multiuser detection for synchronous DS/CDMA channels , 2000, IEEE Trans. Inf. Theory.

[4]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[5]  Miodrag Potkonjak,et al.  Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure , 2001, MobiHoc '01.

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[7]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[8]  Georges Stamon,et al.  Strong-from-weak model sensor estimation using Voronoi diagrams , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[9]  Camillo Gentile,et al.  An improved Voronoi-diagram based neural net for pattern classification , 1999, IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339).

[10]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[11]  Howie Choset,et al.  Complete sensor-based coverage with extended-range detectors: a hierarchical decomposition in terms of critical points and Voronoi diagrams , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[12]  Uyless Black Mobile and wireless networks , 1996 .