| 摘要: |
| 网络拓扑结构可由邻近图表述,定义其为一个包含点集V和边集E的图,某有向边(u,v)属于该图当且仅当点v位于点u的邻域内,这个邻域是在某事先定义的邻近测度作用下产生的.回顾了迄今为止一些重要图结构,内容主要集中在5个方面,包括邻近图的定义或概念、构造算法、图例、隶属关系、拓扑参数,还谈到进一步的研究方向. |
| 关键词: 邻近图 无线网络 拓扑控制 支配集 计算几何 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant No.60473090 (国家自然科学基金); the National "11th Five-Year-Supproting-Plan" of China under Grant No.2006BAH02A0407 (国家"十一五"支撑计划) |
|
| A Survey of Proximity Graphs in Wireless Networks |
|
LU Gang,ZHOU Ming-Tian,NIU Xin-Zheng,SHE Kun,TANG Yong,QIN Ke
|
| Abstract: |
| Network topology can be represented by the proximity graph defined as a graph with a set of vertices V and a set of edges E such that a directed edge (u,v) belong to E if and only if the point v is in the neighborhood induced by some predefined proximity measures of point u. This paper reviews some important graphs obtained so far, and the contents mainly concentrated in five aspects of those proximity graphs including their definitions or conceptions, construction algorithms, illustrations, topological relationships, and some parameters. This paper also outlines several further research directions. |
| Key words: proximity graph wireless networks topology control dominating set computational geometry |
