一种基于混合社区的移动机会网络数据传输机制

计算机工程与科学

一种基于混合社区的移动机会网络数据传输机制

陈卫民1，2，陈志刚2，崔芳2，刘佳琦2

（1.湖南城市学院通信与电子工程学院，湖南益阳 413000;2.中南大学软件学院，湖南长沙 410075）

收稿日期:2016-07-10 修回日期:2016-09-08 出版日期:2016-11-25 发布日期:2016-11-25
基金资助:
国家自然科学基金（61379057，61309001，61272149）；教育部博士点基金优先发展领域课题（20120162130008）；博士生自主探索创新项目（014zzts043）；湖南省教育厅科研项目（15C0261）;益阳市科技计划项目(YK1645)

A packet transmission mechanism based on hybrid

social groups in mobile opportunistic networks

CHEN Weimin1，2，CHEN Zhigang2,CUI Fang2，LIU Jiaqi2

（1.School of Communication and Electronic Engineering，Hunan City University，Yiyang 413000;

2.School of Software,Central South University,Changsha 410075,China）

Received:2016-07-10 Revised:2016-09-08 Online:2016-11-25 Published:2016-11-25

摘要/Abstract

摘要：

由人携带或使用智能设备组成的移动机会网络采用“存储携带转发”的通信机制，通过中继转发来实现节点之间的数据传递。为了改善网络性能，往往需要借助节点的社会属性来进行中继选择和制定转发策略。然而，在已有的传输机制中，往往只是利用节点的部分社会属性，不能完全反映出节点之间的社会关系。为此，提出了一种新的基于混合社区的数据传输机制，并给出了混合社区的内涵、混合社区的构建方法和基于混合社区的数据传输算法。基于几种真实轨迹数据集的实验结果表明，与已有的几种经典路由算法相比，该方法传输成功率较高，传输延迟较短，性能更好。

关键词: 混合社区, 移动机会网络, 数据传输机制, 历史相遇信息, 社会特征

Abstract:

Mobile opportunistic networks which are formed by humancarried intelligent devices, implement the packet transmission between nodes by taking advantages of the relay forwarding based on the “storecarryforward” principle of communication. In order to improve the network performance, the social attributes of nodes are often used to select the relay and make data forwarding decisions. However, the existing packet transmission mechanisms usually use partial social attributes of nodes therefore the social relationship between the nodes cannot be fully reflected. We propose a new packet transmission mechanism based on hybrid social groups in mobile opportunistic networks. We define the concept of hybrid social group, provide the construction method of hybrid social groups and design a packet transmission algorithm. Experiments on several real data sets demonstrate that the proposed mechanism has a higher transmission success rate, a shorter transmission delay and a better performance in comparison with the existing socialgroup routing schemes.

Key words: hybrid social group, mobile opportunistic networks, packet transmission mechanism, historical encounters, social features

陈卫民1，2，陈志刚2，崔芳2，刘佳琦2. 一种基于混合社区的移动机会网络数据传输机制[J]. 计算机工程与科学.

CHEN Weimin1，2，CHEN Zhigang2,CUI Fang2，LIU Jiaqi2.

A packet transmission mechanism based on hybrid

social groups in mobile opportunistic networks

[J]. Computer Engineering & Science.

参考文献

［1］
Sun Jianzhi.Opportunistic network routing algorithm ［M］.Beijing:Posts and Telecom Press,2013.（in Chinese）

［2］Chen Weimin,Chen Zhigang,Cui F.Vicinity enhanced social groupbased routing for opportunistic networks［J］,Journal of Computational Information Systems,2014，10（22）:96199627．

［3］Xiong Yongping, Sun Limin, Niu Jianwei. Opportunistic networks ［J］.Journal of Software,2009,20（1）:124137.（in Chinese）

［4］Xu J,Li J,You L,et al.Dynamic groups based adaptive DTN routing algorithms in social networks ［J］.International Journal of Distributed Sensor Networks，2014,2014（1）:113．

［5］Vahdat A,Becher D.Epidemic routing for partially connected Ad Hoc networks:Technical Report CS200006［R］.North Carolina:Duke University,2000．

［6］Spyropoulos T,Psounis K,Raghavendrac S.Spray and wait:An efficient routing scheme for intermittently connected mobile networks ［C］∥Proc of ACM SIGCOMM Workshop on Delaytolerant Networking,2005:252259．

［7］Lindgren A,Doria A,Schelen O.Probabilistic routing in intermittently connected networks ［J］.ACM SIGMOBILE Mobile Computing and Communications Review,2003,7（3）:1920．

