EP2502361A1 - Verfahren zur zuordnung von zeitschlitzen zu links zwischen netzknoten eines drahtlosen vermaschten netzes - Google Patents
Verfahren zur zuordnung von zeitschlitzen zu links zwischen netzknoten eines drahtlosen vermaschten netzesInfo
- Publication number
- EP2502361A1 EP2502361A1 EP11701380A EP11701380A EP2502361A1 EP 2502361 A1 EP2502361 A1 EP 2502361A1 EP 11701380 A EP11701380 A EP 11701380A EP 11701380 A EP11701380 A EP 11701380A EP 2502361 A1 EP2502361 A1 EP 2502361A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- network
- alternative
- node
- links
- network nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/24—Radio transmission systems, i.e. using radiation field for communication between two or more posts
- H04B7/26—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
- H04B7/2643—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile using time-division multiple access [TDMA]
- H04B7/2656—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile using time-division multiple access [TDMA] for structure of frame, burst
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Definitions
- the invention relates to a method for the assignment of
- the invention relates to a
- Network management unit and a wireless mesh network.
- Wireless mesh networks are based on the principle that data is communicated from one network node to another via a plurality of interconnected network nodes having wireless communication functionality via so-called hops (ie, communications via other nodes) .
- the networks are constructed in such a way that there are several other network nodes within reach of a network node to which data can be sent.
- scheduling methods are used, with which corresponding links between two network nodes are assigned time slots in which the link can be used to transmit data.
- the data transfer takes place usually over several transmission frequencies, in
- channels Also referred to as channels below, with multiple links having different start and end nodes in a timeslot on different channels for disjoint links
- Time slots are assigned for data transmission over as far as possible all channels used for data transmission away times. It is disadvantageous that the individual network nodes often for listening or sending in the appropriate Time slots are activated. If the wireless mesh network, for example, a sensor network with battery-powered sensors, this results in a shortened operating time of the sensors, because listening to the channels leads to high energy consumption, so that at short intervals, the batteries of the sensors must be replaced.
- the object of the invention is therefore the assignment of
- Time slots to form links between network nodes of a wireless mesh network such that in the context of data transmission, an energy efficient operation of
- time slots are allocated to links between network nodes of a wireless mesh network of a plurality of wirelessly communicating network nodes, wherein data and in particular data packets in the network are time-slot-based by means of the assignment to
- Network node exists over which data from the source node to the destination node can be forwarded. In this way, it is appropriate to determine how many nodes in a header plane between a source node and destination node
- a main path is formed, each having one network node per hopplane and the corresponding links between the network nodes of neighboring (i.e., directly consecutive) hop planes of the one
- a link is thus a directed transmission path between a hop plane to the next hop plane in the order of the hop planes. Furthermore, in a step b) for the Hopebenen between
- Source nodes and destination nodes each have a number of
- a step c) the time slots are assigned to the links of the main path and the alternative links in such a way that one of a respective one of them
- This first criterion relates to network nodes of the main path.
- incoming links in a respective network node receive time slots earlier than links extending from the respective network node.
- Main path can be set appropriately alternative paths.
- preference is given to a preference of the main path.
- the second criterion that the data is sequentially connected between the source node and the destination node via the corresponding hop planes
- a reliable data transmission can be achieved.
- the number of transmission possibilities is limited via corresponding links via the scheduling defined according to the invention, so that the number of time slots not used for transmission decreases and as a result a significantly more energy-efficient data transmission with comparable reliability to known methods is made possible.
- step c) The time slot assignment defined in step c) according to the invention is implemented in a preferred embodiment based on the following rule:
- each one is obtained from the respective network node alternative Link a temporally later time slot than the extending from the respective network node link of the main path;
- the alternative link entering the respective alternative network node receives a time slot earlier than the alternative link extending from the respective alternative network node.
- a high reliability of the data transmission can be achieved in particular based on a criterion, according to which the main path or its links the lowest possible data error rate and / or the highest possible reliability / link stability during data transmission and / or the best possible energy efficiency of the
- the alternative network nodes are preferably selected such that their alternative links have the lowest possible data error rate and / or one
- the number of alternative network nodes used in the process may vary. If a particularly energy-efficient operation of the network is in the foreground, then in a preferred variant, a single alternative network node is defined for at least one and in particular all hops planes. Is a high
- Reliability of data transmission in the foreground it can be set in a further variant for at least one and in particular all Hopebenen several alternative network nodes.
- the alternative for a particular Hopebene the alternative for a particular Hopebene
- At least one additional link between alternative network nodes of the neighboring hop planes is defined for at least one pair of adjacent hop planes, with an alternative link extending from an alternative network node being earlier in time
- time slots with variable length can be assigned to the respective links.
- time slots with variable length can be assigned to the respective links.
- Timeslot length be given, wherein extending a time slot of several slots with this fixed
- Time slot length can be sequentially assigned to the same link.
- the method is characterized by an energy-efficient operation of the network. Accordingly, the method is preferably carried out in a meshed network in the form of a wireless sensor network in which the Nodes at least partially sensors with autarkic
- Sensor networks are used in which the sensors are not subject to energy limitations.
- the invention further comprises a resulting method for timeslot-based
- time slots are allocated to links between a source node and a destination node according to the inventive method described above, data being transmitted on one or more channels based on this association between the source node and the destination node.
- the method according to the invention can be combined with data transfer methods known per se, such as e.g. with the standard known from the prior art WirelessHART or IEEE 805.15.4e or ISA 100.11a. In this case, only the assignment of the time slots to network nodes, e.g. be realized in a network management unit.
- the invention further relates to a network management unit for a wireless mesh network of a plurality of network nodes communicating with each other wirelessly, wherein the network management unit is arranged to allocate time slots to links between network nodes based on the above-described association method according to the invention.
- the invention also relates to a
- wireless mesh network of a plurality of wirelessly communicating network nodes with such a network management unit.
- Network management units are designed in such a way that they have data based on the one described above
- Fig. 1 to Fig. 3 are schematic representations which the
- Fig. 5 is a diagram showing the assignment of
- Embodiments of the inventive method for a multi-hop mesh network are described below, in which data packets are zeitzlitz-based with a suitable standard, such as e.g. WirelessHART, to be transmitted.
- a suitable standard such as e.g. WirelessHART
- inventive method is doing a novel
- the method is suitable in particular for use in sensor networks, in which at least part of the network nodes are sensors, which usually have a self-sufficient
- Power supply eg battery
- data is not continuously transmitted from a source node to a destination node, but there are often longer transmission pauses, until a corresponding sensor again has determined new sensor data, which he others
- Fig. 4 shows an example of a section of a multi-hop mesh network. From this network a total of 24 network nodes 1, 2, 3, 24 are shown. Further, dashed lines indicate possible links in the form of direct communication paths between network nodes in
- a so-called main path for data transmission from a source node to a destination node is defined.
- a main path is denoted by reference MP and indicated by corresponding arrows. It can be seen that the main path, starting from the node 9, extends horizontally via the nodes 10, 11, 15 to the
- the main path may vary depending on Use case can be determined suitably.
- the path is chosen such that the packet error rate on the main path is small compared to other paths.
- corresponding alternative paths with alternative links via further network nodes are defined in order to ensure data transmission via other links in the event of packet loss on the main path.
- a corresponding scheduling method is defined, which is designed such that the transmission along the main path is preferred over other transmission paths, and which further comprises a sequential multi-hop transmission from the source node to
- Fig. 1 to Fig. 3 show different variants of
- Network nodes 1, 2, 10 of a wireless mesh network are Network nodes 1, 2, 10 of a wireless mesh network.
- FIGS. 1 to 3 show a detail of a multi-hop network with correspondingly usable links. It is again a main path for data transmission
- Links LI, L2, L3 and L4 includes. Generally, the
- alternative network nodes are now defined with incoming and outgoing alternative links for the individual hop levels lying between source nodes and destination nodes, which in FIG. 1 to FIG. 3 have h-2, h-1, h, h + 1 and h + 2 are designated.
- a number of alternative 2-hop paths (l ia , l ak ) are calculated for each 2-hop path. Segment l jj , l jk ) on the main path using a
- An adjacent network node is a network node defined for the 2-hop segment or the middle level of this segment, via which data packets can also be routed as part of the multi-hop transmission.
- the number of adjacent network nodes can be described mathematically as follows:
- N neigh ⁇ a: 3ae N t and a & N k and a £ N main ⁇ .
- N k denotes network nodes which belong to the network node of the hopplane k of the
- Main paths are adjacent. The number of adjacent ones
- Node in the main path in the header plane i thus has
- FIG. 3 shows a further modification of the method of FIG. 1, in which data transmissions are also permitted directly between alternative network nodes.
- the additional links L15 and L16 are provided for this purpose, with which data packets between the network nodes 7 and 8 or the
- Network nodes 8 and 9 can be transmitted.
- the method of Fig. 3 may also be combined with the method of Fig. 2, i. There may be more than one alternative network node for each header level
- a path is set for the main path which results in a minimum end-to-end packet error rate and thus the highest reliability, while maintaining low
- a node on the main path in the hop level h has to have a temporally earlier time slot for each alternative link in the hop level h-1 entering the node than that from the node to the hop level h + 1
- a node on the main path in the hop plane h must have a time slot that is later than the time from the node to the hop plane h + 1 for each alternative link extending from the node to the hop level h + 1
- An alternative network node in the hop level h has to assign to each link from the hop level h-1 arriving in the alternative network node a timeslot earlier than the alternative link extending from the alternative network node to the hop level h + 1.
- the alternative network nodes are suitably sorted, for example based on a list. In this case, the order of the nodes in N neih the order set in the alternative paths
- the network node on the main path in the level h must sort timeslots for alternative links extending from that node in the same order. That is, the first choice of alternative network nodes determined according to the order must be taken into account in the allocation of time slots before the second choice of alternative network nodes, and so forth.
- Hope level h + 1 obtains a timeslot earlier than any additional link to an alternative network node of level h + 1.
- Timeslots to links will be continuously after
- the allocation of time slots is usually for a plurality of wireless ones
- time slots for corresponding links have variable lengths. This is achieved by assigning a plurality of predetermined time slots of predetermined length one behind the other to the corresponding link for data transmission with a longer time slot.
- Fig. 5 is a diagram along the abscissa
- Time slots SO, Sl, S16 and along the ordinate the corresponding usable channels CO, Cl, C9 are indicated. It was the indicated in Fig. 4
- Destination node 16 considered.
- a variant of the method was implemented in which two alternative network nodes per Hopebene have been considered for data transmission in addition to the network node of the main path MP. That is, for the Hopebene with the network node 10 were the other, in Fig. 4
- Network node 11 the two alternative network nodes 3 and 19 with the corresponding alternative links, etc.
- Target node of the link indicated by an arrow in between For example, for the time slot S2, data transmissions in the three channels CO, C1 and C2
- the invention described above has a number of advantages. Based on the definition of alternative paths from a main path, path generation with low complexity and high reliability is achieved. The allocation of time slots is energy efficient, because of the number of unused ones
- Time slots are greatly reduced. This is particularly advantageous in sensor networks with battery-operated sensors, since in such networks data packets are not transmitted continuously and energy-efficient operation of the sensors has high priority. According to the invention focuses the
- Data transmission particularly reliable network nodes for the main path can be specified.
- the main traffic is transmitted along the main path, and the alternative network nodes are then used if nodes of the main path fail or are unreachable.
- the alternative network nodes are then used if nodes of the main path fail or are unreachable.
- network nodes are used with energy restrictions as alternative network nodes.
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP11701380A EP2502361A1 (de) | 2010-01-22 | 2011-01-19 | Verfahren zur zuordnung von zeitschlitzen zu links zwischen netzknoten eines drahtlosen vermaschten netzes |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP10000625 | 2010-01-22 | ||
PCT/EP2011/050644 WO2011089135A1 (de) | 2010-01-22 | 2011-01-19 | Verfahren zur zuordnung von zeitschlitzen zu links zwischen netzknoten eines drahtlosen vermaschten netzes |
EP11701380A EP2502361A1 (de) | 2010-01-22 | 2011-01-19 | Verfahren zur zuordnung von zeitschlitzen zu links zwischen netzknoten eines drahtlosen vermaschten netzes |
Publications (1)
Publication Number | Publication Date |
---|---|
EP2502361A1 true EP2502361A1 (de) | 2012-09-26 |
Family
ID=43607968
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP11701380A Withdrawn EP2502361A1 (de) | 2010-01-22 | 2011-01-19 | Verfahren zur zuordnung von zeitschlitzen zu links zwischen netzknoten eines drahtlosen vermaschten netzes |
Country Status (4)
Country | Link |
---|---|
US (1) | US20120320812A1 (de) |
EP (1) | EP2502361A1 (de) |
CN (1) | CN102742180A (de) |
WO (1) | WO2011089135A1 (de) |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102781007B (zh) * | 2012-03-30 | 2015-12-09 | 苏州科技学院 | 一种多跳多信道工业无线通信链路重传优化方法 |
JP5895871B2 (ja) | 2013-02-22 | 2016-03-30 | 横河電機株式会社 | 管理装置、管理方法、及び無線通信システム |
CA2846146A1 (en) * | 2013-03-14 | 2014-08-14 | Angelo Marino Tuzi | Asynchronous ubiquitous protocol |
US9456444B2 (en) | 2013-07-17 | 2016-09-27 | Cisco Technology, Inc. | OAM and time slot control in a deterministic ARC chain topology network |
DE102015106205A1 (de) * | 2015-04-22 | 2016-10-27 | Wiesemann & Theis Gmbh | Verfahren zur Vergabe von Timeslots |
JP6538849B2 (ja) | 2015-09-02 | 2019-07-03 | 株式会社東芝 | 時間スロットチャネルホッピング(tsch)macのためのスケジューリングアルゴリズムおよび方法 |
CN110267220B (zh) * | 2019-04-30 | 2021-11-02 | 泉州维盾电气有限公司 | 一种单主机无线设备串联组网数据通信的系统及方法 |
CN113316173B (zh) * | 2021-05-26 | 2022-11-11 | 北京小米移动软件有限公司 | 联网设备确定方法、装置、设备及存储介质 |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2002028023A2 (en) * | 2000-09-27 | 2002-04-04 | Hrl Laboratories, Llc | Method and apparatus for providing directed communications through a networked array of nodes |
ITMI20022170A1 (it) * | 2002-10-14 | 2004-04-15 | Marconi Comm Spa | Sistema di telecomunicazioni |
US20070133592A1 (en) * | 2005-12-13 | 2007-06-14 | Heyun Zheng | Method for tree-based spatial time division multiple access (TDMA) scheduling in a multi-hop wireless |
US8040857B2 (en) * | 2006-12-07 | 2011-10-18 | Misonimo Chi Acquisitions L.L.C. | System and method for timeslot and channel allocation |
US8275313B1 (en) * | 2007-01-15 | 2012-09-25 | Advanced Distributed Sensor Systems | Long range, low power, mesh networking without concurrent timing |
US8406248B2 (en) * | 2007-04-13 | 2013-03-26 | Hart Communication Foundation | Priority-based scheduling and routing in a wireless network |
US8351369B2 (en) * | 2007-12-12 | 2013-01-08 | Synapsense Corporation | Apparatus and method for adaptive data packet scheduling in mesh networks |
CN101415248B (zh) * | 2008-11-21 | 2010-07-21 | 中山大学 | 基于负载均衡的跨层动态源路由协议的建立方法 |
-
2011
- 2011-01-19 EP EP11701380A patent/EP2502361A1/de not_active Withdrawn
- 2011-01-19 WO PCT/EP2011/050644 patent/WO2011089135A1/de active Application Filing
- 2011-01-19 CN CN2011800069088A patent/CN102742180A/zh active Pending
- 2011-01-19 US US13/574,597 patent/US20120320812A1/en not_active Abandoned
Non-Patent Citations (1)
Title |
---|
See references of WO2011089135A1 * |
Also Published As
Publication number | Publication date |
---|---|
WO2011089135A1 (de) | 2011-07-28 |
CN102742180A (zh) | 2012-10-17 |
US20120320812A1 (en) | 2012-12-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP2502361A1 (de) | Verfahren zur zuordnung von zeitschlitzen zu links zwischen netzknoten eines drahtlosen vermaschten netzes | |
EP1815650B1 (de) | Verfahren zur synchronisation und datenuebertragung | |
DE69633574T2 (de) | Architektur für mobile funknetze mit dynamischer topologieanpassung mit hilfe von virtualen unternetzen | |
DE2702023C2 (de) | Funkkanal-Zuteilungsvorrichtung | |
WO2011089136A1 (de) | Verfahren zur zuordnung von zeitschlitzen zu links zwischen netzknoten eines drahtlosen vermaschten netzes | |
EP3323257B1 (de) | Aufbau und aufrechterhaltung eines netzwerkes | |
DE60132006T2 (de) | Ablaufplanung von transfers in einem kommunikationsnetz | |
DE102009043403B4 (de) | Verfahren zum Aufbau eines bidirektionalen Kommunikationspfads in einem drahtlosen Netzwerk | |
DE102009003724A1 (de) | Verfahren zur Optimierung von Netzwerkstrukturen in Funknetzwerken | |
WO2021160746A1 (de) | Lorawan-gateway-netzwerk und verfahren | |
EP2119124B1 (de) | Verfahren zum betrieb einer netzwerkkomponente in einem automatisierungssystem, automatisierungssystem mit einer nach dem verfahren betriebbaren netzwerkkomponente, verfahren zur datenübermittlung in einem automatisierungssystem mit kommunikationsteilnehmern von denen zumindest einzelne nach dem verfahren zum betrieb einer netzwerkkomponente als netzwerkkomponente betrieben sind sowie korrespondierendes computerprogramm und computerprogrammprodukt | |
EP1999899A1 (de) | Verfahren zur ermittlung eines pfaddistanzwertes | |
DE60211488T2 (de) | System und verfahren zur sendeplanung unter verwendung von netzwerkmitgliederschaftsinformationen und umgebungsinformationen | |
DE19536379C2 (de) | Verfahren für die völlig dezentrale Verbindungssteuerung in kanal- oder paketvermittelnden Mobilfunknetzen, insbesondere ATM basierter Zugangsnetze | |
EP1961169B1 (de) | Verfahren zum betreiben eines funknetzwerks sowie teilnehmergerät für ein derartiges netzwerk | |
WO2013182332A1 (de) | Verfahren und system zur zeitsynchronisierung in einem ad-hoc-netzwerk | |
EP3525476B1 (de) | Verfahren zur topologiebestimmung in einer mobilfunk-site und eine entsprechende mobilfunk-site | |
EP2497321A1 (de) | Verfahren zur zuordnung von zeitschlitzen zu einem übertragungspfad in einem drahtlosen vermaschten netz | |
DE19716433A1 (de) | Verfahren zum Aufbau einer Funkkette innerhalb eines Funknetzes | |
EP2566104B1 (de) | Verfahren und Gerät zur Übertragung von Daten in einem hierarchisch gegliederten Funknetzwerk | |
DE112004000797T5 (de) | Nicht interferierende gruppenbasierte Protokolle drahtloser Netzwerke | |
EP2334138A1 (de) | Drahtloses Kommunikationsnetz über eine definierte Gruppe von Teilnehmern | |
DE102010033928A1 (de) | Verfahren zur Zeitschlitz-basierten Übertragung von Datenpaketen in einem drahtlosen vermaschten Netz | |
DE10354943B4 (de) | Verfahren zum Betrieb einer Kommunikationsstrecke zwischen zumindest zwei Kommunikatonsendgeräten | |
DE102007055195A1 (de) | Verfahren zum Betrieb und zum Aufbau eines Funknetzwerks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20120619 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: HEINRICH, ANDREAS |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SIEMENS AKTIENGESELLSCHAFT |
|
DAX | Request for extension of the european patent (deleted) | ||
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04W 72/12 20090101ALN20140122BHEP Ipc: H04W 84/18 20090101ALN20140122BHEP Ipc: H04W 72/04 20090101ALN20140122BHEP Ipc: H04L 12/707 20130101ALI20140122BHEP Ipc: H04B 7/26 20060101AFI20140122BHEP Ipc: H04W 40/00 20090101ALN20140122BHEP |
|
INTG | Intention to grant announced |
Effective date: 20140226 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20140709 |