[1]肖 甫,孙国霞,徐 佳,等.一种基于社交尺度的延迟容忍网络路由算法[J].南京理工大学学报(自然科学版),2014,38(04):512-517.
 Xiao Fu,Sun Guoxia,Xu Jia,et al.Routing algorithm for delay tolerant networks based on social scale[J].Journal of Nanjing University of Science and Technology,2014,38(04):512-517.
点击复制

一种基于社交尺度的延迟容忍网络路由算法
分享到:

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

卷:
38卷
期数:
2014年04期
页码:
512-517
栏目:
出版日期:
2014-08-31

文章信息/Info

Title:
Routing algorithm for delay tolerant networks based on social scale
作者:
肖 甫123孙国霞1徐 佳12蒋凌云12王汝传123
1.南京邮电大学 计算机学院,江苏 南京 210003; 2.江苏省无线传感网高技术研究重点实验室,江苏 南京 210003; 3.宽带无线通信与传感网技术教育部重点实验室,江苏 南京 210003
Author(s):
Xiao Fu123Sun Guoxia1Xu Jia12Jiang Lingyun12Wang Ruchuan123
1.College of Computer,Nanjing University of Posts and Telecommunications,Nanjing 210003,China; 2.Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks,Nanjing 210003,China; 3.Key Lab of Broadband Wireless Communication and Sensor
关键词:
延迟容忍网络 路由协议 社交尺度 数据传输 投递率
Keywords:
delay tolerant network routing protocol social scale data transmission delivery probability
分类号:
TP393.04
摘要:
为克服传统基于概率的路由协议因消息多次转发而导致的网络开销问题,该文在不需获知目的节点先验知识前提下,基于节点局部信息定义包含延迟度和有效性的节点社交尺度,提出了一种基于社交尺度的延迟容忍网络路由算法。该算法通过自适应选择社交延迟度低节点作为消息中继节点,实现消息的局部快速转发; 根据计算节点社交有效性实现消息转发队列的调度管理。实验结果表明:在保证消息投递成功率的前提下,提出的基于社交尺度的延迟容忍网络路由算法有效降低了消息转发数和负载比率,从而降低网络开销。
Abstract:
In order to solve the network load increasing problem due to multiple copies in traditional route protocol based on probability,a novel routing algorithm based on social scale is proposed here.By defining nodes' social scale as delay degree and effectiveness according to nodes' local information, message is forwarded rapidly by selecting relay node with lower social delay degree,and scheduling management of message forward queue is calculated based on nodes' social validity.The experimental results prove that this algorithm can effectively reduce network load while message delivery ratio is well retained.

参考文献/References:

[1] Utku G,Acer G P,Hay D,et al.Timely data delivery in realistic bus network[J].IEEE Transactions on Vehicular Technology,2012,61(3):1251-1265.
[2]Mei A,Stefa J.Give2Get:Forwarding in social mobile wireless networks of selfish individuals[J].IEEE Transactions on Dependable Secure Computing,2012,9(4):569-582.
[3]Rahim M S,Casari P,Guerra F,et al.On the perfor-mance of delay-tolerant routing protocols in underwater networks[A].Proceedings of IEEE Oceans Conference[C].Washington D C,USA:IEEE,2011:1-7.
[4]Pham T M,Fdida S.DTN support for news dissemina-tion in an urban area[J].Computer Networks,2012,56(9):2276-2291.
[5]Fall K.A delay-tolerant network architecture for challenged Internets[A].ACM SIGCOMM[C].New York,USA:ACM,2003:27-34.
[6]Vahdat A,Becker D.Epidemic routing for partially connected ad hoc networks[R].Duck University:Technical Report CS-200006,2000:36-51.
[7]Zhang H,Shen H,Tan Y.Optimal energy balanced data gathering in wireless sensor networks[A].International Parallel and Distributed Processing Symposium[C].Washington D C,USA:IEEE,2007:1-10.
[8]Lindgren A,Doria A,Schelen O.Probabilistic routing in intermittently connected networks[A].First Interna-tional Workshop on Service Assurance with Partial and Intermittent Resources[C].Berlin,Germany:Springer Berlin Heidelberg,2004,3126:239-254.
[9]Pan H,Jon C,Ekio Y.BUBBLE Rap:Social-based forwarding in delay-tolerant Networks[J].IEEE Transactions on Mobile Computing,2011,10(11):1576-1589.
[10]Bulut E,Szymanski B K.Friendship based routing in delay tolerant mobile social networks[A].Proceedings of IEEE Global Telecommunications Conference(GLOBECOM)[C].Washington D C,USA:IEEE,2010:1-5.
[11]Gao W,Cao G.On exploiting transient contact patterns for data forwarding in delay-tolerant networks[J].IEEE Transactions on Mobile Computing,2013,12(1):151-165.
[12]Wang G,Yang Y,Song X,et al.Research for delay tolerant network node similarity-based on social network[J].Journal of Computational Information Systems,2013,13(9):5189-5195.
[13]张振京,金志刚,舒炎泰.基于节点运动预测的社会性DTN高效路由[J].计算机学报,2013,36(3):626-635.
Zhang Zhenjing,Jin Zhigang,Shu Yantai.Efficient routing in social DTN based on nodes' movement predic-tion[J].Chinese Journal of Computers,2013,36(3):626-635.
[14]Paolo M,Sabina G,Elena P,et al.CRAWDAD trace set unimi/pmtr/txt(V.2008-12-01)[EB/OL].http://crawdad.cs.dartmouth.Edu/unimi/pmtr/txt,December 2008.
[15]The ONE 1.4.1[EB/OL].http://www.netlab.tkk.fi/tutkimus/dtn/theone/.Nokia Research Center(Finland),2010.

