中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Trap Array: A Unified Model for Scalability Evaluation of Geometric Routing

文献类型:期刊论文

作者Tan, Guang; Yin, Zhimeng; Jiang, Hongbo
刊名IEEE-ACM TRANSACTIONS ON NETWORKING
出版日期2016
英文摘要Scalable routing for large-scale wireless networks needs to find near shortest paths with low state on each node, preferably sublinear with the network size. Two approaches are considered promising toward this goal: compact routing and geometric routing (geo-routing). To date, the two lines of research have been largely independent, perhaps because of the distinct principles they follow. In particular, it remains unclear how they compare to each other in the worst case, despite extensive experimental results showing the superiority of one or another in particular cases. We develop a novel Trap Array topology model that providesa unified framework to uncover the limiting behavior of 10 representative geo-routing algorithms. We presenta series of new theoretical results, in comparison to the performance of compact routing as a baseline. In light of their pros and cons, we further design a Compact Geometric Routing (CGR) algorithm that attempts to leverage the benefits of both approaches. Theoretical analysis and simulations show the advantages ofthe topology model and the algorithm.
收录类别SCI
原文出处http://dl.acm.org/citation.cfm?id=2465544
语种英语
源URL[http://ir.siat.ac.cn:8080/handle/172644/10262]  
专题深圳先进技术研究院_数字所
作者单位IEEE-ACM TRANSACTIONS ON NETWORKING
推荐引用方式
GB/T 7714
Tan, Guang,Yin, Zhimeng,Jiang, Hongbo. Trap Array: A Unified Model for Scalability Evaluation of Geometric Routing[J]. IEEE-ACM TRANSACTIONS ON NETWORKING,2016.
APA Tan, Guang,Yin, Zhimeng,&Jiang, Hongbo.(2016).Trap Array: A Unified Model for Scalability Evaluation of Geometric Routing.IEEE-ACM TRANSACTIONS ON NETWORKING.
MLA Tan, Guang,et al."Trap Array: A Unified Model for Scalability Evaluation of Geometric Routing".IEEE-ACM TRANSACTIONS ON NETWORKING (2016).

入库方式: OAI收割

来源:深圳先进技术研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。