[go: up one dir, main page]

CN106230973B - A method of file sharing based on social network - Google Patents

A method of file sharing based on social network Download PDF

Info

Publication number
CN106230973B
CN106230973B CN201610763424.2A CN201610763424A CN106230973B CN 106230973 B CN106230973 B CN 106230973B CN 201610763424 A CN201610763424 A CN 201610763424A CN 106230973 B CN106230973 B CN 106230973B
Authority
CN
China
Prior art keywords
user
file
users
social
base station
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201610763424.2A
Other languages
Chinese (zh)
Other versions
CN106230973A (en
Inventor
王磊
周亮
王涛
陈鸣锴
刘嘉铭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tianjin Huawei Education Technology Co.,Ltd.
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201610763424.2A priority Critical patent/CN106230973B/en
Publication of CN106230973A publication Critical patent/CN106230973A/en
Application granted granted Critical
Publication of CN106230973B publication Critical patent/CN106230973B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • G06Q10/40—
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/52—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail for supporting social networking services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/14—Session management
    • H04L67/141—Setup of application sessions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a kind of file sharing methods based on social networks.This method is to provide the new method of file-sharing and distribution between a kind of user based on social networks under the D2D communication environment of base station control.User according to the demand of user, is divided into several interim groups, and judge central user by the social degree of user by base station in this method.In the case where caching in systems without demand file, file is sent to central user by radio honeycomb communication link first by base station, which shares to the user for having social networks in group by D2D communication file.And with the central user do not have social networks user can from base station or obtained this document other users from obtain this document, to realize file-sharing.Furthermore D2D user is also solved the problem of the same time being only capable of processing (receiving or sending) request.The overall performance that the present invention can substantially reduce propagation delay time, mitigate load of base station, optimize cellular communication system.

Description

A kind of file sharing method based on social networks
Technical field
The invention belongs to the device-to-device technical field in the communication technology, in particular to a kind of text based on social networks Part distribution and sharing method.
Background technique
With the fast development of science and technology, social networks has become the pith of human lives, is increasingly becoming message biography Pass the main body with information carrying.The jumping characteristic progress of mobile communication technology makes the social mode of people from traditional social network sites It is transitioned into mobile field rapidly, formation, evolution, the development of this mobile social networking provide more just for people's lives Prompt information interchange, just towards " reducing substance time cost, provide high-quality and high-efficiency useful information ", this direction is advanced, and is influenced With the non-same common music of effect.And deep variation is also just occurring for human relationship at the same time.
Mobile social networking comprehensively considers the characteristics of wireless communication and social science, and extensive concern has been obtained at present With research.Based on this phenomenon, the problem of a nature is that " can the Social behaviors of user assist D2D (Device-to- Device, device-to-device) communicate the performance for improving wireless system ", answer is affirmative.It is well known that user is always at In mobile social networking, each user always inevitably occurs social to contact, exchange bulk information, and this nothing with others Place not social networks, such as colleague, circle of friends, with certain stability, decidability and long-term sustainable.This Outside, the daily Move Mode of user (such as job site, entertainment venues, dwelling) has periodically, the social pass then generated System has certain rule that can follow, therefore each user can form a stable mobile social networking structure.Although current base It is introduced into D2D communication in the D2D Communication Studies of social networks also in initial stage, but by social networks, to wireless communication Can all there be immense value in terms of the whole design of the overall efficiency and future D2D communication system of system.
With the development of wireless cellular network, mobile device is in addition to obtaining data using base station, also by between each user Cooperation carry out shared data, therefore future D2D multimedia content distribution system will become the research hotspot of wireless communication.Based on society It hands over the file-sharing mechanism of network to show the key factor of advantage in wireless communications as D2D technology, has become numerous The research hotspot of scholar.User due to holding mobile communication equipment forms a metastable social network structure, This virtual social network is introduced into wireless communication field carry out file-sharing can make entire wireless network more added with Effect.
In addition it is necessary to the safety for the system of considering.The degree of belief of node is influenced by many factors, including user asks Ask the success or failure probability of response message, the mobility of user, successful probability of failure of data transmission etc., while degree of belief Size affect these factors again.And current social networks file sharing method, there is safety is low, it is difficult to tracking and The defects of control.Therefore the degree of belief in social networks in view of each user is most important.
Summary of the invention
The purpose of the present invention is in the environment that D2D is communicated, propose it is a kind of Cellular Networks assistance under based on social networks File Sharing Technique, which is effectively reducing system overall delay, negative mitigating base station while improving file transmission efficiency Carrying aspect also has very big advantage.
To solve this technical problem, the technical solution adopted by the present invention is that proposing that a kind of file based on social networks is total Method is enjoyed, is specifically comprised the following steps:
Step 1: user grouping, server establish user and collect u={ U1,U2,U3,···,UNAnd user's demand file collection F={ F1,F2,F3,···,FM}；
Step 2: establishing social network diagram, base station is divided into several interim groups according to user interest, by user, and feeds back to Group member establishes regular network；
Step 3: determining central user；
Step 4: judging whether D2D link can be established between user；
Step 5: link selection.
Further, in step 2, adjacency matrix A is first generated according to the regular network, then regular network is connected It connects, generates small-world network, analyze adjacency matrix A, to judge whether to have between node i and node j connection, and generate a nothing Weigh undirected social network diagram G and social networks matrix TM×N。
Particularly, above-mentioned be attached to regular network is referred to and is weighed at random with random reconnection probability to regular network Even.
In step 3, determine that central user is the communication degree D that each user in interim group is calculated by communication degree algorithm (Ui), then choose wherein central user of the maximum user of communication degree as this group.
Above-mentioned communication degree algorithm is preferably Dul.
Judge that the process that D2D link whether can be established between user is first determined whether in the group with the presence or absence of demand in step 4 File, and if so, file is transferred to central user by cellular communications channel by base station first, organize in other users again with It is shared, and the average degree of belief of the user node in social networks is then calculated by degree of belief algorithm, if being less than secure threshold, It then can establish D2D link between user, otherwise can only select cellular communication link.
In step 5, utility function value when link selection between elder generation's computing terminal user node or base station is carried out, is then divided The social network diagram that user is constituted is analysed, the company side for meeting certain restrictions condition is formed into set ψ, is then marked in set ψ Company side with maximum utility functional value, according to the node at side both ends to selecting communication pattern.
Further, above-mentioned restrictive condition is that OIOO (One In One Out) is single-entry single-out.
Compared with prior art, the invention has the following beneficial effects:
1. the present invention can effectively improve the efficiency of file-sharing between user, the time delay of file-sharing is effectively reduced；
2. the present invention can mitigate the downloading burden of base station, have while guaranteeing file-sharing safety and transmission quality Effect saves frequency spectrum resource, optimizes the overall performance of cellular communication system.
3. solving the problems, such as that D2D user is only capable of request of processing (receiving or sending) in the same time.
Detailed description of the invention
Fig. 1 is system framework figure of the invention.
Fig. 2 is up-to-date policy map of the invention.
Fig. 3 is system flow chart of the invention.
Fig. 4 is under D2D communication environment, and 20 users are in the border circular areas that radius is 1000 meters, threshold value S0To user The influence of average degree.
Fig. 5 is under D2D communication environment, and when number of users is 100, system overall delay performance compares figure.
Fig. 6 be under D2D communication environment, number of users be 100 when, load of base station rate of descent figure.
Specific embodiment
The present invention is described in further detail with reference to the accompanying drawings of the specification.
The present invention is adopted the technical scheme that solve this technical problem: emulating user's structure using small-world network model At social networks.Then, user is divided into several interim groups by the demand according to user to file, in each group, The social maximum central user of degree receives file destination first.Finally according to social networks situation between user, with the D2D communication technology It is shared with other users.Including user node degree of belief algorithm Suc, group member's social activity degree algorithm Dul and time delay are calculated Method Del.Be introduced into file-sharing Mechanism Study simultaneously commonly for the colored side labeling algorithm of the greediness of time-delay calculation to It is proposed that time delay algorithm be compared.
User node degree of belief algorithm Suc: assuming that user node UjTrust user node Ui, work as UjIn a network credible When spending higher, then UiConfidence level in a network will not be poor.So degree of belief of the user node in social networks The weighted average that value can trust by other nodes it angle value obtains, specific formula is as follows:
Group member's social activity degree algorithm Dul: user UiSocial degree indicate the summation of its in-degree and out-degree, it may be assumed that
Wherein N is total user node number, works as UiWith node UkBetween when there is social link, a (Ui,Uk)=1, anyway It is then 0.
Greedy colour side labeling algorithm: base station to the propagation delay time between user is considered as being set as t for a constant0, Propagation delay time in same group between D2D user is also considered as being set as t for constant1.Assuming that all cellular link numbers are Lcj, all D2D number of links are Ldj, therefore the available time delay for transmitting file in greedy colored side labeling algorithm are as follows:
The overall delay for the D2D file-sharing mechanism based on social networks that the present invention is studied are as follows:
Wherein LcjAnd LdjThere is no the cellular link number and D2D chain of the other users of social networks with central user respectively Number.
Based on the above theory, we can provide file distribution based on social relations and secret sharing, and to file Propagation delay time is calculated.The present invention is divided into following steps:
Step 1: establishing grouping
(1) server establishes user's collection u={ U1,U2,U3,···,UNAnd user demand file collection F={ F1,F2, F3,···,FM, wherein N indicates the number of user, and M indicates the number of file；
(2) server sends information to base station, and base station is broadcast to all users after receiving information.N number of user asks respectively Respective interested content in M file is sought, and solicited message is sent back to base station；
(3) several interim groups are established according to the interest of user in base station, and group's relationship of formation are fed back to each small All members in group.
Step 2: establishing small-world network model
(1) regular network is established, adjacency matrix A is obtained；
(2) random reconnection is carried out to regular network with random reconnection probability, generates small-world network；
(3) adjacency matrix A is analyzed, to judge whether there is connection between node i and node j；
(4) it generates one and haves no right undirected social network diagram G and social networks matrix TM×N。
Step 3: determine central user:
(1) social activity degree algorithm Dul is used, the social degree of each user in calculating group；
(2) central user of the highest user of social activity degree as group is selected；
(3) file is transferred to central user by cellular communication by base station first；
(4) small group member is based on social networks again and communicates shared this document by D2D.
Step 4: terminal node link selection:
(1) to the degree of belief S (U of each user node in social networksi) initial value is assigned, it is worth range between [0,1]；
(2) degree of belief is averaging to each node according to degree of belief algorithm Suc；
(3) judge whether degree of belief difference total in group is more than accuracy value；
(4) the convergence result of degree of belief is acquired；
(5) judge whether there can be D2D link between user by degree of belief and threshold value comparison；
(6) the utility function value between computing terminal user node (including base station)；
(7) social network diagram that analysis user is constituted, will meet the company side of OIOO (One In One Out) restrictive condition Set ψ is formed, the company side in set ψ with maximum utility functional value is then marked, according to the node at even side both ends to next Select communication pattern.
Now implementation method is shared to file distributing to be further described.
As depicted in figs. 1 and 2, server initially sets up user's collection u={ U1,U2,U3,···,UNAnd user's request text Part collection F={ F1,F2,F3,···,FM, then, user is divided into several interim groups according to user interest by base station (eNB) And feed back to personnel in group.Pass through the social central user U being worth in selected groupi, demand file is sent to center by subsequent base station User.Group member passes through the acquisition modes of utility function select file again.
As shown in figure 3, specific step is as follows for file-sharing implementation method:
1. user grouping
(1) server establishes user's collection u={ U1,U2,U3,···,UNAnd user demand file collection F={ F1,F2, F3,···,FM, wherein N indicates the number of user, and M indicates the number of file；
(2) server sends information to base station, and base station is broadcast to all users after receiving information.N number of user asks respectively Respective interested content in M file is sought, and solicited message is sent back to base station.Assuming that solicited status matrix RN×M= (rn,m) user defines r to the interest of file in expression systemn,m=1 indicates user UNTo file FMIt is interested, conversely, rn,m= 0；
(3) several interim groups are established according to the interest of user in base station, and group's relationship of formation are fed back to each small All members in group.If group's collection is combined into g={ g1,g2,g3,···,gj, gjIt indicates to file FjThere is demand User set.Obvious small set meet relationship g≤| M |, and the number of users in each group meets gj≤N.Due to every A user can request multiple files, so allowing to be overlapped between group, i.e. gi∩gj≠ o is set up.
2. establishing social network diagram
(1) regular network is established, adjacency matrix A is obtained；
(2) random reconnection is carried out to regular network with random reconnection probability, generates small-world network；
(3) adjacency matrix A is analyzed, to judge whether there is connection between node i and node j；
(4) it generates one and haves no right undirected social network diagram G and social networks matrix TM×N。
3. determining central user
(1) after being grouped, base station needs to determine central user in grouping；
(2) since the social status of each user is different, select which user as the central user of group to entire nothing Gauze network has a major impact.Here user in social highest group of value is chosen, can achieve highest sharing efficiency；
(3) user U is calculatediSocial degree, it indicate user's in-degree and out-degree summation, it may be assumed that
Wherein N is total user node number, works as UiWith node UkBetween when there is social link, a (Ui,Uk)=1.In order to Ensure the consistency and comparability of result, present invention assumes that social networks are not present with oneself in user.Definition makes CD(Ui) value is most Big node UiFor central user.
In each group, if the file of demand is not present in the group, base station first transmits file by cellular communication To central user, each group is based on social networks again and communicates shared this document by D2D.
4. whether between judging user D2D link can be established
(1) to the degree of belief s (U of each user node in social networksi) initial value is assigned, it is worth range between [0,1]；
(2) each user node is asked according to the following formula
(3) it setsFor low precision, judgementValue withSize, ifStep 4) is then gone to, is otherwise enabledStep (2) is gone to continue to calculate；
(4) convergence result is acquired；
(5) there are D2D links must satisfy two conditions between user: firstly, there are social networks；Secondly, degree of belief It must be in the range of safety.Assuming that the threshold value of degree of belief is S0, then the social link metric S being made of 0-1 element can be obtainedM×N Meet condition s (Ui) > S0.When meeting two above condition, D2D link can establish between user, otherwise can only use Cellular Networks Middle traditional communication link.
5. link selection
(1) the utility function value between computing terminal user node (including base station):
Wherein:
Indicate that user i has been received that file m,And if only if Γi,m=1 and user j is or just Receiving file m.When user i is base station or its transmitter free time, haveEqually, when the receiver of user j is not occupied Used time,
(2) social network diagram that analysis user is constituted, will meet the company side of OIOO (One In One Out) restrictive condition Set ψ is formed, the company side in set ψ with maximum utility functional value is then marked, according to the node at even side both ends to next Selection communication pattern (if two nodes are user, selects D2D communication pattern；If selecting cellular communication mould containing base station Formula), the process is recycled until set ψ is sky.
6. time-delay analysis
Assuming that all cellular link numbers are Lcj, all D2D number of links are Ldj, therefore calculated in greedy colored side label The time delay of available transmission file in method are as follows:
By previously described it is found that there is the maximum central user of social activity degree in a social groups, it is of the invention in assume The social degree of central user is Dj, then having the user of social networks and degree of belief in threshold range can be with central user Directly by central user by D2D link sharing file with meet demand, therefore the present invention studied based on social networks The overall delay of D2D file-sharing mechanism are as follows:
Wherein LcjAnd LdjThere is no the cellular link number and D2D chain of the other users of social networks with central user respectively The join algorithm of number, link is established by greedy colored side labeling algorithm.Assuming that central user is first of file in the group A recipient, due to social networks and trusting angle value user in the reasonable scope with it and can directly be obtained from central user File is obtained, then theoretically, overall delay is reduced, i.e. tsum,D2DLess than tgre。
The following are simulation results
Fig. 4 illustrates that under given D2D communication environment, 20 users are in the border circular areas that radius is 1000 meters, threshold value S0Influence to user's average degree.As seen from the figure, work as S0=0 i.e. trust threshold is when being zero, and corresponding maximum user average degree is about etc. In 5.25, with the increase of threshold value, the average degree of user is reduced.As can be seen from Figure, curve has downward trend, i.e. S0Value Bigger, trust requirement is harsher, and user's average degree is smaller.
Fig. 5 illustrates under the file-sharing mechanism and greedy colored side labeling algorithm based on social networks, overall delay with File number m variation and the case where change, m is the file total number that user requests in file set F here.By can be in figure Find out, the overall delay of the mentioned method of the present invention is smaller than the time delay in greedy colored side labeling algorithm, is consistent with theory analysis.This Outside, increasing with quantity of documents, the difference of the numerical value of two curves is also increasing in figure.
Fig. 6 illustrates respectively under the file-sharing mechanism algorithm and greedy colored side labeling algorithm based on social networks, The case where load of base station, that is, when meeting request of all users to file, the number of files of base station in response.It can be seen from the figure that It is not identical by the quantity of documents of base station in response when meeting the identical demand condition of user.As m=20, greedy colour side mark The number of files for remembering base station in response in algorithm is about 560, and is only about 210 in algorithm proposed by the present invention.This can illustrate, select User with maximum social activity degree can effectively mitigate the load of base station as central user.
The foregoing is merely a specific embodiments of the invention, are not intended to limit the invention, all in essence of the invention Within mind and principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.

Claims (6)

1.一种基于社交网络的文件共享方法，其特征在于，所述方法包括如下步骤：1. a file sharing method based on social network, is characterized in that, described method comprises the steps: 步骤1：用户分组，服务器建立用户集u＝{U1,U2,U3,…,UN}和用户请求文件集F＝{F1,F2,F3,…,FM}；Step 1: User grouping, the server establishes user set u={U 1 ,U 2 ,U 3 ,...,U N } and user request file set F={F 1 ,F 2 , F 3 ,...,FM }; 用户集中的用户请求文件集中的文件，其中N表示用户的个数M表示文件的个数，在该系统中，首先，服务器发送信息给基站，基站接收到信息后广播给所有用户，N个用户分别请求M个文件中各自感兴趣的内容，并将请求信息发送回给基站，假设请求状态矩阵RN×M＝(rn,m)表示系统中用户对文件的兴趣，定义rn,m＝1表示用户Un对文件Fm感兴趣，反之，rn,m＝0，基站根据用户的兴趣建立若干临时小组，并把形成的小组关系反馈给每个小组中的所有成员，设小组集合为 表示对文件Fj有需求的用户集合，显然小组数量满足关系且每个小组中的用户数量满足由于每个用户可以请求多个文件，所以小组之间允许重叠，即成立；步骤2：建立社交网络图，基站根据用户兴趣，将用户分为若干临时小组，并反馈给组内成员，首先建立规则网络，得到邻接矩阵A；以随机重连概率p＝0.01对规则网络进行随机重连，生成小世界网络；分析邻接矩阵A，若A(i,j)＝A(j,i)＝1，则表示节点i和节点j之间有连接；因此可以生成一个无权无向社交网络图G，将该图的邻接矩阵A定义为由0-1元素组成的社交关系矩阵TN×N，1表示对应的用户之间具有社交关系，即可以通过D2D链路从其他用户处得到其感兴趣的文件，0则相反；user set User request fileset in In this system, first, the server sends information to the base station, and the base station broadcasts the information to all users after receiving the information, and N users request M files respectively. The content of their respective interests, and send the request information back to the base station. Suppose the request state matrix R N×M =(rn ,m ) represents the user’s interest in the file in the system, and the definition rn ,m =1 represents the user U n Interested in the file F m , otherwise, r n,m = 0, the base station establishes several temporary groups according to the user's interest, and feeds back the formed group relationship to all members in each group, and the group set is set as Represents the set of users who have demand for file F j , obviously the number of groups satisfies the relationship and the number of users in each group is sufficient Since each user can request multiple files, overlapping between groups is allowed, i.e. Established; Step 2: Establish a social network graph, the base station divides users into several temporary groups according to user interests, and feeds them back to the members of the group, first establishes a rule network, and obtains an adjacency matrix A; with random reconnection probability p=0.01 pair rules The network is randomly reconnected to generate a small-world network; the adjacency matrix A is analyzed, if A(i,j)=A(j,i)=1, it means that there is a connection between node i and node j; therefore, a non- A weighted undirected social network graph G, and the adjacency matrix A of the graph is defined as a social relationship matrix T N×N composed of 0-1 elements, 1 indicates that there is a social relationship between the corresponding users, that is, through the D2D link from Other users get the files they are interested in, 0 is the opposite; 步骤3：确定中央用户；Step 3: Determine the central user; 由于每个用户的社交状态不同，选择哪个用户作为小组的中央用户对整个无线网络有重要影响，用社交度的概念来描述用户的社交状态，用户Ui的社交度表示其入度和出度的总和，为了确保结果的一致性和可比较性，假设用户与自己不存在社交关系，定义使CD(Ui)值最大的节点Ui为中央用户，中央用户在基于社交网络的D2D传输中起着重要的作用，在系统中没有需求文件缓存的情况下，基站首先把文件通过无线蜂窝通信链路发送给中央用户，该中央用户把文件通过D2D通信共享给组内有社交关系的用户，而与该中央用户没有社交关系的用户可以从基站或者已获得该文件的其他用户处得到该文件；如果系统中已经有该文件的缓存，则用户可以直接从基站或已获得文件的用户处得到需求文件，这个过程要考虑在蜂窝网动态网络上实现D2D内容高效存取；Since the social status of each user is different, which user is selected as the central user of the group has an important impact on the entire wireless network. The concept of social degree is used to describe the social status of users, and the social degree of user U i represents its in-degree and out-degree In order to ensure the consistency and comparability of the results, it is assumed that the user does not have a social relationship with himself, and the node U i that maximizes the value of CD (U i ) is defined as the central user, and the central user is used in social network-based D2D transmission When there is no need for file caching in the system, the base station first sends the file to the central user through the wireless cellular communication link, and the central user shares the file to the users with social relations in the group through D2D communication , and users who have no social relationship with the central user can obtain the file from the base station or other users who have obtained the file; if there is already a cache of the file in the system, the user can directly obtain the file from the base station or the user who has obtained the file. To obtain the requirement file, this process should consider the efficient access of D2D content on the dynamic network of the cellular network; 步骤4：判断用户间是否能建立D2D链路；Step 4: Determine whether a D2D link can be established between users; 考虑到系统的安全性，只有满足一定信任要求的用户，才有可能建立D2D链路共享文件信息，因此引入用户的信任度作为影响系统性能的重要因素，不同节点在网络中的可信度不同，节点之间对彼此的可信度也不相同，那么，由步骤2中表征社交网络的无权无向网络图G就变成了有权有向网络图G'，其权值即代表了在社交网络中用户彼此之间的直接信任度值eji和eij，假设用户节点Uj信任用户节点Ui，当Uj在网络中的可信度较高时，那么Ui在网络中的可信度也不会差，所以一个用户节点在社交网络中的信任度值可以通过其他节点对其信任度值的加权平均得到，由于是基于蜂窝网络辅助下的系统模型，因此基站控制所有用户的状态并保存它们的信息，如用户ID、邻居用户发现、请求和响应文件的成功失败记录以及其他用户的信誉评估等，因此用户的信任度可以从基站反馈的信息中得到，在不排除恶意节点的情况下，其他所有用户对某一用户的直接信任度值应趋近一个值，即eji(j＝1,2，...,N且j≠i)是介于0-1之间的某个相近的值，由以上分析可得，用户之间若存在D2D链路必须满足两个条件：(1)存在社交关系，(2)信任度必须在安全的范围内，假设信任度的阈值为S0，则可得由0-1元素组成的社交链路矩阵SN×N满足条件s(Ui)≥S0；Considering the security of the system, only users who meet certain trust requirements can establish a D2D link to share file information. Therefore, the user's trust degree is introduced as an important factor affecting the system performance. The trust degree of different nodes in the network is different. , the trustworthiness of the nodes to each other is also different, then, the weightless and undirected network graph G representing the social network in step 2 becomes a weighted directed network graph G', and its weight represents The direct trust values e ji and e ij between users in the social network, assuming that the user node U j trusts the user node U i , when U j has a high reliability in the network, then U i is in the network The credibility of the network will not be bad, so the trust value of a user node in the social network can be obtained by the weighted average of its trust value of other nodes. Since it is based on the system model assisted by the cellular network, the base station controls all The status of users and save their information, such as user ID, neighbor user discovery, success and failure records of request and response files, and reputation evaluation of other users, etc., so the user's trust degree can be obtained from the information fed back by the base station. In the case of a malicious node, the direct trust value of all other users for a user should approach a value, that is, e ji (j=1,2,...,N and j≠i) is between 0-1 From the above analysis, it can be obtained that if there is a D2D link between users, two conditions must be met: (1) there is a social relationship, (2) the trust degree must be within a safe range, assuming trust The threshold of degree is S 0 , then the social link matrix S N×N composed of 0-1 elements can be obtained to satisfy the condition s(U i )≥S 0 ; 步骤5：链路选择，为了提高蜂窝通信系统的整体性能，在每个小组中，若该组内不存在需求的文件，则基站通过蜂窝通信把文件首先传输给中央用户，每个小组再基于社交关系通过D2D通信共享该文件；若小组内已存在需求的文件，则通过某种策略，选择从基站或者已有文件缓存的用户处获得文件，由于仅考虑小规模通信模型，通信半径较短，因此基站到用户之间的传输时延可以看作为一个常数设为t0，同样小组中D2D用户之间的传输时延也可以看作为常数设为t1，当请求状态矩阵R的j列的某些元素为1时，则对应的用户被划分到小组中，该小组中用户的总数量为引入贪婪彩色边标记算法，该算法通过计算终端用户节点之间的效用函数值来决定选择蜂窝通信链路还是选择D2D链路进行文件的共享传输，由于用户可能请求多个文件，则每个D2D用户必须在同一时间内发送或接受多个文件，为了避免自我干扰，通常假设D2D用户在同一时间只能处理一个文件，即用户Un在接收一个文件时，其不能响应其他的请求。Step 5: Link selection. In order to improve the overall performance of the cellular communication system, in each group, if there is no required file in the group, the base station first transmits the file to the central user through cellular The social relationship shares the file through D2D communication; if the required file already exists in the group, a certain strategy is used to choose to obtain the file from the base station or the user who has the file cache. Since only the small-scale communication model is considered, the communication radius is short. , so the transmission delay between the base station and the user can be regarded as a constant set to t 0 , and the transmission delay between D2D users in the same group can also be regarded as a constant set to t 1 , when the j column of the state matrix R is requested When some elements of is 1, the corresponding user is divided into In a group, the total number of users in the group is A greedy color edge labeling algorithm is introduced, which decides whether to choose a cellular communication link or a D2D link for file sharing by calculating the utility function value between end-user nodes. Since users may request multiple files, each D2D Users must send or receive multiple files at the same time. In order to avoid self-interference, it is usually assumed that D2D users can only process one file at a time, that is, when user Un receives one file, it cannot respond to other requests. 2.根据权利要求1所述的基于社交网络的文件共享方法，其特征在于步骤3中，确定中央用户是通过交际度算法计算出临时小组内每个用户的交际度D(Ui)，然后选取其中交际度最大的用户作为本组的中央用户。2. the file sharing method based on social network according to claim 1 is characterized in that in step 3, it is determined that the central user is to calculate the degree of communication D (U i ) of each user in the temporary group by the degree of communication algorithm, and then The user with the highest degree of communication is selected as the central user of this group. 3.根据权利要求2所述的基于社交网络的文件共享方法，其特征在于所述交际度算法为Dul。3 . The social network-based file sharing method according to claim 2 , wherein the communication degree algorithm is Dul. 4 . 4.根据权利要求1所述的基于社交网络的文件共享方法，其特征在于步骤4中判断用户间是否能建立D2D链路的过程是首先判断该组内是否存在需求文件，如果存在则基站通过蜂窝通信信道把文件首先传输给中央用户，组内其他用户再与其共享，然后通过信任度算法计算社交网络中的用户节点的平均信任度，若小于安全阈值，则用户间可以建立D2D链路，否则只能选择蜂窝通信链路。4. the file sharing method based on social network according to claim 1 is characterized in that in step 4, the process of judging whether the D2D link can be established between users is to first judge whether there is a demand file in this group, if there is then the base station passes through. The cellular communication channel first transmits the file to the central user, and then shares it with other users in the group, and then calculates the average trust degree of the user nodes in the social network through the trust degree algorithm. Otherwise only the cellular communication link can be selected. 5.根据权利要求1所述的基于社交网络的文件共享方法，其特征在于步骤5中，进行链路选择时先计算终端用户节点或基站之间的效用函数值，然后分析用户构成的社交网络图，将满足一定限制条件的连边组成集合ψ，然后标记出在集合ψ中具有最大效用函数值的连边，根据边两端的节点对来选择通信模式。5. The file sharing method based on social network according to claim 1, is characterized in that in step 5, when carrying out link selection, first calculate the utility function value between end user nodes or base stations, then analyze the social network formed by users In the graph, the connected edges that meet certain constraints are formed into a set ψ, and then the connected edges with the largest utility function value in the set ψ are marked, and the communication mode is selected according to the node pairs at both ends of the edge. 6.根据权利要求5所述的基于社交网络的文件共享方法，其特征在于所述限制条件为单进单出。6 . The social network-based file sharing method according to claim 5 , wherein the restriction condition is single-in and single-out. 7 .
CN201610763424.2A 2016-08-30 2016-08-30 A method of file sharing based on social network Active CN106230973B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610763424.2A CN106230973B (en) 2016-08-30 2016-08-30 A method of file sharing based on social network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610763424.2A CN106230973B (en) 2016-08-30 2016-08-30 A method of file sharing based on social network

Publications (2)

Publication Number Publication Date
CN106230973A CN106230973A (en) 2016-12-14
CN106230973B true CN106230973B (en) 2019-05-21

Family

ID=58071808

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610763424.2A Active CN106230973B (en) 2016-08-30 2016-08-30 A method of file sharing based on social network

Country Status (1)

Country Link
CN (1) CN106230973B (en)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107484105A (en) * 2017-07-03 2017-12-15 南京理工大学 A method of file many-to-many distribution based on social network
CN109756908B (en) * 2017-11-01 2021-10-15 上海交通大学 Optimization method/system, storage medium and device for wireless network caching strategy
CN107979846A (en) * 2017-12-29 2018-05-01 中国人民解放军陆军工程大学 Overlapping alliance game model under situation perception and space self-adaptive algorithm
CN108595475B (en) * 2018-03-12 2022-03-04 电子科技大学 A Cache Node Selection Method in Mobile Social Networks
CN108616845B (en) * 2018-03-30 2021-10-26 佛山市顺德区中山大学研究院 D2D grouping multi-target caching method based on social content and system and device thereof
US10846268B2 (en) 2018-06-08 2020-11-24 Saphyre, Inc. and Gabino M. Roche Jr. Technologies for file sharing
USD873289S1 (en) 2018-06-08 2020-01-21 Saphyre, Inc. Display screen or portion thereof with graphical user interface
CN108810169B (en) * 2018-07-18 2021-05-11 北京隆普智能科技有限公司 Content caching method based on social relationship
CN109803245B (en) * 2019-03-12 2022-01-28 南京邮电大学 Cache node selection method based on D2D communication
CN110312212A (en) * 2019-08-01 2019-10-08 郑州师范学院 A D2D packet communication method, system and related components
CN111866816B (en) * 2020-06-23 2024-04-05 广东以诺通讯有限公司 D2D terminal mode communication selection method under 5G hybrid networking
CN113395263B (en) * 2021-05-26 2022-07-26 西南科技大学 Trust calculation method for sharing video in online social network

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103092459A (en) * 2011-11-07 2013-05-08 吉菲斯股份有限公司 Computer implemented method of displaying contact nodes in online social network, computer systems and computer readable medium thereof
CN103338497A (en) * 2013-06-14 2013-10-02 北京交通大学 Autonomous equipment discovering method in D2D communication system
CN103595750A (en) * 2012-08-17 2014-02-19 华为技术有限公司 Method, terminal and network side for peer-to-pear communication
CN103944975A (en) * 2014-04-03 2014-07-23 武汉大学 File safe sharing method based on mobile social network supporting user revocation
CN104113400A (en) * 2013-04-18 2014-10-22 上海交通大学 Hybrid automatic retransmission method and frequency scheduling method in dual-path D2D system
CN104159221A (en) * 2013-05-13 2014-11-19 中兴通讯股份有限公司 Public security communication processing method and system
CN104410684A (en) * 2009-04-02 2015-03-11 高通股份有限公司 Method and apparatus for establishing a social network through file transfers
CN105117422A (en) * 2015-07-30 2015-12-02 中国传媒大学 Intelligent social network recommender system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10623938B2 (en) * 2012-09-06 2020-04-14 Qualcomm Incorporated Methods and apparatus for paging based peer discovery

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104410684A (en) * 2009-04-02 2015-03-11 高通股份有限公司 Method and apparatus for establishing a social network through file transfers
CN103092459A (en) * 2011-11-07 2013-05-08 吉菲斯股份有限公司 Computer implemented method of displaying contact nodes in online social network, computer systems and computer readable medium thereof
CN103595750A (en) * 2012-08-17 2014-02-19 华为技术有限公司 Method, terminal and network side for peer-to-pear communication
CN104113400A (en) * 2013-04-18 2014-10-22 上海交通大学 Hybrid automatic retransmission method and frequency scheduling method in dual-path D2D system
CN104159221A (en) * 2013-05-13 2014-11-19 中兴通讯股份有限公司 Public security communication processing method and system
CN103338497A (en) * 2013-06-14 2013-10-02 北京交通大学 Autonomous equipment discovering method in D2D communication system
CN103944975A (en) * 2014-04-03 2014-07-23 武汉大学 File safe sharing method based on mobile social network supporting user revocation
CN105117422A (en) * 2015-07-30 2015-12-02 中国传媒大学 Intelligent social network recommender system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"D2D中基于社交关系的按需用户发现策略";王磊、高露露、蒋国平、郑宝玉;《信号处理》;20150930;第31卷(第9期);全文

Also Published As

Publication number Publication date
CN106230973A (en) 2016-12-14

Similar Documents

Publication Publication Date Title
CN106230973B (en) A method of file sharing based on social network
Sharma et al. Neural-blockchain-based ultrareliable caching for edge-enabled UAV networks
Luo et al. Symbiotic blockchain consensus: Cognitive backscatter communications-enabled wireless blockchain consensus
Meng et al. Cooperative device-to-device communications: Social networking perspectives
CN110337092B (en) Low-power-consumption relay selection method based on social trust model
Saxena et al. Exploiting social relationships for trustworthy D2D relay in 5G cellular networks
Luo et al. Advanced data delivery strategy based on multiperceived community with IoT in social complex networks
Wang et al. Sociality‐aware resource allocation for device‐to‐device communications in cellular networks
Kim et al. Quick block transport system for scalable hyperledger fabric blockchain over D2D-assisted 5G networks
Jameel et al. Wireless social networks: A survey of recent advances, applications and challenges
Zhao et al. Survey on social-aware data dissemination over mobile wireless networks
Zhang et al. A rate-and-trust-based node selection model for block transmission in blockchain networks
Luo et al. Wireless blockchain meets 6G: The future trustworthy and ubiquitous connectivity
Mavromoustakis Mitigating file‐sharing misbehavior with movement synchronization to increase end‐to‐end availability for delay sensitive streams in vehicular P2P devices
Yang et al. Social interaction assisted resource sharing scheme for device-to-device communication towards green internet of things
Barik et al. Denial-of-service attack mitigation in multi-hop 5G D2D wireless communication networks employing double auction game
Qian et al. Relay selection algorithm based on social network combined with Q‐learning for vehicle D2D communication
Ghosh et al. DewGame: D2D communication enabled dew computing for 5G IoT using coalition formation game: S. Ghosh, D. Ghosh
Rajabi et al. Impact of connecting to the nth nearest node in dedicated device‐to‐device communications
Khan et al. [Retracted] 5G‐EECC: Energy‐Efficient Collaboration‐Based Content Sharing Strategy in Device‐to‐Device Communication
Wang et al. Energy efficiency for data offloading in D2D cooperative caching networks
CN104426874A (en) Authentication method and authentication device applied to ubiquitous terminal network
Feng et al. Energy‐efficient network cooperation joint resource configuration in multi‐RAT heterogeneous cognitive radio networks
Zhang et al. Exploring the dynamical behavior of information diffusion in D2D communication environment
Qiao Mobile data traffic offloading through opportunistic vehicular communications

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20161214

Assignee: NANJING NANYOU INSTITUTE OF INFORMATION TECHNOVATION Co.,Ltd.

Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS

Contract record no.: X2021980014141

Denomination of invention: A file sharing method based on social network

Granted publication date: 20190521

License type: Common License

Record date: 20211206

EC01 Cancellation of recordation of patent licensing contract
EC01 Cancellation of recordation of patent licensing contract

Assignee: NANJING NANYOU INSTITUTE OF INFORMATION TECHNOVATION Co.,Ltd.

Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS

Contract record no.: X2021980014141

Date of cancellation: 20231107

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20250514

Address after: 300000 Tianjin City Xiqing District Huayuan Industrial Zone Zi Yuan Road 6, Building D, Room 1016

Patentee after: Tianjin Huawei Education Technology Co.,Ltd.

Country or region after: China

Address before: 210003 Gulou District, Jiangsu, Nanjing new model road, No. 66

Patentee before: NANJING University OF POSTS AND TELECOMMUNICATIONS

Country or region before: China