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 numberCN101310488 A
Publication typeApplication
Application numberCN 200680043051
PCT numberPCT/US2006/046900
Publication date19 Nov 2008
Filing date7 Dec 2006
Priority date23 Dec 2005
Also published asEP1964335A1, US20070147255, WO2007073466A1
Publication number200680043051.6, CN 101310488 A, CN 101310488A, CN 200680043051, CN-A-101310488, CN101310488 A, CN101310488A, CN200680043051, CN200680043051.6, PCT/2006/46900, PCT/US/2006/046900, PCT/US/2006/46900, PCT/US/6/046900, PCT/US/6/46900, PCT/US2006/046900, PCT/US2006/46900, PCT/US2006046900, PCT/US200646900, PCT/US6/046900, PCT/US6/46900, PCT/US6046900, PCT/US646900
InventorsO奥伊曼
Applicant英特尔公司
Export CitationBiBTeX, EndNote, RefMan
External Links: SIPO, Espacenet
Routing in wireless mesh networks
CN 101310488 A
Abstract
A method, apparatus and system for communicating in a wireless mesh network may entail using a Viterbi routing algorithm to determine a multi-hop path between a source node and a destination node having a lowest cost metric. In one example, the cost, metric, may be inversely proportional in the achievable transmission rate in the links of each potential multi-hop path. A next hop node in two or more potential multi- hop paths for routing a wireless communication to a destination node may be determined by each node based on the multi-hop path having a lowest cost metric associated with communicating to the destination node. Other embodiments and variations are described in the detailed description.
Claims(18)  translated from Chinese
1、一种用于在无线网状网络中进行通信的方法,所述方法包括: 确定具有最低的成本度量总和的下一跳节点,所述成本度量与沿着两个或更多潜在多跳路径的在无线节点和目的地之间的通信相关联,其中成本度量基于每个潜在的多跳路径中每个相邻无线节点之间的信道特性;以及更新所述无线节点中的路由表,以识别所述确定的下一跳节点。 1. A communicating method in a wireless mesh network, said method comprising: determining the lowest cost metric sum next hop node, along with a measure of the cost of two or more potential multi-hop between the wireless node and the destination of the communication path is associated, wherein the cost metric based on channel characteristics between each potential multi-hop path in each adjacent wireless node; wireless node and updating the routing tables, to identify the next hop determined.
2、 如权利要求1所述的方法,其中所述成本度量与所述相邻无线节点之间的无线信道中可能的传输速率成比例。 2. A method as claimed in claim 1, the wireless channel between the wireless node may transmit a rate proportional to wherein said cost metric and the adjacent.
3、 如权利要求1所述的方法,进一步包括:如果存在相邻无线节点, 则在朝源节点的方向上,向每个所述相邻无线节点发送所述最低成本度量总和的标志。 3. The method of claim 1, further comprising: if there is an adjacent wireless nodes, the direction towards the source node to each of the neighboring radio node sends the lowest cost metric sum sign.
4、 如权利要求1所述的方法,其中更新所述路由表进一步包括:记录与经由所述下一跳节点的通信相关联的所述最低成本度量总和。 4. The method of claim 1, wherein updating the routing table further comprises: recording with the lowest cost associated with communication via the next hop node metric sum.
5、 如权利要求3所述的方法,其中所述源节点包括基础设施型的基站, 所述无线节点包括固定的无线网状点并且所述目的地节点包括移动站。 5. The method of claim 3, wherein said source node comprises a base station infrastructure type, the wireless node comprises a wireless mesh point and fixed the destination node comprises a mobile station.
6、 如权利要求1所述的方法,其中所述无线网状网络包括宽带无线网络。 6. The method of claim 1, wherein the wireless mesh network comprises a broadband wireless network.
7、 如权利要求1所述的方法,其中所述潜在的多跳路径限于源和所述目的地之间的网格中节点段,并且其中忽略了非相邻节点之间的路径。 7. The method of claim 1, wherein said potential multi-hop path segments limited grid nodes between the source and the destination, and which ignores the path between non-adjacent nodes.
8、 一种无线设备,包括:处理电路,其包括确定逻辑,用于从至少两个潜在的多跳路径之一中的各个节点中确定下一跳节点,所述多跳路径用于向目的地节点路由无线通信,其中将所述下一跳节点确定为在具有到所述目的地节点的最大潜在传输速率的多跳路径上。 8, a wireless device, comprising: a processing circuit, which comprises a determination logic for determining a next hop node from one of the at least two potential multi-hop path in each node, for the multi-hop path to the destination routing wireless communications to the node, wherein the next hop node determined in the multi-hop path to the destination node having a maximum transmission rate potential.
9、 如权利要求8所述的无线设备,其中所述逻辑包括无线网状路由管理器。 9. The wireless device of claim 8, wherein the logic includes a wireless mesh routing manager.
10、 如权利要求8所述的无线设备,其中所述逻辑进一步更新所述无线设备的路由表,以便将所述目的地节点关联到所述确定的下一跳节点以及成本度量,所述成本度量与沿着到所述目的地节点的所述多跳路径的通信相关。 10. The wireless apparatus according to claim 8, wherein the logic further updates a routing table of the wireless device, so that the next hop node and a cost metric associated with the destination node determined, the cost The metric to the destination node along a multihop communication-related paths.
11、 如权利要求10所述的无线设备,其中所述处理电路进一歩包括发送逻辑,用于将所述成本度量的标志从所述目的地节点发送到一个或多个上游的相邻无线节点。 11. The wireless device of claim 10, wherein said processing circuitry comprises transmitting logic into a ho, the cost metric for the flag sent from the destination node to one or more neighboring wireless nodes upstream .
12、 如权利要求8所述的无线设备,其中所述设备包括宏基站或微基站中的一个。 12. The wireless device of claim 8, wherein the apparatus comprises a macro base station or a micro base station.
13、 如权利要求8所述的无线设备,其中所述设备进一步包括与所述处理电路通信的射频(RF)接口。 13. The wireless device of claim 8, wherein said apparatus further comprises a radio frequency communication with the processing circuit (RF) interface.
14、 一种无线系统,包括:处理电路,其包括确定逻辑,用于确定两个或多个潜在的多跳路径中的下一跳节点,所述多跳路径用于向目的地节点路由无线通信,其中将所述下一跳节点确定为在具有与到所述目的地节点的通信相关联的最低成本度量的多跳路径上;可通信地耦合到所述处理电路的射频(RF)接口;以及耦合到所述RF接口的至少两个天线,用于多输入或多输出通信中的至/!>——个„ 14. A radio system, comprising: a processing circuit, which comprises a determination logic for determining two or more potential multi-hop path next hop node, the multi-hop path to the destination node for routing wireless communications, wherein the determined next hop node on a multi-hop path metric having the lowest cost to the destination node and associated communication; communicatively coupled to the RF processing circuit (RF) interfaces ;! and coupled to the RF interface of at least two antennas for multi-input multi-output communication to /> - a "
15、 如权利要求14所述的系统,其中所述逻辑使用Viterbi (维特比) 算法来确定所述下一跳节点。 15. The system of claim 14, wherein said logic uses Viterbi (Viterbi) algorithm to determine the next hop node.
16、 如权利要求14所述的系统,其中所述最低成本度量与所述两个或更多潜在的多跳路径中的各个节点之间可达到的传输速率成反比例。 16. The system of claim 14, wherein the minimum achievable cost metric between the two or more potential multi-hop path is inversely proportional to the transmission rate of each node.
17、 如权利要求14所述的系统,其中所述逻辑进一步更新路由表,以便将所述目的地节点与所述确定的下一跳节点以及成本度量相关联,所述成本度量与沿着到所述目的地节点的所述多跳路径的通信相关。 17. The system of claim 14, wherein the logic further updates a routing table for the next hop node and the destination node and the determined cost metrics associated with the cost along to metric said destination node multi-hop communication-related paths.
18、 如权利要求14所述的系统,其中所述系统包括宽带无线基站。 18. The system of claim 14, wherein the system comprises a wideband wireless base station.
Description  translated from Chinese

