移动社交网络中基于节点团结构的数据转发算法研究

发布时间：2018-06-13 22:08

本文选题：移动社交网络 + 友好性　；参考：《合肥工业大学》2016年硕士论文

【摘要】：容迟网络(Delay Tolerant Networks, DTN)是一类端到端连接不稳定的新型无线网络,移动社交网络(Mobile Social Network)作为容迟网络的一个重要应用。移动社交网络通信是由人们通过WIFI、4G、蓝牙等间歇式连接来实现的网络设备之间的数据通信。随着互联网的快速发展,尤其是随着4G技术的成熟、5G技术的研究以及智能手机的普及,移动社交网络用户数量逐年增多,带动了移动互联网的快速发展。当今社会,人们每天甚至每时每刻都在与人打交道。关系在社会生活的中的作用日益重要,如何快速有效地利用已有的社会关系网络是现代人才必须掌握的技能。最近,对利用友好性关系实现数据转发算法的研究是移动社交网络中的一个热门话题。本文中,首先介绍了移动社交网路的发展由来、移动社交网络的基本特点、移动社交网络常见的几种类型以及移动社交网络中几种典型的利用社会属性的数据转发算法。接着,本文从节点的友好性角度出发,利用节点间的友好性,构造了节点间的团结构并利用团与节点、社区之间的亲密度,提出了一种基于团结构亲密度的数据转发算法(Data forwarding algorithm based on intimacy of group, DFAIG)。该算法的基本思想是,数据包携带节点只有在本社区AP或者相遇节点与以目的节点为中心的团结构的亲密度达到一定要求时,才转发数据包给相遇节点。仿真实验结果显示,与著名的Epidemic, Label和SGBR相比,本文提出的算法在降低网络开销上具有明显优势,且有效地提高数据包传递率。在团结构亲密度模型的基础上,对网络模型继续细分,构建了双层社区模型。通过对节点之间友好性的判断,本文将互为朋友的节点划分为同一个小社区。但是由于节点的朋友多种多样,导致小社区之间会出现重叠。因此,我们根据小社区之间朋友对的数目以及重叠的节点数来构建网络中大社区。最后在双层社区模型基础上,提出了新的数据转发算法TLCR。通过仿真模拟实验,TLCR不仅提高了传递率,而且明显减少了拷贝数目。
[Abstract]:Delay-tolerant network (DTNN) is a new wireless network with unstable end-to-end connection. Mobile social network (Mobile Social Network) is an important application of Delay-Tolerant Network (DTNN). Mobile social network communication is the data communication between network devices which is realized by people's intermittent connection such as WiFi 4G Bluetooth and so on. With the rapid development of the Internet, especially with the development of 4G technology and the popularity of smart phones, the number of mobile social network users has increased year by year, driving the rapid development of mobile Internet. In today's society, people are dealing with people every day and even every moment. The relationship plays an increasingly important role in social life. How to utilize the existing social network quickly and effectively is a skill that modern talents must master. Recently, the research of data forwarding algorithm using friendly relationship is a hot topic in mobile social networks. In this paper, we first introduce the origin of mobile social network, the basic characteristics of mobile social network, the common types of mobile social network and some typical data forwarding algorithms using social attributes in mobile social network. Then, from the point of view of node friendliness, using the friendliness between nodes, this paper constructs the cluster structure between nodes and makes use of the affinity between groups and nodes, communities. A data forwarding algorithm based on cluster structure affinity density is proposed in this paper. The basic idea of the algorithm is that the packet carrying node will forward the packet to the encounter node only if the affinity between the AP or the encounter node and the cluster structure centered on the destination node reaches a certain requirement. The simulation results show that compared with the famous Epidemicl label and SGBR the proposed algorithm has obvious advantages in reducing the network overhead and effectively improves the packet transfer rate. Based on the closeness model of regiment structure, the two-layer community model is constructed by subdividing the network model. By judging the friendliness between nodes, the nodes that are friends with each other are divided into the same small community. However, due to the diversity of friends in the nodes, there will be overlap between small communities. Therefore, we construct large communities in the network based on the number of friends pairs and the number of overlapping nodes between small communities. Finally, a new data forwarding algorithm, TLCRs, is proposed based on the two-level community model. Simulation experiments show that TLCR not only improves the transfer rate, but also reduces the number of copies.
【学位授予单位】：合肥工业大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TN929.5;TP393.09

【相似文献】