基于机会网络的资源共享路由策略研究与仿真

计算机与现代化

基于机会网络的资源共享路由策略研究与仿真

陕西工业职业技术学院信息工程学院，陕西咸阳712000

收稿日期:2015-07-24 出版日期:2015-09-21 发布日期:2015-09-24
作者简介: 戚娜（1981-），女，陕西户县人，陕西工业职业技术学院信息工程学院讲师，硕士，研究方向：数据处理和信息安全。
基金资助:
陕西省重点实验室开放共享项目（SAIIP201202）

Research and Simulation of Routing Strategy for Resource Sharing #br# Based on Opportunistic Networks

Department of Information Engineering, Shaanxi Polytechnic Institute, Xianyang 712000, China

Received:2015-07-24 Online:2015-09-21 Published:2015-09-24

摘要/Abstract

摘要：

机会网络利用节点的移动而产生的通信机会传输信息，可以随时自组并且不依赖于任何基础设施的性质，使其广泛地应用于短距离范围内的数据共享环境中。然而，机会网络中传统的路由

算法没有考虑数据共享机会网络的特性，消息只能采用洪泛等传统形式传播。本文首先分析机会数据共享网络的具体特点及其属性，提出消息传播中锚区和目的节点簇的概念；根据消息的重要等级和生

命期提出新的调度算法；结合网络属性和调度算法提出新的路由策略，使消息根据其锚区和目的节点簇快速高效地在网络中传播；通过仿真实验验证本文提出路由策略的正确性和高效性。

关键词: , 机会网络, 资源共享, 路由, 调度, 仿真

Abstract:

Opportunistic networks use the opportunity which generated by the nodes movement to transmit information. It can be widely used in the environment of data

sharing in a short distance due to properties of opportunitys self-organization and without a fixed communication infrastructure. However, the traditional routing algorithm in

opportunistic network does not take into account the characteristics of data sharing. So messages dissemination only can use the traditional forms like flooding. This paper

first analyzes the specific features and attributes of the data sharing opportunistic network, and puts forward the concept of anchor zone and the destination node clusters in

the process of messages dissemination. Furthermore, we propose a new scheduling algorithm based on the level the time to live of the message with different importance and

lifetime. Moreover, we put forward the new routing strategies through combining the data sharing network attributes with scheduling algorithm, so the message spread quickly and

efficiently in the network according to its anchor region and the destination node cluster. Finally, we verify the correctness and efficiency of the routing strategy by

simulation experiments.

Key words: opportunistic networks, resource sharing, routing, scheduling, simulation


戚娜. 基于机会网络的资源共享路由策略研究与仿真[J]. 计算机与现代化.

QI Na. Research and Simulation of Routing Strategy for Resource Sharing #br# Based on Opportunistic Networks[J]. Computer and Modernization.

参考文献

［1］ Pirozmand P, Wu G, Jedari B, et al. Human mobility in opportunistic networks: Characteristics, models and prediction methods［J］. Journal of Network and Computer Applications,

2014,42：45-58.
［2］ Biagioni E, Giordano S. Ad Hoc and sensor networks ［Series Editorial］［J］. IEEE Communications Magazine, 2015,53(1):248.
［3］ Lin Yaguang, Wang Xiaoming, Zhang Lichen, et al. The impact of node velocity diversity on mobile opportunistic network performance［J］. Journal of Network and Computer

Applications, 2015,55:47-58.
［4］ Pan Daru, Zhang Hui, Chen Weijing, et al. Transmission of multimedia contents in opportunistic networks with social selfish nodes［J］. Multimedia Systems, 2015,21

(3):277-288.
［5］ Martin-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.
［6］ Punceva M, Rodero I, Parashar M, et al. Incentivising resource sharing in social clouds［J］. Concurrency and Computation: Practice and Experience, 2015,27

(6):1483-1497. 
［7］ Helmle S, Kuhn M, Pesch D, et al. Multi-hop link adaptation for emergency services narrowband mobile ad-hoc networks［C］// Proceedings of the 10th International ITG

