计算机科学 ›› 2020, Vol. 47 ›› Issue (4): 249-255.doi: 10.11896/jsjkx.190200358

• 计算机网络 • 上一篇    下一篇

MSN下基于亲缘关系的分族分层机会路由算法

薛冒杰, 吴军, 金小俊, 白光伟   

  1. 南京工业大学计算机科学与技术学院 南京211816
  • 收稿日期:2019-02-25 出版日期:2020-04-15 发布日期:2020-04-15
  • 通讯作者: 吴军(wujun@njtech.edu.cn)
  • 基金资助:
    国家自然科学基金(60673185,61073197)

Group Stratification Opportunistic Routing Algorithm Based on Kinship in MSN

XUE Mao-jie, WU Jun, JIN Xiao-jun, BAI Guang-wei   

  1. School of Computer Science and Technology,Nanjing University of Technology,Nanjing 211816,China
  • Received:2019-02-25 Online:2020-04-15 Published:2020-04-15
  • Contact: WU Jun,born in 1962,master,senior engineer,master tutor,is a member of China Computer Federation (CCF).His main research interests include network security,trusted computing and information system security.
  • About author:XUE Mao-jie,born in 1995,master.His main research interests include mobile social networks,network security and opportunity routing.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (60673185,61073197)

摘要: 移动社会网络(Mobile Social Network,MSN)具有社会网络特征,移动智能终端设备由于自身资源限制,往往表现出节点自私性。现有研究主要集中于解决节点个体自私性,而忽视了对节点社会自私性的甄别与利用。因此,文中提出了一种基于亲缘关系的分族分层路由算法。首先,在依据亲缘关系指数分族分层的社区和集群中,自荐的节点通过比较综合举荐值产生族节点和中继节点。然后,以亲缘关系预测的转移概率为转发依据,借助族节点和中继节点优化盲目转发,在有效地控制副本数的同时预测关联可靠路径链路,实现基于节点亲缘关系的相遇投递策略。仿真实验结果表明,该算法可以在保护与利用社会自私性的基础上,有效地提高消息投递率,降低网络时延,提高网络的通信流量等。

关键词: MSN, 分族分层, 机会路由, 亲缘关系, 社会自私性

Abstract: Mobile Social Network (MSN) has the characteristics of social network.Mobile intelligent terminal devices often exhi-bit node selfishness due to their own resource limitations.The existing researches mainly focus on solving the selfishness of node individuals,and thus neglecte the discrimination and utilization of node social selfishness.Therefore,this paper proposed a group stratification opportunistic routing algorithm based on kinship.First,in the communities and clusters based on the kinship index,the self-recommended nodes generate family nodes and relay nodes by comparing the recommended values.Then,the transition probability predicted by the kinship relationship is used as the forwarding basis,the family node and the relay node are used to optimize the blind forwarding.The effective reliable path link is predicted while the number of replicas is effectively controlled,and then encounter-based delivery strategy based on the node affinity is realized.Simulation results show that the proposed mecha-nism can effectively improve the message delivery rate,reduce the network delay,and improve the communication traffic of the network on the basis of protecting and utilizing social selfishness.

Key words: Group stratification, Kinship, MSN, Opportunity routing, Social selfishness

中图分类号: 

  • TP393
