CAJ | 학술논문

机会网络利用节点的移动而产生的通信机会传输信息，可以随时自组并且不依赖于任何基础设施的性质，使其广泛地应用于短距离范围内的数据共享环境中。然而，机会网络中传统的路由算法没有考虑数据共享机会网络的特性，消息只能采用洪泛等传统形式传播。本文首先分析机会数据共享网络的具体特点及其属性，提出消息传播中锚区和目的节点簇的概念；根据消息的重要等级和生命期提出新的调度算法；结合网络属性和调度算法提出新的路由策略，使消息根据其锚区和目的节点簇快速高效地在网络中传播；通过仿真实验验证本文提出路由策略的正确性和高效性。
궤회망락이용절점적이동이산생적통신궤회전수신식，가이수시자조병차불의뢰우임하기출설시적성질，사기엄범지응용우단거리범위내적수거공향배경중。연이，궤회망락중전통적로유산법몰유고필수거공향궤회망락적특성，소식지능채용홍범등전통형식전파。본문수선분석궤회수거공향망락적구체특점급기속성，제출소식전파중묘구화목적절점족적개념；근거소식적중요등급화생명기제출신적조도산법；결합망락속성화조도산법제출신적로유책략，사소식근거기묘구화목적절점족쾌속고효지재망락중전파；통과방진실험험증본문제출로유책략적정학성화고효성。
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 an-alyzes 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 effi-ciently in the network according to its anchor region and the destination node cluster. Finally, we verify the correctness and effi-ciency of the routing strategy by simulation experiments.