CN103428642A - Intra-cluster device-to-device (D2D) multicast method based on relay - Google Patents

Intra-cluster device-to-device (D2D) multicast method based on relay Download PDF

Info

Publication number
CN103428642A
CN103428642A CN 201310297127 CN201310297127A CN103428642A CN 103428642 A CN103428642 A CN 103428642A CN 201310297127 CN201310297127 CN 201310297127 CN 201310297127 A CN201310297127 A CN 201310297127A CN 103428642 A CN103428642 A CN 103428642A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
user
data
cluster
multicast
information
Prior art date
Application number
CN 201310297127
Other languages
Chinese (zh)
Other versions
CN103428642B (en )
Inventor
田辉
陈楠楠
王智博
Original Assignee
北京邮电大学
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

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00Network traffic or resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18Negotiating wireless communication parameters
    • H04W28/22Negotiating communication rate

Abstract

The invention relates to an intra-cluster device-to-device (D2D) multicast method based on relay. The method includes that S1, a base station partitions users with data sharing demands and small link loss between each other into one cluster; S2, the base station informs each user about data distribution in the cluster through multicast, and terminal detecting link information in each cluster is controlled; S3, terminal nodes in each cluster select information multicast sequence according to demanding quantity of each data package, a corresponding transmitting terminal is selected based on data package occupation rate of each user, and sharing data are exchanged through a distribution multicast method; S4, the sharing data are obtained for the users with poor transmitting terminal link quality through relay retransmission. The relay-assistant multicast communication intra-cluster information sharing method is provided, effects of a minority of greatly-fading links in a multicast process on transmission speed are overcome, and optimization of network performance is achieved.

Description

基于中继的簇内D2D多播方法 Based on the cluster relay D2D multicast method

技术领域 FIELD

[0001] 本发明涉及无线通信技术领域,尤其涉及一种基于中继的簇内D2D多播方法。 [0001] The present invention relates to wireless communication technologies, and in particular relates to an internal relay cluster D2D multicast method.

背景技术 Background technique

[0002] 随着3GPP技术及多媒体业务的发展,网络中涌现大量的低能耗,具备计算、存储功能的移动终端,数据业务日益呈现多样化、多媒体化、移动性和位置相关化等特点。 [0002] With the development of technology and 3GPP multimedia services, the emergence of a large number of low-power network, includes computing, the mobile terminal stores function data services become increasingly diversified, multimedia, mobility and location-related and other characteristics. 业务的发展对网络优化及管理能力、网络运行质量、合作伙伴管理能力、面向客户的QOE与QOS等方面提出了更高的要求。 Business development for network optimization and management capabilities, operational aspects of the quality of the network, partner management, customer-oriented and QOS QOE put forward higher requirements.

[0003] 长期演进(LTE,Long Term Evolution)系统是一个基于调度的通信系统。 [0003] Long Term Evolution (LTE, Long Term Evolution) system is a communication system based on scheduling. 在蜂窝通信模式下,用户通过控制信道接入基站(RNC/eNB)获得授权资源并进行数据传输。 In the cellular communication mode, the user is authorized to access the base station through a control channel resource (RNC / eNB), and data transmission. 由于用户之间的信息交流需要通过基站中转,当大量终端需接入网络时,会导致数据请求拥挤,使基站面临较大的业务挑战及压力。 Since the information exchange between the user needs to transit through the base station, when a large number of terminals required to access the network, congestion cause data request, so that the base station face greater challenges and business pressures. 尤其在面对小范围内大量用户间数据共享及交互需求时,采用重复点到基站的通信方式,会严重浪费网络带宽。 In particular, in the face of a large amount of user data in a small area between sharing and interaction requirements, repeated use of the point to the communication base station, the network bandwidth will be a serious waste. 多播可以提高传输效率和网络性能。 Multicast can improve transmission efficiency and network performance. 此模式下,基站利用聚簇将网络中具有相似通信需求的用户聚集到同一个簇中进行服务。 In this mode, the base station uses the aggregated user cluster networks having similar communication requirements to the same service for a cluster. 例如当大量共享用户终端需彼此交换数据信息的时候,基站为每个用户分配独立的上行信道(UL,Up Link)并进行数据汇总,然后多播给每个用户。 Uplink channel (UL, Up Link) data collection and then multicast to each user, for example when a large number of user terminals share one another when the need to exchange data, the base station is independently assigned to each user. 然而使用传统的基站多播模式,并不能缓解用户间数据共享场景下上行资源的冲突,被服务的用户数目会因基站处理速度、能力受到限制。 However, the use of traditional base station multicast mode, and can not alleviate the conflict between the uplink user data resource sharing scenario, the number of users being serviced due to a base station processing speed, capacity is limited.

[0004] D2D (Device-to-Device)通信的信息传输不经过基站,用户可以复用上下行授权资源进行直接通信。 [0004] The information transmission D2D (Device-to-Device) communication without the base station, a downlink user may re-granting resources to spend for direct communication. D2D技术的引入可以增加频谱利用率,减小基站负载,增大网络吞吐量和覆盖范围。 D2D introduction techniques may increase spectrum efficiency, to reduce the load of the base station, increasing the network throughput and coverage. 然而仅仅利用一对一的D2D通信在数据共享环境下不仅会带来数据的冗余传输,也会引入D2D对之间的干扰。 However, only the use of one of the D2D communication in a data sharing environment will not only bring redundant transmission of data, will introduce interference between D2D right.

[0005] 为节省网络资源,提高吞吐量,改善用户体验,当小范围内用户有数据共享需求时,目前主要采用以下的解决方案: [0005] In order to save network resources, increase throughput, improve the user experience, when a small range of user data sharing needs, mainly in the following solution:

[0006] 缓存融合(cache intergration):基于终端对数据的访问量,缓存节点(cachepeer)存储兴趣度比较大的数据包。 [0006] Fusion cache (cache intergration): Based on the data traffic to the terminal, caching node (cachepeer) a relatively large degree of interest stored data packets. 若用户需要的数据包在存储范围内,用户终端直接从缓存节点处下载,否则仍向基站索取。 If the user needs to store data packets within the range, the user terminal downloads directly from the cache node, to the base station or still obtain.

[0007] D2D (Device-to-Device)多播:基站辅助构建簇,各用户轮流充当簇头,通过D2D多播的方式实现用户间的信息共享。 [0007] D2D (Device-to-Device) Multicast: helper constructs base station cluster, each cluster head users take turns, sharing information between users by way D2D multicast. 簇头根据多播用户的链路质量选择传输速率。 The transmission rate selected cluster head multicast user link quality.

[0008] 以上方案充分利用了终端节点间的通信提高网络性能。 [0008] The above makes use of a communication network performance between the terminal nodes. 由于多用户间的传输不需基站(BS)介入或是仅仅通过BS传输辅助信令信息,该方案能够释放下行频谱、减小基站负载,使更多的用户接入网络。 Since the transmission between the base station does not need multi-user (BS) BS transmissions only by intervention or assistance signaling information, the program can be released downstream spectrum, reducing the load of the base station, so that more users access the network. 但是上述数据共享方案一方面存在用户公平性问题:个别用户承担服务器功能,压力大,公平性差;另一方面,多播速率受最差链路质量限制,个别质量差的链路会影响整体的传输效率。 However, these data-sharing program on the one hand there is a user fairness: Individual users assume the server function, stress, poor fairness; on the other hand, multicast rate limit by the worst link quality, poor quality link individual will affect the overall transmission efficiency. 基于此,中继传输引入到D2D多播过程中,方法如下: Based on this, the introduction of relay transmission D2D multicast process, as follows:

[0009] 移动自组织网络(MANET):网络中的移动终端具有路由和分组转发功能,网络信息交换采用了计算机网络中的分组交换机制,既可以作为单独的网络独立工作,也可以以末端子网的形式接入现有网络。 [0009] Mobile ad hoc network (MANET): a mobile terminal in the network with routing and packet forwarding, network information exchanged using packet exchange mechanism in a computer network, either as a separate network independent work may also be end sub in the form of network access existing network.

[0010] 遍历查询:根据节点状态,基站轮询每个节点作为中继的效果,保证用户正确接收多播信息的前提下,选择合适中继最小化总的发射功率。 [0010] traversal query: The node status, the base station polls each node as a relay effect, under the premise of ensure correct reception user multicast information to select a suitable relay to minimize the total transmit power.

[0011] 分析上述方案,路由中继的引入增大了传输效率,但却带来了额外的路由维护成本,增加了传输的消耗及复杂度。 [0011] Analysis of the above-described embodiment, the introduction of relay routes increases transmission efficiency, but introduces additional maintenance cost routing, increased consumption and complexity of the transmission. 当服务范围大时,可以以上述中继寻找开销为代价,解决传输中断等问题,而在以增加传输效率为目标的D2D簇范围内,复杂度低的中继选择算法是首选。 When a large range of services, can look to the relay overhead expense, to address issues such as transmission is interrupted, and in order to increase the transmission efficiency of the D2D cluster target range, low complexity relay selection algorithm is preferred.

发明内容 SUMMARY

[0012](一)要解决的技术问题 [0012] (a) To solve technical problems

[0013] 本发明要解决的技术问题是:提供一种中继协助多播通信的信息共享方式,使得簇内每个拥有独立信息的用户通过数据多播交互,获得簇中存在的全部资源,并克服多播过程中少数大衰落链路对传输速率的影响,实现网络性能的优化。 [0013] The present invention is to solve the technical problem are: to provide a multicast relay assistance information sharing communication, so that each user has a separate multicast information in the cluster through interaction data, obtaining all the resources present in the cluster, and to overcome the effects of fading during the few large link multicast transmission rate to achieve optimal network performance.

[0014] (二)技术方案 [0014] (ii) Technical Solution

[0015] 本发明提供一种基于中继的簇内D2D多播方法,包括:S1:基站将具有数据共享需求并且彼此之间链路损失小的用户划分到一个簇内;S2:基站通过多播将簇内数据分布告知每个用户,并控制各簇内终端探测链路信息;S3:簇内终端节点基于每个数据包的需求量选择信息多播顺序,基于各用户的数据包占有率选择相应发送端,通过分布式多播的方式交换共享数据;S4:与发送端链路质量差的用户通过中继重传得到共享数据。 [0015] The present invention provides a D2D multicast method based on a relay in the cluster, comprising: S1: the base station and the user needs to share the data with a small loss of the link between them is divided into a cluster; S2: a base station through multiple multicast data distribution within a cluster to inform each user terminal detects and controls the link information in each cluster; S3: terminal node in the cluster based on the demand for packet selection information of each multicast sequence, based on each user's share packets select the transmitting end, the data exchange via the shared multicast distributed manner; S4: the transmitting end of the link quality poor user data be shared through the relay retransmission.

[0016] 优选地,用户发送数据共享请求的同时将持有数据包的情况告知基站,并在基站控制下进行链路探测,能够进行D2D通信的用户加入到簇中。 Where [0016] Preferably, the user data is transmitted while sharing request informs the base station holds the data packet, and detecting the link under control of the base station, the user can be added to the D2D communications cluster.

[0017] 优选地,用户在基站辅助控制下,获得邻居节点信息及网络数据包分布,据此构建小世界网络模型。 [0017] Preferably, the user under the control of the auxiliary base station, to obtain information about neighbor nodes, and the network packet distribution, whereby constructing small-world network model.

[0018] 优选地,所述用户在基站辅助控制下,获得邻居节点信息及网络数据包分布,据此构建小世界网络模型包括步骤:基站控制簇成员发送探测信号,新用户监听探测信道,当接收信噪比超过设定阈值门限时,认定发送用户为自身邻居,数据收发通过点到点的直接传输实现,否则,认为链路质量差,信息的传输通过中继转发实现。 [0018] Preferably, the user under the control of the auxiliary base station, obtaining information of neighbor nodes and network packet distribution, whereby small-world network model constructing step comprises: a base station transmits a probe signal control cluster members, the new user listens sounding channel, when received SNR exceeds the threshold set threshold, the user is identified itself transmits a neighbor, the data transceiver by direct transfer point, otherwise, that the difference in link quality, transmission of information is achieved by forwarding relay.

[0019] 优选地,每个用户接入簇后,发送探测信号,使得簇内用户获知邻居信息的更新。 [0019] Preferably, each access cluster of the user, transmitting the probe signal, so that the user knows the cluster update neighbor information.