[1]CONTI M,GIORDANO S.Mobile ad hoc networking:Milestones,challenges,and new research directions[J].IEEE Communications Magazine,2014,52(1):85-96.
[2]XIONG Y P,SUN L M,NIU J W,et al.Opportunistic networks[J].Journal of Software,2009,20(1):124-137.
[3]YUE L.Research on Node Behavior of Mobile Social Networks[D].Beijing:Beijing University of Posts and Telecommunications,2014.
[4]HUANG C M,LAN K C,TSAI C Z.A survey of opportunistic networks[C]//Proceedings of the 22nd International Conference on Advanced Information Networking and Applications Workshops.2018:1672-1677.
[5]XU F,DENG M,XIONG Z G,et al.Data Forwarding Algorithm Based on Multidimensional Context Matching in Mobile Social Networks[J].Computer Science,2019,46(2):81-87.
[6]HUANG J L,LI J B,LI Y.A Utility-Based Probabilistic Routing Algorithm in Mobile Social Networks[J].Journal of Qing-dao University(Natural Science),2018,31(4):21-28.
[7]PAN H,KUANG X,LI V O K,et al.Selfishness,Altruism and Message Spreading in Mobile Social Networks[C]//IEEE International Conference on Computer Communications Workshops.2009.
[8]LI Q,ZHU S,CAO G.Routing in Socially Selfish Delay Tolerant Networks[C]//Proc. IEEE Infocom.2010:1-9.
[9]LIU X X.Social Selfishness-based Routing Algorithm on Opportunistic Networks[J].Computer and Modernization,2016,252(8):91-96.
[10]SERMPEZIS P,SPYROPOULOS T.Understanding the effects of social selfishness on the performance of heterogeneous opportunistic networks [J].Computer Communications,2014,48:71-83.
[11]CIOBANU R I,DOBRE C,DASCÂL M,et al.SENSE:A collaborative selfish node detection and incentive mechanism for opportunistic networks[J].Journal of Network and Computer Applications,2014,41:240-249.
[12]PAN D,ZHANG H,CHEN W J,et al.Transmission of multimedia contents in opportunistic networks with social selfish nodes[J].Multimedia Systems,2015,21(3):277-288.
[13]HUANG H C.Research on Message Forwarding and Collaboration Mechanism of Social Opportunity Network[D].Chongqing:Chongqing University,2017.
[14]HAMILTON P W.The genetical evolution of social behaviour.I[J].Journal of Theoretical Biology,1964,7(1):1-16.
[15]WU Z X,RONG Z H,WANG W X.The Game on Complex Networks[J].Advances in Mechanics,2008,38(6):794-804.
[16]HUMPHREYS L.Mobile Social Networks and Social Practice:A Case Study of Dodgeball[J].Journal of Computer-Mediated Communication,2017,13(1):341-360.
[17]ZHANG C L.Relational awareness and resource allocation of fog wireless access networks [D].Beijing:Beijing University of Posts and Telecommunications,2018.
[18]ZHAO W,LIU X M,DUAN Z,et al.A Review of Social Relationship Mining Research[J].Chinese Journal of Computers,2017,40(3):535-555.
[19]FREEMAN L C.Centrality in social networks conceptual clarification[J].Social Networks,1978,1(3):215-239.
[20]GAO Z X.Research on Key Technologies of Opportunity Network Data Transmission [D].Beijing:Beijing University of Posts and Telecommunications,2015.
[21]MA H,LI T.Application of Prophet Routing Based onThroughput Rate in DTN[J].Computer Technology and Deve-lopment,2018,28(255):193-197.
[22]LINDGREN A,DORIA A,SCHELÉN O.Probabilistic Routing in Intermittently Connected Networks[J].Acm Sigmobile Mobile Computing & Communications Review,2003,7(3):19-20.
[23]KERANEN A.Opportunistic Network Environment Simulator[D].Helsinki:Helsinki University of Technology.2008.
[24]EAGLE N,PENTLAND A.Reality mining:sensing complex social systems[J].Personal & Ubiquitous Computing,2006,10(4):255-268.
[25]DALY E,HAAHR M.Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs[C]//Acm Interational Symposium on Mobile Ad Hoc Networking & Computing.2007.
[1] 苏凡军,杜可怡.
WSNs中基于信任度的节能机会路由算法
Trust Based Energy Efficient Opportunistic Routing Algorithm in Wireless Sensor Networks
计算机科学, 2020, 47(2): 300-305. https://doi.org/10.11896/jsjkx.190100172
[2] 王晨阳, 林辉.
一种基于能量捕获无线传感网的三维地理机会路由
Three-dimensional Geographic Opportunistic Routing Based on Energy Harvesting Wireless Sensor Networks
计算机科学, 2019, 46(6A): 305-308.
[3] 韩莉,钱焕延.
流间编码与流内编码相结合的机会路由算法
Opportunistic Routing Algorithm Combining Intra-session Coding and Inter-session Coding in Wireless Network
计算机科学, 2018, 45(5): 69-74. https://doi.org/10.11896/j.issn.1002-137X.2018.05.012
[4] 许文浩,沈航,白光伟.
无线链路质量突变性感知的机会路由协议
Link Burstiness-aware Opportunistic Routing Protocol in Wireless Networks
计算机科学, 2018, 45(5): 83-88. https://doi.org/10.11896/j.issn.1002-137X.2018.05.015
[5] 王露, 白光伟, 沈航, 王天荆.
认知无线电网络中的频谱感知安全机会路由协议
Spectrum-aware Secure Opportunistic Routing Protocol in Cognitive Radio Networks
计算机科学, 2018, 45(10): 166-171. https://doi.org/10.11896/j.issn.1002-137X.2018.10.031
[6] 印新棋,吴军,莫伟伟,白光伟.
WMNs中基于节点可信度的机会路由改进算法
Improved Opportunistic Routing Algorithm Based on Node Trustworthiness for WMNs
计算机科学, 2017, 44(8): 151-156. https://doi.org/10.11896/j.issn.1002-137X.2017.08.027
[7] 郭东岳,刘林峰.
一种基于区域朋友关系的机会路由算法
Opportunistic Routing Algorithm Based on Regional Friendship
计算机科学, 2017, 44(3): 105-109. https://doi.org/10.11896/j.issn.1002-137X.2017.03.023
[8] 田贤忠,肖赟.
一种能量捕获无线传感网络机会路由算法
Algorithm of Opportunistic Routing Based on Energy Harvesting Wireless Sensor Networks
计算机科学, 2016, 43(Z6): 288-290. https://doi.org/10.11896/j.issn.1002-137X.2016.6A.069
[9] 陶雯,金玲,白光伟,沈航.
网络编码感知的无线机会路由性能分析模型
Performance Model for Network-coding-aware Opportunistic Routing in Wireless Networks
计算机科学, 2016, 43(9): 156-159. https://doi.org/10.11896/j.issn.1002-137X.2016.09.030
[10] 王振朝,蔡志杰,薛文玲.
一种基于部分网络编码的无线网络机会路由算法
Opportunistic Routing Algorithm Based on Partial Network Coding for Wireless Networks
计算机科学, 2016, 43(9): 152-155. https://doi.org/10.11896/j.issn.1002-137X.2016.09.029
[11] 严禹道,刘林峰.
一种基于可变半衰期的机会网络社团兴趣值更新策略
Update Strategy of Communities Information Based on Variable Half-lifes in Opportunistic Networks
计算机科学, 2016, 43(2): 124-128. https://doi.org/10.11896/j.issn.1002-137X.2016.02.028
[12] 姚金宝,张新有,邢焕来.
机会路由中一种候选节点数量估计方法
Estimation Method of Number of Candidate Nodes in Opportunistic Routing
计算机科学, 2016, 43(10): 103-106. https://doi.org/10.11896/j.issn.1002-137X.2016.10.019
[13] 沙海进,白光伟,沈 航,张 芃.
基于探测的多信道无线网状网机会路由算法
Probing-based Opportunistic Routing Algorithm for Multi-channel Wireless Mesh Networks
计算机科学, 2015, 42(5): 132-135. https://doi.org/10.11896/j.issn.1002-137X.2015.05.026
[14] 韩莉,钱焕延.
基于网络编码的无线网络多路径机会路由算法
Algorithm of Network Coding Based Multipath Opportunistic Routing for Wireless Networks
计算机科学, 2014, 41(5): 116-119. https://doi.org/10.11896/j.issn.1002-137X.2014.05.025
[15] 王万良,李桂森,姚信威,岑跃峰.
车载自组网中基于滑动窗口的网络编码传输策略
Sliding Window-based Network Coding Transmission Scheme for Vehicular Ad hoc Networks
计算机科学, 2012, 39(9): 85-88.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!