基于异或运算的机会网络高效转发策略

J4 ›› 2014, Vol. 36 ›› Issue (11): 2094-2099.

基于异或运算的机会网络高效转发策略

刘辉1,2，陈志刚1,2，吴嘉1,2，王丹1,2，曾剑锋1

（1．中南大学软件学院，湖南长沙 410075；2．“移动医疗”教育部中国移动联合实验室，湖南长沙 410083）

收稿日期:2014-06-06 修回日期:2014-08-20 出版日期:2014-11-25 发布日期:2014-11-25
基金资助:
国家自然科学基金资助项目（61073186，61379057，61309001，61379110, 61103202）；教育部博士点基金优先发展领域课题资助项目（20120162130008）；国家973计划资助项目（2014CB046305）；教育部博士点基金新教师类资助项目(20110162120046)

An efficient forwarding strategy based on
XOR operation in opportunistic network

LIU Hui1,2，CHEN Zhigang1,2，WU Jia1,2，WANG Dan1,2，ZENG Jianfeng1

（1.School of Software,Central South University,Changsha 410075;
2. “Mobile Health” Ministry of EducationChina Mobile Joint Laboratory,Changsha 410083,China）

Received:2014-06-06 Revised:2014-08-20 Online:2014-11-25 Published:2014-11-25

摘要/Abstract

摘要：

通过对机会网络中节点传递信息的方式进行研究分析，遍历可以通信的邻居节点，将两节点的信息作比较。通过交集的形式，选择节点中携带信息异或程度最大的邻居节点作为下一跳进行信息传递，从而形成一条有效性最大的通信路径。基于这样的分析过程，提出了一种基于异或运算的机会网络高效转发策略FSXO。通过与机会网络中的经典算法对比，仿真结果表明，FSXO策略能够在高传输成功率的情况下，减少网络中无效数据副本的存在，从而有效地降低路由开销，减少资源的消耗。

关键词: 机会网络, 异或运算, 通信路径, 转发策略

Abstract:

Through studying the ways of forwarding information in opportunistic networks,the communication nodes in the neighbourbood can be traversed and the two nodes can be compared.Through the form of the intersection,the neighbor node with the largest XOR is chosen as the next hop to transfer the information so that a communication path with maximum effectiveness is formed. Based on this analysis process, an efficient forwarding strategy based on XOR operation in opportunistic networks (FSXO) is proposed.The proposal is compared with classical algorithms in opportunistic networks,and the simulation results show that the proposed FSXO strategy can reduce the presence of invalid copy data at high transmission rates,thus effectively reduce the routing overhead and resource consumption.

Key words: opportunistic network;XOR operation;communication path;forwarding strategy

刘辉1,2，陈志刚1,2，吴嘉1,2，王丹1,2，曾剑锋1. 基于异或运算的机会网络高效转发策略[J]. J4, 2014, 36(11): 2094-2099.

LIU Hui1,2，CHEN Zhigang1,2，WU Jia1,2，WANG Dan1,2，ZENG Jianfeng1. An efficient forwarding strategy based on
XOR operation in opportunistic network [J]. J4, 2014, 36(11): 2094-2099.

参考文献［7］

［1］	Xiong Yongping, Sun Limin, Niu Jianwei, et al.Opportunistic networks［J］.Journal of Software, 2009, 20 (1):124137.(in Chinese)
［2］	Jacquet P, Mans B, Rodolakis G. Information propagation speed in mobile and delay tolerant networks［J］. IEEE Transactions on Information Theory, 2010, 56(10):50015015.
［3］	Hu Siquan, Wang Hongbing, Wang Junfeng. Research on the opportunistic networks ［J］. Computer Science, 2009, 36 (10):3237.(in Chinese)
［4］	Zhang L, Huang W, Miao X, et al. The impact of storage capacity usage and predictable contact schedule on dynamic routing for opportunistic deep space information networks［J］. Wireless Personal Communications, 2014,77(2):119.
［5］	Tseng Y C, Wu F J, Lai W T. Opportunistic data collection for disconnected wireless sensor networks by mobile mules［J］. Ad Hoc Networks, 2013, 11(3):11501164.
［6］	MartínCampillo A, Crowcroft J, Yoneki E, et al. Evaluating opportunistic networks in disaster scenarios［J］. Journal of Network and Computer Applications, 2013, 36(2):870880.
［7］	Sun Jianzhi, Liu Nairui, Zhang Yingxin, et al.Performance analysis of typical routing algorithm in opportunistic network ［J］. Computer Engineering, 2011, 37(16):8689.(in Chinese)
［8］	Li Y, Hui P, Jin D, et al. Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks［J］. IEEE Communications Letters, 2010, 14(11):10261028.
［9］	Huang W, Zhang S, Zhou W. Spray and wait routing based on position prediction in opportunistic networks［C］∥Proc of 2011 3rd IEEE International Conference on Computer Research and Development (ICCRD), 2011:232236.
［10］	Gibran K. The PRoPHET:A new annotated edition［M］. London:Oneworld Publications, 2012.
［11］	Kernen A, Ott J, Krkkinen T. The ONE simulator for DTN protocol evaluation［C］∥Proc of the 2nd International Conference on Simulation Tools and Techniques, 2009:55.
	附中文参考文献：
［1］	熊永平，孙利民，牛建伟,等. 机会网络［J］. 软件学报, 2009, 20(1):124137.
［3］	胡四泉，汪红兵，王俊峰. 机会型网络研究综述［J］. 计算机科学, 2009, 36(10):3237.
［7］	孙践知，刘乃瑞，张迎新,等. 机会网络典型路由算法性能分析［J］. 计算机工程, 2011, 37(16):8689.

[1]	陈卫民1，2，陈志刚2，崔芳2，刘佳琦2. 一种基于混合社区的移动机会网络数据传输机制[J]. 计算机工程与科学, 2016, 38(11): 2202-2208.
[2]	张峰，王小明. 机会网络中基于能量消耗的缓存管理策略[J]. J4, 2016, 38(05): 891-897.
[3]	雒续源1,2，陈志刚1,2，王云华3，吴嘉1,2，关培源1,2,李乐1,2. 基于移动医疗大数据平台下深度最优匹配算法的机会网络转发机制 [J]. J4, 2015, 37(10): 1799-1805.
[4]	谭紫逸1，陈志刚1，2，吴嘉1，2 ，张魏斌1. 基于历史传输效率的最小传输延迟算法设计[J]. J4, 2015, 37(10): 1843-1849.
[5]	叶晖1，潘怡1，何文德1，彭绍亮2. 机会网络蓝牙设备唤醒调度机制研究[J]. J4, 2014, 36(07): 1290-1295.
[6]	孙践知，张迎新，陈丹，韩忠明. 具有退避机制的Epidemic路由算法[J]. J4, 2013, 35(3): 66-71.