机会网络中基于摆渡节点与簇节点相互协作的路由机制

doi:10.3969/j.issn.0372-2112.2016.11.007

电子学报 ›› 2016, Vol. 44 ›› Issue (11): 2607-2617.DOI: 10.3969/j.issn.0372-2112.2016.11.007

机会网络中基于摆渡节点与簇节点相互协作的路由机制

刘春蕊¹, 张书奎^1,2, 贾俊铖¹, 林政宽¹

1. 苏州大学计算机科学与技术学院, 江苏苏州 215006;
2. 江苏省无线传感网高技术研究重点实验室江苏南京 210003

收稿日期:2015-04-23 修回日期:2015-10-13 出版日期:2016-11-25 发布日期:2016-11-25
作者简介:刘春蕊,女,1987年出生于河南周口,现为苏州大学计算机科学与技术学院硕士研究生,主要研究方向为:群智感知、网络编码以及隐私保护等.E-mail:20134227012@suda.edu.cn;张书奎,男,1966年生于内蒙古,博士,教授、博士生导师,主要研究方向为物联网、无线传感器网络、信息安全、移动计算、智能信息处理等.E-mail:zhangsk@suda.edu.cn
基金资助:
国家自然科学基金（No.61201212，No.61572340）；江苏省自然科学基金资助项目（No.BK2011376）；江苏省“六大人才高峰”项目（No.2014-WLW-010）；苏州市融合通信重点实验室（No.SKLCC2013XX）；江苏省产学前瞻性项目（No.BY2012114）；软件新技术与产业化协同创新中心部分资助；江苏省科技项目（No.BY2014059-02）

Routing Mechanism Based on the Cooperation of the Ferry Nodes and Cluster Nodes in Opportunistic Networks

LIU Chun-rui¹, ZHANG Shu-kui^1,2, JIA Jun-cheng¹, LIN Cheng-kuan¹

1. School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu 215006, China;
2. Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, Jiangsu 210003, China

Received:2015-04-23 Revised:2015-10-13 Online:2016-11-25 Published:2016-11-25

摘要/Abstract

摘要：

机会网络是一种不需要在源节点和目的节点之间存在完整路径，利用节点移动带来的相遇机会实现网络通信的延迟容忍自组织网络，它以“存储-携带-处理-转发”的模式进行.为实现互不相交簇间的信息传输，本文设计了一种带阈值的簇移动模型CMMT，并提出了一种基于摆渡（Ferry）节点与簇节点协作的路由算法（CBSW）.该算法减少了冗余的通信和存储开销，以及在Spray阶段簇节点没有遇到目的节点或摆渡节点，进入Wait阶段携带消息的节点采用直接分发方式只向目的节点传输等问题.仿真实验表明，CBSW算法能够增加传输成功率，减少网络开销和传输延迟.

关键词: 机会网络, 移动模型, 协作, 路由算法

Abstract:

Opportunistic Networks are delay tolerant self-organized networks with sparse nodes,where the message propagation depends on the cooperation of nodes to fulfill a "store-carry-process-and-forward" fashion by leveraging the mobility of nodes,because there does not exist a complete path from the source to the destination in the most time.To achieve the communication of nodes in mutually disjoint clusters,we propose a Cluster Movement Model with Threshold (CMMT) and routing algorithm (CBSW),which is Cooperative Binary Spray and Wait routing algorithm based on the Ferry nodes and cluster nodes cooperation.This routing algorithm reduces of the redundancy of communication and store the cost,as well as if the destination or Ferry nodes are not found in the spraying phase,nodes carrying a message copy will forward the message only to its destination in the Waiting phase nodes etc.Simulation results demonstrate the effectiveness of the proposed CBSW protocol in terms of high delivery ratio,low overhead and small average delay.

Key words: opportunistic networks, movement model, cooperation, routing algorithm

中图分类号:

TP393.04

刘春蕊, 张书奎, 贾俊铖, 林政宽. 机会网络中基于摆渡节点与簇节点相互协作的路由机制[J]. 电子学报, 2016, 44(11): 2607-2617.

LIU Chun-rui, ZHANG Shu-kui, JIA Jun-cheng, LIN Cheng-kuan. Routing Mechanism Based on the Cooperation of the Ferry Nodes and Cluster Nodes in Opportunistic Networks[J]. Acta Electronica Sinica, 2016, 44(11): 2607-2617.

参考文献

