CN106230973A - A kind of file sharing method based on social networks - Google Patents

A kind of file sharing method based on social networks Download PDF

Info

Publication number
CN106230973A
CN106230973A CN201610763424.2A CN201610763424A CN106230973A CN 106230973 A CN106230973 A CN 106230973A CN 201610763424 A CN201610763424 A CN 201610763424A CN 106230973 A CN106230973 A CN 106230973A
Authority
CN
China
Prior art keywords
user
social networks
file
base station
social
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.)
Granted
Application number
CN201610763424.2A
Other languages
Chinese (zh)
Other versions
CN106230973B (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.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/01—Social networking
    • 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)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computing Systems (AREA)
  • Business, Economics & Management (AREA)
  • Primary Health Care (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • General Health & Medical Sciences (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Health & Medical Sciences (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a kind of file sharing method based on social networks.The method is under the D2D communication environment that base station controls, it is provided that file-sharing and the new method of distribution between a kind of user based on social networks.In the method, base station is according to the demand of user, user is divided into some interim groups, and judges central user by the social degree of user.In the case of not having demand file caching in systems, first base station is sent to central user file by radio honeycomb communication link, and this central user has the user of social networks in file is shared to group by D2D communication.And do not have the user of social networks from base station or obtained and obtain this document at other users of this document, thus file-sharing can be realized with this central user.Additionally solve the problem that D2D user is only capable of processing (receive or a send) request in the same time.The present invention can be substantially reduced propagation delay time, alleviate load of base station, the overall performance of optimization 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 communication technology, particularly to a kind of literary composition based on social networks Part distribution and sharing method.
Background technology
Along with the fast development of science and technology, social networks has become as the pith of human lives, is increasingly becoming message and passes Pass and the main body of information carrying.The jumping characteristic progress of mobile communication technology makes the social mode of people from traditional social network sites Being transitioned into rapidly mobile field, the formation of this mobile social networking, the life of the people that develop, develop into provide more just Prompt communication for information, just advances towards " reducing material time cost, it is provided that high-quality and high-efficiency useful information " this direction, its impact With the non-same common music of effect.And meanwhile the most just there is deep change in human relationship.
Mobile social networking considers the feature of radio communication and social sciences, has been obtained at present paying close attention to widely With research.Based on this phenomenon, a natural problem is that " can the Social behaviors of user assist D2D (Device-to- Device, device-to-device) communicate and improve the performance of wireless system ", answer is affirmative.It is known that user is always at In mobile social networking, each user the most inevitably occurs social activity to contact, exchange bulk information, and this nothing with others Place not social networks, such as colleague, circle of friends etc., there is certain stability, decidability and long-term sustainable.This Outward, the daily Move Mode (such as job site, entertainment venues, dwelling etc.) of user has periodically, the social pass then produced System has certain rule to follow, and the most each user can form a stable mobile social networking structure.Although base at present In the D2D Communication Studies of social networks also in initial stage, but social networks is incorporated in D2D communication, to radio communication The overall efficiency of system and the global design aspect of following D2D communication system all can have immense value.
Along with the development of wireless cellular network, mobile device obtains data, between each user except utilizing base station Cooperation share data, therefore following D2D multimedia content distribution system will become the study hotspot of radio communication.Based on society The file-sharing mechanism handing over network represents the key factor of advantage in wireless communications as D2D technology, has become as numerous The study hotspot of scholar.A metastable social network structure is formed, therefore owing to holding the user of mobile communication equipment This virtual social network is incorporated into wireless communication field to carry out file-sharing so that whole wireless network more added with Effect.
In addition it is necessary in view of the safety of system.The degree of belief of node is influenced by many factors, please including user Ask the successful probability of failure etc. that the success or failure probability of response message, the mobility of user, data are transmitted, degree of belief simultaneously Size affect again these factors.And current social networks file sharing method, there is safety low, it is difficult to follow the tracks of and The defects such as control.Therefore in social networks, consider that the degree of belief of each user is most important.
Summary of the invention
It is an object of the invention to D2D communication environment in, propose a kind of Cellular Networks assist under based on social networks File Sharing Technique, this technology is effectively reducing system overall delay, while improving file transmission efficiency, bears alleviating base station Load aspect also has the biggest advantage.
For solving this technical problem, the technical solution used in the present invention is to propose a kind of file based on social networks altogether Enjoy method, specifically include following steps:
Step 1: user grouping, server is set up user and is collected u={U1,U2,U3,···,UNAnd user's demand file collection F={F1,F2,F3,···,FM}；
Step 2: set up social network diagram, user, according to user interest, is divided into some interim groups, and feeds back to by base station Group member, sets up regular network；
Step 3: determine central user；
Step 4: judge whether can set up D2D link between user；
Step 5: link selection.
Further, in step 2, first generate adjacency matrix A according to described regular network, then regular network is carried out even Connect, generate small-world network, analyze adjacency matrix A, whether to have between decision node i and node j connection, and generate a nothing Weigh undirected social network diagram G and social networks matrix TM×N。
Especially, above-mentioned regular network be attached refers to reconnect probability at random regular network is weighed at random Even.
In step 3, determine central user be calculate interim group by communication degree algorithm in the communication degree D of each user (Ui), then choose the central user that the user that wherein communication degree is maximum organizes as this.
Above-mentioned communication degree algorithm is preferably Dul.
Step 4 judges whether can set up between user the process of D2D link be first determine whether this group in whether there is demand File, is first transferred to file central user if there is then base station by cellular communications channel, in group other users again with It is shared, then by the average degree of belief of the user node in degree of belief algorithm calculating social networks, if less than secure threshold, Then can set up D2D link between user, otherwise can only select cellular communication link.
In step 5, carry out the utility function value between elder generation's computing terminal user node or base station during link selection, then divide The social network diagram that analysis user is constituted, will meet the company limit composition set ψ of certain restrictive condition, then mark in set ψ There is the company limit of maximum utility functional value, according to the node at two ends, limit to selecting communication pattern.
Further, above-mentioned restrictive condition is that OIOO (One In One Out) singly enters singly to go out.
Compared with prior art, there is advantages that
1. the present invention can be effectively improved the efficiency of file-sharing between user, effectively reduces the time delay of file-sharing；
2. the present invention can alleviate the download burden of base station, have while ensureing file-sharing safety and transmission quality Effect saves frequency spectrum resource, optimizes the overall performance of cellular communication system.
3. solve the problem that D2D user is only capable of processing (receive or a send) request in the same time.
Accompanying drawing explanation
Fig. 1 is the system framework figure of the present invention.
Fig. 2 is the up-to-date policy map of the present invention.
Fig. 3 is the system flow chart of the present invention.
Fig. 4 is under D2D communication environment, 20 users in the border circular areas that radius is 1000 meters, threshold value S0To user The impact of average degree.
Fig. 5 is under D2D communication environment, when number of users is 100, and system overall delay Performance comparision figure.
Fig. 6 is under D2D communication environment, when number of users is 100, and load of base station rate of descent figure.
Detailed description of the invention
Below in conjunction with Figure of description, the present invention is described in further detail.
The present invention solves that this technical problem is adopted the technical scheme that: utilize small-world network model to emulate user's structure The social networks become.Subsequently, according to user's demand to file, user is divided into several interim groups, in each group, First the central user of social activity degree maximum receives file destination.Finally according to social networks situation between user, use D2D communication technology It is shared with other users.Including user node degree of belief algorithm Suc, group member social activity degree algorithm Dul, and time delay is calculated Method Del.Be simultaneously introduced in file-sharing Mechanism Study the conventional greedy colored limit labeling algorithm for time-delay calculation in order to It is proposed that time delay algorithm compare.
User node degree of belief algorithm Suc: assume user node UjTrust user node Ui, work as UjIn a network credible When spending higher, then UiCredibility in a network also will not be poor.So the degree of belief that user node is in social networks Its weighted average trusting angle value can be obtained by value by other nodes, and concrete formula is as follows:
s ( U i ) = 1 Σ U j ∈ U i ≠ j s ( U j ) Σ U j ∈ U i ≠ j s ( U j ) * e j i - - - ( 1 )
Group member's social activity degree algorithm Dul: user UiSocial degree represent the summation of its in-degree and out-degree, it may be assumed that
D ( U i ) = Σ k = 1 N a ( U i , U k ) , i ≠ k - - - ( 2 )
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 colored limit labeling algorithm: the propagation delay time between base station to user is considered as being that a constant is set to t0, In same group, propagation delay time between D2D user can also be seen constant as and is set to t1.Assume that all of cellular link number is Lcj, all of D2D number of links is Ldj, the time delay that therefore can obtain transmitting file in the labeling algorithm of greedy colored limit is:
t g r e = Σ j = 1 | G | t 0 × Lc j + t 1 × Ld j - - - ( 3 )
The overall delay of D2D file-sharing based on the social networks mechanism that the present invention is studied is:
t s u m , D 2 D = Σ j = 1 | G | t 0 × ( Lc j + 1 ) + t 1 × ( D j + Ld j ) - - - ( 4 )
Wherein LcjAnd LdjCellular link number and the D2D chain of other users of social networks is not respectively had with central user Way.
Based on above theoretical, we can provide file based on social networks distribution and secret sharing, and to file Propagation delay time calculates.The present invention is divided into following step:
Step 1: set up packet
(1) server is set up user and is collected u={U1,U2,U3,···,UNAnd user demand file collection F={F1,F2, F3,···,FM, wherein N represents the number of user, and M represents 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 respectively please Seek content interested in M file, and solicited message is sent back to base station；
(3) some interim groups are set up according to the interest of user in base station, and the group's relation formed is fed back to each little All members in group.
Step 2: set up small-world network model
(1) set up regular network, obtain adjacency matrix A；
(2) regular network is reconnected at random reconnecting probability at random, generate small-world network；
(3) analyze adjacency matrix A, whether have connection between decision node i and node j；
(4) generate one and have no right undirected social network diagram G and social networks matrix TM×N。
Step 3: determine central user:
(1) social activity degree algorithm Dul, the social degree of each user in calculating group are used；
(2) user that selection social activity degree is the highest is as the central user of group；
(3) first base station is transferred to file central user by cellular communication；
(4) little group member shares this document based on social networks by D2D communication again.
Step 4: terminal node link selection:
(1) the degree of belief S (U to each user node in social networksi) compose initial value, value scope is between [0,1]；
(2) according to degree of belief algorithm Suc, each node is averaging degree of belief；
(3) whether degree of belief difference total in judging group exceedes accuracy value；
(4) the convergence result of degree of belief is tried to achieve；
(5) by whether D2D link can be there is between degree of belief and threshold value multilevel iudge user；
(6) the utility function value between computing terminal user node (including base station)；
(7) analyze the social network diagram that user is constituted, the company limit of OIOO (One In One Out) restrictive condition will be met Composition set ψ, then marks the company limit in set ψ with maximum utility functional value, according to connecting the node at two ends, limit to coming Select communication pattern.
Now file distributing is shared implementation method to be further described.
As depicted in figs. 1 and 2, server initially sets up user and collects u={U1,U2,U3,···,UNAnd user ask literary composition Part collection F={F1,F2,F3,···,FM, subsequently, user is divided into some interim groups according to user interest by base station (eNB) And feed back to personnel in group.The central user U in group is selected by social activity valuei, demand file is sent to central authorities by base station subsequently User.Group member selects the acquisition mode of file again by utility function.
As it is shown on figure 3, the specifically comprising the following steps that of file-sharing implementation method
1. user grouping
(1) server is set up user and is collected u={U1,U2,U3,···,UNAnd user demand file collection F={F1,F2, F3,···,FM, wherein N represents the number of user, and M represents 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 respectively please Seek content interested in M file, and solicited message is sent back to base station.Assume solicited status matrix RN×M= (rn,m) user's interest to file in expression system, define rn,m=1 represents user UNTo file FMInterested, otherwise, rn,m= 0；
(3) some interim groups are set up according to the interest of user in base station, and the group's relation formed is fed back to each little All members in group.If group's collection is combined into g={g1,g2,g3,···,gj, gjRepresent file FjThere is demand User set.Obviously the number of users that small set meets in relation g≤| M |, and each group meets gj≤N.Due to often Individual user can ask multiple file, so allowing overlap, i.e. g between groupi∩gj≠ o sets up.
2. set up social network diagram
(1) set up regular network, obtain adjacency matrix A；
(2) regular network is reconnected at random reconnecting probability at random, generate small-world network；
(3) analyze adjacency matrix A, whether have connection between decision node i and node j；
(4) generate one and have no right undirected social network diagram G and social networks matrix TM×N。
3. determine central user
(1), after packet, base station needs to determine central user in packet；
(2) different due to the social status of each user, select which user as the central user of group to whole nothing Gauze network has a major impact.Here choose user in the group that social value is the highest, the highest sharing efficiency can be reached；
(3) user U is calculatediSocial degree, it represents user's in-degree and summation of out-degree, it may be assumed that
D ( U i ) = Σ k = 1 N a ( U i , U k ) , i ≠ k - - - ( 5 )
Wherein N is total user node number, works as UiWith node UkBetween when there is social link, a (Ui,Uk)=1.In order to Guarantee concordance and the comparability of result, present invention assumes that user and oneself there is not social networks.Definition makes CD(Ui) value is Big node UiFor central user.
In each group, if there is not the file of demand in this group, then first base station is transmitted file by cellular communication To central user, each group shares this document based on social networks by D2D communication again.
4. judge whether can set up D2D link between user
(1) the degree of belief s (U to each user node in social networksi) compose initial value, value scope is between [0,1]；
(2) according to below equation, each user node is asked
s ( U i ) ‾ = 1 Σ U j ∈ U i ≠ j s ( U j ) Σ U j ∈ U i ≠ j s ( U j ) * e j i - - - ( 6 )
(3) setFor low precision, it is judged thatValue withSize, if Then forward step 4 to), otherwise makeForward step (2) to continue to calculate；
(4) convergence result is tried to achieve；
(5) there is D2D link between user and must be fulfilled for two conditions: firstly, there are social networks；Secondly, degree of belief Must be in the scope of safety.The threshold value assuming degree of belief is S0, then can be by social link metric S elementary composition for 0-1M×N Meet condition s (Ui) ＞ S0.When meeting two above condition, D2D link can be set up 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):
U i , j m = L i T r . L j Re . R i , j m . ∂ / | | Γ j , * B | | - - - ( 7 )
Wherein:
Represent that user i has been received that file m,And if only if Γi,m=1 and user j or just Accepting file m.When user i is base station or its transmitter free time, haveEqually, the most occupied when the receiver of user j Used time,
(2) analyze the social network diagram that user is constituted, the company limit of OIOO (One In One Out) restrictive condition will be met Composition set ψ, then marks the company limit in set ψ with maximum utility functional value, according to connecting the node at two ends, limit to coming Communication pattern is selected (if two nodes are user, then to select D2D communication pattern；If containing base station, then select cellular communication mould Formula), circulate this process until set ψ is sky.
6. time-delay analysis
Assume that all of cellular link number is Lcj, all of D2D number of links is Ldj, therefore calculate at greedy colored limit labelling The time delay that can obtain transmitting file in method is:
t g r e = Σ j = 1 | G | t 0 × Lc j + t 1 × Ld j - - - ( 8 )
From previously described, a social colony exist the central user that social activity degree is maximum, the present invention assumes The social degree of central user is Dj, then to have social networks and the degree of belief user in threshold range permissible with central user Directly by central user by D2D link sharing file to meet demand, therefore the present invention studied based on social networks The overall delay of D2D file-sharing mechanism is:
t s u m , D 2 D = Σ j = 1 | G | t 0 × ( Lc j + 1 ) + t 1 × ( D j + Ld j ) - - - ( 9 )
Wherein LcjAnd LdjCellular link number and the D2D chain of other users of social networks is not respectively had with central user Way, the join algorithm of link is set up by greedy colored limit labeling algorithm.Assume that central user is in this group the first of file Individual recipient, can directly obtain owing to having social networks and trust angle value user in the reasonable scope with it at central user Obtaining file, the most in theory, overall delay reduces, i.e. tsum,D2DLess than tgre。
It it is below simulation result
Fig. 4 illustrates under given D2D communication environment, 20 users in the border circular areas that radius is 1000 meters, threshold value S0Impact on user's average degree.As seen from the figure, S is worked as0When=0 i.e. trust threshold is zero, corresponding maximum user's average degree is about etc. In 5.25, along with the increase of threshold value, the average degree of user reduces.As can be seen from Figure, curve has downward trend, i.e. S0Value The biggest, trust requires the harshest, and user's average degree is the least.
Fig. 5 illustrate file-sharing based on social networks mechanism and greediness colour limit labeling algorithm under, overall delay with The situation the change of file number m and change, m is the total number of file that user asks in file set F here.By permissible in figure Finding out, the overall delay of institute of the present invention extracting method is less than the time delay in the labeling algorithm of greedy colored limit, is consistent with theory analysis.This Outward, along with increasing of quantity of documents, in figure, the difference of the numerical value of two curves is also increasing.
Fig. 6 illustrates respectively under file-sharing mechanism algorithm based on social networks and greediness colour limit labeling algorithm, The situation of load of base station, when i.e. meeting all users to the request of file, the number of files of base station in response.It can be seen that When meeting the identical demand condition of user, the quantity of documents of base station in response differ.As m=20, greedy colored limit mark In note algorithm, the number of files of base station in response is about 560, and is only about 210 in the algorithm that the present invention proposes.This can illustrate, selects The user with maximum social activity degree can effectively alleviate the load of base station as central user.
The foregoing is only a specific embodiment of the present invention, not in order to limit the present invention, all essences in the present invention Within god and principle, any modification, equivalent substitution and improvement etc. made, should be included within the scope of the present invention.

Claims (8)

1. a file sharing method based on social networks, it is characterised in that described method comprises the steps:
Step 1: user grouping, server is set up user and is collected u={U1,U2,U3,···,UNAnd user demand file collection F= {F1,F2,F3,···,FM}；
Step 2: set up social network diagram, user, according to user interest, is divided into some interim groups, and feeds back in group by base station Member, sets up regular network；
Step 3: determine central user；
Step 4: judge whether can set up D2D link between user；
Step 5: link selection.
File sharing method based on social networks the most according to claim 1, it is characterised in that in step 2, according to institute State regular network and first generate adjacency matrix A, then regular network is attached, generate small-world network, analyze adjacency matrix A, whether to have between decision node i and node j connection, and generates one and have no right undirected social network diagram G and social networks square Battle array TM×N。
File sharing method based on social networks the most according to claim 2, it is characterised in that described to regular network It is attached being to reconnect probability at random regular network is reconnected at random.
File sharing method based on social networks the most according to claim 1, it is characterised in that in step 3, in determining Centre user be calculate interim group by communication degree algorithm in the communication degree D (U of each useri), then choose and wherein communicate The central user that the user of degree maximum organizes as this.
File sharing method based on social networks the most according to claim 4, it is characterised in that described communication degree algorithm For Dul.
File sharing method based on social networks the most according to claim 1, it is characterised in that judge user in step 4 Between whether can set up the process of D2D link be first determine whether this group in whether there is demand file, pass through if there is then base station First cellular communications channel is transferred to file central user, and in group, other users are the most shared, then calculated by degree of belief Method calculates the average degree of belief of the user node in social networks, if less than secure threshold, then can set up D2D chain between user Road, otherwise can only select cellular communication link.
File sharing method based on social networks the most according to claim 1, it is characterised in that in step 5, carry out chain Road select time elder generation's computing terminal user node or base station between utility function value, then analyze user constitute social networks Figure, will meet the company limit composition set ψ of certain restrictive condition, and then mark and have maximum utility functional value in set ψ Lian Bian, according to the node at two ends, limit to selecting communication pattern.
File sharing method based on social networks the most according to claim 7, it is characterised in that described restrictive condition is Singly enter singly to go out.
CN201610763424.2A 2016-08-30 2016-08-30 A kind of file sharing method based on social networks Active CN106230973B (en)

Priority Applications (1)

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

Applications Claiming Priority (1)

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

Publications (2)

Publication Number Publication Date
CN106230973A true CN106230973A (en) 2016-12-14
CN106230973B 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 kind of file sharing method based on social networks

Country Status (1)

Country Link
CN (1) CN106230973B (en)

Cited By (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 kind of file multi-to-multi distribution method based on social networks
CN107979846A (en) * 2017-12-29 2018-05-01 中国人民解放军陆军工程大学 Overlapping Game with Coalitions model and spatially adaptive algorithm under a kind of scene consciousness
CN108595475A (en) * 2018-03-12 2018-09-28 电子科技大学 A kind of cache node selection method in mobile community network
CN108616845A (en) * 2018-03-30 2018-10-02 佛山市顺德区中山大学研究院 D2D grouping multiple target caching methods based on social content and its system, device
CN108810169A (en) * 2018-07-18 2018-11-13 张家口浩扬科技有限公司 A kind of content buffering method based on social relationships
CN109756908A (en) * 2017-11-01 2019-05-14 上海交通大学 Optimization method/system, storage medium and the equipment of wireless network cache policy
CN109803245A (en) * 2019-03-12 2019-05-24 南京邮电大学 A kind of cache node selection method based on D2D communication
CN110312212A (en) * 2019-08-01 2019-10-08 郑州师范学院 A kind of D2D block communication method, system and associated component
CN111866816A (en) * 2020-06-23 2020-10-30 广东以诺通讯有限公司 D2D terminal mode communication selection method under 5G hybrid networking
CN112368691A (en) * 2018-06-08 2021-02-12 塞佛尔公司 Techniques for file sharing
CN113395263A (en) * 2021-05-26 2021-09-14 西南科技大学 Method for calculating trust of shared video in online social network
USD982597S1 (en) 2018-06-08 2023-04-04 Saphyre, Inc. Display screen or portion thereof with graphical user interface

Citations (9)

* 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
US20140064163A1 (en) * 2012-09-06 2014-03-06 Qualcomm Incorporated Methods and apparatus for paging based peer discovery
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

Patent Citations (9)

* 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
US20140064163A1 (en) * 2012-09-06 2014-03-06 Qualcomm Incorporated Methods and apparatus for paging based peer discovery
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中基于社交关系的按需用户发现策略"", 《信号处理》 *

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107484105A (en) * 2017-07-03 2017-12-15 南京理工大学 A kind of file multi-to-multi distribution method based on social networks
CN109756908B (en) * 2017-11-01 2021-10-15 上海交通大学 Method/system for optimizing wireless network cache strategy, storage medium and equipment
CN109756908A (en) * 2017-11-01 2019-05-14 上海交通大学 Optimization method/system, storage medium and the equipment of wireless network cache policy
CN107979846A (en) * 2017-12-29 2018-05-01 中国人民解放军陆军工程大学 Overlapping Game with Coalitions model and spatially adaptive algorithm under a kind of scene consciousness
CN108595475A (en) * 2018-03-12 2018-09-28 电子科技大学 A kind of cache node selection method in mobile community network
CN108595475B (en) * 2018-03-12 2022-03-04 电子科技大学 Cache node selection method in mobile social network
CN108616845A (en) * 2018-03-30 2018-10-02 佛山市顺德区中山大学研究院 D2D grouping multiple target caching methods based on social content and its system, device
US11841831B2 (en) 2018-06-08 2023-12-12 Saphyre, Inc. Technologies for file sharing
USD982597S1 (en) 2018-06-08 2023-04-04 Saphyre, Inc. Display screen or portion thereof with graphical user interface
US11422979B2 (en) 2018-06-08 2022-08-23 Saphyre, Inc. Technologies for file sharing
CN112368691A (en) * 2018-06-08 2021-02-12 塞佛尔公司 Techniques for file sharing
CN108810169B (en) * 2018-07-18 2021-05-11 北京隆普智能科技有限公司 Content caching method based on social relationship
CN108810169A (en) * 2018-07-18 2018-11-13 张家口浩扬科技有限公司 A kind of content buffering method based on social relationships
CN109803245B (en) * 2019-03-12 2022-01-28 南京邮电大学 Cache node selection method based on D2D communication
CN109803245A (en) * 2019-03-12 2019-05-24 南京邮电大学 A kind of cache node selection method based on D2D communication
CN110312212A (en) * 2019-08-01 2019-10-08 郑州师范学院 A kind of D2D block communication method, system and associated component
CN111866816A (en) * 2020-06-23 2020-10-30 广东以诺通讯有限公司 D2D terminal mode communication selection method under 5G hybrid networking
CN111866816B (en) * 2020-06-23 2024-04-05 广东以诺通讯有限公司 D2D terminal mode communication selection method under 5G hybrid networking
CN113395263A (en) * 2021-05-26 2021-09-14 西南科技大学 Method for calculating trust of shared video in online social network
CN113395263B (en) * 2021-05-26 2022-07-26 西南科技大学 Trust calculation method for sharing video in online social network

Also Published As

Publication number Publication date
CN106230973B (en) 2019-05-21

Similar Documents

Publication Publication Date Title
CN106230973A (en) A kind of file sharing method based on social networks
Zhu et al. Multiple vehicles collaborative data download protocol via network coding
Huynh et al. Social-aware energy efficiency optimization for device-to-device communications in 5G networks
Zheng et al. Energy efficient V2X-enabled communications in cellular networks
Li et al. Coding or not: Optimal mobile data offloading in opportunistic vehicular networks
Zheng et al. Dynamic performance analysis of uplink transmission in cluster-based heterogeneous vehicular networks
Liu et al. Enabling relay-assisted D2D communication for cellular networks: Algorithm and protocols
Waqas et al. Mobility assisted content transmission for device-to-device communication underlaying cellular networks
Zhao et al. Survey on social-aware data dissemination over mobile wireless networks
CN102421139A (en) Method for converging heterogeneous networks based on dynamic load transfer
CN110337092A (en) A kind of low-power consumption relay selection method based on social trust model
Qu et al. Spectrum-aware network coded multicast in mobile cognitive radio ad hoc networks
Dong et al. Dynamic manager selection assisted resource allocation in URLLC with finite block length for 5G-V2X platoons
Wang et al. Iterative greedy user clustering algorithm for D2D–relay in vehicular communication systems
Altman Competition and cooperation between nodes in delay tolerant networks with two hop routing
Qian et al. Relay selection algorithm based on social network combined with Q‐learning for vehicle D2D communication
Li et al. Energy efficient power allocation for co-located antenna systems with D2D communication
Wang et al. Real-time delay minimization for data processing in wirelessly networked disaster areas
CN104683986A (en) Orthogonal resource sharing scheme for D2D (device-to-device)-embedded cellular network based on cooperative relaying
CN104426874B (en) A kind of authentication method and device for ubiquitous terminal network
Wang et al. Social-aware file-sharing mechanism for device-to-device communications
Kim et al. Spectrum allocation with power control in LBS based D2d cellular mobile networks
Zhan et al. Conflict-free scheduling for partially connected D2D networks with network coding
Liu et al. Optimized layered multicast with superposition coding in cellular systems
Han et al. Online and robust resource allocation for D2D communications assisted by Green relays

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