[0020] 优选地,基站完成簇用户收集后,将簇内数据包分布告知每个终端,据此用户能够实现分布式的传输终端及中继寻找。 After [0020] Preferably, the base station is completed to collect user cluster, the cluster distribution of the packet to inform each terminal, whereby a user can implement a distributed transmission terminal and the relay to find.

[0021] 优选地,通过对网络中数据的分布的分析,分布式选择最佳的数据包的多播顺序及发送用户。 [0021] Preferably, by analyzing the distribution of data on the network, a distributed multicast select the best sequence of packets and transmits the user.

[0022] 优选地,所述通过对网络中数据分布的分析,分布式选择最佳的数据包的多播顺序及发送用户包括步骤:每个用户根据数据包的分布得到一致的数据发送顺序及发送用户:将数据包按照需求量降序排列,需求量越大,传送优先级越高;发送端的选择基于对持包用户的数据享有率的分析,持包用户的占有数据越少,发送优先级越高。 [0022] Preferably, the analysis of the data in a distributed network, and distributed sequentially selects a multicast best transmitting user data packet comprising the steps of: for each user gets the same data transmission order based on the distribution data packet and transmitting user: the data packet demand descending order, the greater the demand for higher transfer priority; selecting the transmitting end based on analysis of user data packets held Related rate, holding packet data occupies fewer users, transmission priority higher.

[0023] 优选地,簇内多播的控制是分布式的,依赖于每个用户的计算能力。 [0023] Preferably, the cluster multicast control is distributed, depending on the computing power of each user.

[0024] 优选地,当不能保证发送节点与所有用户的链路质量时,链路质量差的用户通过中继重传得到信息,多跳的传输通过邻居节点的逐次转发实现。 [0024] Preferably, when the link quality can not be guaranteed to all users of the sending node, link quality difference between the user information obtained through the relay retransmission sequential forward multihop transmission is achieved by the neighboring node. [0025] 优选地,所述当不能保证发送节点与所有用户的链路质量时,链路质量差的用户通过中继重传得到信息,多跳的传输通过邻居节点的逐次转发实现包括步骤:未接收到信息的用户向邻居节点发送数据请求,持有该数据包的邻居节点统计自身接收到的请求数量,并反馈给各个数据请求用户;据此未收到信息的终端选择可以服务最多用户的邻居节点作为中继,即向接收到最多数据请求的邻居用户再次发送数据请求,每个邻居节点根据第二次的数据请求重传信息:接收到一个数据请求,就以单播方式实现D2D通信;如果接收到多个数据请求,就以D2D多播提供数据包;如果仍有用户未能得到数据,则重复上述步骤,经过多跳得到服务,通过中继得到服务的用户向当前数据包的多播发送端反馈成功接收信令。 [0025] Preferably, when the link quality can not be guaranteed to all users of the sending node, link quality difference between the user information obtained through the relay retransmission, transmitted through the multi-hop forwarding at successive neighbor nodes comprising the steps of: the user information is not received the request to send data to a neighbor node, holding the packet count the number of neighbor nodes received the request itself, and feeds the data to each requesting user; accordingly not received terminal information service selection may be up to the user neighbor as a relay node, namely to a maximum data request received neighbor user data retransmission request, retransmission information of each neighbor node a second request for the data by: receiving a data request, a unicast manner D2D communication; if the received plurality of data request, in order to provide D2D multicast packets; if the user fails to obtain the data remains, the above steps are repeated to obtain a multi-hop service, the service obtained by the user of the current packet relaying the multicast transmission of the feedback signaling is successfully received.

[0026] 优选地,当多个中继转发同时存在的时候,复用正交的传输资源。 [0026] Preferably, when a plurality of simultaneously present when relaying, multiplexing orthogonal transmission resource.

[0027](三)有益效果 [0027] (c) beneficial effect

[0028] 本发明提供一种中继协助多播通信簇内信息共享的方式,使得簇内每个拥有独立信息的用户通过数据多播交互,获得簇中存在的全部资源,并克服多播过程中少数大衰落链路对传输速率的影响,实现网络性能的优化。 [0028] The present invention provides a relay communication assistance within the multicast cluster information sharing manner, so that each user has a separate multicast information in the cluster through interaction data, to obtain all the resources present in the cluster, and to overcome the multicast procedure Effect of the few large fading rate transmission link, to optimize network performance.

附图说明 BRIEF DESCRIPTION

[0029] 为了更清楚地说明本发明实施例或现有技术中的技术方案,下面将对实施例或现有技术描述中所需要使用附图简单地介绍显而易见地,下面描述中的附图是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。 [0029] In order to more clearly illustrate the technical solutions in the embodiments or the prior art embodiment of the present invention, the following embodiments or the prior art will be described with reference to the drawings as required simply introduced Apparently, the drawings in the embodiments described below is Some embodiments of the present invention, those of ordinary skill in the art is concerned, without creative efforts, can derive from these drawings other drawings.

[0030] 图1为体现小世界网络特性的用户簇的示意图。 [0030] FIG. 1 is a schematic view of a user cluster small world network characteristic expression. 其中,簇内的每个用户含有独立的信息; Wherein, within each user cluster containing independent information;

[0031] 图2为多个中继同时重传的场景示意图; [0031] FIG. 2 is a schematic view of a plurality of simultaneously retransmitted relay scene;

[0032] 图3为用户向基站请求接入的信令传输示意图; [0032] FIG. 3 is a user requests access to a base station signaling schematic;

[0033] 图4为本发明实施例的方法流程图。 [0033] FIG 4 is a flowchart of a method embodiment of the present invention.

具体实施方式 detailed description

[0034] 为了使本发明实施例的目的、技术方案和优点更加清楚,下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整的描述,显然,所描述的实施例是本发明的一部分实施例,而不是全部的实施例。 [0034] In order that the invention object of the embodiment, the technical solution and merits thereof more apparent in conjunction with the present invention in the drawings embodiments below, the technical solutions in the embodiments of the present invention will be clearly and completely described, obviously, the described the embodiment is an embodiment of the present invention is a part, but not all embodiments. 基于本发明中的实施例,本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。 Based on the embodiments of the present invention, those of ordinary skill in the art to make all other embodiments without creative work obtained by, it falls within the scope of the present invention.

