CN107820256B - Data transmission method based on D2D regional distribution technology - Google Patents

Data transmission method based on D2D regional distribution technology Download PDF

Info

Publication number
CN107820256B
CN107820256B CN201711119819.XA CN201711119819A CN107820256B CN 107820256 B CN107820256 B CN 107820256B CN 201711119819 A CN201711119819 A CN 201711119819A CN 107820256 B CN107820256 B CN 107820256B
Authority
CN
China
Prior art keywords
node
cluster
data
cluster head
user
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
CN201711119819.XA
Other languages
Chinese (zh)
Other versions
CN107820256A (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.)
Shanghai Dianji University
Original Assignee
Shanghai Dianji 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 Shanghai Dianji University filed Critical Shanghai Dianji University
Priority to CN201711119819.XA priority Critical patent/CN107820256B/en
Publication of CN107820256A publication Critical patent/CN107820256A/en
Application granted granted Critical
Publication of CN107820256B publication Critical patent/CN107820256B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • 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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Landscapes

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

Abstract

The invention discloses a data transmission method based on a D2D regional distribution technology, which is based on a multicast D2D communication scene, and completes the high-efficiency transmission of data by constructing a clustered D2D network through multiple receivers. The data distribution of the receiver far away from the data source is realized, and the good effect of improving the network data transmission efficiency through an efficient clustering method is achieved. The current situation that the transmission efficiency is influenced due to the fact that the data transmission can only be carried out on the D2D receiver which can be communicated with the data source in the prior art and the parallel transmission quantity is large is overcome, and the better transmission effect is achieved.

Description

