摘要
移动机会网络中的数据传输具有随机性特点,但源节点和目的节点的最优传输路径选择问题一直是研究的热点,该文提出一种节点分簇路由算法,即Node Clustering Routing Algorithm(NCRA)算法,该算法通过节点随机分簇找出簇头,再通过各簇头节点的数据选择传输,完成数据包的转发,最终将数据从源节点传输到目的节点,并找出最优信息传递路径。通过仿真实验,并与移动机会网络的Epidemic算法和OSNN算法比较,NCRA算法优化了网络数据传输路径,且具有传输效率高,能量消耗少,数据冗余少的特点。
The data transmission in the mobile opportunity network has the characteristics of randomness,but the problem of the op⁃timal transmission path selection between the source node and the destination node has always been a research hotspot.This paper proposes a node clustering routing algorithm(NCRA),which finds the cluster head by randomly clustering nodes,and then transfers the data through the data selection of each cluster head node to complete the packet forwarding,finally transfers the data from the source node to the destination node,and finds the optimal information transfer path.The simulation results show that the NCRA al⁃gorithm optimizes the network data transmission path,and has the characteristics of high transmission efficiency,less energy con⁃sumption and less data redundancy.
作者
张霖
王兰
ZHANG Lin;WANG Lan(School of Mathematics and Information Engineering,Chongqing University of Education,Chongqing 400065,China)
出处
《电脑知识与技术》
2020年第21期23-25,31,共4页
Computer Knowledge and Technology
基金
重庆第二师范学院青年项目(KY201926C)。
关键词
移动机会网络
网络节点
分簇
数据传输
mobile opportunistic networks
data node
clustering
data transmission