无线网状网络中的路由背景技术将无线网络中的节点作为中继点来扩展无线网络的范围和/或减少无线网络的成本变得越来越有吸引力。 Wireless mesh network routing BACKGROUND wireless network node as a relay point to extend the range of a wireless network and / or reduce the cost of wireless networks become more and more attractive. 例如,在需要跨越大区域的分布式基站部署的无线广域网(WWAN)或无线城域网(WMAN)中,基站必须经由一些类型的回程来连接到核心网络和/或彼此进行连接。 For example, the need to cross a large area of distributed base stations deployed wireless wide area network (WWAN) or wireless metropolitan area network (WMAN), the base station must go through some type of backhaul to connect to the core network and / or each other to connect. 在常规网络中,回程典型地由有线连接组成。 In conventional networks, backhaul typically composed by a wired connection. 然而,现在越来越多地考虑无线回程而非有线回程,或是无线回程和有线回程的组合,以便于部署以及减少与这些网络相关联的成本。 Now, however, increasingly considering wireless backhaul wireline backhaul, or a combination rather than wireless backhaul and wired backhaul to facilitate deployment and reduce costs associated with these networks. 将使用无线站来中继源和目的地之间的信号的网络类型通俗地称为网状网络。 Network type signal will use radio stations to relay between source and destination popularly known as a mesh network. 在网状网络中,无线网络节点可以形成路径"网",用于使通信可以传播到它的目的地。 In a mesh network, wireless network nodes can form a path "net" for allowing communication can be transmitted to its destination. 人们非常关注的主题是将无线网状网络用作为无线回程,并且正在努力增加通过无线网状网络的传输效率。 Themes people are very concerned about the wireless mesh network is used as a wireless backhaul, and is working to increase the wireless mesh network transmission efficiency. 附图说明参考附图,以下对本发明的描述将使本发明的实施例的各个方面、特征和优点变得明显,其中相似的数字表示相似的元件,其中:图1和图2是示出了根据本发明的多个实施例的无线网状网络中的无线节点的排列的方框图;图3是示出了根据本发明的一个或多个实施例,用于通过无线网状网络来路由传输的基于Viterbi (维特比)的算法的流程图;图4是根据本发明的多个实施例,通过成本度量和路由更新的示例性计算,示出了图2的排列的方框图;图5是示出了根据本发明的多个方面的示例性无线装置的方框图。 Brief description of the drawings, the following description of the present invention will enable various aspects, features and advantages of embodiments of the present invention will become apparent, in which like numerals indicate similar elements and in which: Figure 1 and Figure 2 is a diagram showing a block diagram of a wireless mesh network of the present invention, a plurality of embodiments of the arrangement according to the wireless node; FIG. 3 is a diagram showing in accordance with one or more embodiments of the present invention, is used to route the wireless mesh network transmission flowchart Viterbi (Viterbi) algorithm based; Figure 4 is a plurality of embodiments of the present invention, cost metrics and routing updates through an exemplary calculation shows a block diagram of the arrangement of Figure 2; Figure 5 shows a block diagram of the various aspects of an exemplary wireless device of the present invention. 具体实施方式尽管在以下的详细描述可以根据WMAN来描述本发明与相关的示例性实施例,本发明的实施例并不局限于此,并可以应用到其它类型的可以获得类似优点的无线网络。 Although particular embodiments according to the present invention will be described WMAN associated exemplary embodiment, embodiments of the present invention are not limited thereto in the following detailed description, and may be applied to other types of wireless networks achieve similar advantages. 这些可以明确地应用本发明的实施例的网络可 These can be explicitly applied embodiment of the present invention can network

以包括:无线个域网(WPAN)、无线局域网(WLAN)、诸如蜂窝网络的WWAN和/或这些网络的任意组合。 To include: wireless personal area network (WPAN), wireless local area network (WLAN), or any combination of WWAN such as a cellular network and / or combinations of these networks. 此外,可以参考利用正交频分复用(OFDM)调制的无线网络讨论本发明的实施例。 In addition, you can refer to the use of orthogonal frequency division multiplexing (OFDM) modulation wireless network discussed embodiment of the present invention. 然而,本发明的实施例并不局限于此,并且,例如,只要适当可行就可以使用其它的调制和/或编码方案进行实现。 However, embodiments of the present invention is not limited thereto, and, for example, can be used as long as feasible and appropriate other modulation and / or coding scheme to achieve.