Conference on Systems, Communications and Coding. 2015:1-6.
［8］ Fujihara A, Miwa H. Disaster evacuation guidance using opportunistic communication: The potential for opportunity-based service［J］. Studies in Computational

Intelligence, 2014,546:425-446.
［9］ Yuan Peiyan, Tang Shaojie. Community-based immunization in opportunistic social networks［J］. Physica A: Statistical Mechanics and its Applications, 2015,420:85-97.
［10］Ciobanu R, Marin R, Dobre C, et al. Interest-awareness in data dissemination for opportunistic networks［J］. Ad Hoc Networks, 2015,25：330-345.
［11］Wu Honghai, Ma Huadong, Zhao Dong. Videocent: A quality-oriented incentive mechanism for video delivery in opportunistic networks［J］. Wireless Networks, 2015,21

(3):769-781.
［12］Zhang X, Neglia G, Kurose J, et al. Performance modeling of epidemic routing［J］. Computer Networks, 2007,51(10):2867-2891.
［13］Zhang Sheng, Qian Zhuzhong, Wu Jie, et al. Virtual network embedding with opportunistic resource sharing［J］. IEEE Transactions on Parallel & Distributed Systems,

2014,25(3):816-827.
［14］Mohan S, Qu G, Mili F. Lecture Notes in Computer Science［M］. Springer Berlin Heidelberg, 2012:462-478.
［15］Wang Zhen, Wang Xinhua, Sui Jingqi. Extending research for ONE simulator of opportunistic network［J］. Application Research of Computers, 2012,29(1):272-277.

[1]	王宏杰, 徐胜超, 杨波, 毛明扬, 蒋金陵. 基于SRv6技术的云网安全服务链自动编排方法[J]. 计算机与现代化, 2024, 0(01): 1-5.
[2]	李想, 庄毅. 利用XGBoost的路由算法关键故障点识别方法#br# #br#[J]. 计算机与现代化, 2023, 0(11): 75-81.
[3]	张春晖, 聂芸, 王国伟. 空天三维仿真中空间目标实时渲染算法[J]. 计算机与现代化, 2023, 0(11): 82-88.
[4]	刘续, 查可可. 一种用于机场特种车辆作业的环境目标识别方法[J]. 计算机与现代化, 2023, 0(08): 18-24.
[5]	刘聪, 聂芸, 王国伟. 空天三维仿真的实体多元表达方法[J]. 计算机与现代化, 2023, 0(04): 90-94.
[6]	周江, 陈扬, 虞凌云. 基于效用函数的无源光网络动态带宽分配算法[J]. 计算机与现代化, 2023, 0(04): 106-110.
[7]	韩沐枫. 计及需求响应的微电网多时间尺度调度仿真[J]. 计算机与现代化, 2023, 0(03): 102-106.
[8]	周永福, 徐胜超. 基于双层规划的容器云资源动态配置算法[J]. 计算机与现代化, 2022, 0(12): 1-5.
[9]	李静元, 张珂, 杨东裕. 基于雾计算的工业互联网安全数据访问方法[J]. 计算机与现代化, 2022, 0(12): 118-122.
[10]	田云娜, 田园, 刘雪, 赵彦霖. 一种改进的求解柔性作业车间调度问题的灰狼算法[J]. 计算机与现代化, 2022, 0(08): 78-85.
[11]	张晶, 马潇潇. 海绵校园更新设计虚拟仿真实验系统[J]. 计算机与现代化, 2022, 0(04): 110-114.
[12]	徐明, 张剑铭, 陈松航, 陈豪. 柔性作业车间调度问题的多目标优化算法[J]. 计算机与现代化, 2021, 0(12): 1-6.
[13]	赵继业. 基于云安全模型的簇状树形无线传感器网络路由协议 [J]. 计算机与现代化, 2021, 0(08): 6-10.
[14]	郑捷, 潘大志, . 改进的离散型萤火虫优化算法求解柔性作业车间调度问题 [J]. 计算机与现代化, 2021, 0(08): 11-15.
[15]	陈春燕, 刘梦赤. 基于粒子群遗传算法的智能组卷策略[J]. 计算机与现代化, 2021, 0(08): 16-23.