Data transmission method based on D2D regional distribution technology
Technical Field
The invention relates to a data transmission method in a device-to-device direct communication technology (D2D), in particular to an inter-device network structure establishment and an efficient data transmission algorithm in a communication process.
Background
Various network optimization simply takes optimization scheduling carried out by traditional physical resources such as frequency spectrum, power, time slot and the like as an optimization means, and few researches are carried out on multicast distribution transmission and multicast relations. And the analysis is not performed from the aspects of user homogeneity, collaboration willingness and the like. In more cases, the D2D technology is used for multicast transmission, and factors such as the number of users in a cell, user traffic, user mobility, and user wishes should be considered, which can greatly affect the transmission efficiency of the network.
Disclosure of Invention
The invention aims to overcome the problems and provides a data transmission method based on a D2D regional distribution technology, which is used for establishing a D2D communication propagation model based on regional distribution aiming at scenes with dense personnel, small regions and concentrated demands, and researching the construction of regional distribution clusters and the transmission strategy of regional distribution according to the scenes to improve the network efficiency.
The invention provides a compression coding method of approximate images, which comprises the following steps:
firstly, establishing a neighbor relation, namely establishing the network neighbor relation by adopting a method of jointly determining whether to connect or not by using average connection time and interval frequency. Suppose that the continuous communication time length of the node i and the node j is Li,jThe observation time length is T, and the interrupt times of the node i and the node j are Ni,jThen Li,jSatisfy the requirement of
Figure BDA0001467098050000021
Wherein deltai,j(t) is the shock function. When node i and nodeWhen the point j is in a communicable state, δi,j(t) 1, δ when both nodes are not in a predetermined communication statei,j(t) is 0. After the average connection duration is normalized by the Gaussian similarity function, the weight w between the node i and the node jijSatisfy the requirement of
Figure BDA0001467098050000022
Wherein mu is a scale parameter of the connection time; frequency of interruptions between node i and node j
Figure BDA0001467098050000023
Satisfy the requirement of
Figure BDA0001467098050000024
Where λ is the adjustment coefficient, the weight w between node i and node jijSatisfy the requirement of
Figure BDA0001467098050000025
Weighted value w of all nodes by base stationijPerforming descending ranking, wherein a data processing module selects a plurality of nodes in the sequence to establish a neighbor relation to form a network structure topology; while
Figure BDA0001467098050000026
The connection intention between the node i and the node j is shown, and the longer the connection time is, the more the data transmission time of the two nodes is proved to be. But the connection duration can not determine the link jitter condition, so the weight of the interrupt interval frequency is increased
Figure BDA0001467098050000027
Figure BDA0001467098050000028
Indicates the number of times of communication interruption of two nodes in unit timeThe occupancy in all neighbors, this indicator determines how stable the node communication is. When w isijThe larger the size, the better the conditions that can be communicated between node i and node j are demonstrated. We prefer to establish a neighbor relationship between these two nodes.
And secondly, selecting cluster head nodes, and after the data source completes the first multicast, dividing users under the jurisdiction of the base station into two types, wherein one type is a user capable of completing data reception, and the other type is a user incapable of completing data reception. The data processing module determines that the candidate cluster head node is selected from M users under the jurisdiction of the base station which can complete data receiving, wherein M is expressed as
M＝{θmm}
Wherein theta is when the user can receive the datam1, otherwise θm0; and observing the signal-to-noise ratio conditions of the M candidate cluster heads, selecting the M candidate cluster heads of the user meeting the conditions, and then obtaining the transmitting power P of the data source nodeSChannel gain G from source node to candidate cluster head nodeS,mNoise N0Interference of cellular system to user amThreshold T of signal-to-noise ratio0Satisfy the requirement of
Figure BDA0001467098050000031
And obtaining a cluster head node set CH ═ CH1,CH2,…,CHM}; and other D2D users access the appropriate cluster head under the control of the base station, complete the cluster division and receive data from the cluster head.
Thirdly, dividing convergence, wherein the signal-to-noise ratio of the cluster head node i to one neighbor non-cluster head node of the cluster head node i meets the requirement
Figure BDA0001467098050000032
Wherein, PiFor transmitting power of cluster head node i, Gi,jChannel gain for cluster head to member node j, N0Is white noise; since the data distribution channel uses a dedicated channel, it is generated without considering channel multiplexingThe interference impact of the cellular user on D2D user, so the throughput from user i to user j can be calculated as
Cij＝log2(1+SNRi,j)
Since the throughput is limited to the worst channel state under multicast distribution, the transmission rate of the cluster head is
Ci＝min{Ci,1,Ci,2,…,Ci,N}
In order to save network resources, only the situation that the nodes belong to different cluster head coverage areas needs to be examined, and finally the nodes are allocated to which cluster. Then when the number of cluster heads is M and the number of non-cluster heads is N, the maximum data throughput is expressed as when each non-cluster head node can and can only belong to one cluster
Figure BDA0001467098050000041
The D2D cluster is allocated at this throughput.
Further, after weight calculation is completed for the connection between the nodes, a weight topology of the network is obtained. In order to avoid that the connection number of some nodes is too large to influence the overall communication quality, one of the two nodes with medium intensity needs to make a probabilistic selection to finally determine whether to establish the connection. Therefore, the step of establishing the neighbor relation further comprises a probabilistic selection process, wherein the connection probability pi of the probabilistic selection processijThe relationship between the edge weight and the sum of the weights of all the adjacent edges of the node i satisfies
Figure BDA0001467098050000042
That is, the higher the weight of the connected edge is, the higher the probability of establishing the neighbor relation is. Alpha is an adjustable parameter that can adjust the importance of the weights.
Further, although m users meet the requirement on the channel condition, if the cluster head is too many, the phenomenon of reducing the transmission efficiency due to contention for the limited D2D channel still occurs. Therefore, a cluster head node selection stepThe method also comprises a user number limiting process, when m users meet the requirement, the data processing module presets a critical reference value R0More than or equal to 1, the node degree k of the node i is more than R0Then, node user i is selected as a cluster head node, wherein the critical value r satisfies
Figure BDA0001467098050000043
Further, for smooth communication, when there is a node that cannot be connected to the base station and the cluster head node, the data processing module selects a node that can contact the base station and the node point as a cluster head, and re-converges the cluster structure.
Further, when the node user is not connected to any cluster head node and cannot directly receive data from the base station, the data processing module determines a node capable of being connected to the node user and receiving data of the base station as a cluster head, so as to ensure communication connection.
Drawings
Fig. 1 is a flow chart of the cooperative multicast data distribution strategy of D2D of the present invention.
Detailed Description
In order to make the technical means, creation features, achievement purposes and effects of the invention easy to understand, the implementation process of the technical scheme is further described below.
As shown in the figure, the data transmission method based on the D2D regional distribution technology includes the following steps of D2D cluster allocation:
1. based on the network structure topology and the cluster head selection result, firstly dividing all neighbors of the cluster head to the cluster head as cluster members;
2. and the cluster head calculation obtains channel and node parameters according to the interaction with the pre-distribution members, calculates the throughput condition of the cluster in a unified way, and feeds back the throughput condition to the pre-distribution cluster members.
3. The non-cluster-head node determines to add a cluster with high transmission rate according to the transmission rate condition fed back by a plurality of cluster heads to which the node belongs, and returns a decision result;
4. if the channels with consistent throughput exist, adding the cluster with smaller cluster head degree;
5. if the network state of the node is changed, repeating the steps to finish the attribution adjustment of the cluster members.
According to the above strategy, we complete the partitioning of the clusters and guarantee the conditional maximization of the network throughput at the current moment.
After the D2D user cluster based on the neighbor relation is constructed, regional data distribution which maximizes network throughput is realized. In the data distribution process, the base station firstly performs resource allocation for the user through the structure planning in the first stage, and in the second stage, the base station does not participate in the data distribution any more but is in a monitoring state. When some users are far away from the base station and other users, the users can neither obtain the distributed data from the original cluster head nor initiate the network change of the re-attributing cluster, and at this time, the base station needs to allocate a dedicated resource for the user, and the data of the data source node is forwarded by the base station. The complete D2D collaborative multicast data distribution strategy is shown in fig. 1.
The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are given by way of illustration of the principles of the present invention, and that various changes and modifications may be made without departing from the spirit and scope of the invention as defined by the appended claims. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (5)