本发明的以下实施例可以用于多种应用,包括无线电系统的发射器和接收器。 The following embodiments of the present invention can be used in many applications, including a radio transmitter and receiver system. 明确地包括在本发明的范围内的无线电系统包括,但是并不局限于,网络接口卡(NIC)、网络适配器、移动站、基站、接入点(AP)、混合协调器(HC)、网关、桥、集线器和路由器。 Specifically included within the scope of the present invention, a radio system include, but are not limited to, network interface cards (NIC), a network adapter, a mobile station, a base station, an access point (AP), hybrid coordinator (HC), gateway , bridges, hubs, and routers. 此外,本发明范围内的无线电系统可以包括蜂窝无线电话系统、卫星系统、个人通信系统(PCS)、两路无线电系统和两路寻呼机以及计算设备,包括例如个人计算机(PC)和相关外围设备的无线电系统、个人数字助理(PDA)、个人计算附件和所有现有的和将进一步出现的系统,它们本质上相关并且可以适用于本发明的实施例的原理。 In addition, within the scope of the present invention may include a cellular radio system radiotelephone systems, satellite systems, personal communication systems (PCS), two-way radio systems and two-way pagers and computing devices, including such as a personal computer (PC) and related peripherals radio systems, personal digital assistants (PDA), personal computing accessories and all existing and emerging systems will further, and can be applied to embodiments of the present invention is related to the principles of their nature.

转到图1,根据本发明的多个实施例的无线通信网络ioo可以是具有能够经由空中(OTA)射频(RF)链路来发送和/或接收信息的设备的任意系统。 Turning to Figure 1, a wireless communication network according ioo plurality of embodiments of the present invention may be any system capable of having a transmitting and / or receiving information of the device via the air (OTA) radio frequency (RF) link. 例如在一个实施例中,网络100可以包括多个无线节点101-110 (以及其它未指定的节点),以便向和/或从诸如移动站120的一个或多个固定的或移动的设备通信或中继消息。 For example, in one embodiment, network 100 may include 101-110 (as well as other unspecified nodes) a plurality of wireless nodes, in order to provide and / or a communication device such as a mobile station 120 from one or more fixed or mobile or relay messages. 应该认识到图1表示了示例性的拓扑,其中每个节点101-110位于每个示出的多项式的中心。 It should be appreciated that FIG. 1 illustrates an exemplary topology where each node 101-110 located in each illustrated polynomial center. 示出的格式中的每个六边形旨在通用地表示用于形成网状网络100的节点的区域中的每个节点的无线电链路覆盖的空间的或"蜂窝"的范围。 It illustrates the format of each hexagon is intended to represent a general range radio link area mesh network node 100 for forming the cover of each node of the space or "honeycomb" of. 额外的未参考的蜂窝(白色的六边形)还包括与具体的实例无关的节点。 No additional reference cell (white hexagons) also include specific examples of independent nodes.

在某些实施例中,网络100中的无线节点可以是使用与电气和电子工程师协会(正EE)的多个802无线标准中的一个或多个相兼容的无线协议和/或技术来进行通信的设备,其中的多个802无线标准包括例如,用于WLAN的802.11 (a)、 (b)、 (g)和/或(n)标准、用于WPAN的802.15 标准和/或用于WMAN的802.16标准,但是本发明的实施例并不局限于这个方面。 In some embodiments, the network 100 is a wireless node may be compatible with the use of Electrical and Electronics Engineers (positive EE) more than 802 wireless standards in one or more of the wireless protocols and / or techniques to communicate The apparatus 802 wherein the plurality of wireless standards including, for example, for the WLAN 802.11 (a), (b), (g) and / or (n) standards for the 802.15 WPAN standards and / or for the WMAN 802.16 standard, but the embodiment of the present invention are not limited in this regard. 使用现有的用于ad-hoc网络配置的802.11介质访问控制(MAC)规范, 可以通过广播消息的单播转发或通过广播消息的广播转发,执行基于网络IOO的广播操作。 Using the existing ad-hoc network configuration for the 802.11 MAC (MAC) specifications, can be forwarded or forwarding the message through radio broadcasting, execute the operation based on broadcast network IOO unicast broadcast message. 在单播转发中,广播消息将独立地单播到每个邻居,并且每个邻居依次通过执行多个单播传输,将广播消息转发到它的所有邻居, 直到在最后将消息广播到所有的节点或网点为止。 Unicast forwarding, broadcast messages unicast independently to each neighbor and each neighbor in sequence by performing multiple unicast transmission, the forward broadcast messages to all of its neighbors, until the last message is broadcast to all the node or network so far. 在广播转发中,可以使用唯一的广播目的地地址(例如,包括全1的MAC地址),将广播消息广播到所有的邻居。 In the broadcast forwarding, you can use a unique broadcast destination address (for example, including the MAC address of all ones), the broadcast message is broadcast to all the neighbors. 每个接收到这种消息的邻居节点还将广播消息等等,直到在所有的网状节点接收到广播消息为止。 Each received such a message will also broadcast the message neighbor nodes and so on until all the received broadcast message in the mesh nodes so far. 然而,因为事实上将消息从点A传到点B,例如,在基站101和移动站120之间,可以仅仅需要很少的网格节点,但此时所有的网状节点都将发送广播消息,所以使用这些传统方法的任意一种的时候将出现显著的传输冗余开销。 However, because in fact the message from point A reached points B, e.g., between the base station 101 and mobile station 120, you may only need a few mesh nodes, but this time all mesh nodes will transmit the broadcast message Therefore, when using any of these traditional methods will appear significant transmission redundancy overhead. 在高吞吐量的基础设施中,例如用于宽带无线网络的无线回程排列中,这种类型的冗余是不可接受的。 Wireless backhaul infrastructure arranged in a high throughput, such as for broadband wireless networks, this type of redundancy is unacceptable. 因此需要通过无线网状网络来明确地路由传输的技术。 Hence the need to explicitly routed transmission technology over a wireless mesh network. 此外,为了促进效率和/或可靠性的提高,网状路由技术在选择路由传输的路径时应该考虑网状节点之间的信道特点。 Furthermore, in order to promote the efficiency and / or increased reliability, mesh routing when the routing path transmission channel characteristics should be considered between the mesh nodes. 这最适合于节点之间具有相对较慢的变化或衰减特点的信道,例如固定的无线站之间。 This is most suitable between node having a relatively slow change or attenuation characteristics of the channel, e.g., between the fixed wireless stations. 参考图1作为实例,在每个各自的节点之间的链路中可能存在多个不同等级的信道质量。 1 as an example, there may be a plurality of channel quality of the links between the different levels of each respective node with reference to FIG. 因此,源节点(例如,基站IOI)和目的地节点(例如,移动站120)之间的路由传输不能仅仅考虑到达目的地需要的最少跳数(如节点102、 103和104之间的黑色箭头所示),而是可能还要考虑在源和目的地节点之间的节点的格或网格中的这些节点和相邻节点105-110之间的可能路径中的空中链路的质量。 Thus, the source node (e.g., base station IOI) and the destination node (e.g., mobile station 120) between the transmission route can not be considered only reach the minimum number of hops (e.g. required destination node 102, 103 and 104 black arrow between below), but may also consider the node between the source and destination nodes of the grid or the grid nodes and adjacent nodes 105-110 quality possible path between the air link. 在一个非限制性的示例性实现中网络100中的一个或多个节点(例如, 节点101)可以是一种无线收发器,其经由物理的有线连接(例如,电或光纤连接),连接到诸如因特网协议(IP)网络的核心网络。 In one non-limiting exemplary implementation of one or more network nodes 100 (e.g., node 101) may be a wireless transceiver via a physical wired connection (e.g., electrical or optical connector), connected to such as the Internet Protocol (IP) network core network. 这里将这种类型的站称为"宏"基站(BS)。 This type of station here called "macro" base station (BS). 另夕卜,在某些实施例中,网络100中的一个或多个节点(例如,节点102-110)可以是另一种无线收发器,其不通过电的或有线的或光缆连接到核心网络,而是提供之前提到的无线回程。 Another evening BU, in some embodiments, the network 100 to one or more nodes (eg, nodes 102-110) may be another wireless transceiver, which is not connected to the core by electrical or optical cable or cable network, but to provide wireless backhaul mentioned earlier. 典型地, 这些无线收发器的发送功率和天线高度小于宏BS的发送功率和天线高度。 Typically, these wireless transceiver transmit power and antenna height is less than the macro BS transmit power and antenna height. 这些类型的站可以是有时称为"微"或"极微"基站(依赖它们覆盖区域的大小)的固定的无线电中继节点,但是本发明的实施例不局限于这个方 These types of stations may be referred to as "micro" or "minimal" base station (the size of the area they cover dependent) fixed radio relay nodes, but the embodiment of the present invention is not limited to the square

面。 Surface. 因此在无线网状网络100的某些实施例中,微基站可以经由使用802.16 和/或802.11协议的无线链路,提供彼此之间的连接和/或与宏基站的连接。 Therefore, in some embodiments, the wireless mesh network 100, the micro base station can use a wireless link via 802.16 and / or 802.11, providing connection and / or connection with the macro base station of each other.

考虑下行链路的情况(但是本发明的实施例可以同时应用于上行链路和下行链路的情况),其中需要将宏基站101所初始化的分组路由到移动站120。 Consider the case of downlink (but the embodiment of the present invention can be applied to both uplink and downlink), which needs to be initialized with the macro base station 101 to the mobile station 120 routes the packet. 在这个实施例中,假设在给定的时间/频率资源内仅有一个中继节点以多跳的方式向它的相邻中继节点进行发送。 In this embodiment, it is assumed in a given time / frequency resource is only one relay node to its way to the multi-hop relay node transmits neighbor. 用于路由路径的搜索局限于基站101和目的地120之间的节点102-110的初始网格。 Search for routing paths confined to the base station node 102-110 of the initial mesh between 101 and 120 destinations. 假设最佳的路由位于中继节点102-110的这个网格中的多跳路径之上,并且可以忽略非相邻节点之间的路径。 Suppose the optimal route is located above the grid relay node 102-110 in the multi-hop path, and the path between the non-adjacent nodes can be ignored. 这是个合理的假设,因为非相邻蜂窝之间的路径损耗远高于相邻蜂窝之间的路径损耗。 This is a reasonable assumption, because the path loss between non-adjacent cells is much higher than the path loss between neighboring cells.

这个简化将寻找加权图的最小成本路径(可以使用复杂的Dijkstra算法解决)的一般路由问题减小为可以由Viterbi算法解决的更简单的分层网络路由问题。 This simplified will find the minimum cost path weighted graph (you can use Dijkstra's algorithm to solve complex) of the general routing problem is reduced to a more simple hierarchical network routing problems can be solved by the Viterbi algorithm. Viterbi算法是用其开发者Andrew Viterbi命名的,其为用于寻找隐藏状态的最有潜在的顺序的动态程序算法,该顺序称为Viterbi路径,其导致观察事件的顺序。 Viterbi algorithm is named after its developer Andrew Viterbi, which is used to find the hidden potential of the most dynamic sequence program algorithm, which is known as the Viterbi path sequence, which results in order to observe the event. 长久以来Viterbi算法用于通信链路的错误纠正方案中,并且特别应用于码分多址(CDMA)和其它通信系统使用的译码巻积码中。 Error correction scheme for a long time Viterbi algorithm communication links, and is particularly applicable to the product code decoding Volume CDMA (CDMA) and other communication systems use. 相信本发明的实施例是首次利用Viterbi算法的无线网络中的路由通信。 I believe the embodiment of the present invention is to route traffic for the first time use Viterbi algorithm in a wireless network.

图2中示出了以上情况中的节点101-120的有限段的网格图200。 Figure 2 shows a trellis diagram in the case of more than a limited segment of the nodes 101-120 200. 虽然最短的路径(例如,节点102、 103和104之间)最好将总跳数最小化,但是如果这条路径上的任意链路经历显著的信道衰减,为了将可靠性和/或端到端吞吐量最大化,则可能要求增加跳数并且挑选包括任意相邻节点105、 106、 107、 108、 109或IIO的可替换的路径。 Although the shortest path (for example, node 102, between 103 and 104) is preferable to minimize the total number of hops, but if any of the links on this path experience significant channel attenuation, to the reliability and / or end end maximize throughput, it may be required to increase the number of hops and the selection include any neighboring nodes 105, 106, 107, 108, 109 or IIO alternative path. 应该注意到本发明的实施例的路由技术可以独立地工作,以选择网格图200中的节点的具体格式。 It should be noted that the present invention is an embodiment of the routing technology can work independently to select specific format trellis 200 nodes. 例如,有限路径中的节点数量可以根据设计者的判断进行扩展或减少。 For example, a limited number of nodes in the path can be extended or decreases depending on the designer's judgment. 给定的任意选择将导致可以使用基于Viterbi的路由算法进行最佳化的分层网络路由方案。 Any given result can choose to use to optimize network routing scheme based on hierarchical routing Viterbi algorithm.

转到图3,用于多跳无线网状网络中的路由传输的基于Viterbi的路由算法300可以包括识别305源节点和目的地节点之间的相邻节点的有限制的段,以及确定315用于发送到目的地并且具有最低总成本度量的下一跳节点。 Turning to Figure 3, there are restrictions for multi-hop routing-based Viterbi algorithm may comprise 300 between adjacent nodes 305 to identify the source and destination nodes of a wireless mesh network segments the transmission route, and determining with 315 to be sent to the next hop destination and has the lowest total cost metric. 一旦组中的每个节点已经更新了315它的用于识别在最低成本路径上的下一相邻跳的路由表,可以将来自源的分组基于所选的节点组中的路由表,路由到目的地。 Once the group has been updated 315 per node for identifying it at the lowest cost path to the next adjacent hop routing table can be from the source of the packet based on the selected node group in the routing table, the route to destination. 可以用多种方式执行相邻节点的有限的段的识别305。 You can perform a variety of ways to identify a limited segment 305 adjacent nodes. 将典型地考虑宏BS的区域性覆盖地区中的所有微基站和/或移动站。 The regional coverage of areas typically considered a macro BS of all micro base stations and / or mobile station. 基于移动站的位置,宏BS可以确定用于潜在应用的有限的节点集合并且对路由构造将考虑的节点集合进行通知。 Based on the location of the mobile station, the macro BS can determine a finite set of nodes and potential applications of the node routes to construct a set of notification will be considered. 如果在所识别的组中的每个节点与目的地节点之间存在使用相邻节点的多跳路径,则可以确定310在该潜在的多跳路径上进行通信的总成本度量。 If you use Neighbor multihop path exists between each node and the destination node in the identified group, it can determine the total cost of 310 metric communicate on the potential of multi-hop path. 例如,每个节点可以经由多跳路径通过它相邻的邻居节点的任意组合, 确定与在其本身和目的地之间的链路上进行的通信相关联的成本度量。 For example, each node may be via multi-hop by any combination of its adjacent neighbor node, determining cost metric on the link between itself and destination were associated communications. 可以对希望的任意特定类型的度量执行成本度量确定。 You can perform cost metric to measure to determine any particular type of hope. 在本发明的一个实施例中,成本度量可以涉及传输在特定链路中经历的可用速率或时间,但是可以使用任意希望的度量。 In one embodiment of the present invention, the cost metric may involve the transmission of experience available in the particular link rate or time, but may be used in any desired measure. 依靠基本的网络技术,可以确定用于网格中每个链路的信道的质量,例如基于反馈信号或信标的被动扫描。 Rely on the underlying network technology that can be used to determine the quality of the grid channel of each link, for example, based on the feedback signal beacons or passive scanning. 可以在每个链路的每个节点(例如,101-110;图1-2)估计到网格中的其它相邻节点的吞吐速率。 Each link in each node (e.g., 101-110; FIG. 1-2) is estimated throughput rates of other neighboring mesh nodes. 例如,考虑N跳的路径,其中在跳n的传输时间是tn秒,并且在跳n 的传输速率是Rnbit/秒。 For example, consider the N-hop path, wherein the transmission time tn is in the hop n seconds, and the n-hop transmission rate is Rnbit / sec. 如果发送的消息包括Bbit的信息,并且在多跳中发送T秒,随后可以使用下面的方程式1计算端到端的吞吐量R:其中将Rn计算为即时接收的信号对噪声的比值SNRn的函数,其中SNRn依靠基于第n跳的信道实现的知识。 If the message is sent, including Bbit information, and send in a multi-hop T seconds, then be calculated using the following equation 1 end-throughput R: wherein Rn is calculated as real-time reception of signal to noise ratio SNRn function, which SNRn rely on knowledge-based n-hop channel realizations. 由于固定的中继节点(例如,节点101-110;图1)的不动特性,人们期望在固定无线跳之间经历的信道是慢衰减的(除了当包括移动站时的最后一跳),并且每个节点能够追踪其自身的发M/接收信道。 Since the fixed relay nodes (eg, nodes 101-110; Fig. 1) Fixed characteristics, it is desirable to jump between the fixed wireless channel is experiencing a slow decay (except when including mobile station last dive). and each node can track their own hair M / receiving channel. 路由算法的目标是寻找使R最大化(或使T最小化)的多跳路径。 Destination routing algorithm is looking to make R maximize (or minimize to make T) multihop path. 等价地,将每个链路的成本表示为cn=l/R„,使吞吐量最大化的路径是使总成本最小化的路径。 Equivalently, the cost of each link is represented as cn = l / R ", so that the path to maximize throughput is to minimize the total cost of the path.

因此可以向图2所示的网格上的每个分支分配成本度量,例如,使用以下的方程式 Therefore, costs can be assigned to each branch of the grid shown in Fig. 2 on the measure, for example, using the following equation

<formula>formula see original document page 10</formula> (2) <Formula> formula see original document page 10 </ formula> (2)

通过建立这个方程式,使用基于Viterbi的路由算法可以容易地确定最佳多跳路由。 By establishing this equation, using the Viterbi-based routing algorithm can easily determine the best multi-hop route.

一旦节点使用有限制的组中它的每个相邻的下游节点,来确定了与多跳路径相关联的成本链路,节点就可以更新315它的内路由表,以便识别到目的地的最低成本(或"最佳")路径上的下一跳节点。 Once a node using a restricted group of each of its adjacent downstream nodes to determine the path associated with the multi-hop link cost, the node can update its routing table 315 in order to identify the destination of a minimum cost (or "best") the next hop on the path. 在某些实施例中, 还可以将在最低成本路径上的当前节点和目的地节点之间进行通信的总成本度量记录在路由表中。 In certain embodiments, it is also possible to measure the total cost of communication were recorded in the routing table at the lowest cost path between the current node and the destination node. 可以自动地或按照请求将信息传递320到相邻节点的上游,从而它们可以重复该过程。 Automatically or in accordance with the information transmission request 320 to the upstream neighboring node, so that they can repeat the process. 一旦识别的组中的节点进行了更新, 分组可以通过源来进行发送,并且基于每个节点中的路由表沿着最佳路径进行路由。 Once you have identified a group of nodes have been updated, the packet can be sent by the source, and on a per-node routing tables along the best path routing.

本发明的实施例的基于Viterbi的路由算法是目的地序列距离向量(DSDV)路由算法的特例,在此情况下以分布式(也就是,节点到节点) 的方式执行路由选择。 Viterbi algorithm is based on the destination routing sequence distance vector (DSDV) routing algorithm is a special case, in this case distributed (ie, node-to-node) by way of example of the present invention to perform routing. 这不同于集中的链路状态算法(例如Dijkstm),该算法假设关于连通性和链路的成本的全局信息在每个节点是可用的。 This differs from the centralized link-state algorithms (such Dijkstm), the algorithm assumes that global information about connectivity and link costs is available at each node.

由于上述的微蜂窝基础设施的分层特性,路由选择算法的分布式实现引起的开销成本远小于用于任意ad hoc网络的开销成本。 Because of the hierarchical nature of the above-mentioned micro-cellular infrastructure, distributed routing algorithm to achieve due to overhead cost far less than the overhead cost for any ad hoc networks. 此外,基于这种具有固定的网络拓扑的基础设施网络的路由确保了路由变化的及时更新并且避免了路由回环。 In addition, the route that has a fixed network topology based network infrastructure to ensure the timely update and route changes to avoid routing loops. (路由回环形成的主要原因是节点基于可能与网络拓扑中异步接收或意外的改变的不一致的信息,以完全分布式的方式选择它们的下一跳。) (The main reason for the formation of routing loops is based node information inconsistency may receive asynchronous network topology or unexpected change to a fully distributed manner choose their next hop.)

根据本发明的实施例的各个方面,由于对于复杂的分组交换不需要固定的无线站之间的稳定和低移动性的链路,路由更新更容易开始。 According to aspects of an embodiment of the present invention, since a stable and low mobility complex links for packet switching is not required between a fixed radio station, routing updates easier to start. 比起ad hoc网络的DSDV有诸多改进,其中ad hoc网络具有过多的与周期或触发更新相关联的开销。 Compared DSDV ad hoc networks have a lot of improvements, including ad hoc network has too many cycles or triggered update and the associated costs.

以下是可以用于在分层网络中实现基于Viterbi的路由算法的伪码表示,其中分层网络例如通过图2的网格200表示的图1的网络。 The following can be used to implement in a hierarchical network routing algorithm based on the Viterbi pseudo-code representation, wherein the hierarchical network, such as a grid through FIG. 2 shows a network 200 of FIG. 1. 图2中的每个节点101-120表示收发器站(BS或MS)。 Figure 2 represents each node 101-120 transceiver stations (BS or MS). 对于图2示出的下行链路路由问题,根据一个实施例,路由算法以逆向的方式(例如,从节点110开始,返回到基站101)用分布式并且计算高效的方法来计算最小成本(或最佳)路径。 For downlink route 2 shown in FIG problem, according to one embodiment, the routing algorithm in reverse manner (e.g., node 110 begins to return to the base station 101) and distributed computationally efficient method to calculate the minimum cost (or optimal) path. 该算法可以使用以下的递归步骤:(i)在每个网格阶段,决定节点仅仅保留到目的地的最好(最低成本)"幸存"路径,并且忽略或排除节点和目的地之间的剩余可能路径的节点;以及(ii)决定节点基于幸存路径来更新它的成本度量。 The recursive algorithm can use the following steps: (i) at each lattice stage, to determine the nodes retain only the best (lowest cost) destination "surviving" path, and ignore or preclude the node and the destination of the remaining possible node path; and (ii) determine the survivor path node to update its cost-based measure.

可以使用以下伪码计算最小的成本路径(从MS 120开始): You can use the following pseudo code calculate the minimum cost path (starting with the MS 120):

1、 生成每个链路(图2中的分支箭头表示每个链路)的随机信道,并且根据上述方程式(2)计算分支成本度量。 1, is generated for each link (Figure 2 branches arrows represent each link) of random channel, and (2) calculate the cost of the branch metrics according to the above equation.

2、 使集合O(k)包括从节点k到MS的具有最低成本的节点的序列(称为节点k的最佳路由),并且度量4指示出基于O(k)所指定的路由来将数据从节点k发送到MS的总成本。 2, so that the set O (k) comprises a sequence of nodes with the lowest cost from node k to the MS (known as the best route node k), and measure 4 indicate the O (k) based on the specified routes data sent from node k to the total cost of MS.

3、 将MS的成本初始化为零;也就是dMs-O并且O)(MS)-[]二empty (空)。 3, the cost of MS initialized to zero; that is dMs-O and O) (MS) - [] two empty (empty).

4、 对于所有节点重复以下步骤:使Q(k)成为可以从节点kEK (K是网格上所有节点的集合)接收数据的节点的集合。 4. Repeat for all nodes in the steps of: Q (k) becomes a node can receive data from the node kEK (K is the set of all nodes on the grid) collection. 一旦Q(k)中的所有节点具有它们的最佳路由O(i)以及计算所得的成本度量di, ieQ(k),则将节点k Once all the nodes Q (k) of having their best route O (i) and the calculated cost metric di, ieQ (k), then the node k

的成本度量指派为& ='^S& +e"'},其中ck-i是用于从节点k到节点ie Q(k)的链路的分支度量。将O(k)指派为《>(k) = [k 0>(ibest)],其中 The cost metric assigned to & = '^ S & + e "'}, where ck-i is used for the branch metric from node k to node ie Q (k) of the link would be O (k) assigned as"> ( k) = [k 0> (ibest)], wherein

这样,从移动站120开始,根据本发明的实施例的路由算法可以根据所述步骤,顺序地计算每个节点的成本度量和最佳路由。 Thus, beginning from the mobile station 120, according to the step of calculating the cost of each node sequentially measure and the best route according to an embodiment of the routing algorithm of the present invention. 将在宏基站101 (也就是,上述伪码中的集合0> (宏—BS))产生最低成本的分支集合选择为最佳多跳路径并使用于向目的地120发送320分组。 The macro base station 101 (ie, the collection of pseudo-code above 0> (macro -BS)) to generate the set of the lowest-cost alternative branch for the best multi-hop path and is used to send a packet to a destination 320 120. 完成该算法后,单独的节点现在可以将目的地为移动站120的分组沿最佳路径自行路由。 Upon completion of the algorithm, the individual nodes can now packets destined for the mobile station 120 of their own along the best path routing. 可以使用在每个节点储存的路由表,在网络的节点之间发送分组。 You can use the routing table stored in each node in the network to send packets between nodes. 在一个实施例中,每个节点可以包括路由表,该路由表例如列出所有可用的目的地以及与每个目的地相关联的成本度量和下一跳。 In one embodiment, each node can include a routing table, such as the routing table lists all available destinations and related costs associated with each destination metric and next hop. 在一个示例性实现中,通过请求每个潜在的下一跳的成本度量,每个节点可以估计基于分层基础设施的可能下一跳节点的可用吞吐量。 In an exemplary implementation, by requesting potential cost metric for each hop, each node can be estimated based on a hierarchical infrastructure may be available next hop node throughput. 除对于在本身具有相邻节点的信道之上的通信所确定的成本度量,所提供的成本度量可以用于使用向目的地通信的迄今的最佳的下一跳和总成本度量,来更新节点的路由表。 In addition to the communication channel itself on the adjacent nodes having the determined cost metrics, cost metrics may be provided for communication to the destination using the best next hop to date and the total cost metrics to update the node routing table.

