CN107302747B - Cooperative video transmission method based on stable matching - Google Patents

Cooperative video transmission method based on stable matching Download PDF

Info

Publication number
CN107302747B
CN107302747B CN201710575047.4A CN201710575047A CN107302747B CN 107302747 B CN107302747 B CN 107302747B CN 201710575047 A CN201710575047 A CN 201710575047A CN 107302747 B CN107302747 B CN 107302747B
Authority
CN
China
Prior art keywords
user
users
distance
social
data packet
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
CN201710575047.4A
Other languages
Chinese (zh)
Other versions
CN107302747A (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201710575047.4A priority Critical patent/CN107302747B/en
Publication of CN107302747A publication Critical patent/CN107302747A/en
Application granted granted Critical
Publication of CN107302747B publication Critical patent/CN107302747B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/64—Addressing
    • H04N21/6408—Unicasting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

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

Abstract

The invention requests to protect a cooperative video transmission method based on stable matching, and belongs to the technical field of mobile communication. The method comprises the following steps: 1. dividing a video stream into a plurality of data packets, and dividing users into different clusters according to different data packets received by the users; 2. calculating the social distance of the user by reflecting the importance of different attributes of the user by using the weight factor; 3. generating a dynamic social relationship by combining the dynamic physical distance of the user; 4. calculating the throughput and the time delay of one time slot unicast by utilizing the social relationship and the wireless propagation environment; 5. and designing utility functions of different user cooperation to generate preference information, and enabling the user to form a stable cooperative transmission scheme in an autonomous negotiation mode by utilizing a Gale-Shapley algorithm. The cooperative video transmission method based on stable matching provided by the invention realizes the fusion of a cellular communication system and D2D (Device-to-Device) short-distance communication, and can reduce the calculation complexity and improve the throughput compared with the traditional cooperative method.

Description

Cooperative video transmission method based on stable matching
Technical Field
The invention belongs to the technical field of mobile communication, and particularly relates to a social network-based user cooperative transmission method among different clusters, which can realize high-speed video stream sharing among users.
Background
In the future, the mobile communication technology needs to support personalized multimedia services such as mobile television, streaming media video and video monitoring, and at present, many challenges are still faced to provide satisfactory service quality and user experience for future mobile communication technology scenes, particularly for high-speed and high-reliability networks. At present, a video transmission system between network nodes can be divided into two modes, i.e., multicast and unicast, where multicast refers to a process of transmitting information to a group of destination addresses at the same time, so as to save the load of a server, but multicast cannot provide personalized services for users in comparison with unicast, and meanwhile, the communication rate of multicast is limited by the user with the worst channel quality, which results in a lower data rate, thereby reducing the quality of video streams.
The operation mode of a cellular network is changed by the D2D technology, D2D communication refers to a process that data are directly transmitted in a short distance between terminals without being transferred through the network, and the D2D communication technology is introduced into the cellular network, so that the throughput can be improved, the network coverage can be expanded, the energy efficiency can be improved, and the user experience can be improved. With the widespread adoption of the D2D technology, it is expected that user equipment will play more active roles in future mobile communication technology service configuration processes, such as D2D data forwarding relay, content distribution and caching, and cooperative communication among users. This new form of communication will change the traditional cellular communication mode, and the evolution of the network has made the user equipment increasingly expand its functionality with less and less importance of the base station.
Most studies assume that all users have equal willingness to collaborate, but this is not the case because users have different interests in content and are unwilling to collaborate with potential D2D users for whom there is no social relationship. In practical scenarios (conferences, concert halls, sports events) where many users may request the same video, the conventional base station transmits the content to these users by multiple retransmissions, and for this reason, some researchers have proposed that the data packets should be transmitted in a cooperative manner, which not only improves the quality of packet transmission, reduces transmission delay, but also improves the edge coverage of the cellular network. Human behavior has changed the path of video generation, distribution, and dissemination, users have begun to participate in the dissemination of video and are no longer passive recipients, and the unprecedented expansion of coverage by users to generate increases in video content and socialized sharing has made video delivery an unprecedented challenge.
Disclosure of Invention
The present invention is directed to solving the above problems of the prior art. The cooperative video transmission method based on stable matching can reduce the computational complexity, improve the throughput and realize high-speed video stream sharing. The technical scheme of the invention is as follows:
a cooperative video transmission method based on stable matching is characterized by comprising the following steps:
step 1): the video adopts multi-description coding, a video stream is divided into a plurality of data packets, a base station broadcasts the divided data packets to users, and the users receiving the same data packets are divided into the same cluster;
step 2): establishing a terminal user attribute relationship, introducing a weight factor, calculating the importance degree of each terminal user attribute and the distance between any two user attributes, and calculating a social relationship s by combining a physical distance yij(y)；
Step 3): using social relations sij(y) calculating the throughput and delay of a time slot unicast between terminal users according to the user receiving signal-to-noise ratio;
step 4): establishing a preference sequence between any two cluster users according to the calculated unicast throughput, and enabling the users to autonomously negotiate a stable form of cooperation scheme by using a D2D cooperation transmission algorithm based on stable matching.
Further, in the step 1), the MDC is adopted to generate a plurality of code streams which are independent from each other and have a certain correlation, each description can be decoded independently to obtain reconstruction quality, after the base station broadcasts the video stream, a user obtains at least one description and divides users obtaining the same description into a cluster, and then, in order to reconstruct a complete video data packet, the user needs to cooperate with users in other clusters through short-distance D2D communication.
Further, the step 2) establishes the attribute relationship of the terminal user, calculates the importance degree of each attribute and the distance between any two user attributes, and calculates the social relationship s by combining the physical distance yij(y) specifically includes;
firstly, each node is ledInto a coordinate vector of dimension k
Figure BDA0001350723190000021
fkValues representing attributes in a particular dimension, weighting factor cuSatisfy the requirement of
Figure BDA0001350723190000022
Thereby obtaining a social distance coefficient α of the userijThe distance between users varies randomly when d<r0The probability of a data packet that the user is willing to forward is 1; when d is>r0Collaboration willingness and distance and social distance coefficient αijIn inverse proportion.
Further, the weight factor cuThe weight calculation formula of the attribute on the dimension u is as follows:
Figure BDA0001350723190000031
fiuvalue, f, representing the attribute of user i in dimension uikRepresenting a value, f, representing an attribute of user j in dimension kjuRepresenting values representing attributes of user j in dimension u
The distance of any two user attributes can be expressed as:
Figure BDA0001350723190000032
v (i) an attribute vector representing user i, v (j) an attribute vector representing user j
Assume that within the range of radius R, at tthTime of day user UEiIs uniformly moved and obeys a smooth traversal independent of time, and the positions of all users are independently obeyed to the same distribution (i.i.d.), the distance D of any two userslProbability density function fY(y) is:
Figure BDA0001350723190000033
FY(y) distribution function representing distance between users
Combining physical and attribute distances between usersDefining the probability that a user is willing to forward packets when the user is in a neighbor distance and the contact is relatively frequent as
Figure BDA0001350723190000034
Willingness and distance to collaborate of randomly meeting users and social distance coefficient αijIn inverse proportion, the social relationship can be expressed as:
Figure BDA0001350723190000035
further, the step 3): using social relations sij(y) calculating the throughput and delay of a time slot unicast between terminal users according to the received signal-to-noise ratio of the users, which specifically comprises the following steps: ensuring that the video data packet is successfully received by the receiving end of the adjacent cluster in a time slot meets two conditions, wherein one condition is that a social relation exists between the transmitting end and the receiving end, moreover, due to the influence of small-scale fading and path loss, the instantaneous receiving signal-to-noise ratio is higher than a predefined threshold value gamma, and the probability of successfully receiving the data packet by the receiving end in a time slot is
Figure BDA0001350723190000041
Wherein P istDenotes transmission power of a transmitting end, h (t) denotes at tthAmplitude of the slot signal, Ω (y) represents path loss, N0W represents the power of Gaussian white noise, the unicast throughput is obtained by integration, and the average throughput E in a time slotij[u(y)]Can be expressed as:
Figure BDA0001350723190000042
further, the step 4) is based on a stable matching D2D cooperative transmission algorithm, and the specific steps include:
1. for any received data packet DaAnd DbTwo clusters of
Figure BDA0001350723190000043
And
Figure BDA0001350723190000044
establishing preference sequence, m, for each user according to throughputiIndicating reception of data packet DaUser of n, njIndicating reception of data packet DbThe user of (a) is permitted to,Nindicating reception of data packet DaThe number of users of (a) is,Mindicating reception of data packet DbThe number of users of (c);
2. initialization definition Mmatchlist，MmatchlistRepresents user miThe matching list of (2);
3. user m without matchiGive it no refusal m in preference listiUser n with highest preferencejSending a D2D cooperation request;
4. if it is not
Figure BDA0001350723190000047
Where > represents preference tendency, mi' represents a user currently applying for collaboration;
5、njreceiving miAnd rejects the current matching object mi′，miFrom MmatchlistIs removed;
6. if it is not
Figure BDA0001350723190000046
7、njRefuse miRequesting and maintaining the current matching state, miUpdating the preference list;
8. if it is not
Figure BDA0001350723190000045
mi∈MmatchlistAnd the algorithm ends.
The invention has the following advantages and beneficial effects:
the invention provides a cooperative video transmission method based on stable matching. The specific innovative steps comprise: 1) the invention divides the video stream into a plurality of data packets, fuses the cellular network and the short-distance communication network, realizes high-speed video stream sharing, enables users to share data and reduces the burden of a base station; 2) the importance of different attributes of a user is reflected by using the weight factor, a dynamic social relationship is established by combining with the physical distance, the unicast throughput of a time slot is analyzed, and the social relationship strength can influence the successful transmission probability of a data packet; 3) and a cooperative transmission scheme of users between two different clusters is formed by utilizing a Gale-Shapley algorithm, so that the throughput is improved.
Drawings
FIG. 1 is a diagram of a video streaming collaboration transport application scenario in accordance with the present invention;
FIG. 2 is a flow chart of a method for collaborative video transmission based on robust matching;
FIG. 3 is a schematic diagram of the relationship between social relationship calculation and physical distance in accordance with the present invention;
FIG. 4 is a schematic diagram of the Gale-shape algorithm.
Detailed Description
The technical solutions in the embodiments of the present invention will be described in detail and clearly with reference to the accompanying drawings. The described embodiments are only some of the embodiments of the present invention.
The technical scheme for solving the technical problems is as follows:
the present invention is mainly applied to a hybrid heterogeneous network in which a cellular network and short-range communication coexist, and embodiments of the present invention will be described in detail below with reference to the accompanying drawings and example drawings.
Fig. 1 is a diagram of an application scenario of the present invention, in which a base station allocates independent and mutually orthogonal channel resources to a user to reduce interference between multiple transmitting terminals. After the base station broadcasts the video stream, the user obtains at least one description and divides the users obtaining the same description into a cluster, and secondly, in order to reconstruct the complete video data packet, the user needs to cooperate with the users in other clusters through short-distance D2D communication. The social level is introduced to describe the strength of social relations among different users, and the social relations among the users and the physical channel conditions jointly determine the preference of the users for selecting the cooperative objects.
FIG. 2 is a general flow chart of the present invention, which is described below with reference to the accompanying drawings, and includes the following steps:
the method comprises the following steps: the video adopts multi-description coding, the base station broadcasts the divided data packets to the users, and the users receiving the same data packets are divided into the same cluster;
the base station serves as a control center to control the group formation and resource allocation of the whole cell. In the crowd dense area, n users request the same video resource from the base station, and the data packet is transmitted in two stages. Firstly, a base station broadcasts an original video data packet from a server through a cellular channel, supposing that a video adopts multi-description coding to generate a plurality of code streams (descriptions) which are independent of each other and have certain correlation, each description can be decoded independently to obtain reconstruction quality, the reconstruction effect is correspondingly improved along with the number of the received descriptions, and due to attenuation and network heterogeneity of a wireless channel, many users only obtain partial data packets of the video stream. The users who obtain the same description are divided into a cluster, and secondly, in order to reconstruct a complete video packet, the users need to cooperate with the users in other clusters through short-distance D2D communication.
Step two: establishing terminal user attribute relationship, calculating importance degree of each attribute and distance between any two user attributes, and calculating social relationship s by combining physical distance yij(y)；
Firstly, introducing a k-dimensional coordinate vector to each node
Figure BDA0001350723190000061
Each value represents the value of an attribute in a specific dimension, and in order to distinguish each attribute, the importance of each attribute is represented by a weight factor c and satisfied
Figure BDA0001350723190000062
The weight of the attribute in dimension u is:
Figure BDA0001350723190000063
fiuvalue, f, representing the attribute of user i in dimension uikRepresenting a user j in dimensionValue of attribute on degree k, fjuRepresenting values representing attributes of user j in dimension u
The distance of any two user attributes can be expressed as:
Figure BDA0001350723190000064
v (i) an attribute vector representing user i, v (j) an attribute vector representing user j
Since the user is moving randomly, it is assumed to be within radius R, at tthTime of day user UEiIs uniformly moved and obeys a smooth traversal independent of time, and the positions of all users are independently obeyed to the same distribution (i.i.d.), the distance D of any two userslProbability Density Function (PDF) fY(y) is:
Figure BDA0001350723190000065
FY(y) distribution function representing distance between users
In combination with the physical and attribute distances between users, fig. 3 defines the probability that a user is willing to forward packets when the user is in the neighborhood and the contact is relatively frequent as
Figure BDA0001350723190000071
Willingness and distance to collaborate of randomly meeting users and social distance coefficient αijIn inverse proportion, the social relationship can be expressed as:
Figure BDA0001350723190000072
step three: calculating the throughput and time delay of one time slot unicast between terminal users by utilizing social relation and a wireless propagation environment;
since human participation is largely subjective in D2D communications, successful establishment of communications between two users is not unconditional, and depends on the social relationship between the users at that time and the quality of the channel communication. Therefore, within a time slot, there isEnsuring that the video data packet is successfully received by the receiving end of the adjacent cluster meets the following two conditions, wherein one condition is that a social relationship exists between the sending end and the receiving end, and moreover, due to the influence of small-scale fading and path loss, the instantaneous receiving signal-to-noise ratio (SNR) is higher than a predefined threshold value gamma, and a social relationship threshold value distance r is set in the text0Greater than the edge distance d of the "near field0. The probability that the receiving end successfully receives the data packet in one time slot comprehensively considers physical factors and social factors is as follows:
Figure BDA0001350723190000073
wherein P istDenotes transmission power of a transmitting end, h (t) denotes at tthAmplitude of the slot signal, Ω (y) represents path loss, N0W represents the power of gaussian white noise.
Average throughput E in one time slotij[u(y)]Can be expressed as:
Figure BDA0001350723190000074
step four: and establishing a preference sequence between any two cluster users according to the calculated unicast throughput, and forming a stable cooperation scheme by using a matching algorithm.
The D2D cooperative transmission model may be established as:
Figure BDA0001350723190000081
Figure BDA0001350723190000082
fig. 4 is a D2D cooperative transmission algorithm based on stable matching, which includes the following specific steps:
1. for any received data packet DaAnd DbTwo clusters of
Figure BDA0001350723190000083
And
Figure BDA0001350723190000084
establishing preference sequence, m, for each user according to throughputiIndicating reception of data packet DaUser of n, njIndicating reception of data packet DbThe user of (a) is permitted to,Nindicating reception of data packet DaThe number of users of (a) is,Mindicating reception of data packet DbThe number of users of (c);
2. initialization definition Mmatchlist，MmatchlistRepresents user miThe matching list of (2);
3. user m without matchiGive it no refusal m in preference listiUser n with highest preferencejSending a D2D cooperation request;
4. if it is not
Figure BDA0001350723190000086
5、njReceiving miAnd rejects the current matching object mi′，miFrom MmatchlistIs removed;
6. if it is not
Figure BDA0001350723190000087
7、njRefuse miRequesting and maintaining the current matching state, miUpdating the preference list;
8. if it is not
Figure BDA0001350723190000085
mi∈MmatchlistAnd the algorithm ends.
The above examples are to be construed as merely illustrative and not limitative of the remainder of the disclosure. After reading the description of the invention, the skilled person can make various changes or modifications to the invention, and these equivalent changes and modifications also fall into the scope of the invention defined by the claims.