1. A data transmission method based on D2D regional distribution technology is characterized by specifically comprising the following steps:
1) establishing a neighbor relation, and assuming that the continuous communication time length of the node i and the node j is Li,jThe observation time length is T, and the interrupt times of the node i and the node j are Ni,jThen Li,jSatisfy the requirement of
Figure FDA0002873985230000011
Wherein deltai,j(t) is an impact function, δ when node i and node j are in a communicable statei,j(t) 1, δ when both nodes are not in a predetermined communication statei,j(t) ═ 0; after the average connection duration is normalized by the Gaussian similarity function, the weight w between the node i and the node jijSatisfy the requirement of
Figure FDA0002873985230000012
Wherein mu is a scale parameter of the connection time; frequency of interruptions between node i and node j
Figure FDA0002873985230000013
Satisfy the requirement of
Figure FDA0002873985230000014
Where λ is the adjustment coefficient, the weight w between node i and node jijSatisfy the requirement of
Figure FDA0002873985230000015
Weighted value w of all nodes by base stationijPerforming descending ranking, wherein a data processing module selects a plurality of nodes in the sequence to establish a neighbor relation to form a network structure topology;
2) selecting cluster head nodes, determining candidate cluster head nodes from M users under the jurisdiction of the base station capable of completing data reception by a data processing module, wherein M is expressed as
M＝{θmm}
Wherein theta is when the user can receive the datam1, otherwise θm0; and observing the SNR conditions of the M candidate cluster heads, selecting the user M candidate cluster heads meeting the conditions, and then the data source nodeTransmission power PSChannel gain G from source node to candidate cluster head nodeS,mNoise N0Interference of cellular system to user amThreshold T of signal-to-noise ratio0Satisfy the requirement of
Figure FDA0002873985230000021
And obtaining a cluster head node set CH ═ CH1,CH2,···,CHM}; other D2D users access to proper cluster heads under the control of the base station, complete the cluster division and receive data from the cluster heads;
3) partition convergence, the SNR of the cluster head node i to one of its neighbor non-cluster head nodes is satisfied
Figure FDA0002873985230000022
Wherein, PiFor transmitting power of cluster head node i, Gi,jChannel gain for cluster head to member node j, N0Is white noise; the throughput from user i to user j is
Cij＝log2(1+SNRi,j)
The transmission rate of the cluster head is
Ci＝min{Ci,1,Ci,2,···,Ci,N}
When the number of cluster heads is M and the number of non-cluster heads is N, the maximum data throughput is expressed as M when it is determined that each non-cluster-head node can only belong to one cluster
Figure FDA0002873985230000023
And allocates the D2D cluster at that throughput.
2. The data transmitter based on D2D area distribution technology of claim 1The method is characterized in that the step of establishing the neighbor relation also comprises a probabilistic selection process, wherein the connection probability pi of the probabilistic selection processijThe relationship between the edge weight and the sum of the weights of all the adjacent edges of the node i satisfies
Figure FDA0002873985230000024
Where α is an adjustable parameter.
3. The data transmission method according to claim 1, wherein the cluster head node selection step further comprises a user number limiting process, and when m users meet the requirement, the data processing module presets a critical reference value R0More than or equal to 1, the node degree k of the node i is more than R0Then, node user i is selected as a cluster head node, wherein the critical value r satisfies
Figure FDA0002873985230000031
4. The data transmission method of claim 1, wherein when there is a node that cannot connect to the base station and the cluster head node, the data processing module selects a node that can connect to the base station and the node point as the cluster head and re-converges the cluster structure.
5. The data transmission method according to claim 1, wherein when the node user is not connected to any cluster head node and cannot receive data directly from the base station, the data processing module determines a node capable of being connected to the node and receiving data of the base station as the cluster head.
CN201711119819.XA 2017-11-14 2017-11-14 Data transmission method based on D2D regional distribution technology Active CN107820256B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711119819.XA CN107820256B (en) 2017-11-14 2017-11-14 Data transmission method based on D2D regional distribution technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711119819.XA CN107820256B (en) 2017-11-14 2017-11-14 Data transmission method based on D2D regional distribution technology