图4示出了算法的示例。 Figure 4 shows an example of an algorithm. 用三角形中指示的示例性的成本来标记节点之间的每个分支(链路),节点101-120 (源=101以及目的地=120)与它们的路由一起示出。 Exemplary cost with triangle marks indicate to each branch (link) between nodes, the nodes 101-120 (source and destination = 101 = 120) and their routing is shown together. 在这个简化的实例中可以看到,最佳多跳路径(也就是最低成本)是节点路径101 — 102—103—110—104—120,其总成本(如节点101的路由表所示)为九。 In this simplified example can be seen, the best multi-hop path (ie lowest cost) is a node path 101-- 102-103-110-104-120, the total cost (as shown in the routing table node 101) to IX. 因此,在源101和目的地120之间最短路径可以仅仅为四跳,最低成本和/或最可靠路径具有五跳(虚线箭头所指)。 Thus, between the source and destination 101 120 for the four shortest path can only jump, lowest cost and / or the most reliable path has five jump (dashed arrow). 在两个或更多的多跳路径具有相同的最低成本的情况下,该算法可以选择具有最少跳数的路径,或者,如果两个或更多路径具有相同跳数,该算法可以随机地选择最佳路径来使用。 In two or more cases of multi-hop path with the same lowest cost, the algorithm can choose the path with the least number of hops, or if two or more paths have the same number of hops, the algorithm can be randomly selected the best path to use.

在移动站120需要到尚未建立最佳路由的宏基站101的路由(也就是, 上行路由)的情况下,在一个实施例中,移动站120可以在网络中广播路由请求(RREQ)分组或类似的査询通信。 In the case where the mobile station 120 needs to route the best route has not been established (i.e., the upstream route) macro base station 101, in one embodiment, the mobile station 120 may broadcast a route request (RREQ) packets in the network, or the like The polling communication. 一旦接收到RREQ分组,宏基站101可以搜索它的位置控制器(LC),以便确定可以参与多跳通信的节点组, 其中LC可以包括每个移动站和/或宏基站的位置和邻居的信息。 Upon receiving the RREQ packet, the macro base station 101 may search its location controller (LC), in order to determine the group can participate in multi-hop communication in which each mobile station may include LC and / or location of the macro base station and neighbor information . 可以使用路由回答(RREP)消息或类似的广告发送这个信息。 You can use the route reply (RREP) message or similar ads send the message. 随着RREP传播回到移动站120,节点可以建立到它们的邻居节点的转发指针,并且创建分层基础设施网络的网格,该网格与下行链路情况中图2示出的网络类似。 With the spread RREP back to the mobile station 120, a node can establish their neighbor nodes forwarding pointer, and create a hierarchical infrastructure network grid, the mesh network shown in the downlink case similar to Figure 2.

一旦移动站120接收到RREP,它可以使用该信息来更新它的路由。 Once the mobile station 120 receives the RREP, it can use this information to update its routing. 例如,如果RREP公开了具有更多跳数或具有更小成本的相同跳数的路由路径,它可以对到宏基站101消息更新路由信息,并且幵始使用更新路由来进行传输。 For example, if the RREP discloses the same routing path with more hops or hop has a smaller cost, which the macro base station 101 may update the routing information message, and begin using the updated routing 幵 for transmission.

参考图5,用于在无线网络中使用的装置500可以包括处理电路550, 处理电路550包括如一个或多个上述处理所述的路由通信的逻辑(例如,电路、处理器和软件、或其中的组合)。 Referring to Figure 5, apparatus for use in a wireless network 500 may include a processing circuit 550, the processing circuit 550 comprises one or more of such logic (e.g., circuitry, processor and software for routing traffic according to the above-described processing, or wherein The combinations). 在某些实施例中,装置500可以一般地包括射频(RF)接口510以及基带和MAC处理器部件550。 In certain embodiments, apparatus 500 may generally include a radio frequency (RF) interface 510 and a baseband and MAC processor element 550.

在一个实例实施例中,RF接口510可以是适用于发送和接收调制信号(例如,OFDM)的组件或组件的组合,但是本发明的实施例不局限于任意的特殊调制方案。 In one example embodiment, RF interface 510 may be a combination adapted to send and receive modulated signals (e.g., OFDM) component or components, but the embodiment of the present invention is not limited to any particular modulation scheme. RF接口510可以包括,例如,接收器512、发射器514 和频率合成器516。 RF interface 510 may include, for example, a receiver 512, transmitter 514 and frequency synthesizer 516. 如果有需要,接口510还可以包括,偏压控制、晶体振荡器和/或一个或多个天线518、 519。 If necessary, the interface 510 may also include bias controls, a crystal oscillator and / or one or more antennas 518, 519. 此外,根据需要,RF接口510可以可替换地或额外地使用的外部电压控制振荡器(VCO)、表面声学波滤波器、 中频(IF)滤波器和/或射频(RF)滤波器。 Furthermore, according to need, RF interface 510 may alternatively or external voltage controlled oscillator (VCO) additionally used, the surface acoustic wave filters, intermediate frequency (IF) filters and / or radio frequency (RF) filter. 多个RF接口设计和它们的操作是本领域所知的,因此省略对于其配置的描述。 A plurality of RF interface designs and their operation are known in the art, and therefore its configuration is omitted for description.