［8］Burgess J,Gallagher B,Jensen D,et al.MaxProp:Routing for vehiclebased disruptiontolerant networks［C］∥Proc of IEEE INFOCOM,2006:111．

［9］Burns B, Brock O, Levine B N. MV routing and capacity building in disruption tolerant networks［C］∥Proc of IEEE INFOCOM,2005:398408．

［10］Balasubramanian A,Levine B,Venkataramani A.DTN routing as a resource allocation problem［J］.ACM SIGCOMM Computer Communication Review,2007,37（4）:373384．

［11］Chaintreau A,Hui P,Crowcroft J,et al.Pocket switched networks:Realworld mobility and its consequences for opportunistic forwarding:Technical Report 617［R］.
Cambridge:University of Cambridge Computer Laboratory,2005．

［12］Chaintreau A,Fraigniaud P,Lebhar E.Opportunistic spatial gossip over mobile social networks［C］∥Proc of ACM WOSN’08,2008:7378．

［13］Zhao L,Li F,Wang Y.Hybrid positionbased and DTN forwarding in vehicular wireless Ad Hoc networks［C］∥Proc of 2012 IEEE Vehicular Technology Conference,2012:15．

［14］Bulut E,Szymanski B K.Friendship based routing in delay tolerant mobile social networks.［C］∥Proc of Global Communications Conference,2010,2010:15．

［15］Daly E M,Haahr M.Social network analysis for routing in disconnected delaytolerant manets［C］∥Proc of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing.ACM,2007:3240．

［16］Hui P, Crowcroft J, Yoneki E. BUBBLE Rap:Socialbased forwarding in delaytolerant networks［J］.IEEE Transactions on Mobile Computing,2011,10（11）:15761589．

［17］Niu Jianwei，Zhou Xing, Liu Yan, et al.A message transmission scheme for community—based opportunistic network［J］.Journal of Computer Research and Development,2009,46（12）:20682075.（in Chinese）

［18］Peng Jian, Li Mengshi, Liu Tang, et al.Nodal socialitybased data forwarding for opportunistic network ［J］.Journal of Sichuan University,2013,45（5）:5763．(in Chinese)

［19］Zhao L,Li F,Zhang C,et al.Routing with multilevel social groups in mobile opportunistic networks［C］∥Proc of Global Communications Conference （GLOBECOM）,2012:52905295．

［20］Li F,Zhang C,Gao Z,et al.Social feature enhanced groupbased routing for wireless delay tolerant networks［C］∥Proc of
2012 IEEE 8th International Conference on Mobile Adhoc and Sensor Networks （MSN）,2012:6874．

［21］Li F,Zhao L,Zhang C,et al.Routing with multilevel crosscommunity social groups in mobile opportunistic networks ［J］.Personal and Ubiquitous Computing,2014,18（2）:385396．

［22］Wu J,Wang Y.Hypercubebased multipath social feature routing in human contact networks ［J］.IEEE Transactions on Computer, 2012,63(2):383396．

［23］Wang Y,Yang W,Wu J.Analysis of a hypercubebased social feature multipath routing in delay tolerant networks ［J］.IEEE Transactions on Parallel & Distributed Systems, 2012,24(9):17061716．

［24］Wang Xiaofan, Li Xiang, Chen Guanrong. Complex networks theory and applications ［M］.Beijing:Tsinghua University Press,2006.(in Chinese)

［25］Scott J,Gass R,Crowcroft J,et al.CRAWDAD trace Cambridge/haggle/imote/infocom2006 （v.20090529）［EB/OL］.［20151013］.http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom2006．

［26］Eagle N, Pentland A, Lazer D. Inferring social network structure using mobile phone data［J］. Proceeding of the National Academy of Sciences PNAS,2009,106（36）:1527415278．

附中文参考文献：

［1］孙践知.机会网络路由算法［M］.北京:人民邮电出版社，2013．

［3］熊永平，孙利民，牛建伟.机会网络［J］.软件学报，2009，20（1）:124137．

［17］牛建伟，周兴，刘燕，等.一种基于社区机会网络的消息传输算法［J］.计算机研究与发展,2009,46（12）:20682075．

［18］彭舰，李梦诗,刘唐，等.机会网络中基于节点社会性的数据转发策略［J］.四川大学学报.2013,45（5）:5763．

［24］汪小帆，李翔，陈关荣.复杂网络理论及其应用［M］.北京：清华大学出版社,2006

[1]	蒋俊，黄传河，华超，胡海桥，彭晖. 基于软件定义资源的实时控制CPS数据传输机制[J]. J4, 2015, 37(12): 2250-2255.
[2]	许毅平梁超周曼丽. WebCCTV中的流量控制设计与实现[J]. J4, 2004, 26(6): 13-16.