Publications (2)

Publication Number Publication Date
CN107820256A CN107820256A (en) 2018-03-20
CN107820256B true CN107820256B (en) 2021-05-07

Family

ID=61609162

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711119819.XA Active CN107820256B (en) 2017-11-14 2017-11-14 Data transmission method based on D2D regional distribution technology

Country Status (1)

Country Link
CN (1) CN107820256B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108847993B (en) * 2018-07-20 2021-01-15 中电科新型智慧城市研究院有限公司 Link prediction method based on multi-order path intermediate node resource allocation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102438298A (en) * 2011-11-09 2012-05-02 无锡南理工科技发展有限公司 Trusted energy-saving data convergence method for wireless sensor network
CN102858012A (en) * 2012-09-17 2013-01-02 西安电子科技大学 Subsequent evolution embedded D2D(device-to-device) implementing method on basis of IMT-A (intelligent multimode terminal-advanced) standards
CN103428642A (en) * 2013-07-16 2013-12-04 北京邮电大学 Intra-cluster device-to-device (D2D) multicast method based on relay
CN106507316A (en) * 2016-11-02 2017-03-15 西安邮电大学 User's sub-clustering and resource allocation methods under a kind of D2D multicasts scene

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9763208B2 (en) * 2014-03-21 2017-09-12 Samsung Electronics Co., Ltd. Method and apparatus for supporting synchronization in D2D communication

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102438298A (en) * 2011-11-09 2012-05-02 无锡南理工科技发展有限公司 Trusted energy-saving data convergence method for wireless sensor network
CN102858012A (en) * 2012-09-17 2013-01-02 西安电子科技大学 Subsequent evolution embedded D2D(device-to-device) implementing method on basis of IMT-A (intelligent multimode terminal-advanced) standards
CN103428642A (en) * 2013-07-16 2013-12-04 北京邮电大学 Intra-cluster device-to-device (D2D) multicast method based on relay
CN106507316A (en) * 2016-11-02 2017-03-15 西安邮电大学 User's sub-clustering and resource allocation methods under a kind of D2D multicasts scene

Also Published As

Publication number Publication date
CN107820256A (en) 2018-03-20

Similar Documents

Publication Publication Date Title
CN106507316B (en) User's sub-clustering and resource allocation methods under a kind of D2D multicast scene
CN108462950B (en) NOMA-based D2D communication combined sub-channel and power distribution method
CN105960024B (en) User's discovery and resource allocation methods in a kind of D2D communication based on social activity perception
CN101951307B (en) Method for selecting cell cooperation set under CoMP
CN107466099B (en) Interference management self-optimization method based on non-orthogonal multiple access
WO2022021520A1 (en) Non-orthogonal multiple access power distribution method and system
CN102695131B (en) Distributed power control method in cognitive network on basis of cooperative game
CN107197423B (en) Capacity-oriented D2D multicast resource allocation method
CN105813129A (en) Resource allocation method based on D2D clustering
CN113411105B (en) AP selection method of non-cell large-scale antenna system
CN107690168B (en) Extensible networking method for wireless sensor network
CN107708157A (en) Intensive small cell network resource allocation methods based on efficiency
CN111629352B (en) V2X resource allocation method based on Underlay mode in 5G cellular network
CN107343268B (en) Non-orthogonal multicast and unicast transmission beamforming method and system
CN106658523B (en) Recognize the distributed topology approach that K channel-connectivity is constructed in AdHoc network
Ahmed et al. Video transmission using device-to-device communications: A survey
WO2012171362A1 (en) Method and device for establishing coordinated multi-point transmission cell coordination set
Zafar et al. An efficient resource optimization scheme for D2D communication
da Silva et al. D2d assisted q-learning random access for noma-based mtc networks
CN102355699B (en) Adaptive resource allocation method for multicast/broadcast single frequency network (MBSFN)
CN113873658A (en) Hopping beam resource allocation method taking user service weight gain as objective function
CN107820256B (en) Data transmission method based on D2D regional distribution technology
CN110114983B (en) Apparatus and method for supporting user communication device grouping in a communication network
Aslam et al. Performance analysis of clustering algorithms for content-sharing based D2D Enabled 5G networks
Moghaddam et al. Efficient clustering for multicast device-to-device communications

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