在一些实施例中,接口510可以被配置为提供与一个或多个用于WPAN、 WLAN、 WMAN或WWAN的ffiEE标准兼容的OTA链路访问, 但是这些实施例并不局限于这个方面。 In some embodiments, interface 510 may be configured to provide one or more for WPAN, WLAN, WMAN or a WWAN ffiEE OTA link access standards-compliant, but these embodiments are not limited in this regard.

处理部件550可以与RF接口510通信/协作,以便处理接收/发送信号, 并且可以包括,例如,用于将接收的信号数字化的模拟到数字转换器552、 用于上变频信号以便载波传输的数字到模拟转换器554以及用于各自接收/ 发送信号的物理(PHY)层处理的基带处理器556。 Processing unit 550 may communicate with RF interface 510 / collaboration, in order to process receive / transmit signals, and may include, for example, for receiving digitized analog signals to digital converter 552, a digital converted signal for transmission to the carrier to-analog converter 554 and a physical (PHY) for respective reception / transmission signal processing of the baseband processor 556 layers. 处理部件550还可以包括或由用于MAC/数据链路层处理的处理电路559组成。 Processing unit 550 may also include or be used by the processing circuit 559 MAC / data link layer processing components.

在本发明的某些实施例中,网状路由管理器558可以包括在处理部件550中,并且如前所述,其可以进行运行以确定路由以及控制网状节点寻址。 In certain embodiments of the present invention, the mesh routing manager 558 may include a processing unit 550, and as described above, which can be run to determine the routing and control mesh node addressing. 可替换地或此外,PHY电路556或MAC处理器559可以共享这些功能中的某一些的处理,或者独立地执行这些处理。 Alternatively or in addition, PHY MAC processor circuit 556 or 559 can share some of these features in the process, or independently perform these processes. 如果有需要,MAC和PHY 处理还可以集成在单个电路中。 If necessary, MAC, and PHY processing may also be integrated in a single circuit.

装置500可以是,例如,移动站、无线基站或AP、混合协调器(HC)、 无线路由器和/或用于电子设备的网络适配器。 Device 500 may be, for example, a mobile station, a radio base station or AP, hybrid coordinator (HC), a wireless router and / or network adapter for electronic devices. 因此,根据适当的要求,可以包括或省略装置500的之前所述的功能和/或具体配置。 Thus, according to the requirements of the appropriate, may include or omit the device 500 prior to the functions and / or specific configurations.

可以使用单输入单输出(SISO)结构实现装置500的实施例。 You can use a single-input single-output (SISO) architecture implementing an embodiment of the device 500. 然而, 如图5所示,某些实现可以使用具有多个发送和/或接收天线(例如,518、 519)的多输入多输出(MMO)、多输入单输出(MISO)或单输入多输出(SIMO)结构。 However, as shown in Figure 5, some implementations may be used with a plurality of transmitting and / or receiving antennas (for example, 518, 519) of the multiple-input multiple-output (MMO), multiple-input single-output (MISO) or single-input multiple-output (SIMO) configuration. 此外,本发明的实施例可以利用OTA链路访问的多载波码分复用(MC-CDMA)多载波直接顺序码分复用(MC-DS-CDMA),或与本发明的实施例的特点兼容的现有的或将来出现的调制或复用方案。 In addition, embodiments of the present invention may utilize OTA link access multi-carrier code division multiplexing (MC-CDMA) multi-carrier direct sequence code division multiplexing (MC-DS-CDMA), or the embodiment of the present invention is characterized by compatible with existing or future modulation or multiplexing schemes arise.

可以使用离散电路、专用集成电路(ASIC)、逻辑门和/或单个芯片结构的任意组合实现装置500的组件和特征。 Can use discrete circuits, application specific integrated circuit (ASIC), any combination of logic gates and / or single chip to achieve structural components and features of apparatus 500. 此外,可以使用微控制器、可编程逻辑阵列和/或微处理器或前述的任意的适当组合(统称或单独称为"逻辑")实现装置500的特征。 In addition, you can use a microcontroller, programmable logic arrays and / or any suitable combination of microprocessors or the foregoing (collectively or individually referred to as "logic") to achieve 500 features.

应该理解示例性装置500仅仅表示很多可能的实现的一个功能性描述的实例。 It should be understood merely exemplary apparatus 500 shows an example of many possible implementations of a functional description. 因此,附图中描述的块功能的分割、省略或包括并不意味着必须将用于实现这些功能的硬件组件、电路、软件和/或部件分割,省略、或包括在本发明的实施例中。 Therefore, the block functions depicted in the drawings segmentation, omission does not mean or include hardware components must be used to implement these functions, circuits, software, and / or components division, omitted or included in embodiments of the present invention, .

除非违反物理的可能性,发明人认为这里描述的方法:(i)可以以任意的顺序和/或以任意的组合执行;以及(ii)可以以任意方式组合各自实施例的组件。 Unless the possibility of physical violation, the inventors believe that the methods described herein: (i) can be in any order and / or performed in an arbitrary combination; and (ii) can be combined in any way for the respective components of example. 尽管已经描述了这个新发明的示例性实施例,可以在不超出本发明的范围的前提下进行多种变化和修改。 Although it has been described an exemplary embodiment of this new invention, various changes and modifications can be made without departing from the scope of the present invention premise. 因此本发明的实施例并不局限于上述的具体公开,而是由所附的权利要求和它们的合法等价物的范围所定义的。 Therefore, this embodiment of the invention is not limited to the specific disclosure, but by the appended claims and their legal equivalents scope defined.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
CN102056180B27 Oct 200918 Dec 2013华为技术有限公司Method and system for acquiring deployment scheme of wireless local area network (WLAN) access point (AP)
CN103648105B *27 Oct 20091 Feb 2017华为技术有限公司一种无线局域网接入点部署方案的获得方法及系统
US870540528 Dec 201122 Apr 2014Huawei Technologies Co., Ltd.Method and system for obtaining a deployment scheme of wireless local area network access points
WO2011050721A1 *27 Oct 20105 May 2011Huawei Technologies Co., Ltd.Method and system for obtaining wireless local area network access point deployment plan
Classifications
International ClassificationH04L12/56
Cooperative ClassificationH04W40/12, H04L45/12, H04L45/125
European ClassificationH04W40/12, H04L45/12, H04L45/125
Legal Events
DateCodeEventDescription
19 Nov 2008C06Publication
14 Jan 2009C10Request of examination as to substance
7 Dec 2011C02Deemed withdrawal of patent application after publication (patent law 2001)