Application of Thiessen Polygon Algorithm in Cellular Network Simulation System

Abstract:

Cellular mobile communication system divides the service area into several adjacent cells; each cell sets up a base station. In the traditional cellular representation, we always use regular hexagon to represent the cell. In the practical engineering applications and wireless network planning simulation systems, as the programming environment is complex and diverse, using the regular hexagon to represent the cellular network has limitation. This paper used Thiessen polygon and spatial analysis method to describe the cell service area with a polygon. This method intuitively displayed the relationship between the scope of service and its place with each other in space. For the Pre-construction and later optimization of wireless network planning it has a positive role.

• Periodical: Advanced Materials Research (Volumes 532-533)
• Pages: 1851-1856
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.532-533.1851
• Online since: June 2012
• Authors: Liu Wei, Hai Yan Chen, Li Li, Hai Ming Fu, Li Wei
• Keywords: Delaunay Triangulation, Intersection of Polygon, Thiessen Polygon

References

[1] ZHANG Li-dong, HAN Yong, YIN Hao, CHEN Qiang, YOU Fei. Performance Analysis for Multiple Access of the Mobile-Cellular Model[J]. Journal of University of Electronic Science and Technology of China 2009, (6).

[2] XIAO Lin, WANG Jinlin, ZENG Xuewen. Performance Analysis of Time-shifting System Based-on Hybrid Network [J]. Microcomputer Applications 2009, (8).

[3] GONG Zi-zhen, HUA Xiang-hong , YI Chong-zheng , YANG Rong-hua. The research and implementation of ICP based on Delaunay triangulation[J]. Engineering of Surveying and Mapping. 2010. (5).

[4] WU Ruo ZHANG Xin-dong. A Simple Polygon Triangulation Algorithm[J]. Microcomputer Information. 2010. (30).

[5] GUAN Hong-hao, TANG Wei. Substation location method based on Voronoi diagram[J]. Power System Protection and Control. 2010. (20).

[6] DENG Shu-guang, LIU Gang. Study of algorithm for Delaunay triangular irregular network of constrained data field with reverse fault[J]. Science of Surveying and Mapping. 2006. (4).

[7] TANG Yun, WANG Hao, YAN Deng-Hua , WANG Shui-Sheng. Research on the Spatial-Temporal Differentiation of Precipitation in Northeast China in Recent 50 Years[J]. Scientia Geographica Sinica, 2005. (2).

[8] CUI Xue-sen, YANG Sheng-long, FAN Wei. Grid Based Local Subdivision Algorithms for Constructing Triangulated Irregular Network under Restriction Conditions[J]. Acta Geodaetica et Cartographica Sinica. 2008. (2).

[9] WANG San, LIU Run-tao, WANG Hong-yan. Algorithms for convex hull of union and intersection of two intersecting convex polygons[J]. Computer Engineering and Applications. 2010. (5).

[10] Wu Mingguan The Matter of the Polygons Piling about the computer topographic analysis[J]. JOURNAL OF THE PLA INSTITUTE OF SURVEYING AND MAPPING. 1993(3).