[1] CHAINTREAU A,HUI P,CROWCROFT J,et al.Pocket switched networks:real-world mobility and its consequences for opportunistic forwarding[R].University of Cambridge,Computer Lab,Tech Rep UCAM-CL-TR-617,2005.
[2] PELUSI L,PASSARELLA A,CONTIM.Opportunistic networking:data forwarding in disconnected mobile ad hoc networks[J].Communications Magazine,IEEE,2006,44(11):134-141.
[3] JUANG P,OKI H,WANG Y,et al.Energy-efficient computing for wildlife tracking:design tradeoffs and early experiences with ZebraNet[A].Proceeding of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems[C].New York:ACM,2002.96-107.
[4] SMALL T,HAAS Z J.The shared wireless infestation model:a new ad hoc networking paradigm[A].Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing[C].New York:ACM,2003.233-244.
[5] HULL B,BYCHKOVSKY V,ZHANG Y,et al.CarTel:a distributed mobile sensor computing system[A].The 4th ACM Conference on Embedded Networked Sensor System[C].Colorado:ACM,2006.125-138.
[6] PENTLAND A,FLETCHER R,HASSON A.DakNet:rethinking connectivity in developing nations[J].Computer,2004,37(1):78-83.
[7] MOREIRA W,FERREIRA R,CIRQUEIRA D,et al.SocialDTN:a DTN implementation for digital and social inclusion[A].ACM MobiCom Workshop on Lowest Cost Denominator Networking for Universal Access[C].Miami:ACM,2013.25-28.
[8] MOREIRA W,MENDES P,FERREIRA R,et al.Opportunistic routing based on users daily life routine[A].World of Wireless,Mobile and Multimedia Networks (WoWMoM),2012 IEEE International Symposium[C].Baltimore:IEEE,2012.1-6.
[9] NAUMOV V,GROSS T R.Connectivity-aware routing (CAR) in vehicular ad-hoc networks[A].INFOCOM 2007.26th IEEE International Conference on Computer Communications[C].Anchorage:IEEE,2007.1919-1927.
[10] VAHDAT A,BECKER D.Epidemic routing for partially connected ad hoc networks,CS2200006[R].Durham,NC:Duke University,2000.
[11] SPYROPOULOS T,PSOUNIS K,PAGHAVENDRA C S.Spray and wait:an efficient routing scheme for intermittently connected mobile networks[A].Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking[C].New York:ACM,2005.252-259.
[12] LINDGREN A,DORIA A,SCHENLEN O.Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):19-20.
[13] SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S.Efficient routing in intermittently connected mobile networks:the multiple-copy case[J].Networking,IEEE/ACM Transactions on,2008,16(1):77-90.
[14] 熊永平等,孙利民,年建伟,刘燕.机会网络[J].软件学报,2009,20(1):124-137. XIONG Yong-Ping,SUN Li-Min,NIU Jian-Wei,LIU Yan.Opportunistic Networks[J].Journal of Software,2009,20(1):124-137.(in Chinese)
[15] BETTSTETTER C,RESTA G,SANETI P.The node distribution of the random waypoint mobility model for wireless ad hoc networks[J].Mobile Computing,IEEE transactions on,2003,2(3):257-269
[16] HONG X,GERLA M,PEI G,et al.A group mobility model for ad hoc wireless networks[A].Proceedings of the 2nd ACM International Workshop on Modeling,Analysis and Simulation of Wireless and Mobile Systems[C].New York:ACM,1999.53-60
[17] ROYER E M,MELLIAR-SMITH P M,MOSER L E.An analysis of the optimum node density for ad hoc mobile networks[A].Proceedings of the IEEE International Conference on Communications[C].USA:IEEE,2001.857-861.
[18] EAGLE N,PENTLAND A.Reality mining:sensing complex social systems[J].Personal and Ubiquitous Computing,2006,10(4):255-268.
[19] The University California S D.Wireless Topology Discovery Project[Z].UCSD,2004.
[20] DIO I.An Innovative Paradigm for Autonomic Opportunistic Communication[Z].2010.
[21] ZHANG X,KUROSE J,LEVINE B N,et al.Study of a bus-based disruption-tolerant network:mobility modeling and impact on routing[A].The 3th Annual International Conference on Mobile Computing and Networking[C].Montreal:MobiCom,2007.195-206.
[22] ZHAO W,AMMAR M,and ZEGURA E.Message ferrying proactive routing in highly-partitioned wireless and ad hoc networks[A].The 9th IEEE International Workshop on Future Trends in Distributed Computing Systems (FTDCS)[C].Puerto:IEEE,2003.308-314.
[23] ZHAO W,et al.A message ferrying approach for data delivery in sparse mobile Ad Hoc networks[A].Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHo?04)[C].New York:ACM,2004.187-98.
[24] Zhao W,AMMAR M,ZEGURA E.Controlling the mobility of multiple data transport ferries in a delay-tolerant network[A].Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05)[C].Miami:IEEE,2005.1407-1418.
[25] BETTSTETTER C,WAGNER C.The spatial node distribution of the random waypoint mobility model[A].Proceedings of German Workshop on Mobile Ad Hoc networks(WMAN)[C].Germany:IEEE,2002.41-58
[26] KERANEN A.Opportunistic network environment simulator[R].Special Assignment report,Helsinki University of Technology,Department of Communications and Networking,2008.
[27] JONES E,WARD P.Routing strategies for delay-tolerant networks[A].Proceedings of the ACM SIGCOMM workshop on Delay-tolerant networking[C].New York:ACM,2006.1577-1580.

