Algorithm For Greedy Routing Based On The Thurston Algorithm In Sensor Networks
2016 13TH INTERNATIONAL CONFERENCE ON MODERN PROBLEMS OF RADIO ENGINEERING, TELECOMMUNICATIONS AND COMPUTER SCIENCE (TCSET)(2016)
摘要
In this paper we present a greedy routing scheme for planar 3-connected graphs. The embedding is in R-2, but the proximity measure used is not Euclidean. We show the relationship between our embedding and classical circle packings and described a modification of the Thurston algorithm originally designed for generating circle packings, so that it is able to generate the embeddings required to support greedy power routing on a sensor network.
更多查看译文
关键词
Greedy routing,Thurston algorithm,Embedding,LPD,a circle packing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要