[0035] 如图1〜图4所示,本发明提供了一种用户分簇,及簇内中继协助多播的方式。 [0035] As shown in FIG. 1 ~ 4, the present invention provides a user clustering, and the relay to assist in the cluster multicast manner. 本方案中引入了小世界网络模型,小世界网络中用户享有高聚合度和低链路长度,每个节点拥有邻居信息及目的节点信息。 This scheme introduces small-world network model, small-world network users to enjoy high degree of polymerization and low link length, each node has a node neighbor information, and object information. 当遇到直连不可达链路时,信息的传输通过逐次的邻居节点转发实现。 When confronted unreachable direct link, transmission of information forwarded achieved through successive stages of its neighbors. 本方案包括以下步骤: The program comprises the steps of:

[0036] S1:基站将具有数据共享需求并且彼此之间链路损失小的用户划分到一个簇内,使得同一簇内用户能够实现稳定的D2D通信; [0036] S1: The base station having a demand for data sharing with each other and the small loss of link users into a cluster, so that the same user can realize stable cluster D2D communication;

[0037] S2:基站通过多播将簇内数据分布告知每个用户,并控制各簇内终端探测链路信息,协助构建小世界网络模型;[0038] S3:簇内终端节点基于每个数据包的需求量选择信息多播顺序,基于各用户的数据包占有率选择相应发送端,通过分布式多播的方式交换共享数据; [0037] S2: The base station within the cluster via a multicast data distribution to inform each user terminal detects and controls the link information in each cluster, help build small-world network model; [0038] S3: terminal node in the cluster based on each data demand multicast packet sequence selection information, based on the respective user to select the appropriate share packet transmitting side, exchange data via the shared multicast distributed manner;

[0039] S4:与发送端链路质量差的用户通过中继重传得到共享数据。 [0039] S4: the transmitting end of the link quality poor user through a relay retransmission data be shared. 中继的选择以保证信噪比前提下,最大化服务用户数量为目标。 Relay options to ensure that noise ratio under the premise, to maximize the number of service users as the goal.

[0040] 其中,用户发送数据共享请求的同时将持有数据包的情况告知基站,在基站控制下进行链路探测,能够进行D2D通信的用户加入到簇中。 Case of simultaneous [0040] wherein the user transmits data sharing request packet will hold informs the base station, the base station performs the link detection under control, the user can be added to the D2D communications cluster.

[0041] 其中,用户在基站辅助控制下,获得邻居节点信息及网络数据包分布,据此构建小世界网络模型。 [0041] wherein, the user at the base station assist control, and obtain information about neighbor nodes network packet distribution, whereby constructing small-world network model.

[0042] 其中,每个用户通过基站的广播获得网络中的数据分布,进而得知索取数据的目的节点。 [0042] wherein each of the user data to obtain the distribution network by the broadcast station, and thus obtain the data that the destination node.

[0043] 其中,通过对网络中数据的分布的分析,分布式选择最佳的数据包的多播顺序及发送用户。 [0043] wherein, by analyzing the distribution of data on the network, and distributed sequentially selects a multicast best transmitting user packets. 多播进程通过信令交互进行控制。 Multicast process is controlled by signaling interaction.

[0044] 其中,簇内多播的控制是分布式的,依赖于每个用户的计算能力。 [0044] wherein the cluster multicast control is distributed, depending on the computing power of each user.

[0045] 其中,当不能保证发送节点与所有用户的链路质量时,链路质量差的用户通过中继重传得到信息。 [0045] wherein, when the link quality can not be guaranteed to all users of the sending node, link quality difference between the user information obtained through the relay retransmission. 多跳的传输通过邻居节点的逐次转发实现。 Forward multihop transmission is achieved by successive neighbors.

[0046] 其中,当多个中·继转发同时存在的时候,复用正交的传输资源。 [0046] in which, when a plurality of the relay-forwarded exist when the multiplex transmission resources orthogonal.

[0047] 本发明实施例的实现方式:具有数据共享需求的用户根据网络链路状态构建簇,通过簇内基于中继的D2D协作多播传输,在保证用户公平性前提下实现多用户汇总数据的覆盖。 [0047] implementation of this embodiment of the present invention: a data sharing according to the needs of users to build a cluster network link status, the multicast transmission based cooperative relaying through D2D cluster, multi-user data is summarized in ensuring fairness user premise coverage. 包括如下步骤: Comprising the steps of:

[0048] S1:基站将具有数据共享需求并且彼此之间链路损失小的用户划分到一个簇内,使得同一簇内用户能够实现稳定的D2D通信。 [0048] S1: The base station having a demand for data sharing with each other and the small loss of link users into a cluster, so that the same user can realize stable cluster D2D communication.

[0049] 数据共享用户向基站发送接入请求,并以信令方式通知基站自身持包情况Packi,在基站控制下簇内终端发出探测信号,新用户接收到探测信息后,将接受信噪比上传给基站,据此,基站判断其是否可以加入当前簇: [0049] The data sharing user sends an access request to the base station, and to notify the base station signaling holding bag itself Packi case, generates a detection signal at terminal cluster control station, the new user receives the probe information, the receiving SNR upload to the base station, pursuant to which the base station determines whether it can be added to the current cluster:

[0050] 假如当前簇内有η个用户,如果新用户接收到的η个用户的信噪比都大于设定阈值凡,即满足SNRiinJHu V/ e {1,2....,»},则其可以加入当前簇;接收到的信噪比大于H的用户,SNUH,ie {1,2,…,η}属于其邻居用户。 [0050] If the current cluster have η user, if the user receives a new user signal to noise ratio η is greater than the set threshold value where that satisfies SNRiinJHu V / e {1,2 ...., »}, it can be added to the current cluster; H greater than the received SNR users, SNUH, ie {1,2, ..., η} users belonging to its neighbor.

[0051] S2:基站通过多播将簇内数据分布告知每个用户,并控制各簇内终端探测链路信息,协助构建小世界网络模型。 [0051] S2: The base station within the cluster via a multicast data distribution to inform each user terminal detects and controls the link information in each cluster, help build small-world network model.

[0052] 用户接入簇后,在基站控制下发送探测信息,据此通知邻居用户自身的存在,使得邻居用户更新本地信息。 [0052] After the user access clusters, under the control of the base station transmits probe information, inform the presence of the user's own neighbors, such that the neighboring user updates the local information. 示用户i的邻居信息, Illustrates neighbor information of user i,

Figure CN103428642AD00071

[0053] 经过固定时间周期的用户收集后,基站得知网络含有的汇总数据包,S = Ipackl,及包的分布S,假设簇中有N个用户和M个不同的数据包: [0053] After a fixed period of time to collect a user, the base station that the packet distribution network rollup S contained, S = Ipackl, and the package, assuming that there are N users in a cluster and M different data packet:

Figure CN103428642AD00072

[0055] bij=l表示第j个用户有第i个包,I^ij=O表示没有该数据包。 [0055] bij = l j th user i-th packet, I ^ ij = O indicates that no packet. 基站将此信息下发给簇内用户。 Cluster users send information at this station.

[0056] 以上信息构成了小世界网络中节点的本地信息。 [0056] The above information constitutes a local small-world information network nodes. 小世界网络模型可以用于中继的寻找:当直连链路不可达时候,通过邻居节点逐步转发,实现信息传输。 Small-world network model can be used to relay finding: when the direct link is unreachable when forwarded by neighbors gradually to achieve information transmission.

[0057] S3:簇内终端节点基于每个数据包的需求量选择信息多播顺序,基于各用户的数据包占有率选择相应发送端,通过分布式多播的方式交换共享数据。 [0057] S3: terminal node in the cluster based on the demand for packet selection information of each multicast sequence, based on each user's share packets select the transmission side, exchange data via the shared multicast distributed manner.

[0058] 簇内所有用户都掌握包的分布信息,每个终端节点据此计算得到相同的包的传输顺序以及相应的发送端。 [0058] all users in the cluster are controlled by the distribution of packets, each terminal node calculated accordingly obtained the same transmission order of the packet and the corresponding transmission terminal. 如下: as follows:

[0059] 通过分析S得到每个数据包的占有量: [0059] S occupancy obtained by analyzing each packet:

Figure CN103428642AD00081

其中 among them

Figure CN103428642AD00082

I表示含有第i个数据包的用户个数,将之升序排列得到K',对比K和 I represents the i-th user having a number of data packets, in ascending order of the obtained K ', K and comparison

, ,

K'信息得到包的传输顺序Q:令r取遍I到M,K'中第r个元素在K中的位置对应Q的第r个元素。 K 'packet transmission sequence information obtained Q: Let r runs over I to M, K' corresponding to the first element r Q r th element in K position.

[0060] 对于Q中第qi个数据包,找相应发送用户的原则:持有该数据包的用户中持包量最少的节点需要从网络中获得的数据最多,为公平起见,我们令其进行多播服务。 [0060] For Q qi first data packet, the sending user to find the corresponding principle: holding the user data up to the packet holding node minimum amount required to obtain the packet from the network, be fair, we asked to carry out multicast service. 遍历S中第行,得到有该数据包的用户集合W=U1, i2,…,ij, I1, i2,…,i。 S traversing the first row, the user data packet has been set W = U1, i2, ..., ij, I1, i2, ..., i. ( η,对于W中元素,计 ([Eta], for the W element count

Count

Figure CN103428642AD00083

找到使得\.最小的第j个用户即是该数据包的发送端。 Found that \. J-th smallest user terminal that is transmitting the data packet. 数据包分发顺 Packet distribution along

序及相应发送用户构成基本的数据包分发信息。 Sequence and the corresponding transmitting user packets constituting the basic distribution information.

[0061] 每个用户都通过计算得到相同的数据包分发信息,因而多播过程可以通过信令的交互控制进程。 [0061] Each user calculated through the same packet distribution information, thereby multicasting process may be controlled by exchanging signaling process. 一个数据包的广播过程中,不需要数据的用户保持静默。 Process a broadcast data packet, the user does not need to remain silent data. 发送用户首先发出信息接入请求,接收方探测接收信噪比,大于阈值H的用户(即邻居用户)选择直接接收,并反馈链路情况。 Transmitting user first sends an access request message, the recipient receives detection SNR is greater than the threshold value H of the user (i.e., neighboring user) receives directly selected, and a feedback link conditions. 其余的用户(即非邻居用户)不反馈。 The rest of the user (ie, non-neighbor user) is not feedback. 发送方根据用户反馈的链路信息调整多播传输速率,并默认每个邻居用户都可以准确接受到信息。 Adjusting the sender link information according to the user feedback multicast transmission rate, and each neighbor default user can receive accurate information. 发送端的非邻居用户在下一个时隙向自身邻居节点索要数据包,通过中继重传得到服务,同时为保证信息的正确接收,令其收到数据包后反馈给发送方一个ACK信令信息。 Non-neighbor transmitting end user the next time slot request packet to the neighbor node itself, obtained by the relay retransmission service, as well as ensure the correct reception of information, make an ACK feedback signaling information to the transmission side after receiving the data packet. 发送方收集到所有非邻居用户的ACK反馈后,以信令的方式通知下一个发送用户启动下一个多播进程。 The sender collect all the non-neighbor users ACK feedback, signaling notification under way to send a user starts a multicast process. 以此,通过用户间的信令交互及本地信息,实现多播过程的分布式控制。 In this, the signaling interaction between the user and the local information, implement distributed control multicast process.

[0062] 在多播过程中为保证所有用户的正确接收,传输速率基于最差链路路损情况,记U为需要数据包i的用户集合,k为选择的发送端,考虑信道增益g,D2D用户和蜂窝用户发射功率Pd,P。 [0062] In the multicast process to ensure the correct reception of all users, the transmission rate based on the worst case link path loss, denoted U i for the user needs a set of data packets, k is selected by the transmitting end, consider channel gain g, D2D users and cellular subscribers transmit power Pd, P. ,D2D用户收到的干扰Inf,噪声N及信道带宽B,利用香农定理可将传输速率表示为: , D2D user receives interference Inf, and noise N channel bandwidth B, using Shannon transmission rate may be expressed as:

[0063] = B =l51g1 (I + ——mm^apd)——)IeJJ_3」 N + Pclnfaig(minigMPd)) [0063] = B = l51g1 (I + --mm ^ apd) -) IeJJ_3 "N + Pclnfaig (minigMPd))

[0064] 引入中继后,网络的多播速率得到改善: [0064] After the introduction of the relay, the multicast rate of the network is improved:

[0065] Ct=B*log2(l+ ^),IBmighiXJU [0065] Ct = B * log2 (l + ^), IBmighiXJU

^ + rClnJ ^ + RClnJ

[0066] S4:与发送端链路质量差的用户通过中继重传得到共享数据。 [0066] S4: the transmitting end of the link quality poor user through a relay retransmission data be shared. 中继的选择以保证信噪比前提下,最大化服务用户数量为目标。 Relay options to ensure that noise ratio under the premise, to maximize the number of service users as the goal.

[0067] 当用户不能直接从多播过程得到信息时,会向自身邻居节点索取数据包,并通过持有数据包的邻居用户的重传,得到信息。 [0067] When the user can not get the information directly from the multicast process will request packets to their neighbors, and neighbors by retransmitting the data packet held by the user to obtain information. 重传过程如下:未接收到信息的终端向邻居用户发送数据请求;所有持有该数据包的邻居用户接收到请求信息后,计算自身可以服务的用户数量,并将数量信息反馈给每个向自身发送数据请求的终端。 Retransmission process is as follows: the terminal information is not received transmits a user data request to the neighbor; holds all the user data packet after receiving the neighbor request message, the service itself may calculate the number of users, and the amount of feedback to each terminal itself transmits data request. 未接收到数据的终端对比邻居用户反馈回来的信息,向一个可以同时服务最多用户的邻居请求信息,并提交链路情况;邻居节点根据反馈回来的链路情况,调整重传单播或是多播速率,进行中继重传:如果中继节点接收到一个数据请求信息,则提供D2D单播服务;如果接收到多个数据请求信息,则发送多播服务。 Comparative not received neighbor information terminal of the user data fed back, a neighbor information request can simultaneously serve up to the user, and submit the link conditions; neighbor nodes according to the link conditions fed back to adjust the weight of the multicast or broadcast Flyer rate, relay retransmission: if the relay node receives a data request message, the D2D providing unicast services; a plurality of data if the received request information, sends a multicast service.

[0068] 接收到数据包的用户反馈给发送端一个ACK信息。 [0068] The user receives the packet back to the transmitting side an ACK message. 如果仍有用户未接收到数据包,则回到向邻居用户发送数据请求步骤,在下一时隙进一步寻找转发中继;经过2次中继请求后,仍得不到当前数据信息的用户向发送端请求增大功率发射数据包。 If the user still does not receive the packet, the process returns to the step of transmitting a data request to the neighboring user, and look for the next slot in the forward relay; relay request after 2, still not the current user data to the sender information power increase request packet is transmitted.

[0069] 引入中继后,使用DF (decode and forward)方式传输,考虑中继及终端接收到的SINR (signal and interference noise ratio) SINRr, SINRd,接收速率为 [0069] After the introduction of the relay, the use DF (decode and forward) transmission mode, and the relay terminal considering SINR (signal and interference noise ratio) received SINRr, SINRd, receiving rate

Figure CN103428642AD00091

[0071] 如图2所示,当多个中继重传同时发生的时候,为其分配正交的复用资源,以避免D2D用户之间的干扰。 [0071] As shown in FIG 2, when a plurality of relay retransmission occur simultaneously with their complex allocation of orthogonal resources to avoid interference between the D2D user.

[0072] 本发明提供一种根据兴趣度及距离特征进行用户分簇及簇内信息传输的方式。 [0072] The present invention provides a way for a user cluster clustering information transmission and in accordance with the degree of interest and the distance characteristic. 最终通过多用户协调通信实现网络性能的优化。 Ultimately optimize network performance multiuser coordinating communications.

[0073] 本领域普通技术人员可以理解:实现上述实施例的全部或部分步骤可以通过程序指令相关的硬件来完成,前述的程序可以存储于一计算机可读取存储介质中,该程序在执行时,执行包括上述实施例的步骤;而前述的存储介质包括:R0M、RAM、磁碟或者光盘等各种可以存储程序代码的介质。 [0073] Those of ordinary skill in the art will be appreciated that: all or part of a hardware implemented steps of the above embodiments may be associated by program instructions complete, the program may be stored in a computer readable storage medium, when the program execution , comprising the step of performing the above-described embodiments; the storage medium comprising: a variety of medium R0M, RAM, magnetic disk, or an optical disc capable of storing program code.

[0074] 最用应说明的是:以上实施例仅用于说明本发明的技术方案,而非对其限制;尽管参照前述实施例对本发明进行了详细的说明,本领域普通技术人员应当理解:其依然可以对前述各实施例所记载的技术方案进行修改,或者对其中的部分技术特征进行等同替换;而这些修改或者替换,并不时相应技术方案的本质脱离本发明各实施例技术方案的精神和范围。 [0074] should be noted that the most used: above embodiments are merely used to describe the technical solutions of the present invention, rather than limiting; While the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should be understood: may still be made to the technical solutions in the embodiments described modified or partial technical features which will be equivalents; as such modifications or replacements do not when the essence of corresponding technical solutions to depart from the respective aspect of an embodiment of the present invention and scope.

Claims (12)

  1. 1.一种基于中继的簇内D2D多播方法,其特征在于,包括: 51:基站将具有数据共享需求并且彼此之间链路损失小的用户划分到一个簇内; 52:基站通过多播将簇内数据分布告知每个用户,并控制各簇内终端探测链路信息; S3:簇内终端节点基于每个数据包的需求量选择信息多播顺序,基于各用户的数据包占有率选择相应发送端,通过分布式多播的方式交换共享数据; S4:与发送端链路质量差的用户通过中继重传得到共享数据。 A D2D multicast method based on a relay in the cluster, characterized by comprising: 51: the base station and the user needs to share the data with a small loss of the link between them is divided into a cluster; 52: base station through multiple multicast data distribution within a cluster to inform each user terminal detects and controls the link information in each cluster; S3: terminal node in the cluster based on the demand for packet selection information of each multicast sequence, based on each user's share packets select the transmitting end, the data exchange via the shared multicast distributed manner; S4: the transmitting end of the link quality poor user data be shared through the relay retransmission.
  2. 2.如权利要求1所述的方法,其特征在于,用户发送数据共享请求的同时将持有数据包的情况告知基站,并在基站控制下进行链路探测,能够进行D2D通信的用户加入到簇中。 2. The method according to claim 1, characterized in that, while the user is transmitting data sharing request packet will hold the case informs the base station, and detecting the link under control of the base station, the user can be added to the D2D communications cluster.
  3. 3.如权利要求1所述的方法,其特征在于,用户在基站辅助控制下,获得邻居节点信息及网络数据包分布,据此构建小世界网络模型。 The method according to claim 1, characterized in that the user assist control when the base station to obtain information about neighbor nodes, and the network packet distribution, whereby constructing small-world network model.
  4. 4.如权利要求3 所述的方法,其特征在于,所述用户在基站辅助控制下,获得邻居节点信息及网络数据包分布,据此构建小世界网络模型包括步骤: 基站控制簇成员发送探测信号,新用户监听探测信道,当接收信噪比超过设定阈值门限时,认定发送用户为自身邻居,数据收发通过点到点的直接传输实现,否则,认为链路质量差,信息的传输通过中继转发实现。 4. The method according to claim 3, wherein said user station at the assist control, and obtain information about neighbor nodes network packet distribution, whereby small-world network model constructing step comprises: a base station control cluster member transmits the probe signal, the new user listens sounding channel, when the received SNR exceeds the threshold set threshold, the user is identified itself transmits a neighbor, the data transceiver by direct transfer point, otherwise, that the difference in link quality, transmission of information by relaying achieve.
  5. 5.如权利要求4所述的方法,其特征在于,每个用户接入簇后,发送探测信号,使得簇内用户获知邻居信息的更新。 5. The method according to claim 4, wherein each access cluster of the user, transmitting the probe signal, so that the user knows the cluster update neighbor information.
  6. 6.如权利要求4或5所述的方法,其特征在于,基站完成簇用户收集后,将簇内数据包分布告知每个终端,据此用户能够实现分布式的传输终端及中继寻找。 The method of claim 4 or 5 as claimed in claim 6, wherein the base station after the completion of collecting user clusters, the cluster distribution of the packet to inform each terminal, whereby a user can implement a distributed transmission terminal and the relay to find.
  7. 7.如权利要求1所述的方法,其特征在于,通过对网络中数据的分布的分析,分布式选择最佳的数据包的多播顺序及发送用户。 7. The method according to claim 1, characterized in that, by analyzing the distribution of data on the network, a distributed multicast select the best sequence of packets and transmits the user.
  8. 8.如权利要求7所述的方法,其特征在于,所述通过对网络中数据的分布的分析,分布式选择最佳的数据包的多播顺序及发送用户包括步骤: 每个用户根据数据包的分布得到一致的数据发送顺序及发送用户:将数据包按照需求量降序排列,需求量越大,传送优先级越高;发送端的选择基于对持包用户的数据享有率的分析,持包用户的占有数据越少,发送优先级越高。 8. The method according to claim 7, characterized in that, by analyzing the distribution of the data on the network, and distributed sequentially selects a multicast best transmitting user data packet comprising the steps of: for each user based on the data distribution obtained consistent data packet transmission order and transmits the user: in accordance with the demand for packet data in descending order, the greater the demand for higher transfer priority; selecting the transmitting end based on the analysis of data packets of users who enjoy rates, holding bag data occupies fewer users, higher transmission priority.
  9. 9.如权利要求7或8所述的方法,其特征在于,簇内多播的控制是分布式的,依赖于每个用户的计算能力。 9. The method of claim 7 or claim 8, wherein the cluster multicast control is distributed, depending on the computing power of each user.
  10. 10.如权利要求1所述的方法,其特征在于,当不能保证发送节点与所有用户的链路质量时,链路质量差的用户通过中继重传得到信息,多跳的传输通过邻居节点的逐次转发实现。 10. The method according to claim 1, wherein, when the link quality can not be guaranteed to all users of the sending node, the user of the difference link quality information obtained through the relay retransmission, transmitted through the multi-hop neighbor node successive forwarding achieve.
  11. 11.如权利要求10所述的方法,其特征在于,所述当不能保证发送节点与所有用户的链路质量时,链路质量差的用户通过中继重传得到信息,多跳的传输通过邻居节点的逐次转发实现包括步骤: 未接收到信息的用户向邻居节点发送数据请求,持有该数据包的邻居节点统计自身接收到的请求数量,并反馈给各个数据请求用户;据此未收到信息的终端选择可以服务最多用户的邻居节点作为中继,即向接收到最多数据请求的邻居用户再次发送数据请求,每个邻居节点根据第二次的数据请求重传信息:接收到一个数据请求,就以单播方式实现D2D通信;如果接收到多个数据请求,就以D2D多播提供数据包;如果仍有用户未能得到数据,则重复上述步骤,经过多跳得到服务,通过中继得到服务的用户向当前数据包的多播发送端反馈成功接收信令。 11. The method according to claim 10, wherein, when the link quality can not be guaranteed to all users of the sending node, link quality difference between the user information obtained through the relay retransmission, transmitted through the multi-hop sequentially forwarding at a neighboring node comprises the steps of: the user information is not received transmits a data request to the neighboring node, the neighbor node holds packets that the number of requests received itself and the data to each requesting user feedback; accordingly not received terminal information to the service selection may be up to the user as the relay neighbor nodes, namely to a maximum data request received neighbor user sends a data request again, retransmission information of each neighbor node of the second data request by: receiving a data request, a unicast manner to achieve D2D communication; if the received plurality of data request, in order to provide D2D multicast packets; if the user fails to obtain the data remains, the above steps are repeated to obtain a multi-hop service, by the following the obtained user service data packet to the current multicast transmission of the feedback signaling is successfully received.
  12. 12.如权利要求10或11所述的方法,其特征在于,当多个中继转发同时存在的时候,复用正交的传输资源。 12. The method of claim 10 or claim 11, wherein, when a plurality of simultaneously present when relaying, multiplexing orthogonal transmission resource. · ·
CN 201310297127 2013-07-16 2013-07-16 Based on the cluster relay d2d multicast method CN103428642B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201310297127 CN103428642B (en) 2013-07-16 2013-07-16 Based on the cluster relay d2d multicast method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN 201310297127 CN103428642B (en) 2013-07-16 2013-07-16 Based on the cluster relay d2d multicast method
PCT/CN2013/089877 WO2015007058A1 (en) 2013-07-16 2013-12-18 Method for allocating spectrum resources between cellular subscriber and d2d subscriber in same cell

Publications (2)

Publication Number Publication Date
CN103428642A true true CN103428642A (en) 2013-12-04
CN103428642B CN103428642B (en) 2016-01-13

Family

ID=49652674

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201310297127 CN103428642B (en) 2013-07-16 2013-07-16 Based on the cluster relay d2d multicast method

Country Status (2)

Country Link
CN (1) CN103428642B (en)
WO (1) WO2015007058A1 (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104320772A (en) * 2014-10-13 2015-01-28 北京邮电大学 Trust degree and physical distance based D2D (Device to Device) communication node clustering method and device
CN104581837A (en) * 2015-01-15 2015-04-29 浙江工业大学 Data distribution method with energy-saving effect by means of D2D cooperative communication at equal data block transmission time
CN104937859A (en) * 2013-02-22 2015-09-23 英特尔Ip公司 Device to device communication with cluster coordinating
WO2016112678A1 (en) * 2015-01-16 2016-07-21 中兴通讯股份有限公司 Data processing method and device
WO2016131306A1 (en) * 2015-07-10 2016-08-25 中兴通讯股份有限公司 Content distribution method and device
CN106034081A (en) * 2015-03-10 2016-10-19 北京信威通信技术股份有限公司 Forwarding control method in D2D multicast communication

Citations (2)

* Cited by examiner, † Cited by third party
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
CN102340829A (en) * 2010-07-15 2012-02-01 上海无线通信研究中心 Device-to-device (D2D) cluster data sharing method under cellular environment

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102083138B (en) * 2011-01-14 2017-04-05 北京邮电大学 A method d2d user can simultaneously multiplex a plurality of user resources cellular
US9991998B2 (en) * 2011-11-25 2018-06-05 Avago Technologies General Ip (Singapore) Pte. Ltd. Ratio resource sharing and contention scheme for device-to-device communication in white space spectrum bands
CN103619024B (en) * 2013-11-27 2016-07-06 无锡北邮感知技术产业研究院有限公司 The method of inter-cell cellular user with users of the spectrum resource allocation d2d

Patent Citations (2)

* Cited by examiner, † Cited by third party
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
CN102340829A (en) * 2010-07-15 2012-02-01 上海无线通信研究中心 Device-to-device (D2D) cluster data sharing method under cellular environment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
崔鹏 等: "D2D技术在LTE-A系统中的应用", 《现代电信科技》, 25 February 2011 (2011-02-25) *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104937859B (en) * 2013-02-22 2018-04-24 英特尔Ip公司 Apparatus having a communication device to the cluster coordinator
CN104937859A (en) * 2013-02-22 2015-09-23 英特尔Ip公司 Device to device communication with cluster coordinating
CN104320772A (en) * 2014-10-13 2015-01-28 北京邮电大学 Trust degree and physical distance based D2D (Device to Device) communication node clustering method and device
CN104581837B (en) * 2015-01-15 2018-01-09 浙江工业大学 D2d cooperative communication using one kind of the other block with the transmission time of data distribution method of the energy saving effect
CN104581837A (en) * 2015-01-15 2015-04-29 浙江工业大学 Data distribution method with energy-saving effect by means of D2D cooperative communication at equal data block transmission time
WO2016112678A1 (en) * 2015-01-16 2016-07-21 中兴通讯股份有限公司 Data processing method and device
CN106034081A (en) * 2015-03-10 2016-10-19 北京信威通信技术股份有限公司 Forwarding control method in D2D multicast communication
WO2016131306A1 (en) * 2015-07-10 2016-08-25 中兴通讯股份有限公司 Content distribution method and device

Also Published As

Publication number Publication date Type
CN103428642B (en) 2016-01-13 grant
WO2015007058A1 (en) 2015-01-22 application

Similar Documents

Publication Publication Date Title
Chen et al. QoS-aware routing based on bandwidth estimation for mobile ad hoc networks
Wang et al. Networked wireless sensor data collection: issues, challenges, and approaches
Liu et al. CoopMAC: A cooperative MAC for wireless LANs
US20050111428A1 (en) Power and delay sensitive ad-hoc communication networks
Zhou et al. Intracluster device-to-device relay algorithm with optimal resource utilization
Zhang et al. Wireless mesh networking: architectures, protocols and standards
US20070072604A1 (en) Method and system for a wireless multi-hop relay network
Yuan et al. An optimized ad-hoc on-demand multipath distance vector (AOMDV) routing protocol
Bhatia et al. ICAM: Integrated cellular and ad hoc multicast
US20110225312A1 (en) Unified cache and peer-to-peer method and apparatus for streaming media in wireless mesh networks
US20110225311A1 (en) Unified cache and peer-to-peer method and apparatus for streaming media in wireless mesh networks
US20070133556A1 (en) System and method of distributed intelligent scheduling with compensation optimization (DISCO) for wireless ad hoc or personal area network
Bharati et al. CAH-MAC: cooperative ADHOC MAC for vehicular networks
Jarupan et al. A survey of cross-layer design for VANETs
Cicconetti et al. Bandwidth balancing in multi-channel IEEE 802.16 wireless mesh networks
Liu et al. DELAR: A device-energy-load aware relaying framework for heterogeneous mobile ad hoc networks
CN101877918A (en) Equipment and method for dynamic clustering of base station in mobile communication
US20130100942A1 (en) Mobile ad hoc network with dynamic tdma slot assignments and related methods
JP2006526937A (en) Optimal routing in ad hoc wireless communication network
Biradar et al. Review of multicast routing mechanisms in mobile ad hoc networks
US20160029403A1 (en) Apparatus and methods for scheduling resources in mesh networks
Sivaraj et al. QoS-enabled group communication in integrated VANET-LTE heterogeneous wireless networks
WO2009113976A1 (en) Joint association, routing and rate allocation in wireless multi-hop mesh networks
CN101674630A (en) Implementation method of cross-layer routing capable of perceiving congestion
Wang et al. An AODV-based anycast protocol in mobile ad hoc network

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
C41 Transfer of patent application or patent right or utility model
ASS Succession or assignment of patent right

Owner name: WUXI BUPT SENSING TECHNOLOGY INDUSTRY INSTITUTE CO

Effective date: 20140428

COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 100876 HAIDIAN, BEIJING TO: 214135 WUXI, JIANGSU PROVINCE

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
C14 Grant of patent or utility model
TR01