[1]米乐,王海泉,夏春和,等.使用树结构定位符的MANETs路由模型[J].东南大学学报(自然科学版),2011,41(2):247-251.[doi:10.3969/j.issn.1001-0505.2011.02.007]
 Mi Le,Wang Haiquan,Xia Chunhe,et al.Routing model for MANETs with tree-structure locator[J].Journal of Southeast University (Natural Science Edition),2011,41(2):247-251.[doi:10.3969/j.issn.1001-0505.2011.02.007]
点击复制

使用树结构定位符的MANETs路由模型()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
41
期数:
2011年第2期
页码:
247-251
栏目:
计算机科学与工程
出版日期:
2011-03-20

文章信息/Info

Title:
Routing model for MANETs with tree-structure locator
作者:
米乐1王海泉13夏春和12吕良双1胡俊顺1
(1北京航空航天大学网络技术北京市重点实验室, 北京 100191)(2北京航空航天大学虚拟现实技术与系统国家重点实验室, 北京 100191)(3北京航空航天大学软件学院, 北京 100191)
Author(s):
Mi Le 1Wang Haiquan 13Xia Chunhe 12Lü Liangshuang 1Hu Junshun 1
(1Beijing Key Laboratory of Network Technology, Beihang University, Beijing 100191, China)
(2State Key Laboratory of Virtual Reality Technology and System, Beihang University, Beijing 100191, China)
(3School of Software, Beihang University, Beijing 100191, China)
关键词:
移动自组织网络分布式哈希表多跳路由树结构定位符
Keywords:
MANETs(mobile Ad Hoc networks) distributed Hash tables multi-hop routing tree-structure locator
分类号:
TP393.4
DOI:
10.3969/j.issn.1001-0505.2011.02.007
摘要:
为了解决现有MANETs路由机制的可扩展性问题,提出一种使用树结构定位符的路由模型(TLR),通过DHT方法对节点的标识符和定位符进行分离,并使用基于位置的定位机制来提供一种具有可扩展性的路由服务.定位符描述一个节点在网络拓扑中的相对位置并随着节点的移动发生变化,定位符空间采用树结构进行组织.最后量化分析了该路由模型和其他路由机制的性能.分析结果表明,TLR的可扩展性优于平面主动式路由.在假设条件下,TLR的开销的复杂度小于反应式路由的复杂度.因此,相比于现有的MANETs路由机制,TLR具备很好的可扩展性.
Abstract:
A routing model with tree-structure called TLR (tree-structure locator routing) is proposed. The scalability of routing for MANETs(mobile Ad Hoc networks) is improved with TLR. The routing model resorts to both DHT to separate identifier/locator and a location-based locating schema in order to provide a scalable routing service. Node’s locator indicates its relative location in the network and should be updated whenever the topology changes. And locator space is organized as a tree-structure. At last, an analysis of our model compared with other routing schemata is given. The theoretical analyses show that the schema outperforms flat proactive routing schemas. In assumed condition, the complexity of our schema’s overheads is lower than reactive routing protocols. So, TLR has good scalability.

参考文献/References:

[1] Jelger C,Tschudin C.Dynamic names and private address maps:complete self-configuration for MANETs [C]//Proceedings of the 2006 ACM CoNEXT Conference.New York,2006:1-9.
[2] Du S,Khan A,PalChaudhuri S,et al.A self-organizing,hierarchical architecture for scalable ad hoc networking [J].Ad Hoc Network,2008,6(4):485-507.
[3] 涂睿,苏金树,彭伟.位置与标识分离的命名和寻址体系结构研究综述[J].计算机研究与发展,2009,46(11):1777-1786.
  Tu Rui,Su Jinshu,Peng Wei.Survey of naming and addressing architecture based on locator/identifier split [J].Journal of Computer Research and Development,2009,46(11):1777-1786.(in Chinese)
[4] Chiang C C,Wu H K,Liu W,et al.Routing in clustered multihop mobile wireless networks with fading channel [C]//Proceedings of IEEE Singapore International Conference on Networks.Singapore,1997:197-212.
[5] Iwata A,Chiang C C,Pei G,et al.Scalable routing strategies for ad hoc wireless networks [J].IEEE Journal on Selected Areas in Communications,1999,17(8):1369-1379.
[6] Pei G,Gerla M,Chen T.Fisheye state routing:a routing scheme for ad hoc wireless networks [C]//Proceedings of IEEE Conf Comm.Piscataway,USA,2000:70-74.
[7] Pei G,Gerla M,Hong X.Lanmar:landmark routing for large scale wireless Ad Hoc networks with group mobility [C]//Proceedings of the 1st ACM International Symposium on Mobile Ad Hoc Networking &Computing.New York,2000:11-18.
[8] Karp B,Kung H T.Gpsr:greedy perimeter stateless routing for wireless networks [C]//Proceedings of the 6th Annual International Conference on Mobile Computing and Networking.New York,2000:243-254.
[9] Cheng Hui,Cao Jiannong,Chen H-H,et al.GrLS:group-based location service in mobile ad hoc networks [J].IEEE Transactions on Vehicular Technology,2008,57(6):3693-3707.
[10] Das S M,Pucha H,Hu Y C.Performance comparison of scalable location services for geographic ad hoc routing [C]//The 24th Annual Joint Conference of the IEEE Computer and Communications Societies.Piscataway,USA,2005:1228-1239.
[11] Caesar M,Castro M,Nightingale E B,et al.Virtual ring routing:network routing inspired by DHTs [C]//Proceedings of the 2006 Conference on Applications,Technologies,Architectures and Protocols for Computer Communications.New York,2006:351-362.
[12] Sampath D,Garcia-Luna-Aceves J J.PROSE:scalable routing in MANETs using prefix labels and distributed hashing [C]//Proceedings of the 6th Annual IEEE Communications Society Conference on Sensor,Mesh and Ad Hoc Communications and Networks.Piscataway,USA,2009:601-609.
[13] Eriksson J,Faloutsos M,Krishnamurthy S V.DART:dynamic address routing for scalable ad hoc and mesh networks [J].IEEE/ACM Transactions on Networking (TON),2007,15(1):119-132.
[14] Eriksson J,Faloutsos M,Krishnamurthy S V.Scalable ad hoc routing:the case for dynamic addressing [C]//Proceedings of IEEE INFOCOM 2004.Piscataway,USA,2004:1108-1119.
[15] Rowstron A,Druschel P.Pastry:scalable,distributed object location and routing for large-scale peer-to-peer systems[C]//Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms.New York,2001:329-350.

备注/Memo

备注/Memo:
作者简介:米乐(1986—) ,女,硕士生;夏春和(联系人),男,博士,教授,xch @buaa.edu.cn.
基金项目:国家高技术研究发展计划( 863计划)资助项目(2007AA01Z407)、北京市教育委员会共建资助项目(JD100060630).
引文格式: 米乐,王海泉,夏春和,等.使用树结构定位符的MANETs路由模型[J].东南大学学报:自然科学版,2011,41(2):247-251.[doi:10.3969/j.issn.1001-0505.2011.02.007]
更新日期/Last Update: 2011-03-20