Claims (4)

1. A cooperative video transmission method based on stable matching is characterized by comprising the following steps:
step 1): the video adopts multi-description coding to divide the video stream into a plurality of descriptions which are equal in importance and can be independently decoded and are related to coding, a base station broadcasts divided data packets to users, and the users receiving the same data packets are divided into the same cluster;
step 2): establishing terminal user attribute relationship, introducing weight factor, calculating importance degree and any two social distances of each terminal user attribute, and calculating social relationship s by combining physical distance yij(y)；
Firstly, introducing a k-dimensional coordinate vector to each node
Figure FDA0002578223530000011
fkValues representing attributes in a particular dimension, weighting factor cuSatisfy the requirement of
Figure FDA0002578223530000012
Thereby obtaining a social distance coefficient α of the userijThe distance between users varies randomly when d < r0The probability of a data packet that the user is willing to forward is 1; when d > r0Collaboration willingness and distance and social distance coefficient αijIn inverse proportion; r is0Representing social relationship threshold distance, d0Representing an edge distance;
the weight factor cuThe weight calculation formula of the attribute on the dimension u is as follows:
Figure FDA0002578223530000013
fiuvalue, f, representing the attribute of user i in dimension uikValue, f, representing the attribute of user i in dimension kjuValues representing attributes of user j in dimension u
The social distance coefficient may be expressed as:
Figure FDA0002578223530000014
v (i) an attribute vector representing user i, v (j) an attribute vector representing user j;
assume that within the range of radius R, at tthTime of day user UEiIs uniformly moved and obeys a smooth traversal independent of time, and the positions of all users are independently obeyed to the same distribution (i.i.d.), the distance D of any two userslProbability density function fY(y) is:
Figure FDA0002578223530000015
FY(y) distribution function representing distance between users
Combining the physical distance and the social distance between users, the probability of data packets which the users are willing to forward when the users are in the neighbor distance is defined as
Figure FDA0002578223530000021
Willingness and distance to collaborate of randomly meeting users and social distance coefficient αijIn inverse proportion, the social relationship can be expressed as:
Figure FDA0002578223530000022
step 3): using social relations sij(y) calculating the throughput and delay of a time slot unicast between terminal users according to the user receiving signal-to-noise ratio;
step 4): establishing a preference sequence between any two cluster users according to the calculated unicast throughput, and enabling the users to autonomously negotiate a stable form of cooperation scheme by using a D2D cooperation transmission algorithm based on stable matching.
2. The cooperative video transmission method based on stable matching as claimed in claim 1, wherein the video stream in step 1) employs MDC to generate multiple mutually independent and related descriptions, each description can be decoded independently to obtain reconstruction quality, after the base station broadcasts the video stream, the user obtains at least one description and divides the users obtaining the same description into a cluster, and then, in order to reconstruct a complete video data packet, the user needs to cooperate with the users in other clusters through short distance D2D communication.
3. The collaborative video transmission method based on stable matching according to claim 1,
the step 3): using social relations sij(y) calculating the throughput and delay of a time slot unicast between terminal users according to the received signal-to-noise ratio of the users, which specifically comprises the following steps: ensuring that the video data packet is successfully received by the receiving end of the adjacent cluster in a time slot meets two conditions, wherein one condition is that a social relation exists between the transmitting end and the receiving end, moreover, due to the influence of small-scale fading and path loss, the instantaneous receiving signal-to-noise ratio is higher than a predefined threshold value gamma, and the probability of successfully receiving the data packet by the receiving end in a time slot is
Figure FDA0002578223530000023
Wherein P istDenotes transmission power of a transmitting end, h (t) denotes at tthAmplitude of the slot signal, Ω (y) represents path loss, N0W represents the power of Gaussian white noise, the unicast throughput is obtained by integration, and the average throughput E in a time slotij[u(y)]Can be expressed as:
Figure FDA0002578223530000031
4. the cooperative video transmission method based on stable matching as claimed in claim 1, wherein the step 4) is based on a D2D cooperative transmission algorithm based on stable matching, and the specific steps include:
1. for any received data packet DaAnd DbTwo clusters of
Figure FDA0002578223530000032
And
Figure FDA0002578223530000033
establishing preference sequence, m, for each user according to throughputiIndicating reception of data packet DaUser of n, njIndicating reception of data packet DbM denotes a received data packet DaN represents the received data packet DbThe number of users of (c);
2. initialization definition Mmatchlist，MmatchlistRepresents user miThe matching list of (2);
3. user m without matchiGive it no refusal m in preference listiUser n with highest preferencejSending a D2D cooperation request;
4. if it is not
Figure FDA0002578223530000034
Wherein
Figure DA00025782235348476
Denotes preference tendency, m'iRepresenting users currently applying for collaboration;
5、njreceiving miAnd rejects the current matching object mi′，miFrom MmatchlistIs removed;
6. if it is not
Figure FDA0002578223530000035
7、njRefuse miRequesting and maintaining the current matching state, miUpdating the preference list;
8. if it is not
Figure FDA0002578223530000036
mi∈MmatchlistAnd the algorithm ends.
CN201710575047.4A 2017-07-14 2017-07-14 Cooperative video transmission method based on stable matching Active CN107302747B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710575047.4A CN107302747B (en) 2017-07-14 2017-07-14 Cooperative video transmission method based on stable matching

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710575047.4A CN107302747B (en) 2017-07-14 2017-07-14 Cooperative video transmission method based on stable matching

