CN106230973B - A kind of file sharing method based on social networks - Google Patents
A kind of file sharing method based on social networks Download PDFInfo
- 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
- base station
- social networks
- group
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000004891 communication Methods 0.000 claims abstract description 33
- 230000010267 cellular communication Effects 0.000 claims abstract description 12
- 238000004422 calculation algorithm Methods 0.000 claims description 24
- 239000011159 matrix material Substances 0.000 claims description 16
- 238000010586 diagram Methods 0.000 claims description 10
- 230000001413 cellular effect Effects 0.000 claims description 9
- 238000002372 labelling Methods 0.000 claims description 8
- 230000005540 biological transmission Effects 0.000 claims description 5
- 230000004044 response Effects 0.000 claims description 5
- 230000015572 biosynthetic process Effects 0.000 claims description 4
- 230000008569 process Effects 0.000 claims description 4
- 238000012545 processing Methods 0.000 abstract description 2
- 230000000694 effects Effects 0.000 description 9
- 230000007246 mechanism Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 4
- 230000006855 networking Effects 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000003638 chemical reducing agent Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 230000000116 mitigating effect Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000011273 social behavior Effects 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
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 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
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. a kind of file sharing method based on social networks, which is characterized in that described method includes following steps:
Step 1: user grouping, server establish user and collect u={ U1,U2,U3,…,UNAnd user demand file collection F={ F1,
F2,F3,…,FM}；
User's collectionIn user's demand file collectionIn file, wherein N
Indicate that the number M of user indicates the number of file, within the system, firstly, server sends information to base station, base station is received
All users are broadcast to after information, N number of user requests respective interested content in M file respectively, and solicited message is sent out
Send back to base station, it is assumed that solicited status matrix RN×M=(rn,m) user defines r to the interest of file in expression systemn,m=1 table
Show user UnTo file FmIt is interested, conversely, rn,m=0, several interim groups are established according to the interest of user in base station, and formation
Group's relationship feed back to all members in each group, if group collection be combined into It indicates
To file FjThere is the user of demand to gather, it is clear that small set meets relationshipAnd the number of users in each group is full
FootSince each user can request multiple files, so allowing to be overlapped between group, i.e.,It sets up；
Step 2: establish social network diagram, base station is divided into several interim groups according to user interest, by user, and feed back to group at
Member, initially sets up regular network, obtains adjacency matrix A；It is weighed at random with random reconnection Probability p=0.01 pair regular network
Even, small-world network is generated；Adjacency matrix A is analyzed, if A (i, j)=A (j, i)=1, then it represents that have between node i and node j
Connection；Therefore can be generated one haves no right undirected social network diagram G, and the adjacency matrix A of the figure is defined as being made of 0-1 element
Social networks matrix TN×N, 1 indicates there is social networks between corresponding user, it can by D2D link from other users
Place obtains its interested file, and 0 opposite；
Step 3: determining central user；
Since the social status of each user is different, which user is selected to have as the central user of group to entire wireless network
Great influence describes the social status of user, user U with the concept of social degreeiSocial degree indicate its in-degree and out-degree
Summation, in order to ensure the consistency and comparability of result, it is assumed that user makes C with social networks, definition oneself is not presentD(Ui)
It is worth maximum node UiFor central user, central user plays an important role in the D2D transmission based on social networks, is being
In the case where not having demand file caching in system, file is sent to central use by radio honeycomb communication link first by base station
Family, which shares to the user for having social networks in group by D2D communication file, and does not have society with the central user
The user of friendship relationship can from base station or obtained this document other users from obtain this document；If had in system
The caching of this document, then user can directly from base station or obtained file user from obtain demand file, this process is wanted
Consider to realize that D2D content efficiently accesses on Cellular Networks dynamic network；
Step 4: judging whether D2D link can be established between user；
In view of the safety of system, only meets certain user for trusting and requiring, be possible to establish D2D link sharing file
Information, therefore introduce an important factor for degree of belief of user is as system performance is influenced, the confidence level of different nodes in a network
Difference, it is also not identical to mutual confidence level between node, then, have no right Undirected networks by characterize social networks in step 2
Figure G has reformed into the vector network chart G' that has the right, and weight is direct trust between representing the user in social networks
Angle value ejiAnd eij, it is assumed that user node UjTrust user node Ui, work as UjWhen confidence level in a network is higher, then UiIn net
Confidence level in network will not be poor, so trust angle value of the user node in social networks can pass through other nodes pair
Its weighted average for trusting angle value obtains, and by the system model being then based under cellular network auxiliary, therefore base station control is all
The state of user and the information for saving them, such as User ID, the successful failure record of neighbor user discovery, request and response file
And credit assessment of other users etc., therefore the degree of belief of user can be obtained from the information of base station feedback, be not excluded for
In the case where malicious node, other all users should approach a value, i.e. e to the direct trust angle value of a certain userji(j=1,
2 ..., N and j ≠ i) it is value similar in some between 0-1, it can be obtained by analyzing above, D2D chain if it exists between user
Road must satisfy two conditions: (1) there are social networks, (2) degree of belief must be in the range of safety, it is assumed that the threshold of degree of belief
Value is S0, then the social link metric S being made of 0-1 element can be obtainedN×NMeet condition s (Ui)≥S0；
Step 5: link selection, in order to improve the overall performance of cellular communication system, in each group, if being not present in the group
The file of demand, then file is transferred to central user by cellular communication by base station first, and each group is based on social networks again
Shared this document is communicated by D2D；If the file of existing demand in group, by certain strategy, selection from base station or
File is obtained at the user of existing file caching, due to only considering small-scale traffic model, communication radius is shorter, therefore base station is arrived
Propagation delay time between user is considered as being set as t for a constant0, propagation delay time in same group between D2D user
It is considered as being set as t for constant1, when certain elements that the j of solicited status matrix R is arranged are 1, then corresponding user is divided intoIn group, the total quantity of user is in the groupGreedy colored side labeling algorithm is introduced, which passes through computing terminal
Utility function value between user node determines shared biography that selection cellular communication link still selects D2D link to carry out file
Defeated, since user can request that multiple files, then each D2D user must send within the same time or receive multiple files,
In order to avoid self interference, usually assume that D2D user can only handle a file, i.e. user U in the same timenReceiving one
When file, other requests cannot be responded.
2. the file sharing method according to claim 1 based on social networks, it is characterised in that in step 3, in determination
Entreating user is the communication degree D (U that each user in interim group is calculated by communication degree algorithmi), it then chooses and wherein communicates
Spend central user of the maximum user as this group.
3. the file sharing method according to claim 2 based on social networks, it is characterised in that the communication degree algorithm
For Dul.
4. the file sharing method according to claim 1 based on social networks, it is characterised in that judge user in step 4
Between whether to establish the process of D2D link first determined whether with the presence or absence of demand file in the group, and if so, base station passes through
File is transferred to central user by cellular communications channel first, and other users are shared again in group, is then passed through degree of belief and is calculated
Method calculates the average degree of belief of the user node in social networks, if being less than secure threshold, can establish D2D chain between user
Otherwise road can only select cellular communication link.
5. the file sharing method according to claim 1 based on social networks, it is characterised in that in step 5, carry out chain
Then utility function value when road selects between elder generation's computing terminal user node or base station analyzes the social networks that user is constituted
The company side for meeting certain restrictions condition is formed set ψ by figure, and then mark has maximum utility functional value in set ψ
Lian Bian, according to the node at side both ends to selecting communication pattern.
6. the file sharing method according to claim 5 based on social networks, it is characterised in that the restrictive condition is
It is single-entry single-out.
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 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 kind of file sharing method based on social networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106230973B (en) |
Families Citing this family (12)
| 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 |
| CN107979846A (en) * | 2017-12-29 | 2018-05-01 | 中国人民解放军陆军工程大学 | Overlapping Game with Coalitions model and spatially adaptive algorithm under a kind of scene consciousness |
| CN108595475B (en) * | 2018-03-12 | 2022-03-04 | 电子科技大学 | Cache node selection method in mobile social network |
| 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 kind of D2D block communication method, system and associated component |
| 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)
| 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)
| 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 |
-
2016
- 2016-08-30 CN CN201610763424.2A patent/CN106230973B/en active Active
Patent Citations (8)
| 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)
| 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 kind of file sharing method based on social networks | |
| Pawar et al. | Device-to-device communication based IoT system: benefits and challenges | |
| Han et al. | Matching theory for wireless networks | |
| Huynh et al. | Social-aware energy efficiency optimization for device-to-device communications in 5G networks | |
| Meng et al. | Cooperative device-to-device communications: Social networking perspectives | |
| Wang et al. | Tag-assisted social-aware opportunistic device-to-device sharing for traffic offloading in mobile social networks | |
| Wang et al. | Socially enabled wireless networks: Resource allocation via bipartite graph matching | |
| Liu et al. | Enabling relay-assisted D2D communication for cellular networks: Algorithm and protocols | |
| Saxena et al. | Exploiting social relationships for trustworthy D2D relay in 5G cellular networks | |
| Wang et al. | Sociality‐aware resource allocation for device‐to‐device communications in cellular networks | |
| CN110337092B (en) | Low-power-consumption relay selection method based on social trust model | |
| Ever et al. | Performance evaluation of hybrid disaster recovery framework with D2D communications | |
| Waqas et al. | Mobility assisted content transmission for device-to-device communication underlaying cellular networks | |
| Zhang et al. | Peer discovery for D2D communications based on social attribute and service attribute | |
| Zhao et al. | Survey on social-aware data dissemination over mobile wireless networks | |
| Hu et al. | Multi-principal multi-agent contract design: theory and application to device-to-device communications | |
| Qian et al. | Relay selection algorithm based on social network combined with Q‐learning for vehicle D2D communication | |
| Wang et al. | Real-time delay minimization for data processing in wirelessly networked disaster areas | |
| Liu et al. | On social-aware data uploading study of D2D-enabled cellular networks | |
| Macedo et al. | Fuzzy-based load self-configuration in mobile P2P services | |
| Wang et al. | Social-aware file-sharing mechanism for device-to-device communications | |
| CN104426874A (en) | Authentication method and authentication device applied to ubiquitous terminal network | |
| Pang et al. | Optimal target user selection policy for d2d wireless caching networks | |
| Ghosh et al. | DewGame: D2D communication enabled dew computing for 5G IoT using coalition formation game | |
| Li et al. | Relay selection in network coding assisted multi-pair D2D 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 |