技术领域technical field
本发明涉及无线通信技术领域，尤其涉及一种基于中继的簇内D2D多播方法。The present invention relates to the technical field of wireless communication, in particular to a relay-based intra-cluster D2D multicast method.
背景技术Background technique
随着3GPP技术及多媒体业务的发展，网络中涌现大量的低能耗，具备计算、存储功能的移动终端，数据业务日益呈现多样化、多媒体化、移动性和位置相关化等特点。业务的发展对网络优化及管理能力、网络运行质量、合作伙伴管理能力、面向客户的QOE与QOS等方面提出了更高的要求。With the development of 3GPP technology and multimedia services, a large number of mobile terminals with low energy consumption and computing and storage functions are emerging in the network, and data services are increasingly characterized by diversification, multimedia, mobility and location correlation. Business development puts forward higher requirements on network optimization and management capabilities, network operation quality, partner management capabilities, and customer-oriented QOE and QOS.
长期演进（LTE，LongTermEvolution）系统是一个基于调度的通信系统。在蜂窝通信模式下，用户通过控制信道接入基站（RNC/eNB）获得授权资源并进行数据传输。由于用户之间的信息交流需要通过基站中转，当大量终端需接入网络时，会导致数据请求拥挤，使基站面临较大的业务挑战及压力。尤其在面对小范围内大量用户间数据共享及交互需求时，采用重复点到基站的通信方式，会严重浪费网络带宽。多播可以提高传输效率和网络性能。此模式下，基站利用聚簇将网络中具有相似通信需求的用户聚集到同一个簇中进行服务。例如当大量共享用户终端需彼此交换数据信息的时候，基站为每个用户分配独立的上行信道（UL，UpLink）并进行数据汇总，然后多播给每个用户。然而使用传统的基站多播模式，并不能缓解用户间数据共享场景下上行资源的冲突，被服务的用户数目会因基站处理速度、能力受到限制。The Long Term Evolution (LTE, LongTermEvolution) system is a communication system based on scheduling. In the cellular communication mode, the user accesses the base station (RNC/eNB) through the control channel to obtain authorized resources and perform data transmission. Since the information exchange between users needs to be transferred through the base station, when a large number of terminals need to access the network, it will cause data request congestion, which will make the base station face greater business challenges and pressure. Especially in the face of data sharing and interaction requirements among a large number of users in a small area, the use of repeated point-to-base station communication will seriously waste network bandwidth. Multicast can improve transmission efficiency and network performance. In this mode, the base station uses clustering to gather users with similar communication requirements in the network into the same cluster for service. For example, when a large number of shared user terminals need to exchange data information with each other, the base station allocates an independent uplink channel (UL, UpLink) for each user and summarizes the data, and then multicasts to each user. However, using the traditional base station multicast mode cannot alleviate the conflict of uplink resources in the data sharing scenario between users, and the number of served users will be limited due to the processing speed and capability of the base station.
D2D（Device-to-Device）通信的信息传输不经过基站，用户可以复用上下行授权资源进行直接通信。D2D技术的引入可以增加频谱利用率，减小基站负载，增大网络吞吐量和覆盖范围。然而仅仅利用一对一的D2D通信在数据共享环境下不仅会带来数据的冗余传输，也会引入D2D对之间的干扰。The information transmission of D2D (Device-to-Device) communication does not pass through the base station, and users can multiplex uplink and downlink authorized resources for direct communication. The introduction of D2D technology can increase spectrum utilization, reduce base station load, and increase network throughput and coverage. However, only using one-to-one D2D communication in a data sharing environment will not only lead to redundant transmission of data, but also introduce interference between D2D pairs.
为节省网络资源，提高吞吐量，改善用户体验，当小范围内用户有数据共享需求时，目前主要采用以下的解决方案：In order to save network resources, increase throughput, and improve user experience, when users in a small area have data sharing needs, the following solutions are currently mainly used:
缓存融合（cacheintergration）：基于终端对数据的访问量，缓存节点（cachepeer）存储兴趣度比较大的数据包。若用户需要的数据包在存储范围内，用户终端直接从缓存节点处下载，否则仍向基站索取。Cache integration (cache integration): Based on the amount of access to data by the terminal, the cache node (cachepeer) stores data packets with relatively high interest. If the data package required by the user is within the storage range, the user terminal directly downloads it from the cache node, otherwise it still asks for it from the base station.
D2D（Device-to-Device）多播：基站辅助构建簇，各用户轮流充当簇头，通过D2D多播的方式实现用户间的信息共享。簇头根据多播用户的链路质量选择传输速率。D2D (Device-to-Device) multicast: The base station assists in building clusters, each user takes turns acting as a cluster head, and information sharing between users is realized through D2D multicast. The cluster head selects the transmission rate according to the link quality of the multicast users.
以上方案充分利用了终端节点间的通信提高网络性能。由于多用户间的传输不需基站（BS）介入或是仅仅通过BS传输辅助信令信息，该方案能够释放下行频谱、减小基站负载，使更多的用户接入网络。但是上述数据共享方案一方面存在用户公平性问题：个别用户承担服务器功能，压力大，公平性差；另一方面，多播速率受最差链路质量限制，个别质量差的链路会影响整体的传输效率。基于此，中继传输引入到D2D多播过程中，方法如下：The above solutions make full use of the communication between terminal nodes to improve network performance. Since the transmission between multiple users does not require the intervention of the base station (BS) or only transmits auxiliary signaling information through the BS, this solution can release the downlink spectrum, reduce the load of the base station, and enable more users to access the network. However, on the one hand, the above-mentioned data sharing scheme has the problem of user fairness: some users assume the server function, and the pressure is high, and the fairness is poor; on the other hand, the multicast rate is limited by the worst link quality, and individual links with poor quality will affect the overall transmission efficiency. Based on this, the relay transmission is introduced into the D2D multicast process, and the method is as follows:
移动自组织网络（MANET）：网络中的移动终端具有路由和分组转发功能，网络信息交换采用了计算机网络中的分组交换机制，既可以作为单独的网络独立工作，也可以以末端子网的形式接入现有网络。Mobile Ad Hoc Network (MANET): The mobile terminals in the network have routing and packet forwarding functions. The network information exchange adopts the packet switching mechanism in the computer network. It can work independently as a separate network or in the form of a terminal subnet. Access to existing networks.
遍历查询：根据节点状态，基站轮询每个节点作为中继的效果，保证用户正确接收多播信息的前提下，选择合适中继最小化总的发射功率。Traverse query: According to the node status, the base station polls each node as a relay effect, and selects the appropriate relay to minimize the total transmission power under the premise of ensuring that the user correctly receives the multicast information.
分析上述方案，路由中继的引入增大了传输效率，但却带来了额外的路由维护成本，增加了传输的消耗及复杂度。当服务范围大时，可以以上述中继寻找开销为代价，解决传输中断等问题，而在以增加传输效率为目标的D2D簇范围内，复杂度低的中继选择算法是首选。Analyzing the above solutions, the introduction of routing relays increases transmission efficiency, but brings additional routing maintenance costs and increases transmission consumption and complexity. When the service range is large, the above-mentioned relay search overhead can be used to solve the problem of transmission interruption. However, within the scope of the D2D cluster with the goal of increasing transmission efficiency, a relay selection algorithm with low complexity is the first choice.
发明内容Contents of the invention
（一）要解决的技术问题(1) Technical problems to be solved
本发明要解决的技术问题是：提供一种中继协助多播通信的信息共享方式，使得簇内每个拥有独立信息的用户通过数据多播交互，获得簇中存在的全部资源，并克服多播过程中少数大衰落链路对传输速率的影响，实现网络性能的优化。The technical problem to be solved by the present invention is to provide an information sharing method for relay-assisted multicast communication, so that each user in the cluster with independent information can obtain all the resources in the cluster through data multicast interaction, and overcome multiple The impact of a few large fading links on the transmission rate during the broadcast process is realized to optimize network performance.
（二）技术方案(2) Technical solutions
本发明提供一种基于中继的簇内D2D多播方法，包括：S1：基站将具有数据共享需求并且彼此之间链路损失小的用户划分到一个簇内；S2：基站通过多播将簇内数据分布告知每个用户，并控制各簇内终端探测链路信息；S3：簇内终端节点基于每个数据包的需求量选择信息多播顺序，基于各用户的数据包占有率选择相应发送端，通过分布式多播的方式交换共享数据；S4：与发送端链路质量差的用户通过中继重传得到共享数据。The present invention provides a relay-based intra-cluster D2D multicast method, including: S1: the base station divides users who have data sharing requirements and have small link losses between each other into a cluster; S2: the base station divides the cluster into a cluster through multicast Inform each user of the data distribution in the cluster, and control the terminal detection link information in each cluster; S3: The terminal node in the cluster selects the information multicast sequence based on the demand of each data packet, and selects the corresponding transmission based on the data packet occupancy rate of each user The end exchanges shared data through distributed multicast; S4: users with poor link quality with the sender obtain shared data through relay retransmission.
优选地，用户发送数据共享请求的同时将持有数据包的情况告知基站，并在基站控制下进行链路探测，能够进行D2D通信的用户加入到簇中。Preferably, when the user sends the data sharing request, the user informs the base station of the holding of the data packet, and performs link detection under the control of the base station, and the users capable of D2D communication are added to the cluster.
优选地，用户在基站辅助控制下，获得邻居节点信息及网络数据包分布，据此构建小世界网络模型。Preferably, the user obtains neighbor node information and network data packet distribution under the auxiliary control of the base station, and constructs a small-world network model based on this.
优选地，所述用户在基站辅助控制下，获得邻居节点信息及网络数据包分布，据此构建小世界网络模型包括步骤：基站控制簇成员发送探测信号，新用户监听探测信道，当接收信噪比超过设定阈值门限时，认定发送用户为自身邻居，数据收发通过点到点的直接传输实现，否则，认为链路质量差，信息的传输通过中继转发实现。Preferably, the user obtains neighbor node information and network data packet distribution under the auxiliary control of the base station, and constructing the small-world network model accordingly includes the steps: the base station controls the cluster members to send detection signals, and the new user listens to the detection channel. When the ratio exceeds the set threshold threshold, the sending user is considered to be its own neighbor, and the data is sent and received through point-to-point direct transmission. Otherwise, the link quality is considered to be poor, and the information transmission is realized through relay forwarding.
优选地，每个用户接入簇后，发送探测信号，使得簇内用户获知邻居信息的更新。Preferably, after each user accesses the cluster, a probe signal is sent, so that the users in the cluster know the update of neighbor information.
优选地，基站完成簇用户收集后，将簇内数据包分布告知每个终端，据此用户能够实现分布式的传输终端及中继寻找。Preferably, after the base station completes the cluster user collection, it notifies each terminal of the distribution of data packets in the cluster, so that the user can realize distributed transmission terminal and relay search.
优选地，通过对网络中数据的分布的分析，分布式选择最佳的数据包的多播顺序及发送用户。Preferably, by analyzing the distribution of data in the network, the optimal multicast sequence of data packets and sending users are selected in a distributed manner.
优选地，所述通过对网络中数据分布的分析，分布式选择最佳的数据包的多播顺序及发送用户包括步骤：每个用户根据数据包的分布得到一致的数据发送顺序及发送用户：将数据包按照需求量降序排列，需求量越大，传送优先级越高；发送端的选择基于对持包用户的数据享有率的分析，持包用户的占有数据越少，发送优先级越高。Preferably, through the analysis of data distribution in the network, the distributed selection of the best multicast sequence of data packets and sending users includes the steps: each user obtains a consistent data sending sequence and sending users according to the distribution of data packets: Arrange the data packets in descending order according to the demand. The greater the demand, the higher the transmission priority; the selection of the sender is based on the analysis of the data sharing rate of the user who holds the package. The less data the user owns, the higher the transmission priority.
优选地，簇内多播的控制是分布式的，依赖于每个用户的计算能力。Preferably, the control of intra-cluster multicast is distributed, relying on the computing power of each user.
优选地，当不能保证发送节点与所有用户的链路质量时，链路质量差的用户通过中继重传得到信息，多跳的传输通过邻居节点的逐次转发实现。Preferably, when the link quality between the sending node and all users cannot be guaranteed, users with poor link quality obtain information through relay retransmission, and multi-hop transmission is realized through successive forwarding of neighboring nodes.
优选地，所述当不能保证发送节点与所有用户的链路质量时，链路质量差的用户通过中继重传得到信息，多跳的传输通过邻居节点的逐次转发实现包括步骤：未接收到信息的用户向邻居节点发送数据请求，持有该数据包的邻居节点统计自身接收到的请求数量，并反馈给各个数据请求用户；据此未收到信息的终端选择可以服务最多用户的邻居节点作为中继，即向接收到最多数据请求的邻居用户再次发送数据请求，每个邻居节点根据第二次的数据请求重传信息：接收到一个数据请求，就以单播方式实现D2D通信；如果接收到多个数据请求，就以D2D多播提供数据包；如果仍有用户未能得到数据，则重复上述步骤，经过多跳得到服务，通过中继得到服务的用户向当前数据包的多播发送端反馈成功接收信令。Preferably, when the link quality between the sending node and all users cannot be guaranteed, the user with poor link quality obtains information through relay retransmission, and the multi-hop transmission is realized through successive forwarding of neighboring nodes, including the steps of: not receiving The user of the information sends a data request to the neighbor node, and the neighbor node holding the data packet counts the number of requests received by itself, and feeds back to each data request user; based on this, the terminal that has not received the information selects the neighbor node that can serve the most users As a relay, the data request is sent again to the neighbor user who has received the most data request, and each neighbor node retransmits the information according to the second data request: when a data request is received, D2D communication is realized in unicast mode; if After receiving multiple data requests, provide data packets with D2D multicast; if there are still users who fail to get data, repeat the above steps, get services through multiple hops, and multicast the current data packets to users who get services through relays The sender feedbacks that the signaling has been successfully received.
优选地，当多个中继转发同时存在的时候，复用正交的传输资源。Preferably, when multiple relays exist simultaneously, orthogonal transmission resources are multiplexed.
（三）有益效果(3) Beneficial effects
本发明提供一种中继协助多播通信簇内信息共享的方式，使得簇内每个拥有独立信息的用户通过数据多播交互，获得簇中存在的全部资源，并克服多播过程中少数大衰落链路对传输速率的影响，实现网络性能的优化。The present invention provides a way of relay assisting information sharing in a multicast communication cluster, so that each user in the cluster with independent information can obtain all the resources in the cluster through data multicast interaction, and overcome the small number of large resources in the multicast process. The impact of fading links on the transmission rate realizes the optimization of network performance.
附图说明Description of drawings
为了更清楚地说明本发明实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用附图简单地介绍显而易见地，下面描述中的附图是本发明的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the accompanying drawings that are required in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are of the present invention. For some embodiments, those of ordinary skill in the art can also obtain other drawings based on these drawings without any creative effort.
图1为体现小世界网络特性的用户簇的示意图。其中，簇内的每个用户含有独立的信息；Fig. 1 is a schematic diagram of a user cluster embodying the characteristics of a small-world network. Among them, each user in the cluster contains independent information;
图2为多个中继同时重传的场景示意图；FIG. 2 is a schematic diagram of a scenario where multiple relays retransmit simultaneously;
图3为用户向基站请求接入的信令传输示意图；FIG. 3 is a schematic diagram of signaling transmission for a user to request access to a base station;
图4为本发明实施例的方法流程图。Fig. 4 is a flow chart of the method of the embodiment of the present invention.
具体实施方式detailed description
为了使本发明实施例的目的、技术方案和优点更加清楚，下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整的描述，显然，所描述的实施例是本发明的一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的范围。In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.
如图1～图4所示，本发明提供了一种用户分簇，及簇内中继协助多播的方式。本方案中引入了小世界网络模型，小世界网络中用户享有高聚合度和低链路长度，每个节点拥有邻居信息及目的节点信息。当遇到直连不可达链路时，信息的传输通过逐次的邻居节点转发实现。本方案包括以下步骤：As shown in FIGS. 1 to 4 , the present invention provides a method for user clustering and intra-cluster relay-assisted multicasting. This solution introduces a small-world network model. In a small-world network, users enjoy high aggregation and low link length, and each node has neighbor information and destination node information. When encountering a direct unreachable link, the transmission of information is realized through successive neighbor node forwarding. This protocol includes the following steps:
S1：基站将具有数据共享需求并且彼此之间链路损失小的用户划分到一个簇内，使得同一簇内用户能够实现稳定的D2D通信；S1: The base station divides users who have data sharing requirements and have small link loss between each other into a cluster, so that users in the same cluster can achieve stable D2D communication;
S2：基站通过多播将簇内数据分布告知每个用户，并控制各簇内终端探测链路信息，协助构建小世界网络模型；S2: The base station notifies each user of the data distribution in the cluster through multicast, and controls the terminal detection link information in each cluster to assist in building a small-world network model;
S3：簇内终端节点基于每个数据包的需求量选择信息多播顺序，基于各用户的数据包占有率选择相应发送端，通过分布式多播的方式交换共享数据；S3: The terminal nodes in the cluster select the information multicast sequence based on the demand of each data packet, select the corresponding sender based on the data packet occupancy rate of each user, and exchange shared data through distributed multicast;
S4：与发送端链路质量差的用户通过中继重传得到共享数据。中继的选择以保证信噪比前提下，最大化服务用户数量为目标。S4: Users with poor link quality with the sender obtain shared data through relay retransmission. The selection of relays aims to maximize the number of service users under the premise of ensuring the signal-to-noise ratio.
其中，用户发送数据共享请求的同时将持有数据包的情况告知基站，在基站控制下进行链路探测，能够进行D2D通信的用户加入到簇中。Wherein, when the user sends the data sharing request, the base station is notified of the holding of the data packet, the link detection is performed under the control of the base station, and the users capable of D2D communication are added to the cluster.
其中，用户在基站辅助控制下，获得邻居节点信息及网络数据包分布，据此构建小世界网络模型。Among them, under the auxiliary control of the base station, the user obtains neighbor node information and network data packet distribution, and constructs a small-world network model based on this.
其中，每个用户通过基站的广播获得网络中的数据分布，进而得知索取数据的目的节点。Among them, each user obtains the data distribution in the network through the broadcast of the base station, and then knows the destination node for requesting the data.
其中，通过对网络中数据的分布的分析，分布式选择最佳的数据包的多播顺序及发送用户。多播进程通过信令交互进行控制。Among them, by analyzing the distribution of data in the network, the optimal multicast sequence of data packets and sending users are selected in a distributed manner. The multicast process is controlled through signaling interaction.
其中，簇内多播的控制是分布式的，依赖于每个用户的计算能力。Among them, the control of intra-cluster multicast is distributed and depends on the computing power of each user.
其中，当不能保证发送节点与所有用户的链路质量时，链路质量差的用户通过中继重传得到信息。多跳的传输通过邻居节点的逐次转发实现。Wherein, when the link quality between the sending node and all users cannot be guaranteed, users with poor link quality obtain information through relay retransmission. The multi-hop transmission is realized through successive forwarding of neighbor nodes.
其中，当多个中继转发同时存在的时候，复用正交的传输资源。Wherein, when multiple relays exist at the same time, orthogonal transmission resources are multiplexed.
本发明实施例的实现方式：具有数据共享需求的用户根据网络链路状态构建簇，通过簇内基于中继的D2D协作多播传输，在保证用户公平性前提下实现多用户汇总数据的覆盖。包括如下步骤：The implementation of the embodiment of the present invention: users with data sharing requirements construct clusters according to the network link status, and realize the coverage of multi-user summary data under the premise of ensuring user fairness through relay-based D2D cooperative multicast transmission in the cluster. Including the following steps:
S1：基站将具有数据共享需求并且彼此之间链路损失小的用户划分到一个簇内，使得同一簇内用户能够实现稳定的D2D通信。S1: The base station divides users who have data sharing requirements and have small link loss between each other into a cluster, so that users in the same cluster can realize stable D2D communication.
数据共享用户向基站发送接入请求，并以信令方式通知基站自身持包情况packi，在基站控制下簇内终端发出探测信号，新用户接收到探测信息后，将接受信噪比上传给基站，据此，基站判断其是否可以加入当前簇：The data sharing user sends an access request to the base station, and notifies the base station of its own packet status packi by signaling. Under the control of the base station, the terminal in the cluster sends a detection signal. After the new user receives the detection information, it will receive the signal-to-noise ratio and upload it to Base station, according to which, the base station judges whether it can join the current cluster:
假如当前簇内有n个用户，如果新用户接收到的n个用户的信噪比都大于设定阈值HL，即满足SNRi,new>HL,则其可以加入当前簇；接收到的信噪比大于H的用户，SNRi,new>H,i∈{1,2,…,n}属于其邻居用户。If there are n users in the current cluster, if the signal-to-noise ratios of the n users received by the new user are greater than the set threshold HL , that is, SNRi,new >HL , Then it can join the current cluster; the user whose received signal-to-noise ratio is greater than H, SNRi,new >H, i∈{1,2,...,n} belongs to its neighbor users.
S2：基站通过多播将簇内数据分布告知每个用户，并控制各簇内终端探测链路信息，协助构建小世界网络模型。S2: The base station notifies each user of the data distribution in the cluster through multicast, and controls the terminal detection link information in each cluster to assist in building a small-world network model.
用户接入簇后，在基站控制下发送探测信息，据此通知邻居用户自身的存在，使得邻居用户更新本地信息。neighi表示用户i的邻居信息，After the user accesses the cluster, the detection information is sent under the control of the base station, and the neighboring users are notified of their own existence, so that the neighboring users update the local information. neighi represents the neighbor information of user i,
经过固定时间周期的用户收集后，基站得知网络含有的汇总数据包，及包的分布S，假设簇中有N个用户和M个不同的数据包：After a fixed time period of user collection, the base station knows the summary data packets contained in the network, And the distribution S of packets, assuming that there are N users and M different packets in the cluster:
bij=1表示第j个用户有第i个包，bij=0表示没有该数据包。基站将此信息下发给簇内用户。bij =1 indicates that the jth user has the i-th package, and bij =0 indicates that there is no such data package. The base station sends this information to the users in the cluster.
以上信息构成了小世界网络中节点的本地信息。小世界网络模型可以用于中继的寻找：当直连链路不可达时候，通过邻居节点逐步转发，实现信息传输。The above information constitutes the local information of the nodes in the small world network. The small-world network model can be used to search for relays: when the direct link is unreachable, the neighbor nodes forward gradually to realize information transmission.
S3：簇内终端节点基于每个数据包的需求量选择信息多播顺序，基于各用户的数据包占有率选择相应发送端，通过分布式多播的方式交换共享数据。S3: The terminal nodes in the cluster select the information multicast sequence based on the demand of each data packet, select the corresponding sender based on the data packet occupancy rate of each user, and exchange shared data through distributed multicast.
簇内所有用户都掌握包的分布信息，每个终端节点据此计算得到相同的包的传输顺序以及相应的发送端。如下：All users in the cluster have the distribution information of the packets, and each terminal node calculates the transmission order of the same packets and the corresponding sender accordingly. as follows:
通过分析S得到每个数据包的占有量：K={k1,k2,…km}，其中表示含有第i个数据包的用户个数，将之升序排列得到K'，对比K和K'信息得到包的传输顺序Q:令r取遍1到M，K'中第r个元素在K中的位置对应Q的第r个元素。The occupancy of each packet is obtained by analyzing S: K={k1 ,k2 ,…km }, where Indicates the number of users containing the i-th data packet, and arranges them in ascending order to obtain K', and compares the information of K and K' to obtain the transmission sequence Q of the packets: let r take 1 to M, and the r-th element in K' is in K The position in corresponds to the rth element of Q.
对于Q中第qi个数据包，找相应发送用户的原则：持有该数据包的用户中持包量最少的节点需要从网络中获得的数据最多，为公平起见，我们令其进行多播服务。遍历S中第qi行，得到有该数据包的用户集合W={i1,i2,…,ic},i1,i2,…,ic≤n，对于W中元素，计算找到使得sj最小的第j个用户即是该数据包的发送端。数据包分发顺序及相应发送用户构成基本的数据包分发信息。For the qi -th data packet in Q, the principle of finding the corresponding sending user: among the users holding the data packet, the node with the least amount of packets needs to obtain the most data from the network. For the sake of fairness, we let it multicast Serve. Traverse the qi line in S to get the user set W={i1 ,i2 ,…,ic },i1 ,i2 ,…,ic ≤n with the data packet, for the elements in W, calculate The jth user who finds the smallest sj is the sender of the data packet. The data packet distribution order and the corresponding sending users constitute the basic data packet distribution information.
每个用户都通过计算得到相同的数据包分发信息，因而多播过程可以通过信令的交互控制进程。一个数据包的广播过程中，不需要数据的用户保持静默。发送用户首先发出信息接入请求，接收方探测接收信噪比，大于阈值H的用户（即邻居用户）选择直接接收，并反馈链路情况。其余的用户（即非邻居用户）不反馈。发送方根据用户反馈的链路信息调整多播传输速率，并默认每个邻居用户都可以准确接受到信息。发送端的非邻居用户在下一个时隙向自身邻居节点索要数据包，通过中继重传得到服务，同时为保证信息的正确接收，令其收到数据包后反馈给发送方一个ACK信令信息。发送方收集到所有非邻居用户的ACK反馈后，以信令的方式通知下一个发送用户启动下一个多播进程。以此，通过用户间的信令交互及本地信息，实现多播过程的分布式控制。Each user obtains the same data packet distribution information through calculation, so the multicast process can control the process through the interaction of signaling. During the broadcast of a data packet, users who do not need data remain silent. The sending user first sends an information access request, and the receiver detects the receiving signal-to-noise ratio, and the users (that is, neighbor users) that are greater than the threshold H choose to receive directly and feedback the link status. The remaining users (ie, non-neighbor users) do not respond. The sender adjusts the multicast transmission rate according to the link information fed back by the user, and defaults that each neighboring user can receive the information accurately. The non-neighboring users at the sending end ask for data packets from their neighbor nodes in the next time slot, and get the service through relay retransmission. At the same time, in order to ensure the correct reception of information, they are asked to feed back an ACK signaling message to the sender after receiving the data packets. After collecting the ACK feedbacks of all non-neighboring users, the sender notifies the next sending user to start the next multicast process by means of signaling. In this way, distributed control of the multicast process is realized through signaling interaction and local information between users.
在多播过程中为保证所有用户的正确接收，传输速率基于最差链路路损情况，记U为需要数据包i的用户集合，k为选择的发送端，考虑信道增益g，D2D用户和蜂窝用户发射功率Pd，Pc，D2D用户收到的干扰Inf，噪声N及信道带宽B，利用香农定理可将传输速率表示为：In order to ensure the correct reception of all users in the multicast process, the transmission rate is based on the worst link path loss. U is the set of users who need data packet i, and k is the selected sender. Considering the channel gain g, D2D users and Cellular user transmit power Pd , Pc , interference Inf received by D2D users, noise N and channel bandwidth B, using Shannon's theorem, the transmission rate can be expressed as:
引入中继后，网络的多播速率得到改善：After introducing the relay, the multicast rate of the network is improved:
S4：与发送端链路质量差的用户通过中继重传得到共享数据。中继的选择以保证信噪比前提下，最大化服务用户数量为目标。S4: Users with poor link quality with the sender obtain shared data through relay retransmission. The selection of relays aims to maximize the number of service users under the premise of ensuring the signal-to-noise ratio.
当用户不能直接从多播过程得到信息时，会向自身邻居节点索取数据包，并通过持有数据包的邻居用户的重传，得到信息。重传过程如下：未接收到信息的终端向邻居用户发送数据请求；所有持有该数据包的邻居用户接收到请求信息后，计算自身可以服务的用户数量，并将数量信息反馈给每个向自身发送数据请求的终端。未接收到数据的终端对比邻居用户反馈回来的信息，向一个可以同时服务最多用户的邻居请求信息，并提交链路情况；邻居节点根据反馈回来的链路情况，调整重传单播或是多播速率，进行中继重传：如果中继节点接收到一个数据请求信息，则提供D2D单播服务；如果接收到多个数据请求信息，则发送多播服务。When a user cannot directly obtain information from the multicast process, it will request data packets from its own neighbor nodes, and obtain information through the retransmission of neighbor users who hold data packets. The retransmission process is as follows: the terminal that has not received the information sends a data request to the neighbor user; after receiving the request information, all the neighbor users who hold the data packet calculate the number of users they can serve, and feed back the quantity information to each direction An endpoint that itself sends data requests. The terminal that has not received the data compares the information fed back by the neighbor users, requests information from a neighbor that can serve the most users at the same time, and submits the link status; the neighbor node adjusts the retransmission unicast or multicast according to the feedback link status Rate, perform relay retransmission: if the relay node receives one data request message, it will provide D2D unicast service; if it receives multiple data request messages, it will send multicast service.
接收到数据包的用户反馈给发送端一个ACK信息。如果仍有用户未接收到数据包，则回到向邻居用户发送数据请求步骤，在下一时隙进一步寻找转发中继；经过2次中继请求后，仍得不到当前数据信息的用户向发送端请求增大功率发射数据包。The user who receives the data packet feeds back an ACK message to the sender. If there are still users who have not received the data packets, return to the step of sending data requests to neighboring users, and further search for forwarding relays in the next time slot; after 2 relay requests, users who still cannot get the current data information send Request increased power to transmit packets.
引入中继后，使用DF（decodeandforward）方式传输，考虑中继及终端接收到的SINR（signalandinterferencenoiseratio）SINRr，SINRd，接收速率为After introducing the relay, use the DF (decode and forward) method for transmission, considering the SINR (signalandinterferencenoiseratio) SINRr and SINRd received by the relay and the terminal, the receiving rate is
如图2所示，当多个中继重传同时发生的时候，为其分配正交的复用资源，以避免D2D用户之间的干扰。As shown in Figure 2, when multiple relays retransmit simultaneously, they are assigned orthogonal multiplexing resources to avoid interference between D2D users.
本发明提供一种根据兴趣度及距离特征进行用户分簇及簇内信息传输的方式。最终通过多用户协调通信实现网络性能的优化。The invention provides a method for performing user clustering and intra-cluster information transmission according to interest degree and distance characteristics. Finally, the optimization of network performance is realized through multi-user coordinated communication.
本领域普通技术人员可以理解：实现上述实施例的全部或部分步骤可以通过程序指令相关的硬件来完成，前述的程序可以存储于一计算机可读取存储介质中，该程序在执行时，执行包括上述实施例的步骤；而前述的存储介质包括：ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。Those of ordinary skill in the art can understand that all or part of the steps for realizing the above-mentioned embodiments can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the execution includes The steps of the above-mentioned embodiments; and the above-mentioned storage media include: various media capable of storing program codes such as ROM, RAM, magnetic disk or optical disk.
最用应说明的是：以上实施例仅用于说明本发明的技术方案，而非对其限制；尽管参照前述实施例对本发明进行了详细的说明，本领域普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中的部分技术特征进行等同替换；而这些修改或者替换，并不时相应技术方案的本质脱离本发明各实施例技术方案的精神和范围。It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than limiting them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still be Modifications are made to the technical solutions described in the foregoing embodiments, or equivalent replacements are made to some of the technical features; and these modifications or replacements do not deviate from the spirit and scope of the technical solutions of the embodiments of the present invention from time to time.
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310297127.XACN103428642B (en) | 2013-07-16 | 2013-07-16 | Based on relaying bunch in D2D multicasting method |
| PCT/CN2013/089877WO2015007058A1 (en) | 2013-07-16 | 2013-12-18 | Method for allocating spectrum resources between cellular subscriber and d2d subscriber in same cell |
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310297127.XACN103428642B (en) | 2013-07-16 | 2013-07-16 | Based on relaying bunch in D2D multicasting method |
| Publication Number | Publication Date |
|---|---|
| CN103428642A CN103428642A (en) | 2013-12-04 |
| CN103428642Btrue CN103428642B (en) | 2016-01-13 |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310297127.XAExpired - Fee RelatedCN103428642B (en) | 2013-07-16 | 2013-07-16 | Based on relaying bunch in D2D multicasting method |
| Country | Link |
|---|---|
| CN (1) | CN103428642B (en) |
| WO (1) | WO2015007058A1 (en) |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014130091A1 (en)* | 2013-02-22 | 2014-08-28 | Intel IP Corporation | Systems and methods for access network selection and traffic routing |
| CN112491734A (en)* | 2014-05-30 | 2021-03-12 | 索尼公司 | Electronic device and data transmission method |
| CN104320772B (en)* | 2014-10-13 | 2018-02-06 | 北京邮电大学 | D2D communication nodes clustering method and device based on degree of belief and physical distance |
| CN104581837B (en)* | 2015-01-15 | 2018-01-09 | 浙江工业大学 | The data distributing method with energy-saving effect of D2D collaboration communications is utilized under the transmission of data blocks time such as a kind of |
| WO2016112678A1 (en)* | 2015-01-16 | 2016-07-21 | 中兴通讯股份有限公司 | Data processing method and device |
| CN105992157A (en)* | 2015-02-06 | 2016-10-05 | 北京信威通信技术股份有限公司 | D2D relay multicast method assisted by network |
| CN105992143A (en)* | 2015-02-06 | 2016-10-05 | 北京信威通信技术股份有限公司 | D2D relay multicast method assisted by network |
| CN106034289A (en)* | 2015-03-10 | 2016-10-19 | 北京信威通信技术股份有限公司 | Forwarding control method in D2D multicast communication |
| CN106034081B (en)* | 2015-03-10 | 2019-04-05 | 北京信威通信技术股份有限公司 | A kind of transmission control method in D2D cast communication |
| KR20180003546A (en) | 2015-04-08 | 2018-01-09 | 인터디지탈 패튼 홀딩스, 인크 | Mobile relay implementation for device-to-device (D2D) communication |
| EP3284290A1 (en)* | 2015-05-15 | 2018-02-21 | Sony Corporation | Mobile communications system, communications terminals and methods |
| CN106341892A (en)* | 2015-07-10 | 2017-01-18 | 中兴通讯股份有限公司 | Content distribution implementing method and device |
| CN106341774B (en)* | 2015-07-10 | 2020-03-20 | 华为技术有限公司 | Data transmission method, network equipment and user equipment |
| WO2018111926A2 (en) | 2016-12-16 | 2018-06-21 | Inception 3, Inc. | Methods of treating cochlear synaptopathy |
| CN106507489B (en)* | 2016-12-30 | 2019-12-10 | 宇龙计算机通信科技(深圳)有限公司 | resource allocation method and access device |
| CN107911824B (en)* | 2017-11-07 | 2021-12-14 | 曙光信息产业(北京)有限公司 | Dynamic spectrum allocation method and device |
| CN107820256B (en)* | 2017-11-14 | 2021-05-07 | 上海电机学院 | A data transmission method based on D2D area distribution technology |
| AU2018417367A1 (en)* | 2018-04-02 | 2020-10-15 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Information reporting method, terminal device, network device, and computer storage medium |
| CN112291496A (en)* | 2019-07-24 | 2021-01-29 | 北京我声我视科技有限公司 | Instant messaging method and system based on content |
| CN116367122A (en)* | 2023-02-20 | 2023-06-30 | 南京汇邦信息科技有限公司 | Channel management system based on terminal through communication |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102340829A (en)* | 2010-07-15 | 2012-02-01 | 上海无线通信研究中心 | D2D intra-cluster data sharing method in cellular environment |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110047384A1 (en)* | 2009-08-21 | 2011-02-24 | Qualcomm Incorporated | Establishing an ad hoc network using face recognition |
| CN102083138B (en)* | 2011-01-14 | 2017-04-05 | 北京邮电大学 | A kind of D2D user to can the multiple phone user's resources of concurrent multiplexing method |
| WO2013075340A1 (en)* | 2011-11-25 | 2013-05-30 | Renesas Mobile Corporation | Radio resource sharing and contention scheme for device-to-device communication in white space spectrum bands |
| CN103619024B (en)* | 2013-11-27 | 2016-07-06 | 无锡北邮感知技术产业研究院有限公司 | With the method that in community, between phone user and D2D user, frequency spectrum resource distributes |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102340829A (en)* | 2010-07-15 | 2012-02-01 | 上海无线通信研究中心 | D2D intra-cluster data sharing method in cellular environment |
| Title |
|---|
| D2D技术在LTE-A系统中的应用;崔鹏 等;《现代电信科技》;20110225;全文* |
| Publication number | Publication date |
|---|---|
| CN103428642A (en) | 2013-12-04 |
| WO2015007058A1 (en) | 2015-01-22 |
| Publication | Publication Date | Title |
|---|---|---|
| CN103428642B (en) | Based on relaying bunch in D2D multicasting method | |
| CN102340829B (en) | Data sharing method in D2D bunch under cellular environment | |
| Liu et al. | CoopMAC: A cooperative MAC for wireless LANs | |
| WO2015078068A1 (en) | Relay-based in-cluster d2d multicast method | |
| CN102461323B (en) | Communication Method in IEEE 802.11 Wireless Local Area Network | |
| CN109348537A (en) | Multi-beam ad hoc network channel access control method | |
| WO2010124647A1 (en) | Device and method for base stations dynamic clustering in mobile communication | |
| WO2016123945A1 (en) | Method and apparatus for data processing, user equipment, and base station | |
| Militano et al. | When D2D communication improves group oriented services in beyond 4G networks | |
| CN103763076B (en) | Implementation method of cooperative MAC protocol based on asynchronous multi-channel in vehicular ad hoc network | |
| CN104754746B (en) | Cluster-based multi-channel cooperative MAC protocol implementation method in vehicle-mounted self-organizing network | |
| CN110519845B (en) | Multi-hop TDMA access method for UAV ad hoc network based on time slot assisted allocation and use | |
| Chi et al. | Efficient and reliable multicast using device-to-device communication and network coding for a 5G network | |
| CN102932866A (en) | Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network | |
| WO2022042608A1 (en) | Communication method and apparatus | |
| CN101997582A (en) | Cooperative communication method and apparatus based on super frame | |
| Li et al. | An optimal relay number selection algorithm for balancing multiple performance in flying ad hoc networks | |
| CN120166375A (en) | A UAV swarm networked measurement, control and communication system and communication method | |
| CN102905337B (en) | Routing Method Based on Cross-Layer Design in Ad Hoc Networks | |
| CN100426877C (en) | Method of communication by bimode terminal | |
| Mainaud et al. | Cooperative communication for wireless sensors network: a mac protocol solution | |
| CN110099387B (en) | A Multi-AP information transmission system and transmission method in a 6GHz scenario | |
| Jingrong et al. | Opportunistic cooperative routing in multi-radio multi-channel wireless sensor networks | |
| CN102324954A (en) | Cooperative Combination Optimization Method Based on Synchronization Constraint and Channel Energy Criterion | |
| CN116709592A (en) | Data transmission method and system based on MESH ad hoc network content sharing |
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right | Owner name:WUXI BUPT SENSING TECHNOLOGY INDUSTRY INSTITUTE CO Effective date:20140428 | |
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right | Effective date of registration:20140428 Address after:100876 Beijing city Haidian District Xitucheng Road No. 10 Applicant after:Beijing University of Posts and Telecommunications Applicant after:Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd. Address before:100876 Beijing city Haidian District Xitucheng Road No. 10 Applicant before:Beijing University of Posts and Telecommunications | |
| ASS | Succession or assignment of patent right | Free format text:FORMER OWNER: WUXI BUPT SENSING TECHNOLOGY INDUSTRY INSTITUTE CO., LTD. Effective date:20140618 Owner name:WUXI BUPT SENSING TECHNOLOGY INDUSTRY INSTITUTE CO Free format text:FORMER OWNER: BEIJING POSTAL AND TELECOMMUNICATIONS UNIV. Effective date:20140618 | |
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data | Free format text:CORRECT: ADDRESS; FROM: 100876 HAIDIAN, BEIJING TO: 214135 WUXI, JIANGSU PROVINCE | |
| TA01 | Transfer of patent application right | Effective date of registration:20140618 Address after:214135 Jiangsu Wuxi District Road No. 97 Linghu University Science Park E Applicant after:Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd. Address before:100876 Beijing city Haidian District Xitucheng Road No. 10 Applicant before:Beijing University of Posts and Telecommunications Applicant before:Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd. | |
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | Effective date of registration:20180329 Address after:518000 Guangdong, Shenzhen, Guangdong, East China Industrial Zone, Nanshan District Patentee after:Shenzhen Tinno Wireless Technology Co., Ltd. Address before:214135 Jiangsu Wuxi District Road No. 97 Linghu University Science Park E Patentee before:Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd. | |
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee | Granted publication date:20160113 Termination date:20190716 | |
| CF01 | Termination of patent right due to non-payment of annual fee |