机会网络中基于摆渡节点与簇节点相互协作的路由机制

Routing Mechanism Based on the Cooperation of the Ferry Nodes and Cluster Nodes in Opportunistic Networks

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	亓凯梁, 刘超, 包建荣, 姜斌, 吴俊. 多中继选择极化译码转发及优化功率分配[J]. 电子学报, 2022, 50(5): 1167-1173.
[2]	宋政育, 郝媛媛, 孙昕. 低轨卫星协作边缘计算任务迁移和资源分配算法[J]. 电子学报, 2022, 50(3): 567-573.
[3]	赵雄文, 张钰, 秦鹏, 王晓晴, 耿绥燕, 宋俊元, 刘瑶, 李思峰. 空天地一体化无线光通信网络关键技术及其发展趋势[J]. 电子学报, 2022, 50(1): 1-17.
[4]	林昀轩, 刘超, 包建荣, 姜斌, 吴俊. 选择软消息转发协作下的物理层网络编码[J]. 电子学报, 2021, 49(7): 1450-1456.
[5]	王毅, 王侃琦, 张茂省, 李静. 基于直觉模糊Memetic框架的双粒子群混合优化算法[J]. 电子学报, 2021, 49(6): 1041-1049.
[6]	欧阳一鸣, 张鹏, 王奇, 安鑫, 梁华国. WiNoC中交叉开关仲裁及路由算法设计[J]. 电子学报, 2021, 49(3): 518-526.
[7]	王毅, 李晓梦, 耿国华, 周琳, 段焱中. 基于直觉模糊熵的混合粒子群优化算法[J]. 电子学报, 2021, 49(12): 2381-2389.
[8]	崔苑茹, 李鹏, 刘宏, 王小明, 吴晓军. 基于校园机会网络的协作小组缓存调度策略[J]. 电子学报, 2021, 49(12): 2399-2406.
[9]	刘剑锋, 孙力帆, 普杰信, 何子述, 王燕玲. 基于刚性约束的双移动机器人协同定位[J]. 电子学报, 2020, 48(9): 1777-1785.
[10]	欧阳一鸣, 贾博远, 李建华, 黄正峰, 梁华国. WiNoC中无线通信拥塞与故障感知的容错路由算法[J]. 电子学报, 2020, 48(4): 662-669.
[11]	马彬, 王宏明, 谢显中. 基于监督学习的协作宽带压缩频谱检测方案[J]. 电子学报, 2020, 48(12): 2338-2344.
[12]	魏松杰, 王佳贺, 刘沛龙, 程浩. LEO星座中基于不完全信息的路由联盟博弈策略[J]. 电子学报, 2020, 48(10): 1923-1927.
[13]	丁旭, 吴晓蓓, 王力立, 张新宇, 夏昕. 无线传感器网络中基于最优转发集的协作式编码传输协议[J]. 电子学报, 2019, 47(7): 1584-1590.
[14]	马学彬, 郑田玉, 李明珠. 机会网络中自私行为影响的分析与调节[J]. 电子学报, 2019, 47(4): 837-847.
[15]	李美玲, 李莹, Sami Muhaidat, 王钢飞, 董增寿, 王安红, 梁杰. 非理想干扰删除下全双工中继NOMA系统的物理层安全性能研究[J]. 电子学报, 2019, 47(1): 183-189.