Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberCN1929688 A
Publication typeApplication
Application numberCN 200610153724
Publication date14 Mar 2007
Filing date8 Sep 2006
Priority date8 Sep 2005
Also published asUS20070066315
Publication number200610153724.5, CN 1929688 A, CN 1929688A, CN 200610153724, CN-A-1929688, CN1929688 A, CN1929688A, CN200610153724, CN200610153724.5
Inventors门洋一
Applicant冲电气工业株式会社
Export CitationBiBTeX, EndNote, RefMan
External Links: SIPO, Espacenet
Method of setting a network path and wireless station
CN 1929688 A
Abstract  translated from Chinese
本发明涉及对于设有多个无线站的无线网状网络,指定了将其中2个无线站直通的会话时,设定该会话路径的方法。 When the present invention relates to a plurality of wireless stations for wireless mesh networks, which specifies the two radio stations straight session, the session path setting method. 首先,基于跳数取得对应会话的路径候补。 First, the number of hops to obtain the corresponding session-based alternate path. 当存在多个路径候补时,对各路径候补计算无线资源消耗量或者计算基于中继无线站的话务裕度的路径候补的话务裕度。 When there are a plurality of candidate paths, calculating the wireless resource consumption or computing traffic path traffic margin Margin relay wireless station based on each candidate path candidate. 然后,以计算的无线资源消耗量或路径候补的话务裕度为评价参数,选择并设定会话路径。 Then, it works with wireless resource consumption margin or alternate route calculation parameters for evaluation, selection and set the session path. 从而,从多个连接路径中选择网络整体上合适的连接路径。 Thus, to choose the right path to connect to the network as a whole from multiple connection paths.
Claims(6)  translated from Chinese
1.一种网络路径设定方法,对于设有多个无线站的无线网状网络,指定了将其中2个上述无线站直通的会话时,设定该会话路径,其特征在于:基于跳数,取得对应于上述会话的路径候补,当有多个路径候补时,对各路径候补计算无线资源消耗量,以计算的无线资源消耗量作为全部或一部分的评价参数,选择并设定会话路径。 A network path setting method, a plurality of wireless stations for wireless mesh network, which is specified when the two straight session of the wireless stations, setting the session path, wherein: based on the number of hops , corresponding to the session to obtain the path candidates, when there are a plurality of candidate paths, the path of each candidate calculating the wireless resource consumption to calculate the consumption of radio resources as all or part of the evaluation parameters, select and set the session path.
2.一种网络路径设定方法,对于设有多个无线站的无线网状网络,指定了将其中2个上述无线站直通的会话时,设定该会话路径,其特征在于:基于跳数,取得对应于上述会话的路径候补,当有多个路径候补时,对各路径候补计算基于中继无线站的话务裕度的路径候补的话务裕度,以计算的路径候补的话务裕度作为全部或一部分的评价参数,选择并设定会话路径。 2. A network path setting method, a plurality of wireless stations for wireless mesh network, which is specified when the two straight session of the wireless stations, setting the session path, wherein: based on the number of hops made corresponding to the above sessions alternate route when there are multiple alternate paths, the path is calculated route traffic margin margin relay traffic radio station based on each candidate alternate path to calculate the candidate's traffic margin as all or part of the evaluation parameters, select and set the session path.
3.一种网络路径设定方法,对于设有多个无线站的无线网状网络,指定了将其中2个上述无线站直通的会话时,设定该会话路径,其特征在于:基于跳数,取得对应于上述会话的路径候补,当有多个路径候补时,对各路径候补计算无线资源消耗量,同时计算基于中继无线站的话务裕度的路径候补的话务裕度,以计算的无线资源消耗量及路径候补的话务裕度作为全部或一部分的评价参数,选择并设定会话路径。 3. A network path setting method, a plurality of wireless stations for wireless mesh network, which is specified when the two straight session of the wireless stations, setting the session path, wherein: based on the number of hops made corresponding to the above sessions alternate route when there are multiple paths candidate when the candidate is calculated for each path, the radio resource consumption, while calculating traffic paths margin margin relay traffic radio station based candidates to Traffic margin wireless resource consumption and route calculation as a candidate for all or part of the evaluation parameters, select and set the session path.
4.如权利要求1至权利要求3中任一项所述的网络路径设定方法,其特征在于:计算各路径候补中的预测延迟量,也将计算的预测延迟量用作评价参数。 4. The network of claim 1 to claim path setting method according to any one of claims 3, wherein: calculated for each candidate prediction path delay amount, a delay amount calculation will be used as a predictive evaluation parameters.
5.一种无线站,它是无线网状网络的构成要素,其特征在于:设有执行权利要求1至权利要求4中任一项所述的网络路径设定方法的路径设定部件。 A radio station, which is the constituent elements of the wireless mesh network, wherein: the implementation of features claimed in claim 1 to claim path network path setting method according to any one of claims 4 setting means.
6.如权利要求5所述的无线站,其特征在于:具备与其它无线站进行通信的多个收发模块。 The radio station according to claim 5, wherein: a plurality of transceiver stations and other wireless communications.
Description  translated from Chinese
网络路径设定方法及无线站 The network path setting method and radio stations

技术领域 FIELD

本发明涉及网络路径设定方法及无线站,例如适用于无线IP电话等的业务提供的具有多个连接路径的无线通信系统。 The present invention relates to a network path setting method and a wireless station, e.g., a wireless communication system having a plurality of connection paths for the wireless IP telephony and other services provided.

背景技术 BACKGROUND

具有多个连接路径的无线网络根据出发点有无线多跳通信网络、无线特别网络、无线网状网络等不同的称呼(以下称为无线网状网络),希望在多个连接路径中选择最佳连接路径。 Wireless network having a plurality of connection paths in accordance with the starting point have different names wireless multihop communication network, a wireless ad hoc network, wireless mesh network (hereinafter, referred to as wireless mesh network), is desirable to select the best connection in a plurality of connection paths path.

一直以来,作为可在短时间内检索通信所需的最佳路径的方法,有专利文献1中记载的方法。 Heretofore, as a method to retrieve an optimal path in a short time required for the communication, there is a method described in Patent Document 1. 该方法中,作为无线网状网络中的路径选择的指标,采用链路(在1次收发处理中执行的节点与节点的连接;专利文献1的表现为通信路径)的误比特率及反映数据的传送速度权重。 In this method, as an indicator of the wireless mesh network path selection using the link (a connection to a receiving process in the primary node and the node; the performance of Patent Document 1 is a communication path) bit error rate and the data that reflects transmission rate weight.

专利文献1:日本特开2003-152786号公报发明内容但是,在传统技术中,并不想实现无线网状网络中的全体路径上的最优化。 Patent Document 1: Japanese Laid-Open Publication No. 2003-152786 DISCLOSURE OF THE INVENTION However, in the conventional art, does not want to optimize the entire wireless mesh network path.

例如,在确立链路的层上,公开了基于误比特率与传送速度的权重计算方法、考虑了实际传送延迟的权重计算方法,并公开了由这些计算结果获得的权重的最佳路线的确定方法,但考虑了传送延迟的权重,延迟越大权重值越大,权重的加法值增加,其操作成为难以选择路径。 For example, on the layer to establish the link, discloses heavy weights are calculated bit error rate and transmission rate based method, considering the actual transmission delay weight calculation method, and discloses a right from these calculation results obtained heavy best route determination method, but considering the transmission delay increases the weight, the greater the delay the greater the weight values, the weight of the addend, its operation becomes difficult to select a path.

误比特率小的路径并不限于整体上最佳的路径,另外,传送延迟小的路径也不限于整体上最佳的路径。 Bit error rate is small the optimal path is not limited to the path as a whole, in addition, a small transmission delay path is not limited to the best overall path. 例如,尽管一部分无线资源中的队列长度较短,由于缺乏无线资源,要在无线网状网络上实现整体的最佳,则要考虑使选择的路线给予网络整体的成本最小化。 For example, although a portion of the radio resources in the queue length is short, due to lack of radio resources, to achieve the overall best in the wireless mesh network, consider the selection of the route given the overall cost of the network is minimized.

因此,希望从多个连接路径中能够选择从网络整体来看合适的连接路径的网络路径设定方法及无线站。 It is therefore desirable from a plurality of connection paths to select the appropriate connection network path from the network as a whole path setting method and a radio station.

本发明第一方面的特征在于:对于设有多个无线站的无线网状网络,指定了将其中2个上述无线站直通的会话时,设定该会话路径的网络路径设定方法中,基于跳数,取得对应于上述会话的路径候补,当有多个路径候补时,对各路径候补计算无线资源消耗量,以计算的无线资源消耗量作为全部或一部分的评价参数,选择并设定会话路径。 The first aspect of the present invention is characterized in that: a plurality of wireless stations for wireless mesh network, which is specified to the wireless station when two straight session, the network path setting method of setting the session path, based on hops, made corresponding to the session path candidates, when there are a plurality of candidate paths, the path of each candidate calculating the wireless resource consumption to calculate the consumption of radio resources as all or part of the evaluation parameters, selecting and setting the session path.

本发明第二方面的特征在于:对于设有多个无线站的无线网状网络,指定了将其中2个上述无线站直通的会话时,设定该会话路径的网络路径设定方法中,基于跳数,取得对应于上述会话的路径候补,当有多个路径候补时,对各路径候补计算基于中继无线站的话务裕度的路径候补的话务裕度,以计算的路径候补的话务裕度作为全部或一部分的评价参数,选择并设定会话路径。 A second aspect of the present invention is characterized in that: a plurality of wireless stations for wireless mesh network, which is specified to the wireless station when two straight session, the network path setting method of setting the session path, based on hops, made corresponding to the above sessions alternate route when there are multiple paths candidate, the candidate for each path, the path is calculated based on the radio station's relay traffic margin margin candidate traffic path to calculate the candidate's Traffic margin as all or part of the evaluation parameters, select and set the session path.

本发明第三方面的特征在于:对于设有多个无线站的无线网状网络,指定了将其中2个上述无线站直通的会话时,设定该会话路径的网络路径设定方法中,基于跳数,取得对应于上述会话的路径候补,当有多个路径候补时,对各路径候补计算无线资源消耗量,同时计算基于中继无线站的话务裕度的路径候补的话务裕度,以计算的无线资源消耗量及路径候补的话务裕度作为全部或一部分的评价参数,选择并设定会话路径。 A third aspect of the present invention is characterized in that: a plurality of wireless stations for wireless mesh network, wherein when the specified two straight session of the wireless stations, setting a network path setting method of the session path, based on hops, made corresponding to the above sessions alternate route when there are multiple paths candidate, the candidate is calculated for each path, the radio resource consumption, while calculating traffic route traffic margin margin-based wireless relay station candidate , traffic margin wireless resource consumption and route calculation as a candidate for all or part of the evaluation parameters, select and set the session path.

本发明第四方面的特征在于:无线网状网络的构成要素即无线站,设有执行本发明第一~第三方面中任一方面的网络路径设定方法的路径设定部件。 A fourth aspect of the present invention is characterized in that: the elements constituting the wireless mesh network, i.e. the radio station, is provided on the one hand the network path setting method of the third aspect of the present invention is the first to perform any of the path setting means.

依据本发明,对于某一会话有多个路径候补时,对于各路径候补计算无线资源消耗量和/或路径候补的话务裕度,并以计算的无线资源消耗量和/或路径候补的话务裕度作为评价参数,选择并设定会话路径,因此从网络整体来看可选择合适的连接路径。 According to the present invention, for a session when a plurality of candidate paths, calculating for each candidate route traffic margin radio resource consumption and / or path candidate, and the radio resource consumption and / or path calculation candidate words Service margin as evaluation parameters, select and set the session path, so choose the appropriate connection path from the network as a whole.

附图说明 Brief Description

图1是表示实施例的会话路径的设定动作的流程图。 Figure 1 is a flowchart showing the setting operation of the session path according to an embodiment.

图2是表示实施例的无线站的结构的方框图。 Figure 2 is a block diagram of an embodiment of a wireless station Fig.

图3是表示实施例的动作说明用的无线网状网络的结构说明图。 Figure 3 is a diagram showing operation of the embodiment described with the structure illustrating a wireless mesh network.

图4是表示对图3的各无线站测量的特性值的说明图。 Figure 4 is an explanatory characteristic value for each radio station measures of Figure 3 Fig.

图5是表示图3的各链路的传送速度的说明图。 5 is a transmission rate of each link in Fig. 3. Fig.

图6是表示对图3的无线网状网络请求的会话例的说明图。 6 is an explanatory diagram showing an example of the session of FIG. 3 of the wireless mesh network requests.

图7是表示图6的会话相关的路径候补与路径设定用的参数值的说明图。 Figure 7 is an explanatory diagram of the session parameter values in Fig. 6 candidate path associated with the path setting used.

符号说明100...无线站,101...路径管理部,102...队列管理部,103...中央控制部,110...收发模块,111...无线接收部,112...接收控制部,113...发送控制部,114...无线发送部,115...连接管理部。 Description of Symbols 100 ... radio station, the path management unit 101 ..., 102 ... queue managing unit, the central control unit 103 ..., 110 ... transceiver module, 111 ... wireless reception unit, 112. .. reception control unit, 113 ... transmission control unit, 114 ... wireless transmission unit, 115 ... connection management section.

具体实施方式 DETAILED DESCRIPTION

(A)实施例以下,参照附图详细说明本发明的网络路径设定方法及无线站的一实施例。 (A) Examples The following detailed description with reference to the drawings the present invention is a network path setting method and a radio station of an embodiment.

(A-1)实施例的构成图2是表示构成无线网状网络的实施例的无线站的基本结构的方框图。 (A-1) System Configuration Fig. 2 is a block diagram showing an embodiment of a wireless mesh network of basic configuration of a radio station.

图1中,各无线站100设有路径管理部101、队列管理部102、中央控制部103及1个收发模块110。 1, each wireless station 100 is provided with the path management unit 101, a queue management module 102, the central control unit 103 and a transceiver module 110. 另外,路径管理部101、队列管理部102及中央控制部103例如由CPU、ROM、RAM、EEPROM等构成,以软件方式执行处理。 Further, the path management unit 101, a queue management unit 102 and the central control unit 103 is configured by CPU, ROM, RAM, EEPROM, etc., in a software manner processing.

收发模块110设有无线接收部111、接收控制部112、发送控制部113、无线发送部114及连接管理部115。 Transceiver module 110 is provided with radio reception section 111, the reception control unit 112, transmission control section 113, radio transmission section 114 and the connection management unit 115.

无线发送部114发送无线信号。 Radio transmission section 114 transmits a radio signal. 无线接收部111接收无线信号。 Radio reception section 111 receives a radio signal. 另外,无线线路的通信方式并没有限定。 Further, communication radio channel and is not limited.

接收控制部112从接收的无线信号抽取分组,将分组接收经由连接管理部115通知中央控制部103,根据来自中央控制部103的指示,将接收的分组经由连接管理部115供给中央控制部103和/或队列管理部102。 Receiving a radio signal from the control unit 112 extracts the received packet, the packet is received via the connection management unit 115 notify the central control unit 103, according to an instruction from the central control unit 103, the packet will be received via the connection management unit 115 and supplied to the central control unit 103 / or queue management section 102. 另外,中继的分组的场合,也可将接收的分组经由连接管理部115直接供给发送控制部113。 Further, the case of the relay packet of the packet can also be received via the connection management unit 115 is supplied directly to the transmission control section 113.

发送控制部113生成或更新目的地、跳数等的分组内的管理信息,将分组无线信号化。 Transmission control unit 113 generates or updates the management information grouped destination, and number of hops within the packet-oriented radio signal. 发送的分组由中央控制部103或队列管理部102提供。 Packet transmitted by the central control unit 103 or the queue management module 102.

连接管理部115进行CSMA/CA等无线媒体访问控制,整理来自接收控制部112的信号输入、来自中央控制部103的发送指示,并切换收发动作。 Connection management unit 115 performs CSMA / CA wireless MAC, finishing signal input from the reception control unit 112 transmits an instruction from the central control unit 103, and the switching operation of the transceiver.

路径管理部101中,管理自身的单跳的链路信息(链路目的地无线站地址、传送速度、最后通信时刻等)、多跳路径信息(连接目的地无线站地址、次跳目的地无线站地址、跳数、剩余跳数等)、网络上的其它链路信息、其它无线站的负载信息,并保持路径选择所需的信息。 The path management unit 101, the management of their own single-hop link information (link destination radio station address, transmission speed, the last communication time, etc.), multi-hop path information (connected radio station addresses, times jump destination radio station address, number of hops, the remaining number, etc.) to jump, other link information on the network, the load information of other radio stations, and maintain routing information needed.

本实施例的场合,路径管理部101也保持后述那样的信息,执行后述的路径的选择动作。 The case of this embodiment, the path management unit 101 maintains the selection operation information described later, the path described later is executed. 从路径的选择功能看,路径管理部101中设有多个路径候补的选择部101a、预测延迟的计算部101b、延迟条件不充足路径的排除部101c、无线资源消耗量的计算部101d、话务裕度的计算部101e、路径选择部101f。 Look from the path selection function, the path management unit 101 has multiple paths candidate selection unit 101a, predicted delay calculation section 101b, the delay condition is not sufficient to exclude the path Ministry 101c, 101d radio resource consumption calculation unit, and then Service margin calculation section 101e, the path selecting section 101f.

队列管理部102保持中继所需的分组、在该无线站上发生的分组,根据中央控制部103的指示,使分组依次传递到收发模块110。 Queue management unit 102 holds the packet relay required, packet occurs on the radio station, according to an instruction of the central control unit 103, so that packets are sequentially transmitted to the transceiver module 110.

中央控制部103控制上述的各部分,与该无线站100相关的信息处理装置等协作。 The central control unit 103 controls the respective portions described above, in collaboration with the wireless station 100 related to the information processing apparatus or the like.

(A-2)实施例的动作以下,说明实施例的无线站执行的路径设定动作。 (A-2) operation of the embodiment will be described below path wireless station embodiment performs the setting operation.

<路径设定动作的概略说明> & Lt; path setting operation is a schematic description & gt;

同一段的无线网状网络内的无线站(以下称为节点)间的各链路中,最佳传送速度由物理层的协议(negotiation)来自动设定。 Each section of the link with the wireless station within a wireless mesh network (hereinafter called node) between, the optimum transmission speed are automatically set by the physical layer protocol (negotiation). 例如,现有的IEEE802.11b/g对应的无线卡等具有这样的设定功能。 For example, conventional IEEE802.11b / g corresponding wireless card has a setting function. 从而,在各链路中,可确认设定为何种传送速度。 Thus, in each link, which can be confirmed is set to the transmission rate.

在上述的无线网状网络内的各节点中,测定队列处理的负载(例如,当前的队列长度平均分组传送间隔)。 Each node in said wireless mesh network, the measured load queue processing (e.g., the current queue length average packet transmission interval).

对于某一直通的会话,伴随通话质量(分组尺寸、业务量、延迟)的指示,发生了路径设定请求时路径管理部101执行的路径设定动作(实施例的路径设定动作)如图1所示。 For a straight session, with call quality (packet size, traffic, delay) instruction, the path setting request path when the path management unit 101 performs the setting operation has occurred (route setting operation of the embodiment) FIG. Fig 1.

S1.[选择多个路径]对于有设定请求的会话,以直通方式选择最短跳数或排序的多个路径作为设定候补的路径。 S1. [Select multiple paths] For the session setup request to the shortest path straight to select multiple hops or ordered as set alternate path.

S2.[预测延迟的计算]将满足有指示的通话质量的分组数据尺寸及业务量条件时的直通的预测延迟,基于各链路上的传送速度、各节点中的队列的负载来计算。 S2. [Calculate the predicted delay] will meet projected straight packet data size and traffic conditions are indicative of the call quality of the delay, transmission speed based on each link, each node calculates a load queue. 这里,在追加会话后估计队列处理的负载增加来设定适当的容限,将负载估计稍大一些。 Here, the estimated load increase after an additional session queue processing to set an appropriate tolerance, the load estimate is slightly larger. 另外,由于追加的会话的话务量对于网络整体的容量充分小,容限可为固定长度。 Further, since the traffic additional sessions for the overall capacity of the network is sufficiently small, tolerance for a fixed length.

预测延迟时间成为该路径候补的各链路中的链路传送时间的总和与该路径候补的各节点内的分组处理时间及队列平均通过时间的总和。 Prediction lag time becomes the sum of the sum of the packet processing time of each node of each link in the path candidate link transmission time of the path within the candidate queue and the average throughput time. 每一链路的链路传送时间或1节点中的节点内的分组处理时间与从分组到达节点开始到出来为止等待的队列平均通过时间相比非常小,因此在计算上可省略,在这种情况下,预测延迟时间表示如下。 Link transmit time for each link or node packet processing time within a node and the packet arrives at the node from the beginning to wait until the queue out of mean transit time is very small compared, it can be omitted in the calculation, in which case, prediction lag time is as follows.

预测延迟时间=∑(各节点的队列平均通过时间)S3.[排除不满足延迟条件的路径]在多个路径候补中,删除其路径候补的预测延迟时间不满足有指示的通信质量的延迟条件的路径。 Predicted delay time = Σ (each node by the average queue time) S3. [Excluded delay does not satisfy the conditions of the path] candidates in multiple paths, delete its path prediction candidate does not meet with a communication delay time of the delay quality indicator conditions path.

S4及S5.[无线资源消耗量的计算、话务裕度的计算]某一节点的队列突出变长的情况难以保证必须通过该节点的会话的通话质量,因此,抑制到一部分节点的话务集中,使各节点中的队列通过时间与无线资源的消耗量均在基准以下。 S4 and S5. [Radio resource consumption calculation, calculation of traffic margin] projecting excessively long queue of a node to be difficult to guarantee the quality of the node via call session, therefore, suppressed to a portion of the node traffic concentrated, so that each node in the queue by the time the radio resource consumption in the reference are the following. 因此,计算无线资源消耗量与话务裕度。 Therefore, the calculation of wireless resource consumption and traffic margin.

作为无线资源消耗量,采用链路传送时间的总和上考虑了信号冲突率(信号冲突比)的值。 As the radio resource consumption, the total transfer time to consider the use of link signal collision rate (signal collision ratio) values. 无线资源消耗量例如按下式计算。 Such as radio resource consumption is calculated as follows. 下式的最初的总和∑针对其路径候补的全部链路。 The initial sum formula Σ for all its path candidate link. 后面的总和∑针对成为对象的链路两端的节点。 Sum Σ behind such target node for the ends of the link.

无线资源消耗量(时间)=∑(((数据尺寸+报头尺寸)/各链路传送速度+传送开销时间)∑(1+信号冲突比))分组发送间隔作为路径上节点的容纳话务裕度(例如值设为0~1),可采用将各中继节点的容纳话务裕度全部相乘的值或各中继节点的容纳话务裕度的最小值。 Wireless resource consumption (time) = Σ (((data size + header size) / each link transmission speed + transport overhead time) Σ (1+ signal collision ratio)) packet transmission interval as a node on the path to accommodate words the minimum margin to accommodate traffic traffic margin (such as the value to 0 to 1), can be used to accommodate the traffic margin of all the relay nodes multiplied value or the relay node. 另外,在后述的详细的动作说明中,采用后者的场合。 Further, in an operation described later in detail description, the use of the latter case.

S6.[路径选择]在上述的步骤S3中未删去的满足通信质量的路径候补中,选择路径上队列的裕度大且无线资源消耗量小的路径。 S6. [Routing] In the above step S3 is not satisfied, by deleting the communication quality of path candidates, the selection path queue margin large and small consumption of radio resource path. 从而使会话设定而加到网络的负载最小,可实现网络整体话务的容纳量的最大化。 Allowing the session to set the minimum and added to the load on the network, you can maximize the overall network to accommodate the amount of traffic.

<路径设定动作的详细说明> & Lt; path setting operation is described in detail & gt;

以下,用具体例说明实施例的路径设定动作。 Below, appliances conventions embodiment path setting operation.

这里,如图3所示,作为节点ID配置给予BS01~BS09的各节点(无线站),由图3所示的链路考虑节点间可通信的无线网状网络。 Here, shown in Figure 3, as the node ID of each node given configuration BS01 ~ BS09 (radio stations), consider the link between the nodes shown in Figure 3 may be a wireless mesh network communications. 测定各节点BS01~BS09的信号冲突率(信号冲突比)、通过节点的分组的处理所需的时间的平均值及最大值、容纳话务的裕度,该信息由各节点BS01~BS09共有。 Each node measured rate of collisions BS01 ~ BS09 signal (signal conflict ratio), by the average value and the maximum value required for the processing node of a packet time margin to accommodate the traffic of the message by the node BS01 ~ BS09 total. 这里,测定的各值如图4所示。 Here, the values measured as shown in Fig.

这里,信号冲突率例如为各节点中一定期间的信号发送开始数中,可由连接管理部115辨认实际发送失败的数的比例,由各节点的路径管理部101保持,还根据控制分组在节点间交换来获得其它节点的数据。 Here, the signal collision rate, for example, the number of signal transmission start of each node in a certain period, the connection management unit 115 may be sent to identify the actual ratio of the number of failures, each node in the path management section 101 to maintain, but also between the nodes according to the control group exchange to get the data to other nodes.

另外,通过节点的分组的处理所需的时间的平均值及最大值例如为对于各节点中一定期间的发送分组,将测定从该分组进入队列管理部102的管理下的队列开始到由无线发送部114发送为止的时间的多个值平均后的值及这些多个值的最大值,由各节点的路径管理部101保持,还根据控制分组在节点间交换来获得其它节点的数据。 Further, the average value and the maximum value required for the processing node of a packet time, for example, for each node in a certain packet transmission period, the queue manager will enter the measurement management unit 102 of the queue from which the next packet transmitted by the radio starts to and maximum values of the plurality of values of the plurality of transmission value averaging unit 114 after time until, by the path management unit 101 holds the node, but also based on the exchange of control packets between nodes to retrieve data from other nodes. 时间的测定通过将分组进入队列时用节点的系统时钟参照时刻,在队列管理部102记录并发送时,再次参照系统时钟的当前时刻的值与之前作为队列管理部102中各分组的信息记录的进入队列时的时刻比较来获得,由路径管理部101保持。 Measurement time by the queue when the packet enters the system clock reference node with the time when the recording queue management module 102 and send, again with reference to the value of the current time with the system clock before the queue manager as an information recording unit 102 in each packet of When comparing the moment to enter the queue to get, keep the path management unit 101.

并且,各节点的容纳话务的裕度是表示对于路径管理部101中测定等而获得的各节点的可处理的话务量,从该可处理的话务量减去当前该节点负担的话务量的值多大的指数,由各节点的路径管理部101保持,还根据控制分组在节点间交换来获得其它节点的数据。 Further, the margin to accommodate traffic of each node is a traffic that can be handled for each node in the path management unit 101 or the like obtained by measurement, from the traffic can be handled by subtracting the current node, then the burden How much traffic volume index value, and each node of the path management unit 101 holds, also in accordance with a control packet exchanged between nodes to retrieve data from other nodes. 通过由控制分组在节点间交换并共有来获得周边节点的数据。 And by the control packet switching node to obtain a total of data between peripheral nodes.

例如作为节点的容纳话务裕度,采用下述2个式中的任一式。 For example as a receiving node of a traffic margin, using the following two formulas of any type.

容纳话务裕度=(可处理话务量-当前话务量)/可处理话务量容纳话务裕度=(可处理话务量-当前话务量)/可处理话务量2另外,如图5所示,获得的设节点间的各链路的传送速度在各节点共有。 Accommodate traffic margin = (can handle traffic - Current traffic) / can handle traffic to accommodate the traffic margin = (can handle traffic - Current traffic) / 2 In addition to handling traffic , as shown in Figure 5, the transmission rate of each link is provided between the node obtains the total of each node. 另外,在上述的图3中,实线箭头的链路表示图5中的传送速度为50Mbps的链路,虚线箭头的链路表示图5中的传送速度为10Mbps的链路,点线箭头的链路表示图5中的传送速度为2Mbps的链路。 Further, in the above Fig. 3, the link of the solid line arrows in FIG. 5 shows a transmission rate of 50Mbps link, the link of the dotted arrow in Figure 5 represents the link transmission rate is 10Mbps, dotted line arrows Figure 5 shows the link transmission rate is 2Mbps link.

当保持了如图4及图5所示的数据或信息时,发生如图6所示的新的会话(会话请求)。 When holding the data or information in FIG. 4 and FIG. 5, the occurrence shown in FIG. 6 of the new session (session request). 以下,说明对该会话的路径分配动作。 The following describes the operation of the distribution path of the session. 路径的分配动作例如可由会话的起点节点的路径管理部执行,也可由会话的终点节点的路径管理部执行,也可由担任路径分配的专用节点的路径管理部执行,也可由不介入通信的控制站执行。 Allocation motion path such as a path starting node of the session by the Department of Management, also by the end of the session path management node, Executive, may also be assigned as a path path management department dedicated node execution, but also by not intervene communication station carried out. 以下,不管节点的种类而设任意节点的路径管理部执行动作来说明。 Below, regardless of the type of node and set the path to any node in the Department of Management to illustrate the implementation of the action.

基本上,按照上述的图1所示流程来执行路径的分配动作(设定动作),但在图1所示动作之前,也进行会话请求的确认动作。 Basically, according to the flow shown in FIG. 1 described above performs allocation operation (setting operation) path, but before the operation shown in Figure 1, but also to perform confirmation operation session requests.

S0.[会话请求的确认]会话请求的确认动作中,确认请求参数等是否为允许该无线网状网络的范围等。 S0. [Confirming a session request] to confirm the operation of the session request, and whether the confirmation request parameter is the allowable range of the wireless mesh network and the like. 图6所示的会话ID=01的会话(以下称为会话01)是节点BS01与BS09之间的双向话务,延迟请求为50毫秒以下。 Session ID = 01 shown in FIG. 6 of the session (hereinafter referred to as Session 01) is a two-way traffic between nodes BS01 and BS09, a request for a delay of 50 milliseconds or less.

S1.[选择多个路径]首先,由链路信息将节点BS01及BS09之间的可通信路径(路径候补)列入表中。 S1. [Select multiple paths] First, the link information node communication path between BS01 and BS09 (alternate route) included in the table. 例如,在图3所示的节点配置的场合,在表中列入如图7的第1列所示的15个路径候补L1~L15。 For example, in a case where the node configuration shown in Figure 3, included in the path 15 shown in FIG. 7 of a candidate L1 ~ L15 in the table.

S2.[预测延迟的计算]将通过中途的中继节点的节点的分组处理所需的时间的平均值及最大值相加,算出预测延迟时间的平均/最大值。 S2. [Calculate the predicted delay] The average value and the maximum value of the processing time required for a packet relay node by adding the middle node calculates prediction lag average / maximum time. 图7的第2列中对于各路径候补L1~L15算出的预测延迟时间的平均值及最大值按其顺序示出。 Figure 7 in the second column for each path candidate L1 ~ L15 computed prediction delay time and the maximum value of the order of their average value is shown.

例如为路径候补L1的场合,中继节点仅为节点BS02,因此节点BS02的节点通过时间的平均值(26毫秒)及最大值(40毫秒)原样成为路径候补L1的预测延迟时间的平均值(26毫秒)及最大值(40毫秒)。 For example, the case of L1 path candidate relay nodes only node BS02, BS02 node the node by averaging time (26 ms) and the maximum value (40 ms) as a candidate to become the average of L1 path predicted delay time ( 26 ms) and the maximum value (40 ms). 另外例如为路径候补L5的场合,中继节点为节点BS02及BS06,因此将节点BS02的节点通过时间的平均值(26毫秒)及最大值(40毫秒)与节点BS06的节点通过时间的平均值(10毫秒)及最大值(16毫秒)相加后的值成为路径候补L5的预测延迟时间的平均值(36毫秒)及最大值(56毫秒)。 Further, for example, the path candidate L5 occasion, the relay node to node BS02 and BS06, BS02 and therefore the node node by averaging time (26 ms) and the maximum value (40 ms) by the time and the average node BS06 (10 ms) and the maximum value (16 ms) the added value becomes the candidate path L5 predicted average delay time (36 ms) and the maximum value (56 ms).

S3.[排去不满足延迟条件的路径]若如上求出预测延迟(的平均值及最大值),则与请求延迟比较,排除不满足请求延迟的路径候补。 S3. [Drain delay does not satisfy the conditions of the path] if calculated as predicted delay (the mean and maximum), the delay compared with the request, excluding the path does not meet the request delay of candidates. 请求延迟值可以平均值及最大值的方式供给,也可以其一种的方式供给。 Request delay and the average of the maximum value may approach the supply, which may also be a way of supplying.

图6所示的会话请求中的请求延迟值(请求延迟时间)在50毫秒以下。 6 shown in FIG session request in the request delay value (delay time request) in 50 milliseconds or less. 在与最大值对应的请求延迟值的场合,图7的第2列右侧的数值上加下划线的最大值不满足请求延迟值,该路径候补从候补中被排除。 Corresponding to the maximum in the case where the request delay value, the maximum value of the second column in FIG. 7 on the value on the right underlined delay value does not satisfy the request, the path candidate is excluded from the candidates. 在这样的条件下,路径候补L2、L5~L7、L9~L12被排除。 Under such conditions, the path candidate L2, L5 ~ L7, L9 ~ L12 is excluded. 设50毫秒以下的请求延迟值(请求延迟时间)为与平均值对应的请求延迟值的场合,图7的第2列左侧的数值上加下划线的平均值不满足请求延迟值,该路径候补从候补中被排除。 Request Delay value set below 50 milliseconds (request delay time) with the request for a delay corresponding to the average value of the occasion, plus the average of the underlined value does not satisfy the request delay on the first two values to the left of Figure 7, the path candidate is excluded from the candidates. 在这样的条件下,路径候补L10、L12被排除。 Under such conditions, the path candidate L10, L12 is excluded.

S4.[无线资源消耗量的计算]计算未排除的各路径候补的各链路的无线资源消耗量,取总和并计算其路径候补的无线资源消耗量。 S4. Radio resource consumption of each path [radio resource consumption calculation] is calculated for each candidate did not rule out a link, take the sum and calculate its path candidate radio resource consumption. 这里,设传送开销为0.1毫秒/分组。 Here, set the transmission overhead is 0.1 ms / packet. 以下的式与简略说明中的式相同,但变形后加以表示。 The following brief description of the type with the same formula, but after deformation to be expressed. 分组长度(=数据尺寸+报头尺寸)为200比特且与链路无关,分组发送间隔为0.02秒且与链路无关。 Packet length (= data size + header size) is 200 bits and has nothing to do with the link, the packet transmission interval is 0.02 seconds and has nothing to do with the link.

∑((传送开销+分组长度/传送速度)/分组发送间隔∑(1+信号冲突率))例如,关于路径候补L1,有节点BS01及BS02间的链路和节点BS02及BS09间的链路。 Σ ((transport overhead + packet length / transmission rate) / packet transmission interval Σ (1+ signal collision rate)), for example, on alternate paths L1, there are nodes BS01 and BS02 between chain links and nodes between BS02 and BS09 road.

前者的节点BS01及BS02间的链路的传送速度为50Mbps,因此该分组长度/传送速度为200比特/50Mbps=0.004毫秒/分组,因此,(传送开销+分组长度/传送速度)/分组发送间隔为(0.1+0.004)/0.02=5.2毫秒。 Transmission speed of the link of the former node BS01 and BS02 is between 50Mbps, so the packet length / transmission speed of 200 bits /50Mbps=0.004 msec / packet, and therefore, (transport overhead + packet length / transmission rate) / packet transmission interval for (0.1 + 0.004) /0.02=5.2 milliseconds. 前者的链路两端的节点BS01及BS02的信号冲突率分别为0.2及0.3,因此∑(1+信号冲突率)为(1+0.2)+(1+0.3)=2.5。 Node links at both ends of the former BS01 and BS02 signal collision rates were 0.2 and 0.3, so Σ (1+ signal collision rate) is (1 + 0.2) + (1 + 0.3) = 2.5. 因而,前者的链路的无线资源消耗量成为5.22.5。 Thus, the former link radio resource consumption becomes 5.2 2.5.

后者的节点BS02及BS09间的链路的传送速度为2Mbps,因此该分组长度/传送速度为200比特/2Mbps=0.1毫秒/分组,因此,(传送开销+分组长/传送速度)/分组发送间隔为(0.1+0.1)/0.02=10毫秒。 The latter nodes BS02 and BS09 link between transmission speed of 2Mbps, so the packet length / transmission speed of 200 bits /2Mbps=0.1 ms / packet, therefore, (transfer overhead + packet length / transmission speed) / packet transmission interval of (0.1 + 0.1) /0.02=10 msec. 后者的链路两端的节点BS02及BS09的信号冲突率分别为0.3及0.1,因此∑(1+信号冲突率)为(1+0.3)+(1+0.1)=2.4。 BS02 and BS09 signal collision rate link node both ends of the latter were 0.3 and 0.1, so Σ (1+ signal collision rate) for the (1 + 0.3) + (1 + 0.1) = 2.4. 因而,后者的链路的无线资源消耗量成为102.4。 Thus, the latter link the consumption of radio resources becomes 10 2.4.

结果,路径候补L1的无线资源消耗量为5.22.5+102.4=37。 As a result, the radio resource consumption candidate path L1 is 5.2 2.5 + 10 2.4 = 37.

图7的第3列示出各路径候补L1~L15的无线资源消耗量。 Figure 3 lists the candidates for each path L1 ~ L15 7 radio resource consumption. 另外,已在步骤S3中进行路径候补的去除,因此不计算排除的路径候补的无线资源消耗量,但图7为参考而示出全部路径候补的无线资源消耗量。 Further, in step S3 has been removed candidate path, the path and therefore the radio resource consumption is not excluded candidate calculation, but with reference to FIG. 7 is shown for a radio resource consumption of all candidate paths.

S5.[话务裕度的计算]对于未排除的各路径候补分别计算中继节点的容纳话务裕度。 S5. [Traffic margin calculation] for each path is not excluded candidate relay nodes are calculated margin to accommodate traffic. 然后,将全部中继节点的中继节点的容纳话务裕度相乘来计算路径候补的话务裕度。 Then, a margin to accommodate the traffic of all the relay nodes relay nodes alternate route is calculated by multiplying the traffic margin. 或者,抽取各中继节点的容纳话务裕度的最小值,作为路径候补的话务裕度。 Or, to extract the minimum margin to accommodate traffic in each relay node, as a path candidate traffic margin.

例如,路径候补L1的中继节点仅为节点BS02,因此该路径候补L1的话务裕度在采用任何算出方法的场合,节点BS02的话务裕度均为0.5。 For example, the path L1 candidate relay nodes only node BS02, so the path of traffic candidate L1 margin in the use of the method of calculating any occasion, traffic nodes BS02 margin are 0.5.

另外例如路径候补L8的中继节点为节点BS03及BS05,因此该路径候补L8的话务裕度为节点BS03的话务裕度0.8与节点BS05的话务裕度0.7中的小值(最小值)即0.7。 Another example path L8 candidate relay node for node BS03 and BS05, so the path L8 candidate's margin of node traffic traffic traffic margin BS03 margin of 0.8 and 0.7 in the node BS05 small value (minimum ) that is 0.7. 还有,作为路径候补的话务裕度采用相乘的方式时,成为0.70.8=0.56。 Also, as an alternate route traffic margin multiplied when using the way to become 0.7 0.8 = 0.56.

图7的第4列中示出采用将各中继节点的话务裕度的最小值作为路径候补的话务裕度的方式时的值。 Figure 7 of the first four values are shown by way of traffic margin of a minimum value of each traffic margin relay node as a path candidate time. 另外,由于已在步骤S3中进行路径候补的去除,不计算排除的路径候补的话务裕度,但图7中为参考而示出全部的路径候补的话务裕度。 Further, since the path candidate has been removed in step S3, the traffic path is not calculated margin excluded candidate, but in Fig. 7 is shown by reference traffic margin entire path candidate.

S6.[路径选择]最终的路径选择分2个阶段的处理来进行。 S6. [Routing] ultimate path selection process in two stages to carry out.

首先,排除话务裕度相对较小的路径候补。 First, eliminate traffic relatively small margin alternate path. 例如在图7的场合,若话务裕度为0.5及0.6设为相对小(图7的第4列中加下划线),则排除话务裕度为0.5及0.6的路径候补。 For example, in the case of Figure 7, if the traffic margin of 0.6 to 0.5 and a relatively small (Fig. 7 in the first four underlined), were excluded from the traffic margin of 0.5 and 0.6 of the path candidate.

在图7的例的场合,在进行基于预测延迟与请求延迟的关系的路径候补的除外、基于话务裕度的路径候补的除外后,路径候补集中在L3、L4、L8、L13~L15。 In the example case of Figure 7, except for performing the prediction based on the path delay and the delay relationship between the candidate request, the latter based on the exception path traffic margin candidate, the candidate path concentrated in L3, L4, L8, L13 ~ L15.

如上在集中路径候补后,对于各路径候补算出评价值,按其评价值好的顺序加位次号,将位次为第1位的路径候补设为这次的请求会话的路径。 As in the centralized path candidate, the candidate is calculated for each path evaluation value, the evaluation value in descending order of their rank number plus the rank of the first one of the set of candidate paths requests a session path.

这里,对于路径候补的评价值为对预测延迟、无线资源消耗量、容纳话务裕度的各项加权后的合成值。 Here, the path candidate evaluation value for predicting delayed, wireless resource consumption, the combined value of the weighted margin to accommodate traffic. 为算出评价值,也可对各项值根据需要形成倒数或进行正负反转。 For calculating an evaluation value, but also on the formation of the reciprocal value or positive-negative reversal required. 例如作为评价值可采用使各项值的大小与良否匹配后(例如对一部分的项采用倒数)的权重加法值。 For example, can be used as an evaluation value of the right to make the value of the size and good after not match (for example, using part of the reciprocal of the term) of heavy sum is obtained. 另外例如可为对各项加位次号、各项的位次的权重加法值。 Another example can be a plus for the rank number, the weight of the addition of the right order of precedence values.

重要的是,选择无线资源消耗量小、话务裕度大、预测延迟小的取得平衡的路径地定义评价值。 It is important to select a small radio resource consumption, traffic large margin, predicting a small delay to define a path to balance evaluation value.

图7的第5列示出对剩下的路径候补进行基于评价值的加位次号后的位次。 FIG fifth column shows the remaining candidate path based ranking number plus the value of the evaluation rank after 7. 图7的例的场合,响应会话ID为01的请求会话选择路径候补L4。 Example of the case of Fig. 7, in response to the session ID for a session request to select a path 01 candidate L4. 即,在无线站BS01及BS09之间,以无线站BS08为中继节点的路径进行通信。 That is, between the wireless stations BS01 and BS09, the wireless station BS08 to the path for the relay node to communicate.

例如,若在无线站BS01的路径管理部101进行了路径分配动作的场合,无线站BS01的路径管理部101用控制分组,向中继的无线站BS08或对置的终端无线站即无线站BS09供给包含通信路径的会话信息等。 For example, if the path of the radio station BS01 management unit 101 performs a path allocation operation of the occasion, the path of the radio station BS01 control packet management unit 101, the radio relay station BS08 or opposite end radio station that radio station BS09 feeding session information includes a communication path or the like.

(A-3)实施例1的效果如以上所述,依据实施例1,不仅考虑预测延迟,而且也考虑无线资源消耗量或容纳话务裕度,而进行路径的选择,从而选择的路径满足指示的通信质量,并将无线网状网络中受限制的无线资源的消耗抑制在最小限,可避免集中到一部分节点的话务。 (A-3) Effects embodiment as described above in Example 1, Example 1 according to the path, not only to consider the prediction lag, but also of a radio resource consumption or receiving traffic margin, path selection is performed so as to satisfy the selected a communication quality indicator, and wireless mesh networks restricted radio resource consumption suppressed minimized, to avoid the concentration of traffic to a portion of the node. 结果,增加了无线网状网络整体的会话容量,并可将业务量最大化。 As a result, the wireless mesh network to increase overall capacity of the session, and to maximize the traffic.

(B)其它实施例上述实施例中,会话路径的确定上利用预测延迟、无线资源消耗量、容纳话务裕度这3个参数,但也可利用无线资源消耗量及容纳话务裕度的至少一种来确定会话路径。 (B) Other embodiments The embodiment described above, the use of prediction on the determined session path delay, the radio resource consumption, to accommodate the traffic margin these three parameters, but may also be using radio resources consumption and receiving traffic margin determining at least one session path.

另外,上述实施例中,基于预测延迟或容纳话务裕度汇集路径候补,但可基于评价值在确定前进行汇集。 Further, the above-described embodiment, based on the predicted delay or receiving traffic margin collection path candidate, but may be based on the evaluation values were determined prior to collection. 反之,可在评价值的算出前汇集预定数(例如5个)的路径候补。 On the contrary, can be pooled predetermined number (e.g. 5) before calculating a path candidate evaluation value.

而且,上述实施例中,不进行基于无线资源消耗量的路径候补的汇集,但可基于无线资源消耗量进行路径候补的汇集。 Further, the above-described embodiment, the radio resource consumption is not performed based on the path candidate collection, but can be pooled based on the path candidate radio resource consumption.

而且,上述实施例中,按预测延迟、无线资源消耗量、容纳话务裕度的顺序,算出参数值,但该算出顺序为任意。 Further, the above-described embodiment, as predicted delay, the radio resource consumption, the order receiving traffic margin, calculated parameter values, but the calculated arbitrary order.

另外,上述实施例中,一个节点(无线站)设有一个收发模块,但一个节点(无线站)可设有多个收发模块。 Further, the above-described embodiments, a node (radio station) is provided with a transceiver module, but a node (radio station) may be provided with a plurality of transceiver modules. 在这种情况下,路径管理部101为1个,也可与上述同样地进行路径设定动作。 In this case, the path management unit 101 is a, the setting operation can be performed similarly to the above path. 例如,可同时对应于仅收发模块的数量不同的会话。 For example, can only correspond to the number of different sessions transceiver module. 另外,同一节点间的链路在收发模块的组合不同的场合(例如,载波等不同的其它信道的场合),可以作为不同的链路而管理话务量或传送速度,并包含于对应于会话请求的不同的候补中,也可将这些信道的信息合为一体后作为一个链路处理。 In addition, the link between nodes in the same combination of different occasions transceiver module (e.g., carrier and other different channel case of Yes), the management traffic or may be different links as the transmission rate, corresponding to the session and contained in Different candidates request, these channels can also be combined into one post information as a link processing. 例如节点BS01及BS02之间,可按照信道CH1或者信道CH2通信的场合,可将图7的第1行的路径候补按每个信息分割而作成2个路径候补,也可作为综合两信道的信息的一个路径候补(图7的第1行)处理。 E.g. between nodes BS01 and BS02, in accordance CH1 or occasions CH2 communication channel channel can be a path candidate FIG first line 7 of each information is divided and made two path candidates, but also as an integrated two-channel information a path candidate (line 1 in Fig. 7) processing.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
CN102017714B31 Dec 20084 Dec 2013黑莓有限公司Path selection for a wireless system with relays
Classifications
International ClassificationH04B7/15, H04W16/26, H04L12/721, H04W40/04, H04W40/00, H04L12/701
Cooperative ClassificationH04L45/121, H04W40/00, H04L45/00, H04W40/04, H04L45/124, Y02B60/50
European ClassificationH04L45/00, H04L45/124, H04L45/121
Legal Events
DateCodeEventDescription
14 Mar 2007C06Publication
16 May 2007C10Entry into substantive examination
21 Jul 2010C02Deemed withdrawal of patent application after publication (patent law 2001)