相似文献/References:

[1]潘达儒,林沐,陈良杰,等.一种基于转交效用的多副本机会网络路由协议[J].南京理工大学学报(自然科学版),2012,36(04):573.
 PAN Da-ru,LIN Mu,CHEN Liang-jie,et al.Multiple-copy Opportunistic Network Routing Based on Transitivity[J].Journal of Nanjing University of Science and Technology,2012,36(04):573.
[2]徐佳,廖俊,肖甫,等.间歇性连接移动自组网中自适应喷雾路由协议[J].南京理工大学学报(自然科学版),2012,36(02):296.
 XU Jia,LIAO Jun,XIAO Fu,et al.Adaptive Spray Routing Protocal for Intermittently Connected Mobile Ad Hoc Networks[J].Journal of Nanjing University of Science and Technology,2012,36(04):296.
[3]徐昕,等.基于移动Agent的分组k-Anycast路由协议[J].南京理工大学学报(自然科学版),2010,(02):232.
 XU Xin,GU Yun-li,QIAN Huan-yan.k-Anycast Routing Protocol Based on Component and Mobile Agents[J].Journal of Nanjing University of Science and Technology,2010,(04):232.
[4]李华峰,钱焕延,高德民,等.基于模板理论的无线传感器网络路由协议[J].南京理工大学学报(自然科学版),2013,37(03):1.
 Li Huafeng,Qian Huanyan,Gao Demin,et al.Routing protocol for wireless sensor networks based on schema theory[J].Journal of Nanjing University of Science and Technology,2013,37(04):1.
[5]王会霞,李 娜.无线传感器网络中基于能量感知的QoS路由协议[J].南京理工大学学报(自然科学版),2016,40(04):467.[doi:10.14177/j.cnki.32-1397n.2016.40.04.015]
 Wang Huixia,Li Na.Energy awareness based QoS routing protocol in wireless sensor network[J].Journal of Nanjing University of Science and Technology,2016,40(04):467.[doi:10.14177/j.cnki.32-1397n.2016.40.04.015]

备注/Memo

备注/Memo:
收稿日期:2013-07-08 修回日期:2013-12-04
基金项目:国家自然科学基金(61373137; 61100199; 61373017); 江苏省科技支撑计划(BE2012755); 江苏省“六大人才高峰”项目(2013-DZXX-014); 江苏省青蓝工程项目
作者简介:肖甫(1980-),男,博士,副教授,主要研究方向:无线自组织网络、多媒体技术等,E-mail:xiaof@njupt.edu.cn。
引文格式:肖甫,孙国霞,徐佳,等.一种基于社交尺度的延迟容忍网络路由算法[J].南京理工大学学报,2014,38(4):512-517.
投稿网址:http://zrxuebao.njust.edu.cn
更新日期/Last Update: 2014-08-31