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 numberCN102124783 B
Publication typeGrant
Application numberCN 200980129997
PCT numberPCT/IB2009/052977
Publication date25 Dec 2013
Filing date8 Jul 2009
Priority date30 Jul 2008
Also published asCN102124783A, EP2319268A1, EP2319268B1, US20110128918, WO2010013154A1
Publication number200980129997.8, CN 102124783 B, CN 102124783B, CN 200980129997, CN-B-102124783, CN102124783 B, CN102124783B, CN200980129997, CN200980129997.8, PCT/2009/52977, PCT/IB/2009/052977, PCT/IB/2009/52977, PCT/IB/9/052977, PCT/IB/9/52977, PCT/IB2009/052977, PCT/IB2009/52977, PCT/IB2009052977, PCT/IB200952977, PCT/IB9/052977, PCT/IB9/52977, PCT/IB9052977, PCT/IB952977
Inventors翟虹强
Applicant皇家飞利浦电子股份有限公司
Export CitationBiBTeX, EndNote, RefMan
External Links: SIPO, Espacenet
Method for discovering high throughput routes in wireless mesh networks
CN 102124783 B
Abstract  translated from Chinese
一种用于在网格的基于无线介质(WiMedia)的网络中发现源节点与目的地节点之间的路由的方法(300)。 The method of discovery route between the source node and the destination node based on wireless media (WiMedia) network for the grid (300). 该方法包括:在由源节点与目的地节点之间的中间节点接收到路由请求(RREQ)时,在RREQ中至少保存中间节点的标识(ID)号以及在其上接收RREQ的链路的传输信道速率(S320);计算新的路由价格(S330);确定新的路由价格是否大于在所接收的RREQ中包括的价格(S340);当新的路由价格大于所接收的RREQ中的路由价格时,更新所接收的RREQ以包括新的路由价格(S350);以及将经过更新的RREQ转发给中间节点的一个或者更多个相邻节点(S370)。 The method comprising: upon receiving from the intermediate node between the source node and the destination node route request (RREQ), at least in the RREQ save intermediate node identification (ID) number, and the received RREQ transmission link on which the channel rate (S320); computing a new route price (S330); determining whether the new route price is larger than in the received RREQ included in the price (S340); when the new route price is larger than the received RREQ in the route price when updating the received RREQ to include the new route price (S350); and forwards the updated RREQ to one or more intermediate nodes neighboring node (S370).
Claims(13)  translated from Chinese
1.一种用于在网格的基于无线介质(WiMedia)的网络中发现源节点与目的地节点之间具有最闻吞吐量的路由的方法(300),包括: 在由源节点与目的地节点之间的中间节点接收到路由请求(RREQ)时,在RREQ中至少保存中间节点的标识(ID)号以及在其上接收到该RREQ的链路的传输信道速率(S320);部分地基于路由中的链路的有效传输速率来计算新的路由价格(S330 ); 确定新的路由价格是否大于在所接收的RREQ中包括的价格(S340); 当新的路由价格大于所接收的RREQ中的路由价格时,更新所接收的RREQ以包括新的路由价格(S350);以及将经过更新的RREQ转发给中间节点的一个或者更多个相邻节点(S370)。 1. A method for grid-based wireless media (WiMedia) network discovery method (300) has the most throughput smell route between source and destination nodes, comprising: the source node and the destination an intermediate node between the node receives the route request (RREQ), at least in the RREQ save intermediate node identification number (ID) and the received RREQ transmission channel rate of the link (S320) thereon; based in part on The effective transfer rate of the link route to calculate a new route price (S330); determining whether the new route price is greater than in the received RREQ included in the price (S340); when the new route price is greater than the received RREQ When the route price, updates the received RREQ to include the new route price (S350); and forwarding the updated RREQ to one or more intermediate nodes neighboring node (S370).
2.如权利要求1所述的方法,还包括确定是否存在在中间节点中缓存的一个或者更多个RREQ (S360);在所缓存的一个或者更多个RREQ、经过更新的RREQ以及所接收的RREQ中找到具有较小的路由价格值的RREQ (S365);以及将被确定具有最小的路由价格的RREQ转发给中间节点的一个或者更多个相邻节点(S370)。 2. The method of claim 1, further comprising determining whether there is cached in the intermediate node to one or more of the RREQ (S360); buffered in one or more of the RREQ, updated and received RREQ The RREQ RREQ find the route having a smaller value price (S365); and will be determined having the smallest route price RREQ forwarded to one or more intermediate nodes neighboring node (S370).
3.如权利要求1所述的方法,其中路由价格是为路由中的链路计算的有效传输速率的倒数和。 The method according to claim 3, wherein the route price is calculated route links reciprocal and effective transfer rate.
4.如权利要求3所述的方法,其中计算路由价格还包括: 获得所接收的RREQ已经在其上经过的路由(S410); 得到由沿着所述路由的链路使用的传输信道速率,其中每个链路在传输RREQ的节点与接收RREQ的节点之间(S420).; 为每个链路计算有效传输信道速率(S430); 创建链路列表(S450);以及对链路列表中的所有链路的有效传输信道速率的倒数求和(S460 )。 4. The method according to claim 3, wherein calculating the route price further comprises: obtaining the received RREQ has on its route through (S410); obtained by the transmission channel rate along the route used by the link, wherein each of the link between the transmission and receiving RREQ RREQ the node node (S420) .; calculated for each link effective transmission channel rate (S430); create a link list (S450); and the link list All effective transmission channel rate summation reciprocal link (S460).
5.如权利要求4所述的方法,其中链路列表包括所有具有在最后节点的相邻节点的列表中指定的至少一个端节点或者作为中间节点的相邻节点的至少一个端节点的链路。 5. The method of claim 4, wherein the link includes a list of all the links in the list with the specified neighboring node of at least the last node or an end node of the intermediate node as an adjacent node of the at least one end node .
6.如权利要求5所述的方法,其中最后节点的相邻节点的列表包括路由上作为将所接收的RREQ传输到中间节点的节点的相邻节点的节点。 6. The method of claim 5, wherein the final list of neighboring nodes as a routing node including the received RREQ transmission node adjacent to the node of the intermediate node node.
7.如权利要求6所述的方法,还包括创建最后节点的相邻节点的列表以包括路由上同样是中间节点的相邻节点的节点(S440);并且将经过更新的最后节点的相邻节点的列表保存在所接收的RREQ中。 7. The method of claim 6, further comprising creating a list of neighbor nodes to the final node also includes a routing node is the node adjacent intermediate node (S440); and the neighboring nodes of the last update through node list stored in the received RREQ in.
8.如权利要求5所述的方法,其中在RREQ中保持最后节点的相邻节点的列表、传输信道速率以及RREQ在其上经过的路由。 8. The method of claim 5, wherein the list of neighboring nodes to keep the last node in the RREQ, the transmission channel rate and in the RREQ through its route.
9.如权利要求4所述的方法,其中链路的有效信道传输速率是通过将数据分组的有效负载大小除以在链路上完成数据分组的传输所需要的时间来计算的。 9. The method of claim 4, wherein the effective channel transfer rate of the link by the payload size of the data packet transmission of the data packet divided by the time required to complete the link to be calculated.
10.如权利要求9所述的方法,其中完成数据分组的传输的时间等于至少数据帧(Tdata)和肯定应答(Tadt)帧的传输时间以及肯定应答帧与数据帧之间的帧间间隔(Tifs)的和。 10. The method of claim 9, wherein the data packet transfer completion time at least equal to the data frame (Tdata) and acknowledgment transmission time (Tadt) frame and an acknowledgment frame data interframe interval between frames ( Tifs) and.
11.如权利要求10所述的方法,其中通过下式计算传输时间Tdata: Hs +P= + ,其中Tpreamble是帧的前同步码的传输时间;ΗΡ是帧报头的大小,P是有效负载的大小,Re是链路的传输信道速率。 11. The method of claim 10, wherein the transmission time calculated by the following formula Tdata: Hs + P = +, which is the transmission time of a frame Tpreamble preamble; ΗΡ the frame header size, P is the payload size, Re is a transport channel rate of the link.
12.如权利要求2所述的方法,其中将源节点与目的地节点之间的路由选择为由目的地节点接收的所有RREQ中具有最小的路由价格的RREQ传播的路由。 12. The method of claim 2, wherein a route between the source node and the destination node selects all the destination node received RREQ route shortest route prices of RREQ spread grounds.
13.如权利要求1所述的方法,还包括由目的地节点生成路由响应(RREP);以及在所选择的路由上将RREP发送给源节点。 13. The method of claim 1, further comprising generating a route response (RREP) by the destination node; and the route will be in the selected send RREP to the source node.
Description  translated from Chinese

用于在无线网格网络中发现高吞吐量路由的方法 Found in a wireless mesh network routing method for high throughput

[0001] 本申请要求2008年7月30日提交的美国临时申请第61/084709号的权益。 [0001] This application claims the benefit of US Provisional Application No. 61/084709 number of July 30, 2008 submission.

技术领域 Technical Field

[0002] 本发明总地涉及在网格网络中发现路由。 [0002] The present invention relates generally to find routes in a mesh network.

背景技术 Background

[0003] 用于超宽带(UWB)系统的WiMedia规范定义了用于无线个人区域网络(WPAN)的全分布式介质访问控制(MAC)协议。 [0003] WiMedia specification for ultra-wideband (UWB) system definition for wireless personal area networks (WPAN) fully distributed medium access control (MAC) protocol. 由于规章限制,WPAN中节点的传输功率和传输范围现在被限制。 Due to regulatory restrictions, the transmission power and transmission range of nodes WPAN now limited. WiMedia规范支持多个不同的信道速率,包括53.3 Mbps,80 Mbps、106.7 Mbps、160 Mbps,200 Mbps,320 Mbps,400 Mbps 以及480Mbps。 WiMedia specification supports a number of different channel rates, including 53.3 Mbps, 80 Mbps, 106.7 Mbps, 160 Mbps, 200 Mbps, 320 Mbps, 400 Mbps and 480Mbps.

[0004] 为了扩展基于WiMedia的WPAN的通信范围,启用网格的MAC协议可以在这种网络中利用。 [0004] In order to extend the communication range of WiMedia based WPAN, enabling mesh MAC protocol can be used in such a network. 启用网格的MAC协议使得网络中的节点能够通过其它中间节点达到其直接通信范围之外的另一节点。 MAC protocols such mesh-enabled nodes in the network to reach another node outside its range of direct communication through other intermediate nodes. 中间节点将来自源节点的分组向目的地节点转发/中继。 The intermediate node of a packet from the source node to the destination node forwarding / relaying. 网格MAC协议的操作在图1中图示。 Operation Grid MAC protocol is illustrated in Figure 1. 在网格的基于WiMedia的WPAN 100中,节点110-A不能直接与节点110-F通信,因为它们在彼此的传输范围之夕卜。 In the mesh WiMedia based WPAN 100, the node 110-A can not directly communicate with the node 110-F, as they are in transmission range of each other, Xi Bu. 然而,节点110-A可以通过启用网格的节点IIO-B和110-D来将分组发送到节点110-F。 However, the node 110-A can be sent to node 110-F grid nodes by enabling IIO-B and 110-D to the packet. 因此,用于将数据从源节点IIO-A传输到目的地节点110-F的路由包括转发节点110-B和110-D。 Therefore, for the data from the source node IIO-A transmission route to the destination node 110-F, including forwarding node 110-B and 110-D. 启用网格的节点是实施网格MAC协议的节点。 Enable the grid node is the node to implement grids MAC protocol.

[0005] 现有的路由发现和路由选择(routing)协议例如包括动态源路由选择(DSR)协议以及自组网按需距离矢量(AODV)协议。 [0005] The existing route discovery and routing (routing) protocol for example, include Dynamic Source Routing (DSR) protocol as well as ad hoc network demand distance vector (AODV) protocol. 这些协议仅在存在流量传递的需要时才发现路由,由此便利低路由维持开销。 If these agreements only require traffic passed in the presence of discovery routes, thus convenient to maintain low routing overhead. 如在图2A中所图示的,为了发现路由,源节点210-A广播由节点2IO-B和210-C接收的路由发现请求(RREQ)分组,然后所述节点210-B和210-C将RREQ转发到它们的相邻设备。 As illustrated in Figure 2A, in order to find the route, the source node 210-A broadcast discovery request (RREQ) from the route node 2IO-B and 210-C receives a packet, then the node 210-B and 210-C The RREQ forwarded to their adjacent equipment. 例如,如图2B所示,节点210-B将所接收的RREQ转发给节点210-C、2IO-D以及210-E,同时节点210-A将所接收的RREQ转发给节点210-B和210-D。 For example, as shown in FIG. 2B, the nodes 210-B forwards the received RREQ to a node 210-C, 2IO-D and 210-E, while the node 210-A forwards the received RREQ to a node 210-B and 210 -D. 相同的过程由节点210-E和210-D执行(参见图2C)。 By the same process node 210-E and 210-D executed (see Fig. 2C). 在接收RREQ分组之后,目的地节点将路由发现响应(RREP)分组沿所接收的RREQ经过的路由发送回源节点。 After receiving RREQ packet, the destination node will route discovery response (RREP) packet received RREQ along the route through the source node sends back. 这在图2D中图示,其中节点2IO-F是目的地节点。 This is illustrated in Fig. 2D, where the nodes 2IO-F is the destination node. 基于RREP,源节点210-A确定用于将分组发送到目的地节点210-F的路由。 Based RREP, the source node 210-A is used to determine the packet transmission route to the destination node 210-F to.

[0006] DSR和AODV协议典型地发现具有最小的跳计数的路由,即经过最小数目的中间节点的路由。 [0006] DSR and AODV protocols typically find routes with the smallest hop count, ie, after the minimum number of intermediate routing nodes. 因此,沿着该路由的每一跳具有接近最大通信范围的跳距离。 Therefore, each hop along the route have near maximum communication range jump distance. 由此,所发现的路由仅可以支持低传输速率。 Thus, the discovered routing can support only a low transmission rate. 结果是,更高速率的好处未被完全利用。 As a result, the benefits of higher speed is not fully utilized.

[0007] 因此,在WiMedia网格网络中提供一种有效的路由发现解决方案将是有利的。 [0007] Thus, to provide an efficient route discovery solutions will be advantageous in the WiMedia mesh network.

发明内容 DISCLOSURE

[0008] 本发明的特定实施例包括一种用于在网格的基于无线介质(WiMedia)的网络中发现源节点与目的地节点之间的路由的方法。 [0008] The method embodiment includes a route discovery for the grid between the source node and the destination node-based wireless media (WiMedia) network in particular embodiments of the invention. 该方法包括:在由源节点与目的地节点之间的中间节点接收到路由请求(RREQ)时,在RREQ中至少保存中间节点的标识(ID)号以及在其上接收RREQ的链路的传输信道速率;计算新的路由价格(route price);确定新的路由价格是否大于在所接收的RREQ中包括的价格;当新的路由价格大于所接收的RREQ中的路由价格时,更新所接收的RREQ以包括新的路由价格;以及将经过更新的RREQ转发给中间节点的一个或者更多个相邻节点。 The method comprising: upon receiving from the intermediate node between the source node and the destination node route request (RREQ), at least in the RREQ save intermediate node identification (ID) number, and the received RREQ transmission link on which the channel rate; calculating a new route price (route price); determining whether the new route price is greater than in the received RREQ included in the price; when the new route price is greater than the received RREQ in the route price update received RREQ to include the new route price; and forwards the updated RREQ to one or more intermediate nodes neighboring nodes.

[0009] 本发明的特定实施例还包括在其上存储有计算机可执行代码的计算机可读介质,当计算机可执行代码被执行时,导致处理器执行在网格的基于无线介质(WiMedia)的网络中发现源节点与目的地节点之间的路由的过程。 [0009] Specific embodiments of the present invention further comprises computer executable code in a computer readable medium having stored thereon, computer executable code, when executed, cause a processor to perform the grid-based wireless media (WiMedia) of the network discovery process routes between the source node and the destination node. 所述过程包括:在由源节点与目的地节点之间的中间节点接收到路由请求(RREQ)时,在RREQ中至少保存中间节点的标识(ID)号以及在其上接收RREQ的链路的传输信道速率;计算新的路由价格;确定新的路由价格是否大于在所接收的RREQ中包括的价格;当新的路由价格大于所接收的RREQ中的路由价格时,更新所接收的RREQ以包括新的路由价格;以及将经过更新的RREQ转发给中间节点的一个或者更多个相邻节点。 The process includes: when a node is received by the intermediate between the source and destination nodes to route request (RREQ), in RREQ save at least an intermediate node identification number (ID) and on which the link receives RREQ transmission channel rate; calculating a new route price; determining whether the new route price is larger than in the received RREQ included in the price; when the new route price is greater than the received RREQ in the route price update received RREQ to include The new route price; and forwards the updated RREQ to one or more intermediate nodes neighboring nodes.

[0010] 被视为本发明的主题在本说明书的结尾处的权利要求书中被特别指出并且明显地要求保护。 [0010] The subject of the invention is considered right at the end of the specification in the claims it is particularly pointed out and distinctly claimed. 本发明的上面和其它的特征和优点将从结合附图进行的以下的详细描述中显而易见。 The above and other features and advantages of the invention will become apparent from the detailed description of the drawings below.

附图说明 Brief Description

[0011] 图1为网格WiMedia WPAN的示意图。 [0011] Figure 1 is a schematic view of the mesh WiMedia WPAN.

[0012] 图2A、2B、2C和2D是在演示现有的发现协议的操作中有用的网络的示意图。 [0012] FIG. 2A, 2B, 2C and 2D are schematic operation in the demo existing discovery protocols useful network.

[0013] 图3是描述根据本发明的实施例实现的路由发现方法的流程图。 [0013] FIG. 3 is a flowchart describing a method according to an embodiment of the present invention was found to achieve the route.

[0014] 图4是描述根据本发明的实施例实现的计算路由价格的步骤的流程图。 [0014] FIG. 4 is a flowchart of an embodiment according to the procedure of the present invention achieves the price calculated route description.

[0015] 图5A、5B、5C、ro、5E、5F和5G是在演示根据本发明的实施例实现的发现协议的操作中有用的网络的示意图。 [0015] FIG. 5A, 5B, 5C, ro, 5E, 5F and 5G are useful in the operation and demonstration according to an embodiment of the present invention is implemented in the network discovery protocol Fig.

具体实施方式 DETAILED DESCRIPTION

[0016] 重要的是:注意本发明公开的实施例仅为这里的创新教导的许多有利用途的示例。 [0016] Important: Note that the disclosed embodiments of the present invention only the innovative teachings herein many advantageous use of examples. 通常,本公开的说明书中进行的陈述不需要限制各个所要求保护的发明中的任一个。 Typically, the statement does not require the disclosure of the specification be restricted to any one of the individual protection of the claimed invention. 此夕卜,一些陈述可以适用于某些发明特征,而不适用于其它发明特征。 Bu this evening, some statements may apply to some invention features, it does not apply to other inventive features. 通常,除非另外指出,不失一般性地,单数的元件可以是复数,并且反之亦然。 In general, unless otherwise indicated, without loss of generality, singular elements may be in plural and vice versa. 在附图中,遍布若干视图,相似的标号指代相似的部件。 In the drawings, throughout the several views, like numerals refer to like parts.

[0017] 这里公开的发现过程发现源节点与目的地节点之间具有最高吞吐量的路由。 [0017] The discovery process disclosed herein was found to have the highest throughput route between source and destination nodes. 根据本发明的原理,路由发现请求(RREQ)是被构造来至少运送RREQ经过的节点的标识(ID)号、沿着路由的链路用于传输RREQ所使用的信道速率、RREQ经过的路由的价格以及最后节点的相邻节点的列表的分组。 According to the principles of the present invention, the route discovery request (RREQ) is configured to transport nodes RREQ through at least the identification (ID) number, along the route of the transmission link for the channel rate RREQ used, RREQ through routes grouping neighboring nodes and a list of the price of the last node. 路由价格是为路由中的链路计算的有效速率的倒数和。 Prices are effective rate routing for route calculation and the reciprocal link. 最后节点的相邻节点的列表保持路由上同样是RREQ经过的最后节点的相邻节点的节点的记录。 The final list of neighboring nodes adjacent nodes keep a record of the last node on the node is also RREQ after routing nodes. 网络中的每个节点保持包括每个其相邻节点的ID号的相邻节点列表以及用于存储近来接收的RREQ的缓存器。 Each node in the network to maintain a list of neighboring nodes for each of its neighboring nodes including the ID number of the RREQ and the buffer for storing the received recently.

[0018] 图3示出了描述根据本发明的实施例实现的用于在无线网格网络中发现路由的方法的示例和非限制性流程图300。 [0018] FIG. 3 shows a diagram illustrating an example of a method of discovery routes and non-limiting flowchart 300 in a wireless mesh network in an embodiment of the present invention is implemented in accordance. 该方法由广播至少运送上面提及的信息的RREQ的源节点发起。 The method consists of broadcasting information delivery at least the above-mentioned source node RREQ initiated. 该方法由接收RREQ的每个中间节点(即源节点与目的地节点之间的路径中的节点)执行。 The method (i.e., the path between the source node and the destination node in the node) performed by each intermediate node receives a RREQ. 当RREQ被从源节点传输时,RREQ包括源节点的ID。 When RREQ is transmitted from the source node, RREQ includes a source node ID. 在S310,中间节点接收RREQ。 In S310, an intermediate node receives the RREQ. 在S320,中间节点在RREQ中插入其ID以及在其上接收RREQ的链路的速率。 In S320, the intermediate node into its ID in the RREQ and receiving RREQ on which the rate of the link. 在S330,计算RREQ在其上传播的路由(即源节点与中间节点之间的路由)的价格。 In S330, the calculation RREQ in the route (ie the route between the source node and the intermediate node) on the spread of prices.

[0019] 现在参照图4,在图4中,更详细地示出了S330的执行。 [0019] Referring now to Figure 4, in Figure 4, is shown in more detail in the S330 execution. 在S410,所接收的RREQ经过的路由R从RREQ中获得。 In S410, the received RREQ route through R obtained from the RREQ. 路由R表示为: Route R is expressed as:

[0020] R(S,Fl, F2,F3, Fk) [0020] R (S, Fl, F2, F3, Fk)

[0021] 其中节点S是源节点,节点F1、F2、...、Fk-1是RREQ已经经过的节点。 [0021] where the node is the source node S, node F1, F2, ..., Fk-1 is the node RREQ has elapsed. 在S420,根据所接收的RREQ获得由沿着路由的链路使用的信道速率。 In S420, based on the received RREQ obtained by the channel rate of the link along the route used. 信道速率表示为(Rl,R2, Rk-1),其中Rl是由从节点S到Fl的链路使用的有效信道速率,Ri (2< i < k-Ι)是由从节点F1-1到Fi (2 S i < k-Ι)的链路使用的信道速率。 Channel rate is expressed as (Rl, R2, Rk-1), which is made from the node S Rl effective channel rate to link the use of Fl, Ri (2 <i <k-Ι) is made from the node to F1-1 Fi (2 S i <k-Ι) links using channel rate. 在S430,计算传输RREQ的节点与接收RREQ的节点之间的链路的有效传输信道速率。 In S430, to calculate the effective transmission channel transmission rate of the link between the node and a receiving RREQ RREQ nodes. 从传输节点(Fk-1)到接收节点(Fk)的链路的有效信道速率被称为“Rk”,Li (I < i < k)表示这些节点之间的链路。 From the transit node (Fk-1) to the receiving node effective channel rate (Fk) the link is called "Rk", Li (I <i <k) represents the link between these nodes. 有效信道速率是通过不包括对于给定的原始信道速率的PHY/MAC协议开销而计算的有效信道吞吐量。 Effective channel rate by not including the original for a given channel rate PHY / MAC protocol overhead calculated effective channel throughput. 有效信道速率不同于由WiMedia规范定义的原始信道速率。 Effective channel rate channel rate differs from the original by the WiMedia specification. 根据一个实施例,如下地由接收节点(Fk)计算有效信道速率Rk: According to one embodiment, as calculated by the receiving node (Fk) effective channel rate Rk:

[0022] [0022]

Figure CN102124783BD00061

[0023] 在上面的公式中,参数P是数据分组的有效负载大小,参数Tp是用于完成数据分组的传输的总时间。 [0023] In the above formula, the parameter P is the payload size of the data packet, the parameter Tp is the total time for completion of the transmission of data packets. 参数Tp包括数据(Tdata)分组和ACK (肯定应答)(Tadt)帧的传输时间以及这些帧之间的任意帧间间隔(Tifs)。 Tp parameters including data (Tdata) packets and ACK (acknowledgment) (Tadt) transmission time frame and any interframe spacing between these frames (Tifs). 如果使用RTS/CTS,时间Tp还可以包括RTS/CTS的传输时间(TrtsArts)tj数据帧的传输时间基于前同步码的传输时间(Tpramble;)、以信道速率Rc传输的帧报头(Hp)、有效负载大小P以及用于传输数据帧的原始信道速率R。 If you use the RTS / CTS, time Tp may also include RTS / CTS transmission time (TrtsArts) tj data frame transmission time based on the transmission time of the preamble (Tpramble;), to channel rate Rc transmitted frame header (Hp), payload size P and for the transmission of data frames of the original channel rate R. ,其中所述前同步码的传输时间(Tpreamble)是固定的,无论所选择的信道速率Rc如何。 , Wherein the transmission time of the preamble (Tpreamble) is fixed, regardless of the selected channel rate Rc how. 有效负载大小P可以是平均有效负载大小或者由源节点采用的任意值。 Payload size P may be an average value, or any payload size used by the source node. 原始信道速率&可以是由链路使用的固定信道速率,或者可以使用已知的链路适应算法来确定。 Original channel rate & can be fixed channel rate used by the link, or you can use a known link adaptation algorithm to determine.

[0024] 在S440,中间节点(Fk)创建由路由上同样是节点(Fk)的相邻节点的节点组成的经过更新的最后节点的相邻节点的列表。 [0024] In S440, an intermediate node (Fk) creates a list of the nodes on the route the same node (Fk) of neighboring nodes consisting of nodes through last updated neighboring nodes. 如上文所提及的,节点Fk接收由节点Fk-1传输的RREQ。 As previously mentioned, the node is received by the node Fk Fk-1 transmission of RREQ. 在S450,创建链路列表以包括所有具有被包括在所接收的RREQ中的最后节点的相邻节点的列表中或者作为节点(Fk)的相邻节点的至少一个端节点的链路。 In S450, in order to create a link list including all adjacent nodes having the last node is included in the received RREQ in a list or as a node (Fk) of the adjacent nodes at least one link end node. 例如,如果路由是R (S、F1、F2、F3以及F4),并且由节点F4接收的RREQ中的最后节点的相邻节点的列表仅包括节点F2,则链路列表包括链路F1->F2,F2->F3以及F3_>F4。 For example, if the route is R (S, F1, F2, F3 and F4), and a list of neighbor nodes received by the node F4 RREQ last nodes includes only nodes F2, the link list includes link F1-> F2, F2-> F3 and F3_> F4. 在S460,节点(Fk)的路由价格是通过对链路列表中的所有链路的有效信道速率的倒数求和而计算的。 In S460, the node (Fk) by route price is valid channel rate of all links in a link list of the calculated reciprocal of the summation. 也就是说,如下计算价格: In other words, price is calculated as follows:

[0025] [0025]

Figure CN102124783BD00071

[0026] 其中Rij是为链路列表中的链路Lij (I < j < η)计算的有效速率,“η”是列表中链路的总数。 [0026] where Rij is a link in the list of links Lij (I <j <η) calculated the effective rate, "η" is the total number of links in the list.

[0027] 现在向后参照图3,在图3中,在S340,进行检查以确定所计算的价格是否大于在所接收的RREQ中包括的价格。 [0027] Referring back now to Figure 3, in Figure 3, in S340, check is made to determine whether the calculated price in the received RREQ than included in the price. 如果是,在S350,更新RREQ以包括新的计算的值;否则,执行以S360继续。 If, in S350, the updated RREQ to include the new calculated value; otherwise, execution continues with S360.

[0028] 在S360,中间节点检查其缓存器是否包括与所接收的RREQ的源-目的地配对相同的源-目的地配对有关的其它RREQ。 [0028] In S360, the intermediate node checks whether its cache includes a source of the received RREQ - destination pairs same source - destination pair RREQ other relevant. 如果是,在S365,进行另一检查以确定所接收的RREQ(具有或者不具有经过更新的价格)是否具有比缓存的RREQ中指示的路由价格小的路由价格。 If so, in S365, another check to determine whether the received RREQ (with or without an updated price) whether the route price less expensive than the route cache of RREQ indicated. 如果是,在S370,中间节点将所接收的RREQ转发给其相邻节点;否则,执行结束。 If so, in S370, the intermediate node forwards the received RREQ to its neighboring nodes; otherwise, execution ends. 在某些实施例中,最后节点的相邻节点的列表可以在S370以与针对S440描述的方式相同的方式更新。 In some embodiments, the list of neighboring nodes may be in the last node in S370 and S440 described manner for the update in the same manner. 如果S360产生否定的答案,则执行进行到S370。 If the S360 produces a negative answer, then execution proceeds to S370.

[0029] 最优路由的选择由目的地节点基于路由价格执行。 [0029] The optimum route selection is performed by the destination node routing based on price. 具体地,如果目的地节点接收对于相同的源-目的地配对的多个RREQ,则该节点选择在所有RREQ中具有最小的路由价格的RREQ所传播的路由。 Specifically, if the destination node receives the same source - destination pair plurality RREQ, the node selects the route having the smallest route price among all the RREQ RREQ propagated. 目的地节点在所选择的路由上发送RREP。 The destination node sends a RREP on the selected route. 源节点和中间节点在接收到RREP之后更新它们的路由缓存/表格。 The source node and the intermediate nodes update their routing cache / table after receiving the RREP.

[0030] 应当注意:诸如DSR以及AODV之类的现有的路由发现协议可以适于实现这里公开的路由发现方法。 [0030] It should be noted: the existing routes such as DSR and AODV like the discovery protocol can be adapted to achieve the route discovery method disclosed herein. 例如,需要现有的路由选择协议在目的地节点可以发送回RREP之前等待预定义的时间量以检查在该时间期间是否接收到额外的RREQ。 For example, the needs of existing routing protocols in the destination node can send a predefined amount of time to wait before RREP back during that time to check whether it has received additional RREQ.

[0031] 作为另一实例,如果需要路由选择协议记录RREQ经过的所有或者某些配对的节点之间的路由和路由的价格,则RREQ可以适于为所有或者某些中间节点(B卩,不仅仅为RREQ经过的最后节点)指示RREQ经过的相邻节点的列表。 [0031] As another example, between a pair of nodes all or some routing protocol if required records RREQ through routing and routing prices, the RREQ can be adapted for all or some intermediate node (B Jie, not only RREQ only after the last node) instruction list RREQ of the adjacent nodes.

[0032] 参照图5A-5G,在图5A-5G中,提供了演示根据本发明的实施例实现的路由发现过程的操作的非限制性实例。 [0032] Referring to FIG. 5A-5G, in FIG. 5A-5G, there is provided a demonstration of non-limiting examples of the process of discovery operation according to an embodiment of the present invention achieves the route. 图5Α示出了包括六个节点510-Α到510-F的网络。 Figure 5Α shows including six nodes 510-Α 510-F of the network. 链路的有效信道速率在两个节点之间的边上示出。 Effective channel rate of the link between two nodes on the edge shown. 为了简单和示范的目的,有效信道速率与原始信道速率相同。 For simplicity and illustrative purposes, the effective channel rate channel rate identical to the original.

[0033] 图5Β到图5G示出了从源节点510-Α发送到目的地节点510-F的RREQ的传播路由。 [0033] FIG 5Β to Figure 5G shows the propagation route RREQ is sent from the source node to the destination node 510-Α 510-F's. 源节点510-Α通过向节点510-Β和5IO-C发送RREQ来开始路由发现过程(参见图5Β)。 The source node 510-Α by sending RREQ to node 510-Β and 5IO-C to start the route discovery process (see Figure 5Β). 由节点510-Β计算的路由价格是1/160,由节点510-C计算的路由价格是1/53.3。 Routing price from node 510-Β calculation is 1/160, routing price calculated by the node 510-C is 1 / 53.3. 然后,节点510-Β和510-C广播RREQ。 Then, the node 510-Β and 510-C broadcast RREQ. 节点510-C还接收由节点510-Β发送的RREQ,并且在此之后计算对于该RREQ的路由价格,该路由价格是2/160。 Node 510-C also receives RREQ sent by the node 510-Β, and thereafter calculating a route for the RREQ price, the route price is 2/160. 新的路由价格小于之前计算的值1/53.3。 Value before the new route price less than the calculated 1 / 53.3. 由此,节点510-C利用新的路由(510-A,510-B,510-C)以及新的价格2/160再一次将RREQ重新广播到节点510-D和510-E (参见图5C)。 Thus, node 510-C with the new route (510-A, 510-B, 510-C) and the new price 2/160 RREQ once again re-broadcast to nodes 510-D and 510-E (see FIG. 5C ). 网络500中的其它节点遵循相同的规则,参见图5E和5F。 Network 500 other nodes follow the same rules, see Figure 5E and 5F.

[0034] 目的地节点510-F利用具有价格4/160的路由(510-A,510-B,510-C,510-D,510-E,510-F)接收RREQ,利用具有路由价格2/53.3+1/160 的路由(510-A,510-C, 510-E,510-F)接收RREQ,并且接收一些其它的RREQ。 [0034] The destination node 510-F has a price advantage of 4/160 routes (510-A, 510-B, 510-C, 510-D, 510-E, 510-F) receives RREQ, the use of having a route price 2 /53.3+1/160 route (510-A, 510-C, 510-E, 510-F) receives RREQ, and receives some other RREQ. 节点510-F比较所有的路由价格,并且选择具有最小的价格的路由,其是路由(510-A,510-B, 510-C, 510-D, 510-E, 510-F)。 Node 510-F compare prices of all routes and selects the route with the lowest price, which is a route (510-A, 510-B, 510-C, 510-D, 510-E, 510-F). 随后,目的地节点510-F沿着所选择的路由将RREP发送回源节点510-A (参见图5G)。 Subsequently, the destination node 510-F along the selected route RREP sent back to the source node 510-A (see Figure 5G). 源节点5IO-A更新其路由缓存/表格,并且从节点510-A到510-F的路由被建立。 5IO-A source node updates its routing cache / table, and was built from the node 510-A to 510-F of the route.

[0035] 应当了解:使用上述方法发现的路由比由现有的协议发现的最短跳路由具有更好的吞吐量。 [0035] It should be understood: using the above method than the shortest routes discovered hop route from the existing protocol discovery has better throughput. 例如,这种协议将选择路由(510-A,510-C, 510-E, 510-F)、(510-A, 510-B,510-D, 510-F)或者(510-A,510-C, 510-D, 510-F)。 For example, such a routing protocol (510-A, 510-C, 510-E, 510-F), (510-A, 510-B, 510-D, 510-F), or (510-A, 510 -C, 510-D, 510-F). 所有这三个路由具有相同的价格2/53.3+1/160 Sr 1/22.8,其具有大约22.8Mbps的吞吐量。 All three routes have the same price 2 / 53.3 + 1/160 Sr 1 / 22.8, which has a throughput of about 22.8Mbps. 对于该网络,所公开的方法选择具有1/40的价格以及大约40Mbps的吞吐量的路由(510-A,510-B, 510-C, 510-D,510-E, 510-F)。 For the network, the disclosed method of selecting a price as well as the route of approximately 1/40 40Mbps throughput (510-A, 510-B, 510-C, 510-D, 510-E, 510-F). 因此,此实例在端到端吞吐量上的改进是大约75%。 Therefore, improvement in this instance the end throughput is about 75%. 如果有更多的节点和更高的速率可用,则该改进可以甚至更高。 If there are more nodes and higher data rates are available, the improvement can be even higher.

[0036] 所公开的方法可以在包括但不限于以下的通信系统中实现:基于UWB的WPAN、基于WiMedia的无线网络和WPAN或者任何时分多址(TDMA)或者基于超帧的无线网络。 [0036] The disclosed methods may include but are not limited to, the following communication systems to achieve: Based on UWB WPAN, WiMedia-based wireless networks and WPAN or any time division multiple access (TDMA) or super-frame based wireless networks.

[0037] 将本发明的原理实现为硬件、固件和软件的组合。 [0037] The principles of the present invention is implemented as a combination of hardware, firmware and software. 此外,所述软件优选地被实现为确实包含在程序存储单元或者计算机可读介质上的应用程序。 Moreover, the software is preferably implemented as indeed included in the program storage unit or computer readable media applications. 所述应用程序可被上传到包括任何合适结构的机器,并由其执行。 The application program may be uploaded to a machine comprising any suitable structure, by its implementation. 优选地,所述机器在具有诸如一个或多个中央处理单元(“CPU”)、存储器以及输入/输出接口之类的硬件的计算机平台上被实现。 Preferably, the machine having such as one or more central processing units ("CPU"), a memory, and input / output interface or the like of the computer hardware platform is implemented. 所述计算机平台也可包括操作系统和微指令代码。 The computer platform may also include an operating system and microinstruction code. 这里所描述的各种过程和功能可以是可由CPU执行的微指令代码的部分或应用程序的部分或它们的任意组合,无论这种计算机或者处理器是否被明确示出。 The various processes and functions described herein may be or may be any combination of the microinstruction code or part of the CPU executes the application portion thereof, whether or not such computer or processor is explicitly shown. 另外,诸如附加数据存储单元和打印单元之类的各种其它的外设单元可以与计算机平台连接。 In addition, various other peripheral units such as an additional data storage unit and a printing unit can be connected to computer platforms.

[0038] 上面的详细描述已经阐明了本发明可以采用的许多形式中的几个。 [0038] The foregoing detailed description has set forth a few of the many forms of the invention may be employed in. 意在上面的详细描述被理解为本发明可以采取的所选择的形式的例示,而不是理解为对于本发明的定义的限制。 In the above detailed description is intended to be understood that the invention can take the form of a selected illustrative, and not as the definition of the present invention is limited. 仅权利要求书(包括所有的等效物)意在限定本发明的范围。 Books (including all equivalents) intended to define the scope of the invention as claimed only requirement.

Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
WO2007/073466A1 Title not available
WO2007/099263A1 Title not available
Non-Patent Citations
Reference
1D. Johnson.《The Dynamic Source Routing Protocol (DSR)for Mobile Ad Hoc Networks for IPv4,Request for Comments: 4728》.《STANDARD, INTERNET ENGINEERING TASK FORCE, IETF,Network Working Group》.2007,第1页,第5页,第9页第22行到第12页第2段.
Classifications
International ClassificationH04L12/701, H04W40/02
Cooperative ClassificationH04W40/24, H04L45/26, H04L45/302, H04L45/34, H04L45/125
Legal Events
DateCodeEventDescription
13 Jul 2011C06Publication
14 Sep 2011C10Request of examination as to substance
25 Dec 2013C14Granted