Publications (2)

Publication Number Publication Date
CN107302747A CN107302747A (en) 2017-10-27
CN107302747B true CN107302747B (en) 2020-09-29

Family

ID=60132864

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710575047.4A Active CN107302747B (en) 2017-07-14 2017-07-14 Cooperative video transmission method based on stable matching

Country Status (1)

Country Link
CN (1) CN107302747B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109587641B (en) * 2018-11-30 2020-11-03 武汉科技大学 Data flow sharing method based on user matching in mobile intelligent equipment
CN113259970B (en) * 2021-05-08 2022-07-08 Tcl通讯（宁波）有限公司 Communication method and terminal device

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104350692A (en) * 2012-04-11 2015-02-11 英特尔公司 Operator-assisted device-to-device (d2d) discovery
CN106412801A (en) * 2016-08-31 2017-02-15 西安电子科技大学 Video frame structure and D2D communication based video multicast method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104350692A (en) * 2012-04-11 2015-02-11 英特尔公司 Operator-assisted device-to-device (d2d) discovery
CN106412801A (en) * 2016-08-31 2017-02-15 西安电子科技大学 Video frame structure and D2D communication based video multicast method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"Social-Aware Peer Discovery for D2D Communications Underlaying Cellular Networks";Bentao Zhang et al;《TRANSACTIONS ON WIRELESS COMMUNICATIONS》;20150530;全文 *
"Social-Aware Video Multicast Based on Device-to-Device Communications";Yang Cao et al;《TRANSACTIONS ON MOBILE COMPUTING》;20160630;全文 *
"D2D中基于社交关系的按需用户发现策略";王磊等;《信号处理》;20150930;全文 *
"D2D协作通信网络中基于社交信息的中继选择和功率分配";徐少毅等;《电子与信息学报》;20170531;全文 *

Also Published As

Publication number Publication date
CN107302747A (en) 2017-10-27

Similar Documents

Publication Publication Date Title
CN105960024B (en) User&#39;s discovery and resource allocation methods in a kind of D2D communication based on social activity perception
Wu et al. Socially aware energy-efficient mobile edge collaboration for video distribution
Zhang et al. Social-aware D2D pairing for cooperative video transmission using matching theory
Shen et al. Device-to-device-assisted communications in cellular networks: An energy efficient approach in downlink video sharing scenario
Li et al. A QoS-oriented distributed routing protocol for hybrid wireless networks
Yan et al. Socially aware trust framework for multimedia delivery in D2D cooperative communication
CN110337092B (en) Low-power-consumption relay selection method based on social trust model
Xu et al. Network coding for data delivery in caching at edge: Concept, model, and algorithms
Ahmed et al. Video transmission using device-to-device communications: A survey
Jin et al. A channel aware MAC protocol in an ALOHA network with selfish users
CN107302747B (en) Cooperative video transmission method based on stable matching
Yaqub et al. Asking neighbors a favor: Cooperative video retrieval using cellular networks in VANETs
Blodt Efficient end system multicast for mobile ad hoc networks
CN109640298B (en) Mobile D2D content sharing method and system based on alliance formation game
CN105430700A (en) Wireless local area network mobility management method based on multi-virtual-access-point associated access
Zhao et al. Social‐Aware Cooperative Video Distribution via SVC Streaming Multicast
Ullah et al. Layered video communication in ICN enabled cellular network with D2D communication
Liu et al. Multi-cell MEC space partition and dynamic adjustment scheme for VR video transmission
Sekar Cross-layer design for energy efficient multicast video transmission over mobile ad hoc networks
Wang et al. Adaptive VR video data transmission method using mobile edge computing based on AIoT cloud VR
Irum et al. Network-coded cooperative communication in virtualized mobile small cells
Rocha et al. BitCover: Enhanced BitTorrent for interactive VoD streaming over 5G and WiFi-Direct
Diaz et al. A new multimedia–oriented architecture and protocol for wireless ad hoc networks
Jiao et al. Energy-Efficient Cooperative Scalable Video Distribution and Sharing in Mobile Social Networks
WANG et al. Survey on caching technology in mobile edge networks

Legal Events

Date Code Title Description
PB01 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