Social DTN Message Transmission Strategy Based on Line Graph
-
摘要: 针对目前大多数DTN路由算法存在因孤立节点数量过多进而影响整个网络性能问题,提出了一种基于线图的社会性DTN消息传输策略.本策略将时间划分为若干时间片段,以线图节点对质量以及相似性作为评判标准,周期性地将三跳以内的节点划分成不同社区,最后通过社区内、社区间不同的路由策略进行数据传输.仿真结果表明:该算法与Epidemic、PROPHET、Sim Bet算法相比,在未降低网络延时性能的情况下,具有较高的消息投递率、较小的网络开销等.Abstract: Under the circumstance that there are too much isolated nodes in recent DTN routing algorithm that seriously affect the performance of the whole network. This paper proposes a social DTN message transmission strategy based on line graph. The algorithm takes the quality of node pair and similarity in the line graph into consideration,and then divides nodes into different communities within three hops periodically. Finally,different routing strategies are designed in the community and between communities to achieve data transmission. Simulation results show that compared with Epidemic,PROPHET,and Sim Bet algorithm,the algorithm has higher message delivery ratio and smaller network overhead without any increase in network latency.
-
Keywords:
- social DTN /
- line graph /
- community /
- isolated node
-
-
[1] WANG Bo,HUANG Chuan-he,YANG Wen-zhong,et al.Trust opportunistic routing protocol in multi-hop wireless networks[C]∥2010 IEEE International Conference on Wireless Communications,Networking and Information Security.Beijing:IEEE,2010:563-567.
[2] 郭航,王兴伟,黄敏,等.容延容断网络研究及进展[J].计算机科学,2010,37(11):12-18.GUO Hang,WANG Xing-wei,HUANG Min,et al.Delay/disruption tolerant network[J].Research and Development of Computer Science,2010,37(11):12-18.(in Chinese) [3] 林闯,董扬威,单志广.基于DTN的空间网络互联服务研究综述[J].计算机研究与发展,2014,51(5):931-943.LIN Chuang,DONG Yang-wei,SHAN Zhi-guang.Overview of the research on the Internet service of space network based on[J].DTN Computer Research and Development,2014,51(5):931-943.(in Chinese) [4] GROSSGLAUSER M,TSE D.Mobility increases the capacity of ad-hoc wireless networks[C]∥Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies.Anchorage:IEEE,2001(3):1360-1369.
[5] RAMANATHAN R,HANSEN R,BASU P,et al.Prioritized epidemic routing for opportunistic networks[C]∥Proceedings of the 1st International Mobi Sys Workshop on Mobile Opportunistic Networking.New York:ACM,2007:62-66.
[6] LINDGREN A,DORIA A,SCHELN O.Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):19-20.
[7] DALY E,HAAHR M.Social network analysis for routing in disconnected delay-tolerant MANETs[C]∥Proceedings of the 8th ACM International Sysposium on Mobile Ad hoc Network and Computing.Montreal:ACM,2007:32-40.
[8] 张振京,金志刚,舒炎泰.基于节点运动预测的社会性DTN高效路由[J].计算机学报,2013(3):626-635.ZHANG Zhen-jing,JIN Zhi-gang,SHU Yan-tai.Social DTN efficient routing based on node motion prediction[J].Journal of Computers,2013(3):626-635.(in Chinese) [9] WANG Yun-sheng,WU Jie.Social-tie-based information dissemination in mobile opportunistic social networks[C]∥2013 IEEE 14th International Symposium and Workshops on a World of Wireless,Mobile and Multimedia Networks.Madrid:IEEE,2013:1-6.
[10] LU Zong-qing,WEN Yong-gang,CAO Guo-hong.Community detection in weighted networks:algorithms and applications[C]∥2013 IEEE International Conference on Pervasive Computing and Communications.San Diego:IEEE,2013:179-184.
[11] 万里,廖建新,朱晓民.一种动态网络社区划分算法[J].北京工业大学学报,2011,37(2):285-290.WAN Li,LIAO Jian-xin,ZHU Xiao-min.A dynamic network community division algorithm[J].Journal of Beijing University of Technology,2011,37(2):285-290.(in Chinese) [12] 朱铁英,崔艳茹,李童,等.基于社会性的DTN网络路由算法研究[J].计算机工程,2012,38(14):96-98.ZHU Tie-ying,CUI Yan-ru,LI Tong,et al.Research on DTN network routing algorithm based on social[J].Computer Engineering,2012,38(14):96-98.(in Chinese) [13] EVANS T S,LAMBIOTTE R.Line graphs,link partitions,and overlapping communities[J].Physical Review E,2009,80(1):016105.
[14] WANG Kun,HUANG Guo,WU Meng,et al.An Efficient Routing Algorithm Based on Social Awareness in DTNs[C]∥IEEE 77th Vehicular Technology Conference(VTC Spring).Dresden:IEEE,2013:1-5.
[15] 施伟.复杂网络中层次重叠社区发现算法研究[D].重庆:重庆大学通信与信息工程学院,2013.SHI Wei.Hierarchical overlapping community discovery algorithm in complex network research[D].Chongqing:School of Communication and Information Engineering,Chongqing University,2013.(in Chinese) [16] LI Q,GARCIA-LUNA-ACEVES J J.Opportunistic routing using prefix ordering and self-reported social groups[C]∥2013 International Conference on Computing,Networking and Communications.IEEE,2013:28-34.
[17] KERNEN A,OTT J,KRKKINEN T.The ONE simulator for DTN protocol evaluation[C]∥Proceedings of the 2nd international conference on simulation tools and techniques.Brussels:Institute for Computer Sciences,Social-Informatics and Telecommunications Engineering,2009:55-57.
[18] The 25th Conference on Computer Communications Sponsored by IEEE Communications Society[EB/OL].[2014-10-20].http:∥infocom2006.ieee-infocom.org/.
[19] 张振宇,张珍,杨文忠.复杂网络中重叠社区检测[J].计算机工程与科学,2013(12):76-83.ZHANG Zhen-yu,ZHANG Zhen,YANG Wen-zhong.Overlap in complex network community detection[J].Computer Engineering&Science,2013(12):76-83.(in Chinese) [20] 黄发良,肖南峰.基于线图与PSO的网络重叠社区发现[J].自动化学报,2011,37(9):1140-1144.HUANG Fa-liang,XIAO Nan-feng.Based on line graph and PSO's network of overlapping communities found[J].Automation Journal,2011,37(9):1140-1144.(in Chinese) [21] AHN Y Y,BAGROW J P,LEHMANN S.Link communities reveal multiscale complexity in networks[J].Nature,2010,466:761-764.
[22] ZHU Kong-lin,LI Wen-zhong,FU Xiao-ming.Smart:A social and mobile aware routing strategy for disruption tolerant networks[J].IEEE Transactions on Vehicular Technology,2014,1:3423-3434.
计量
- 文章访问数: 26
- HTML全文浏览量: 0
- PDF下载量: 9
下载:
