New! View global litigation for patent families

CN104486800A - Moderate service-based adaptive cooperative transmission method and system in wireless network - Google Patents

Moderate service-based adaptive cooperative transmission method and system in wireless network Download PDF

Info

Publication number
CN104486800A
CN104486800A CN 201410751607 CN201410751607A CN104486800A CN 104486800 A CN104486800 A CN 104486800A CN 201410751607 CN201410751607 CN 201410751607 CN 201410751607 A CN201410751607 A CN 201410751607A CN 104486800 A CN104486800 A CN 104486800A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
cooperative
network
method
service
wireless
Prior art date
Application number
CN 201410751607
Other languages
Chinese (zh)
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]
    • 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/24Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]

Abstract

The invention provides a moderate service-based adaptive cooperative transmission method and a moderate service-based adaptive cooperative transmission system in a wireless network. The method comprises the following steps of 1, initializing wireless users and idle frequency bands in the network; 2, acquiring related parameters of a known route, a QoS (quality of service) requirement and a spare network around a known node; 3, determining whether to trigger a cooperative mode or not; 4, if the cooperative mode is triggered, making a series of strategy sets. According to the method and the system, the network flow and the utilization rate can be maximized under the condition of meeting the QoS requirement of the users.

Description

无线网络中基于适度服务的自适应协作转发方法及系统 Adaptive collaboration forwarding method and system for wireless networks based on appropriate services

技术领域 FIELD

[0001] 本发明设及一种自适应协作转发方法,具体地,设及一种无线网络中基于适度服务的自适应协作转发方法。 [0001] The present invention is provided an adaptive cooperative forwarding method and, in particular, and is provided in a wireless network based adaptive coordinated appropriate forwarding service.

背景技术 Background technique

[0002] 伴随着社会需求的日益增长,各种无线通信技术正快速发展并应用在社会生活的各个领域,无线通信网络朝着高速化、宽带化、泛在化的方向发展,各种无线接入技术纷纷涌现,使得未来网络的频谱资源更加紧缺。 [0002] With the growing social needs, various wireless communication technology is rapidly developed and applied in various fields of social life, wireless communication networks toward high-speed, broadband, ubiquitous in the direction of development, various wireless access the technology have emerged, making the future of the network spectrum resources more scarce. 传统的频谱固定分配模式,导致授权频段与非授权频段负载不均衡,造成频谱资源的极大浪费。 The traditional fixed spectrum allocation models, resulting in licensed bands and unlicensed bands load imbalance, causing a great waste of spectrum resources. 3G系统的商用普及W及4G研究的不断推进,无线接入的需求与日俱增,该导致无线频谱资源日益拥挤,给日趋紧张的频谱资源雪上加霜。 Commercial popularity of W 3G and 4G systems research progresses, the increasing demand for wireless access, which results in an increasingly crowded radio spectrum resources, spectrum resources to the growing tension worse. W认知无线电技术为核屯、的认知无线网络能够通过对无线网络环境进行交互感知, 智能规划、决策和调度,实现无线异构网络的智能组网,有效地进行网络资源管理的智能优化,允许未授权的认知用户机会式的动态接入到空闲的授权用户频段,从而提高频谱资源利用率。 W cognitive radio technology for the nuclear village, cognitive wireless network can effectively optimize intelligent network resource management through a wireless network environment interact perception, intelligent planning, decision-making and scheduling, intelligent wireless networking heterogeneous networks that allows unauthorized access to a dynamic style of cognitive users the opportunity to authorized users band idle, thereby improving the utilization of spectrum resources.

[0003] 然而,由于认知无线网络的固有动态异构特性,使得传统的认知无线电机会式动态频谱接入方式(感知.接入)很具挑战性。 [0003] However, due to the inherent characteristics of the dynamic heterogeneous cognitive wireless network, the traditional opportunistic cognitive radio dynamic spectrum access (perceived Access) is challenging. 认知用户在频谱接入的过程中,必须连续的进行频谱的感知,一旦感知到频段被主用户占用,认知用户则须立即停止自己当前的信息传输或者进行频谱的切换。 In the cognitive process of user access in the frequency spectrum, will be perceived to be a continuous spectrum, once the band occupied by a primary user is to perceive, cognitive user shall immediately stop the current transmission of information or their switching spectrum. 该种方式下的频谱共享是极其被动的,认知用户间的频谱接入受到主用户的较大约束,然而,主用户缺乏一定灵活性,维持网络整体和平共处的责任完全寄托于认知用户,因此,在实现方面上更加复杂且难W保证网络性能,频谱利用率仍然不高。 Spectrum sharing in this manner is extremely passive, between the cognitive spectrum user access was severely constrained the primary user, however, the primary user a certain lack of flexibility, responsibility for maintaining the network as a whole were pinned to the peaceful coexistence of cognitive users Therefore, in terms of the realization of more complex and difficult to W to ensure network performance, spectral efficiency is still not high.

[0004] 协作通信作为一种新兴的通信技术,在物理层和MAC层方面优化信号的传输,应用于应用层,具有增加无线网络信道容量、降低发射功率、减少延时的巨大潜力,且灵活多变、扩展性强,为认知无线网络的发展注入了新的活力。 [0004] The cooperative communication technology as a new communication, to optimize the physical layer and the MAC layer aspect of the transmission signal, applied to the application layer, the wireless network has an increased channel capacity, reducing transmit power, reducing the huge potential delays, and flexible changeable, extensible for the development of cognitive wireless network has injected new vitality. 采用协作通信技术,在不增加系统硬件资源的条件下,融合分集技术与中继传输技术的优势,对当前网络中多种资源进行有效利用。 Using cooperative communication technology, without increasing hardware resources, conditions, diversity technique and the advantages of fusion relay transmission technology, the current network resources more effectively. 可W实现多样高速的数据传输,显著缩短数据传输时间,有效克服阴影效应及衰落,提高数据传送的可靠性,降低通信中断概率,扩大网络覆盖范围,降低网络能耗,提高频谱资源利用率。 W may be varied to achieve high-speed data transmission, significantly reducing the data transmission time, overcome shadowing and fading, improve the reliability of data transmission, reducing the outage probability of communication, network coverage, reduce network energy consumption and improve the utilization of spectrum resources.

[0005] 为了更加深入的提升认知无线电网络的性能,融合了协作通信技术和认知无线电技术的协作认知无线网络应运而生。 [0005] In order to improve the performance of more in-depth cognitive radio networks, the integration of collaborative communications technologies and collaborative cognitive cognitive radio wireless network came into being. 协作认知网络将协作频谱感知、协作中继传输等技术应用于认知无线电网络中,充分发挥两种技术的优势,在提升频谱利用率的同时,提高网络吞吐量、网络覆盖范围等通信性能,近年来引起了学术界的极大关注。 Cognitive collaborative network cooperative spectrum sensing, the cooperative relay transmission technology applied to the cognitive radio network, the full advantages of the two technologies, while improving spectral efficiency, improving network throughput, and other communication performance network coverage in recent years it has aroused great concern in academic circles. 已有的对于认知无线网络中的协作机制的研究,主要集中认知用户之间进行协作感知和协作传输上,通过彼此间的信息共享和频谱共享提高频谱资源的利用效率,提升网络性能。 Existing research collaboration mechanisms of cognitive wireless networks, mainly conducted between cognitive users collaborate on cooperative sensing and transmission, through information sharing and spectrum sharing among each other to improve the utilization efficiency of spectrum resources, improve network performance. 然而,该方式下的频谱共享建立在频谱感知的基础上,依然十分被动,只有当主用户空闲情况下,认知用户才能机会式的进行频谱的接入,可用频谱的动态性给信道的选择和接入带来巨大的挑战,同时,在主用户在进行数据传输时,无法充分利用认知用户的网络资源,该使得频谱资源并未得到最大限度的利用,且认知用户的QoS服务要求难W保证。 However, spectrum sharing in this way based on spectrum sensing on, still very passive, only when the main user is idle cases, cognitive access to spectrum users to opportunistically choose dynamic to the channel of the available spectrum and access a huge challenge, but, when the main user during data transmission, the user can not make full use of the cognitive network resources, so that the spectrum has not been to maximize the use of resources, and cognitive difficulties users of QoS requirements W guarantee.

发明内容 SUMMARY

[0006] 针对现有技术中的缺陷,本发明所要解决的技术问题是提供一种无线网络中基于适度服务的自适应协作转发方法,本发明在满足用户的QoS要求的情况下,尽可能使网络流量和利用率达到最大值。 [0006] For the prior art drawbacks, the present invention is to solve the technical problem of providing a wireless network based on an appropriate method for adaptive coordinated forwarding service, in the case where the present invention is to meet the QoS requirements of the user, so that as maximum utilization and network traffic.

[0007] 根据本发明提供的一种无线网络中基于适度服务的自适应协作转发方法,包括W 下步骤: [0007] The present invention provides a radio network based adaptive coordinated services appropriate forwarding method, comprising the steps of a W:

[000引步骤1 ;对网络内部无线电用户和空闲频带进行初始化; [000] Step 1 primer; internal radio network users and initialize idle band;

[0009] 步骤2 ;对已知路由路径、QoS要求、已知节点周围网络空闲的相关参数进行获取; [0009] Step 2; known routing path, QoS requirements, the relevant parameters of known nodes around the network is idle acquired;

[0010] 步骤3 ;对是否触发协作模式进行确定; [0010] Step 3; mode for determining whether to trigger cooperation;

[0011] 步骤4 ;若触发协作模式,做出一系列的策略集。 [0011] Step 4; if the trigger collaborative model, make a series of policy set.

[0012] 优选地,所述步骤3包括W下步骤: [0012] Preferably, the step 3 W comprises the steps of:

[001引步骤3. 1 ;检查已知路由路径是否全部满足QoS要求,并将不满足QoS要求的路径Py放入待解决集合P,其中,P。 [Step 001 primer 3.1; check known routing path satisfies all QoS requirements, and does not meet the QoS requirement to be resolved into a set of Py path P, wherein, P. 表示节点i与节点j之间的路径; It represents the path between the node i and a node J;

[0014] 步骤3.2 ;检查待解决集合P中每一项P。 [0014] Step 3.2; checking the set P to be resolved in each P. 周围网络是否空闲,若为空闲则将P。 Around the network is idle, if it is idle will be P. 赋值为true,否则赋值为false ; Assigned to true, otherwise the assignment is false;

[001引步骤3. 3 ;若待解决集合P中每一项P。 [Step 001 primer 3.3; each of the set P to be solved if a P. 都为true,则做出决策;触发协作模式;否贝1J,不触发。 They are true, then make a decision; trigger collaborative model; no shell 1J, does not trigger.

[0016] 优选地,在所述步骤3. 1中,需要检查已知路由路径是否满足QoS要求并计算相关数据,具体为; [0016] Preferably, in said step 3.1, is known to check routing path satisfies the QoS requirement and to calculate correlation data, in particular;

[0017] 步骤3. 1. 1 ;比较集合D中所有元素的传输时延之和与QoS要求中的时延要求,更新QoS要求中的带宽要求,其中,集合D存放有已知路由路径Py; [0017] Step 3. 1.1; Comparative D set delay requirements of all elements in the transmission delay and the QoS requirements, the QoS bandwidth requirements update request, wherein the set of known routing path storing D Py ;

[001引步骤3. 1. 2 ;遍历集合D中的每个元素P。 [001] Step 3. 1.2 primer; through the collection of each element D P. .,比较Pu的传输带宽和QoS要求中的带宽要求,然后将不满足QoS的路径Pu放入待解决集合P ; ., Comparative Pu transmission bandwidth and QoS requirements in bandwidth requirements, and does not satisfy the QoS paths to be resolved into a set of P Pu;

[0019] 步骤3. 1. 3 ;最后根据QoS要求与资源限制,按照顺序对集合P中每个元素Pu计算A Sy,其中,A Sy表示为满足QoS要求而需要增加的带宽大小。 [0019] Step 3. 1.3; final QoS requirements and resource constraints, in order to calculate A Sy each element in the set P Pu, wherein, denoted as A Sy meet the QoS requirements need to increase the size of the bandwidth.

[0020] 优选地,所述步骤3. 1. 1,具体为: [0020] Preferably, said step 3.1.1, specifically:

[002U 若集合D中所有元素的传输时延之和大于QoS要求中的时延要求,则表示QoS要求中时延不满足,用A t表示集合D中所有元素的传输时延之和大于QoS要求中的时延要求的差值,At同时代表为满足QoS要求而需要减少的时延大小;根据At,通过At与AS 之间的转换公式计算AS, AS表示为满足QoS要求而需要增加的总带宽大小;按照顺序遍历集合D中的元素,计算AS加上最小的传输带宽,并与当前QoS要求中的带宽要求作比较,将较大者更新为QoS要求中的带宽要求; [002U set D if the transmission delay is greater than the sum of all elements and delay requirements of the QoS requirements, it indicates that the delay does not satisfy the QoS requirement, transmission delay represents all of the elements of the set D is greater than A t with QoS the difference between the delay requirements of the claims, At the same time to meet the QoS requirements on behalf of the need to reduce the size of the delay; according to At, is calculated by the conversion formula between the aS and the aS At, aS indicates to meet QoS requirements need to increase the total bandwidth size; collection element according to the traversal order of D, aS plus the minimum calculated transmission bandwidth, and compared with the current bandwidth requirements of the QoS requirements, larger bandwidth requirements were updated in the QoS requirement;

[0022] 其中,At与AS之间的转换公式如下; C [0022] wherein, between the conversion formulas are as follows At the AS; C

[002引。 [002 lead. ^ + r0 + rc ^ + R0 + rc

[0024] h 二衣+ Tu + T At = (1 _。 _ CC [0024] h diitaconate + Tu + T At = (1 _. _ CC

[0025] -奇-皂_ cc _ 奇_ Si + AS _ Si [0025] - Odd - CC _ _ soap odd _ Si + AS _ Si

[0026] 的二~瓦^-~c [0026] di ~ W ^ - ~ c

[0027] 其中,Si为协作前的路径带宽,S 2为协作后的路径的带宽,C为数据块长度,ti为协作前的传输时延,t,为协作后的传输时延,^为协作前的发送时延,f为协作后的发送时延,T。 [0027] where, Si is the path bandwidth before the collaboration, S 2 is the bandwidth of the path after the collaboration, C is a data block length, ti is the transmission delay before the collaboration, t, of transmission delay after collaboration is ^ send delay before the collaboration, sending delay after the collaboration is f, T. 为传播时延,T为处理时延。 Is a propagation delay, T is the processing delay.

[0028] 优选地,所述步骤4包括如下步骤: [0028] Preferably, said step 4 comprises the steps of:

[0029] 步骤4. 1 ;对集合P中的元素按照带宽从小到大进行排序; [0029] Step 4.1; P elements in the collection are sorted in the large bandwidth of ascending;

[0030] 步骤4. 2 ;根据宽带提升值,对集合P中每个元素P。 [0030] Step 4.2; broadband The boost value, each element of the set P P. 确定协作路径。 To determine the path of cooperation.

[0031] 优选地,在所述步骤4. 2中,将QoS要求不满足的情况转换成带宽提升值,具体为: [0031] Preferably, in said step 4.2, does not meet the QoS requirements of conversions to the bandwidth of the boost value, in particular:

[0032] 若QoS要求中带宽不满足,带宽提升值直接为QoS要求中的带宽要求减去Pu的当前带宽; [0032] If the QoS bandwidth requirements is not satisfied, the bandwidth value is subtracted directly enhance the current bandwidth Pu bandwidth requirements for the QoS requirements;

[0033] 若QoS要求中时延不满足,时延提升值为Py的当前时延减去QoS要求中的时延要求,根据时延提升值,通过时延带宽转换计算带宽提升值。 [0033] If the QoS delay requirements is not satisfied, the delay value Py enhance the current subtracting delay in the delay requirement of QoS requirements, in accordance with the delay boost values, calculate the bandwidth delay values ​​to enhance bandwidth of the converter.

[0034] 优选地,所述步骤4. 2,包括如下步骤: [0034] Preferably, the step 4.2, comprising the steps of:

[00对步骤4. 2. 1 ;遍历P。 [00 step 4. 2.1; traversal P. 周围网络节点,寻找节点Ni使得节点i与节点Ni的通信带宽大于等于AS,同时节点j与节点Ni的通信带宽大于等于AS ; Around the network node, such that the communication bandwidth to find the node Ni node i and Ni is not less than the AS node, while the node j and the node Ni communication bandwidth greater than or equal to the AS;

[0036] 步骤4. 2. 2 ;找到符合条件的节点N府,停止遍历; [0036] Step 4. 2.2; find qualified node N House, stopping traversal;

[0037] 步骤4. 2. 3 ;将路径P"i和PW加入原路由路径集合,其中,P m表示从节点i到N 1 之间的路径,Pjm表示从节点N 1到节点j之间的路径。 [0037] Step 4. 2.3; path P "i PW and joined to the original set of routing paths, wherein, P m denotes the path from node i to between 1 N, Pjm represents between node N 1 to the node j path of.

[003引根据本发明提供的一种无线网络中基于适度服务的自适应协作转发系统,所述无线网络中基于适度服务的自适应协作转发系统使用上述的无线网络中基于适度服务的自适应协作转发方法。 [003 incorporated in a wireless network for adaptive coordinated according to the present invention provides a system for adaptive coordinated appropriate forwarding services based on, the wireless network system using an adaptive forward appropriate collaboration services based on the wireless network based services moderate forwarding method.

[0039] 与现有技术相比,本发明具有如下的有益效果: [0039] Compared with the prior art, the present invention has the following advantages:

[0040] 本发明在满足用户的QoS要求的情况下,尽可能使网络流量和利用率达到最大值。 [0040] In the case of the present invention to meet the user's QoS requirements, network traffic and possible maximum utilization. 本发明主要针对认知无线电网络中的传输QoS要求不满足且周围网络空闲时,借助临近节点的协作传输,尽可能满足用户的QoS要求。 The present invention does not meet the QoS transmission for cognitive radio networks around the requirements and the network idle time, by means of coordinated transmission neighbor nodes as possible to meet the QoS requirements of users. 该种无线网络中基于适度服务的自适应协作转发方法能有效的提升网络利用率。 This kind of wireless network adaptive collaborative service-based forwarding method appropriate can effectively improve network utilization.

附图说明 BRIEF DESCRIPTION

[0041] 通过阅读参照W下附图对非限制性实施例所作的详细描述,本发明的其它特征、 目的和优点将会变得更明显: [0041] W with reference to a reading of the detailed description of non-limiting embodiments, other features of the present invention, objects and advantages will become more apparent:

[0042] 图1为本发明无线网络中基于适度服务的自适应协作转发方法的流程图。 [0042] FIG. 1 is a flowchart appropriate forwarding method based on adaptive collaborative services in a wireless network of the present invention.

[0043] 图2为根据QoS要求与资源限制,按照顺序对P中每个元素Py计算ASU。 [0043] FIG. 2 is a resource limitations in the order of P calculated for each element ASU Py QoS requirements.

[0044] 图3为根据A Sy,按照顺序对P中每个元素Py确定协作路径的原理示意图。 [0044] FIG. 3 is a A Sy, P schematic diagram according to the principles of each element in order to determine cooperative Py path.

具体实施方式 detailed description

[0045] 下面结合具体实施例对本发明进行详细说明。 Specific embodiments of the present invention will be described in detail [0045] below in conjunction. W下实施例将有助于本领域的技术人员进一步理解本发明,但不W任何形式限制本发明。 W contribute to the embodiment of the present art will be further understood in the art of the present invention, but not to limit the invention in any form W. 应当指出的是,对本领域的普通技术人员来说,在不脱离本发明构思的前提下,还可W做出若干变形和改进。 It should be noted that one of ordinary skill in the art, without departing from the inventive concept, W may make various modifications and improvements. 该些都属于本发明的保护范围。 These belong to the scope of the present invention.

[0046] 如图1所示,本发明无线网络中基于适度服务的自适应协作转发方法包括W下步骤: [0046] As shown, wireless network according to the present invention, a method for adaptive coordinated based forwarding services comprising 1 W modest steps of:

[0047] 步骤1 ;对网络内部无线电用户和空闲频带进行初始化; [0047] Step 1; internal radio network users and initialize idle band;

[0048] 步骤2 ;对已知路由路径、QoS要求、周围网络空闲的相关参数进行获取; [0048] Step 2; known routing path, QoS requirements, the relevant parameters will be acquired free surrounding network;

[0049] 步骤3 ;对是否触发协作模式进行确定; [0049] Step 3; mode for determining whether to trigger cooperation;

[0050] 步骤4 ;若触发协作模式,做出一系列的策略集; [0050] Step 4; if the trigger collaborative model, make a series of policy set;

[0化1] 步骤5,验证此策略集是网络容量最大化的近似值。 [0 of 1] Step 5, this verification strategy is set to maximize network capacity approximation.

[0化2] 其中,所述步骤3包括W下步骤: [0 of 2] wherein, W comprises the step 3 the steps of:

[0化3] 步骤3. 1 ;检查已知路由路径是否全部满足QoS要求; [0 of 3] Step 3.1; check known routing path satisfies all QoS requirements;

[0054] 步骤3. 2 ;检查待解决集合P中每一项P。 [0054] Step 3.2; Check to be resolved in each of the set P P. 周围网络是否空闲,若为空闲则将P。 Around the network is idle, if it is idle will be P. 赋值为true,否则赋值为false ; Assigned to true, otherwise the assignment is false;

[0化5] 步骤3. 3 ;若P中每一项都为true,则做出决策;触发协作模式;否则,不触发。 [0 of 5] Step 3.3; if each of the P are true, then make a decision; trigger collaborative model; otherwise, does not trigger. [0化6] 优选地,所述步骤3. 1中需要检查已知路由路径是否满足QoS要求并计算相关数据,首先比较D中所有元素的传输时延之和与QoS要求中的时延要求,若前者大于后者则表示QoS要求中时延不满足,用A t表示两者的差值,同时代表为满足QoS要求而需要减少的时延大小。 [0 of 6] Preferably, in said step 3.1 is known to check whether the routing path satisfies the QoS requirement and to calculate correlation data, the first comparison D the transmission delay of the delay requirements of all elements and the QoS requirements of If the former is larger than the latter represents the delay does not satisfy the QoS request, represented by the difference between the two a t, in order to meet the QoS requirements simultaneously represent a reduced latency required size. 根据At,可W通过公式计算AS,AS表示为满足QoS要求而需要增加的总带宽大小。 According At, W may be calculated by the formula AS, AS indicates to meet QoS requirements need to increase the size of the total bandwidth. 按照顺序遍历D中的元素,计算AS加上最小的传输带宽,并与当前QoS要求中的带宽要求作比较,将较大的那个更新为QoS要求中的带宽要求。 D in order to traverse element AS plus the minimum calculated transmission bandwidth, and bandwidth requirements of the current QoS requirements for comparison, the larger the bandwidth requirements for the updating of QoS requirements. 然后遍历D中的每个元素Pu,比较Pu的传输带宽和QoS要求中的带宽要求,然后将不满足QoS的路径PU放入待解决集合P ;最后根据QoS要求与资源限制,按照顺序对P中每个元素Pu计算ASU; Then each element traversing D Pu, Pu comparing transmission bandwidth and QoS requirements in bandwidth requirements, and does not satisfy the QoS paths to be resolved into a set of P PU; final QoS requirements and resource constraints, in order for P each element Pu calculating the ASU;

[0化7] 所述步骤4包括W下步骤: [0 of 7] W comprises the steps of Step 4:

[0化引步骤4. 1 ;对P中的元素按照带宽从小到大进行排序; [Step 0 of primers 4.1; P of the elements are sorted in ascending bandwidths;

[0059] 步骤4. 2 ;根据宽带提升值,对P中每个元素Pu确定协作路径。 [0059] Step 4.2; broadband The boost value, determines the path to cooperate each element P Pu.

[0060] 优选地,所述步骤4. 2中捜索Py周围网络节点,寻找节点N 1使得节点i与节点N 1 的通信带宽大于等于AS,同时节点j与节点Ni的通信带宽大于等于AS;当找到符合条件的节点时,停止遍历;将路径P«i和PW加入原路由路径集合D。 [0060] Preferably, the step Dissatisfied Py around cable network node 4.2, node N 1 to find that node i and the node N 1 is greater than or equal communication bandwidth the AS, while the node j and the node Ni communication bandwidth greater than or equal to the AS; when found eligible node, traversal stops; path P «i PW and joined to the original set of routing path D.

[0061] W下结合具体的实施例对本发明的技术方案作进一步信息描述,整个发明实现过程如下: [0061] of W with reference to specific examples of the technical solutions of embodiments of the present invention will be further described information, the entire disclosure realization process is as follows:

[0062] 步骤1 ;对网络内部无线电用户和空闲频带进行初始化 [0062] Step 1; internal radio network and the available bandwidth the user initializes

[0063] 假设带宽分配方法是已知的,根据相应的带宽分配方法对网络内部无线电用户和空闲频带进行分配。 [0063] Suppose the bandwidth allocation method is known, according to corresponding bandwidth allocation method for a radio within the network user and idle frequency band allocation.

[0064] 步骤2 ;对路由路径、QoS要求、周围网络空闲的相关参数进行获取[00化]假设路由路径是已知的,存放在集合D中,每一段表示为Py,i和j表示两个不同的节点。 [0064] Step 2; path routing, QoS requirements, the relevant parameters will be acquired free surrounding network [of 00] assume the routing path are known, stored in set D, each section is expressed as Py, i and j represent two different nodes. 对于D中的每个元素Pu,需要获取其传输时延、传输带宽。 For each element in D Pu, which need to acquire the transmission delay, transmission bandwidth. 还要对整条路径的QoS 要求进行获取,该里只需要时延要求和带宽要求。 But also for the entire path of QoS requirements for obtaining, in which only delay requirements and bandwidth requirements. 最后对周围网络空闲的相关参数进行获取,需要根据已知的公式判断此局部网络是否空闲。 Finally, the relevant parameters will be acquired free surrounding network needs to judge whether the local network is idle according to a known formula.

[0066] 步骤3 ;对是否触发协作模式进行确定; [0066] Step 3; mode for determining whether to trigger cooperation;

[0067] 步骤3. 1 ;检查已知路由路径是否满足QoS要求并计算相关数据。 [0067] Step 3.1; check for known routing path satisfies the QoS requirement and to calculate correlation data.

[0068] 步骤3. 1. 1 ;比较D中所有元素的传输时延之和与QoS要求中的时延要求。 [0068] Step 3. 1.1; Comparative D, the sum of the delay and transmission delay requirements of the QoS requirements of all elements.

[0069] 若前者大于后者则表示QoS要求中时延不满足,用A t表示两者的差值,同时代表为满足QoS要求而需要减少的时延大小。 [0069] If the former is larger than the latter represents the delay does not satisfy the QoS request, represented by the difference between the two A t, in order to meet the QoS requirements simultaneously represent a reduced latency required size. 根据At,可W通过公式计算AS,AS表示为满足QoS要求而需要增加的总带宽大小。 According At, W may be calculated by the formula AS, AS indicates to meet QoS requirements need to increase the size of the total bandwidth. 按照顺序遍历D中的元素,计算AS加上最小的传输带宽,并与当前QoS要求中的带宽要求作比较,将较大的那个更新为QoS要求中的带宽要求。 D in order to traverse element AS plus the minimum calculated transmission bandwidth, and bandwidth requirements of the current QoS requirements for comparison, the larger the bandwidth requirements for the updating of QoS requirements.

[0070] 其中,At与AS之间的转换公式如下; C [0070] wherein, between the conversion formulas are as follows At the AS; C

[0071] = - + r〇+ rc [0071] = - + + RC r〇

[007引(2 = ^ + r0 + r At = t'l _。 _c c [007 Primer (2 = ^ + r0 + r At = t'l _. _c c

[0073] -奇-這_ cc ^ ^ ~ Sj, + AS _ Si 口074]的二--~百 [0073] - Odd - this _ cc ^ ^ ~ Sj, + AS _ Si port 074] di - ~ one hundred

[0075] 其中,Si为协作前的路径带宽,S 2为协作后的路径的带宽,C为数据块长度,t 1为协作前的传输时延,t,为协作后的传输时延,f为协作前的发送时延,为协作后的发送时延,T。 [0075] where, Si is the path bandwidth before the collaboration, S 2 after the path bandwidth collaboration, C is a data block length, t 1 is the time delay before the cooperative transmission, t, of transmission delays after collaborative, f to send delay before the collaboration, to send delay after the collaboration, T. 为传播时延,T为处理时延。 Is a propagation delay, T is the processing delay.

[0076] 步骤3. 1. 2 ;遍历D中的每个元素P。 [0076] Step 3. 1.2; D through each element of P. .,比较Pu的传输带宽和QoS要求中的带宽要求,然后将不满足QoS的路径Pu放入待解决集合P ; ., Comparative Pu transmission bandwidth and QoS requirements in bandwidth requirements, and does not satisfy the QoS paths to be resolved into a set of P Pu;

[0077] 步骤3. 1. 3 ;根据QoS要求与资源限制,按照顺序对P中每个元素Pu计算ASU; [0077] Step 3. 1.3; QoS requirements and resource constraints, in order to calculate P ASU each element of Pu;

[0078] 将QoS要求不满足的情况转换成A Sy,其中A Sy是为满足QoS要求而需要增加的带宽大小。 [0078] does not satisfy the QoS requirements conversions into A Sy, wherein A Sy meet the QoS requirement is the need to increase the size of the bandwidth. 若QoS要求中带宽不满足,A Su直接为QoS要求中的带宽要求减去P。 If the QoS requirement is not satisfied bandwidth, A Su directly minus the bandwidth requirements of QoS requirements P. 的当前带宽。 The current bandwidth. 结果如图2所示。 The results shown in Fig.

[0079] 步骤3. 2 ;检查周围网络是否空闲 [0079] Step 3.2; check whether the network is idle around

[0080] 对待解决集合P中每一项Pu的周围网络空闲的相关参数进行计算,判断是否空闲。 [0080] treated solve a set of parameters P, around each of the network idle Pu is calculated, it is determined whether or not idle. 若为空闲,则将P。 If it is idle, then P. 赋值为true,否则赋值为false ; Assigned to true, otherwise the assignment is false;

[0081] 步骤3. 3 ;对是否触发协作模式做出决策 [0081] Step 3.3; make a decision on whether to trigger a collaborative model

[00間若P中每一项都为true,则做出决策;触发协作模式;否则,不触发。 [00 P if every item is true, then make a decision; trigger collaborative model; otherwise, does not trigger.

[0083] 步骤4 ;若触发协作模式,做出一系列的策略集 [0083] Step 4; if the trigger collaborative model, make a series of policy set

[0084] 步骤4. 1 ;对P中的元素按照带宽从小到大进行排序 [0084] Step 4.1; P of the elements are sorted in ascending bandwidths

[0085] 步骤4. 2 ;根据A Su,按照顺序对P中每个元素Pu确定协作路径。 [0085] Step 4.2; The A Su, P, in order for each element to determine Pu cooperate path.

[0086] 步骤4. 2. 1 ;捜索Py周围网络节点,寻找节点N 1使得节点i与节点N 1的通信带宽大于等于AS,同时节点j与节点Ni的通信带宽大于等于AS ; [0086] Step 4. 2.1; Py Dissatisfied cord around network node, find node N 1 so that the node i and the node N 1 is greater than or equal communication bandwidth the AS, while the node j and the node Ni communication bandwidth greater than or equal to the AS;

[0087] 步骤4. 2. 2 ;当找到符合条件的节点时,停止遍历; [0087] Step 4. 2.2; when found qualified node, traversal stops;

[00能]步骤4. 2. 3 ;将路径P"i和PW加入原路由路径集合D。结果如图3所示: [00 can] Step 4. 2.3; path P "i PW and joined to the original set of routing path D. The results shown in Figure 3:

[0089] W上对本发明的具体实施例进行了描述。 [0089] W on the specific embodiments of the present invention have been described. 需要理解的是,本发明并不局限于上述特定实施方式,本领域技术人员可W在权利要求的范围内做出各种变形或修改,该并不影响本发明的实质内容。 It is to be understood that the present invention is not limited to the particular embodiments, those skilled in the art may make various modifications or alterations W within the scope of the claims, that does not affect the substance of the present invention.

Claims (8)

1. 一种无线网络中基于适度服务的自适应协作转发方法,其特征在于,包括以下步骤: 步骤1:对网络内部无线电用户和空闲频带进行初始化; 步骤2 :对已知路由路径、QoS要求、已知节点周围网络空闲的相关参数进行获取; 步骤3:对是否触发协作模式进行确定; 步骤4:若触发协作模式,做出一系列的策略集。 A wireless network based on an appropriate method for adaptive coordinated forwarding services, characterized by comprising the following steps: Step 1: internal radio network users and initialize idle band; Step 2: known routing path, QoS requirements , the relevant parameters are known around the nodes of the network will be free to obtain; step 3: to determine whether to trigger the cooperation mode; step 4: if the trigger collaborative model, make a series of policy set.
2. 根据权利要求1所述的无线网络中基于适度服务的自适应协作转发方法,其特征在于,所述步骤3包括以下步骤: 步骤3. 1 :检查已知路由路径是否全部满足QoS要求,并将不满足QoS要求的路径Pu放入待解决集合P,其中,表示节点i与节点j之间的路径; 步骤3. 2 :检查待解决集合P中每一项周围网络是否空闲,若为空闲则将赋值为true,否则赋值为false ; 步骤3. 3 :若待解决集合P中每一项Pi」都为true,则做出决策:触发协作模式;否则, 不触发。 Wireless network according to claim 1 in an appropriate forwarding method based on adaptive collaboration services, wherein said step 3 comprises the following steps: Step 3.1: Check whether all known routing path satisfies the QoS requirement, and does not meet the QoS requirement to be resolved into a set of paths P Pu, which represents the path between the node i and a node J; step 3.2: check each of the set P to be resolved around a network is idle, if it is idle will be assigned to true, otherwise the assignment is false; step 3.3: If the set P to be resolved in each of Pi "are true, then make a decision: trigger collaborative model; otherwise, does not trigger.
3. 根据权利要求2所述的无线网络中基于适度服务的自适应协作转发方法,其特征在于,在所述步骤3. 1中,需要检查已知路由路径是否满足QoS要求并计算相关数据,具体为: 步骤3. 1. 1:比较集合D中所有元素的传输时延之和与QoS要求中的时延要求,更新QoS要求中的带宽要求,其中,集合D存放有已知路由路径Pij; 步骤3. 1. 2:遍历集合D中的每个元素Pu,比较Pu的传输带宽和QoS要求中的带宽要求,然后将不满足QoS的路径放入待解决集合P; 步骤3. 1. 3:最后根据QoS要求与资源限制,按照顺序对集合P中每个元素计算ASu,其中,A表示为满足QoS要求而需要增加的带宽大小。 Wireless network according to claim 2 in an appropriate forwarding method based on adaptive collaboration services, wherein, in said step 3.1, is known to check routing path satisfies the QoS requirement and to calculate correlation data, specifically: step 3.1.1: comparison of transmission delay set D of all the elements and the delay requirements of the QoS requirements, bandwidth requirements updated QoS requirements, wherein the set of known routing path storing D Pij ; 3. 1. step 2: traversing each element in set D Pu, Pu bandwidth-transmission bandwidth and QoS requirements, and will not meet the QoS paths to be resolved into a set of P; step 3.1. 3: Finally, QoS requirements and resource constraints, in order to calculate the set P ASu each element, wherein, a represents to meet QoS requirements need to increase the size of the bandwidth.
4. 根据权利要求3所述的无线网络中基于适度服务的自适应协作转发方法,其特征在于,所述步骤3. 1.1,具体为: 若集合D中所有元素的传输时延之和大于QoS要求中的时延要求,则表示QoS要求中时延不满足,用△t表示集合D中所有元素的传输时延之和大于QoS要求中的时延要求的差值,At同时代表为满足QoS要求而需要减少的时延大小;根据At,通过At与AS之间的转换公式计算AS,AS表示为满足QoS要求而需要增加的总带宽大小;按照顺序遍历集合D中的元素,计算AS加上最小的传输带宽,并与当前QoS要求中的带宽要求作比较,将较大者更新为QoS要求中的带宽要求; 其中,At与AS之间的转换公式如下: Wireless network according to claim 3, said method for adaptive coordinated forwarding services based moderate, wherein said step 3. 1.1, in particular: if the transmission delay set D is greater than all the elements of QoS request latency requirement, it indicates the delay does not satisfy the QoS requirements, set D represents the difference of transmission delays of all the elements and is greater than the QoS requirements requested by the delay △ t, At the same time meet the QoS representatives delay requirements need to reduce the size; the At is calculated by the conversion formula between the aS and the aS At, aS indicates to meet QoS requirements need to increase the size of the total bandwidth; order through the collection element D is calculated plus aS the minimum transmission bandwidth and the bandwidth requirements of the current QoS requirements by comparing the updated larger bandwidth requirements of QoS requirements; wherein the conversion formula between, At the aS as follows:
Figure CN104486800AC00021
Figure CN104486800AC00031
其中,Si为协作前的路径带宽,S2为协作后的路径的带宽,C为数据块长度,ti为协作前的传输时延,〖2为协作后的传输时延,f为协作前的发送时延,f为协作后的发送时延, L为传播时延,T为处理时延。 Where, Si is the path bandwidth before cooperation, S2 is the bandwidth of the path of the collaboration, C is a data block length, ti is the transmission delay before the collaboration, the transmission delay of 2 〖collaboration, f is transmitted before the cooperative delay, f is the transmission delay collaboration, L is the propagation delay, T is the processing delay.
5. 根据权利要求2或4所述的无线网络中基于适度服务的自适应协作转发方法,其特征在于,所述步骤4包括如下步骤: 步骤4. 1 :对集合P中的元素按照带宽从小到大进行排序; 步骤4. 2 :根据宽带提升值,对集合P中每个元素确定协作路径。 2 or 4 according to the wireless network based adaptive coordinated appropriate forwarding service claim, wherein said step 4 comprises the following steps: Step 4.1: the elements of the set P in accordance with a bandwidth from small to large sorting; step 4.2: the broadband boosting value, determines the path of the set P cooperate each element.
6. 根据权利要求5所述的无线网络中基于适度服务的自适应协作转发方法,其特征在于,在所述步骤4. 2中,将QoS要求不满足的情况转换成带宽提升值,具体为: 若QoS要求中带宽不满足,带宽提升值直接为QoS要求中的带宽要求减去的当前带宽; 若QoS要求中时延不满足,时延提升值为Pi」的当前时延减去QoS要求中的时延要求, 根据时延提升值,通过时延带宽转换计算带宽提升值。 The cooperative forwarding method of adaptive wireless network as claimed in claim 5, wherein the moderate-based services, wherein, in said step 4.2, the QoS requirement is not satisfied the bandwidth into a boost value, in particular : If the QoS bandwidth requirements are not met, the bandwidth upgrade directly subtracted value for the current bandwidth requirements of QoS bandwidth requirements; if the delay does not satisfy the QoS requirements, to enhance the value of Pi delay "minus the current delay QoS requirements the delay requirements, delay according to boost values, the conversion is calculated by the bandwidth of the boost value delay bandwidth.
7. 根据权利要求5所述的无线网络中基于适度服务的自适应协作转发方法,其特征在于,所述步骤4. 2,包括如下步骤: 步骤4. 2. 1 :遍历周围网络节点,寻找节点N:使得节点i与节点N:的通信带宽大于等于AS,同时节点j与节点&的通信带宽大于等于AS; 步骤4. 2. 2 :找到符合条件的节点&时,停止遍历; 步骤4. 2. 3 :将路径PiN1和PjN1加入原路由路径集合,其中,PiN1表示从节点i到Ni之间的路径,表示从节点Ni到节点j之间的路径。 5 according to the wireless network based adaptive coordinated appropriate forwarding service claim, wherein said step 4.2, comprising the following steps: Step 4. 2.1: traversing the nodes around the network, looking for node N: such that node i and the node N: not less than the AS communication bandwidth, while the node j and node & communication bandwidth greater than or equal the AS; 2.2 step 4: when found eligible node & stopping traversal; step 4 . 2.3: PIN1 path routing and primary PjN1 added set of paths, wherein, PIN1 represents the path between the node i Ni, Ni denotes the path from node J between nodes.
8. -种无线网络中基于适度服务的自适应协作转发系统,其特征在于,所述无线网络中基于适度服务的自适应协作转发系统使用权利要求1至7中任一项所述的无线网络中基于适度服务的自适应协作转发方法。 8. - kind of adaptive coordinated wireless network forwarding system based on appropriate service, wherein the wireless network using cooperative forwarding system as claimed adaptive appropriate wireless network and services based in claim 1 to any one of claims 7 forwarding method based on adaptive collaboration moderately services.
CN 201410751607 2014-12-09 2014-12-09 Moderate service-based adaptive cooperative transmission method and system in wireless network CN104486800A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201410751607 CN104486800A (en) 2014-12-09 2014-12-09 Moderate service-based adaptive cooperative transmission method and system in wireless network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201410751607 CN104486800A (en) 2014-12-09 2014-12-09 Moderate service-based adaptive cooperative transmission method and system in wireless network

Publications (1)

Publication Number Publication Date
CN104486800A true true CN104486800A (en) 2015-04-01

Family

ID=52761290

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201410751607 CN104486800A (en) 2014-12-09 2014-12-09 Moderate service-based adaptive cooperative transmission method and system in wireless network

Country Status (1)

Country Link
CN (1) CN104486800A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105049139A (en) * 2015-07-07 2015-11-11 河海大学常州校区 Cognitive User information transmission method applied to cognitive radio system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050053094A1 (en) * 2003-09-09 2005-03-10 Harris Corporation Mobile ad hoc network (MANET) providing quality-of-service (QoS) based unicast and multicast features
US20070041345A1 (en) * 2005-08-17 2007-02-22 Yarvis Mark D Methods and apparatus for providing an integrated multi-hop routing and cooperative diversity system
CN101459948A (en) * 2009-01-04 2009-06-17 北京航空航天大学 Cooperative routing method
CN102244913A (en) * 2010-05-12 2011-11-16 华为技术有限公司 Multi-hop routing cooperation method of wireless network and realization apparatus thereof
CN103096413A (en) * 2013-02-21 2013-05-08 湖南大学 Multi-interface multi-hop wireless network lower-distribution type cooperation route method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050053094A1 (en) * 2003-09-09 2005-03-10 Harris Corporation Mobile ad hoc network (MANET) providing quality-of-service (QoS) based unicast and multicast features
US20070041345A1 (en) * 2005-08-17 2007-02-22 Yarvis Mark D Methods and apparatus for providing an integrated multi-hop routing and cooperative diversity system
CN101459948A (en) * 2009-01-04 2009-06-17 北京航空航天大学 Cooperative routing method
CN102244913A (en) * 2010-05-12 2011-11-16 华为技术有限公司 Multi-hop routing cooperation method of wireless network and realization apparatus thereof
CN103096413A (en) * 2013-02-21 2013-05-08 湖南大学 Multi-interface multi-hop wireless network lower-distribution type cooperation route method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105049139A (en) * 2015-07-07 2015-11-11 河海大学常州校区 Cognitive User information transmission method applied to cognitive radio system

Similar Documents

Publication Publication Date Title
Choi et al. Joint resource allocation for parallel multi-radio access in heterogeneous wireless networks
Shi et al. A distributed optimization algorithm for multi-hop cognitive radio networks
Zheng et al. Device-centric spectrum management
US20140113643A1 (en) System and Method for Radio Access Virtualization
Ren et al. A survey on dynamic spectrum access protocols for distributed cognitive wireless networks
CN102088736A (en) User position list-based method for selectively multiplexing multiple honeycomb user resources for device to device (D2D) user pairs
CN102083138A (en) Method for simultaneously multiplexing multiple cellular user resources by D2D (Device-to-Device) user pair
CN102123496A (en) Method for multiplexing cellular user resources of device-to-device (D2D) user pairs based on base station positioning
CN101977391A (en) Multiple terminal cooperative communication method in cognition wireless network
CN101702635A (en) Method for switching frequency spectrum based on cognitive radio technology and system thereof
Wen et al. QoS-aware mode selection and resource allocation scheme for device-to-device (D2D) communication in cellular networks
CN102098684A (en) System and method for allocating cross-layer resources in cognitive radio network
CN101827418A (en) Energy optimization-based cognitive radio multicast routing method
CN101977386A (en) Interference coordination method of femtocell grouping in cellular network
CN102404751A (en) Cross-layer cognitive radio network user access method based on frequency hopping
CN101594617A (en) Method for establishing control channel of hierarchical spectrum sharing network
CN102223644A (en) System and method for combining relay selection and power distribution
CN101635974A (en) Self-organizing cognitive wireless network routing method
CN102355670A (en) Multichannel wireless mesh network channel distribution method
Li et al. On efficient resource allocation for cognitive and cooperative communications
CN101534557A (en) Method for allocating resources optimally in distributed mode by self-organizing cognitive wireless network
CN101778114A (en) Method for multi-channel parallel transmission of streaming media services on basis of load balance
Xiao et al. Opportunistic channel selection approach under collision probability constraint in cognitive radio systems
Chen et al. Efficient spectrum utilization via cross-layer optimization in distributed cognitive radio networks
Akhtar et al. Synergistic spectrum sharing in 5G HetNets: A harmonized SDN-enabled approach

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination