Please wait a minute...
浙江大学学报(工学版)
J4  2010, Vol. 44 Issue (3): 413-419    DOI: 10.3785/j.issn.1008-973X.2010.03.001
自动化技术、计算机技术     
基于特征分类的机会网络多因素预测路由
 周强, 应晶, 吴明晖
1. 浙江大学 计算机科学与技术学院, 浙江 杭州 310027； 2. 浙江大学 城市学院, 浙江 杭州 310015
Multifactor prediction routing protocol based on
characteristic categorization of opportunistic networks
 ZHOU Qiang, YING Jing, WU Ming-hui
 全文: PDF  HTML
摘要：

为了对复杂的机会网络进行分类分析并且确定有效的路由机制,提出基于特征的分类,根据节点的移动特征、类型特征和信息传递特征对机会网络进行了形式化的分类,并给出一个基于特征分类的机会网络评价标准.在特征分类以及冗余效用路由机制的基础上,提出基于多因素预测的路由规则,其中包含了基于节点运动时空局限因素、节点运动地理倾向因素、网络固定节点因素考虑的一系列启发式规则.特征分类和基于此的多因素预测路由规则都是开放式的,可以进行不断地完善与扩充.实验结果表明,基于特征分类的多因素预测路由规则的性能,显著优于经典的基于冗余的路由机制，以及基于冗余效用混合的PROPHET机制.
Abstract:

In order to analyze the complex opportunistic networks and establish efficient routing protocols, a characteristic based categorization formalized the opportunistic networks categorization according to the characteristics of nodes’ motion, nodes’ species and the immobile nodes in the networks, and then an evaluation criterion of opportunistic networks was proposed based on the categorization. A multifactor prediction routing protocol was proposed according to the characteristic categorization and the redundancyutility hybrid routing protocols. This multifactor prediction routing protocol contains a series of heuristic rules about the nodes’ spacetime limit factors, nodes’ geographical motion tendency factors and immobile nodes factors. The characteristic categorization and the multifactor prediction routing protocol are both open, which can be improved and expanded. Experiments proved that the multifactor prediction routing protocol has distinct better performance than the classic redundancybased protocols and also better performance than the redundancyutility hybrid PROPHET protocol.
出版日期: 2012-03-20
:  TP393  
基金资助:

 国家“863”高技术研究发展计划资助项目2007AA01Z187)
通讯作者: 应晶,男,教授     E-mail: yingj@zucc.edu.cn
作者简介: 周强（1981—),男,山东青岛人,博士生,主要从事计算机软件理论及计算机网络应用研究
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　

引用本文:

周强, 应晶, 吴明晖. 基于特征分类的机会网络多因素预测路由[J]. J4, 2010, 44(3): 413-419.

ZHOU Jiang, YING Jing, TUN Meng-Hui. Multifactor prediction routing protocol based on
characteristic categorization of opportunistic networks. J4, 2010, 44(3): 413-419.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2010.03.001    或    http://www.zjujournals.com/eng/CN/Y2010/V44/I3/413

［1］ FALL K. A delaytolerant network architecture for challenged Internets［C］//Proceedings of the 2003 Conference on applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe: ACM, 2003: 2734.
［2］ PELUSI L, PASSARELLA A, CONTI M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks［J］. Communications Magazine, 2006, 44(11): 134141.
［3］ 熊永平,孙利民,牛建伟,等. 机会网络［J］. 软件学报, 2009, 20(1): 124137.
XIONG Yongping, SUN Limin, NIU Jianwei, et al. Opportunistic networks［J］. Journal of Software, 2009, 20(1): 124137.
［4］ JUANG P, OKI H, WANG Yong, et al. Energyefficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet［C］//Proceedings of the 10th Int’l Conf on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002: 96107.
［5］ SMALL T, HASS Z. The shared wireless infostation model: A new ad hoc networking paradigm (or where there is a whale, there is a way)［C］// Proceedings of the 4th ACM Int’l Symp. on Mobile Ad Hoc Networking. Annapolis: ACM, 2003: 233244.
［6］ PAN H, CHAINTREAU A, SCOTT J, et al. Pocket switched networks and human mobility in conference environments［C］//Proceedings of the 2005 ACM SIGCOMM Workshop on DelayTolerant Networking. Philadelphia: ACM, 2005: 244251.
［7］ SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S. Performance analysis of mobilityassisted routing［C］//Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Florence: ACM, 2006: 2225.
［8］ ABDULLA M, SIMON R. Characteristics of common mobility models for opportunistic networks［C］// Proceedings of the 2nd ACM Workshop on Performance monitoring and Measurement of Heterogeneous Wireless and Wired Networks. Chania: ACM, 2007: 105109.
［9］ BOLDRINI C, CONTI M, PASSARELLA A. ContentPlace: socialaware data dissemination in opportunistic networks［C］//Proceedings of the 11th International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems. Vancouver: ACM, 2008: 203210.
［10］ BOLDRINI C, CONTI M, PASSARELLA A. Modelling data dissemination in opportunistic networks［C］//Proceedings of the Third ACM Workshop on Challenged Networks. San Francisco: ACM, 2008: 8996.
［11］ PAN H, CROWCROFT J. How small labels create big improvements［C］//Proceedings of the 2006 ACM CoNEXT Conference. Lisboa: ACM, 2006: Article No. 34.
［12］ CAMPBELL A, EISENMAN S, LANE N, et al. Peoplecentric urban sensing［C］//Proceedings of the 2nd Annual International Workshop on Wireless Internet. Boston: ACM, 2006: Article No. 18.
［13］ HENDERSON T, KOTZ D, ABYZOV I. The changing usage of a mature campuswide wireless network［C］//Proceedings of the 10th Annual International Conference on Mobile Computing and Networking. Philadelphia: ACM, 2004: 187201.
［14］ CHIOU C, CHEN L. Poster Abstract: an evaluation study of routing reliability in opportunistic networks［C］//Proceedings of the 9th ACM International Symposium on Mobile ad hoc Networking and Computing. Hong Kong: ACM, 2008: 455456.
［15］ SONG Libo, KOTZ D F. Evaluating opportunistic routing protocols with large realistic contact traces［C］//Proceedings of the Second ACM Workshop on Challenged Networks. Montreal: ACM, 2007: 3542.
［16］ VAHDAT A, BECKER D. Epidemic routing for partiallyconnected ad hoc networks［R］. Technical Report CS200006, Durham: Duke University, 2000.
［17］ CHEN L, YU C, SUN T, et al. A Hybrid routing approach for opportunistic networks［C］//Proceedings of the 2006 SIGCOMM Workshop on Challenged Networks. Pisa: ACM, 2006: 213220.
［18］ LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittently connected networks［J］. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3): 1920.
[1] 尹可挺, 周波, 张帅, 徐斌, 陈一稀, 江丹. Web服务组合中基于QoS的自底向上服务替换[J]. J4, 2010, 44(4): 700-709.
[2] 王瑞琴, 孔繁胜, 潘俊. 基于WordNet的无导词义消歧方法[J]. J4, 2010, 44(4): 732-737.