(19)
(11) EP 3 267 729 B9

(12) CORRECTED EUROPEAN PATENT SPECIFICATION
Note: Bibliography reflects the latest situation

(15) Correction information:
Corrected version no 1 (W1 B1)
Corrections, see
Claims EN

(48) Corrigendum issued on:
14.10.2020 Bulletin 2020/42

(45) Mention of the grant of the patent:
29.04.2020 Bulletin 2020/18

(21) Application number: 17179758.2

(22) Date of filing: 05.07.2017
(51) International Patent Classification (IPC): 
H04L 12/751(2013.01)
H04W 40/24(2009.01)
H04W 84/18(2009.01)
H04W 40/26(2009.01)
H04L 12/707(2013.01)
H04W 40/22(2009.01)
H04L 12/721(2013.01)

(54)

HYBRID FLOOD-RELAYING AND ROUTING MESH NETWORKS

HYBRIDE FLUTVERMITTELNDE UND -LEITENDE MESH-NETZWERKE

FLOOD-RELAYING HYBRIDE POUR ROUTAGE DANS DES RÉSEAUX MAILLÉS


(84) Designated Contracting States:
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

(30) Priority: 05.07.2016 US 201662358194 P
01.11.2016 US 201662415544 P

(43) Date of publication of application:
10.01.2018 Bulletin 2018/02

(73) Proprietor: MediaTek Inc.
Hsin-Chu 300, Taiwan (TW)

(72) Inventors:
  • Ko, Li-Chun
    106 Taipei City (TW)
  • Huang, Rongsheng
    Fremont, CA 94539 (US)

(74) Representative: Dilg, Haeusler, Schindelmann Patentanwaltsgesellschaft mbH 
Leonrodstraße 58
80636 München
80636 München (DE)


(56) References cited: : 
US-A1- 2013 250 754
   
  • XIE HUAWEI & USTC Y SUN INSTITUTE OF COMPUTING TECHNOLOGY G WANG HUAWEI (USA) H WU H: "Scalable Hybrid Routing for Information-Centric Networks; draft-xie-icnrg-hybrid-routing-00.txt", SCALABLE HYBRID ROUTING FOR INFORMATION-CENTRIC NETWORKS; DRAFT-XIE-ICNRG-HYBRID-ROUTING-00.TXT, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GENEVA, SWITZERLAND, 18 February 2013 (2013-02-18), pages 1-16, XP015090220, [retrieved on 2013-02-18]
   
Note: Within nine months from the publication of the mention of the grant of the European patent, any person may give notice to the European Patent Office of opposition to the European patent granted. Notice of opposition shall be filed in a written reasoned statement. It shall not be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention).


Description

TECHNICAL FIELD



[0001] The present disclosure relates generally to the field of network communication, more specifically, to the field of packet forwarding mechanisms in mesh network communication.

BACKGROUND OF THE INVENTION



[0002] A mesh network typically includes a plurality of nodes that communicate with each other for data propagation. A mesh network can propagate messages by using either a flooding approach or a routing approach. In the routing propagation approach, a message (e.g., a packet) traverses along a specific path by hopping from a relay node to another until it reaches the destination node. In the flooding propagation approach, instead of a specific route, the message is sent to all the linked nodes in the mesh network, including the unintended nodes.

[0003] Generally speaking, flooding propagation is less efficient in terms of power and bandwidth usage than routing propagation, mainly because multiple nodes within a reception range retransmit the message approximately at the same time. The resultant collisions inevitably increase energy consumption and network overhead to unreasonable levels. Also, because relay nodes incur a lot of unnecessary packet transmission in flooding propagation, a flooding-based mesh network is usually difficult to scale up. Compared to flooding propagation, routing propagation is advantageous due to lower overhead traffic and better scalability.

[0004] On the other hand, flooding propagation offers greater simplicity in terms of implementation of communication logic in the network nodes since no sophisticated routing techniques are involved. Moreover, in flooding, signals usually arrive at a node through several propagation paths, and therefore one or several blocked paths are usually of no consequence, which ensures high reachability and reliability.

[0005] Some network devices acting as a relay node in a mesh network may only have the capability to forward packets by flood-relaying (which may be referred to as a "normal relay node" herein), where each packet received by such a node is sent to all coupled links except the one that the packet arrived on. In contrast, some other network devices acting as a relay node have enhanced configurations enabling it to forward packets by routing-relaying (which may be referred to as a "high end relay node" herein), in which a packet is transmitted to a next node along a specific or prescribed route. Typically, such a high end relay node can also perform flood-relaying.

[0006] Normal relay nodes are easy to implement due to the low computation and memory requirements of flood-relaying. High end relay nodes feature increased development and manufacturing costs due to increased memory capacity, computing power, and design complexity. For example, a high end node may integrate logic for network management, self-discovery, self-repair, routing tables and/or routing information management and communication, which are not included in the normal relay nodes with no routing-relaying capability.

[0007] Fig. 1 illustrates a mesh network system 100 in which packet propagation is exclusively based on flooding in accordance with the prior art. As illustrated in a simplified form, the network 100 is composed of edge nodes A, K, L, H and J and normal relay nodes B, C, E, D and G. Each edge node is capable of originating packets but typically not capable of forwarding packets; and each normal relay node is capable of forwarding packets to other nodes by flood-relaying.

[0008] For instance, edge node A generates a packet and specifies edge node J as the destination node. The flooding-based propagation of the packet is depicted by the arrows. More specifically, edge node A transmits the packet to each of the relay nodes B, C, D and E that are directly linked to A, and each of B, C, D and E forwards the packet to all of its directly-linked nodes except A, and so on. Particularly, B transmits the packet to K and L; C transmits the packets to L, E, and D; and E transmits the packet to C, D and H. Eventually, the packet is delivered to the destination node J through G. As demonstrated, although K, L and H, as well as several relay nodes linked to them, are unintended recipients, the packet is still delivered to them, resulting in significant bandwidth and power inefficiency.

[0009] Fig. 2 illustrates a mesh network system 200 allowing both flooding-based and routing-based packet propagation in accordance with the prior art. As illustrated, the network 200 is composed of edge nodes A, K, L, H and J, normal relay nodes B and E, and high end relay nodes C, D and G.

[0010] When edge node A generates a packet directed to the destination node J, it is specified in the packet header whether the packet is to be propagated to J by flooding or by routing, for example by using a routing protocol (RP) flag. If the RP flag indicates flooding propagation, all the relay nodes participate the propagation and forward the packet by flood-relaying, including the normal and the high end ones. On the other hand, if the RP flag indicates routing propagation, only the high end relay nodes participate the propagation and accordingly forward the packet by routing-relaying. A normal relay node receiving the packet may discard it due to lack of routing-relay capability.

[0011] Thus, according to the prior art, once the RP indication is set by the edge node, the corresponding propagation approach is used through the entire packet propagation process. High end relay nodes in the mesh network act as routing relays only if the edge node selects routing propagation for a packet. This limitation causes inefficient use of the enhanced capacities and benefits offered by high end relay nodes and routing propagation in the mesh network. In addition, this requires the edge node have routing capability which may not always be true in a real life. The article entitled "Scalable Hybrid Routing for Information-Centric Networks," Xie Huawei and USTC Y Sun Institute of Computing Technology G Wang Huawei (USA) H Wu H (XP015090220) discloses a hybrid reactive routing approach in which an information-centric network design is augmented with an infrastructure information base to obtain the benefit of both name-based and infrastructure-based routing.

SUMMARY OF THE INVENTION



[0012] Accordingly, a method and a wireless communication device operable as relay node as claimed in the independent claims are disclosed herein, which are directed to a communication protocol allowing expanded use of routing propagation in a mesh network with a hybrid capability of flooding propagation and routing propagation, thereby improving the balance between cost and performance efficiency.

[0013] Embodiments of the present disclosure include relay nodes operable to convert a packet to a routing-propagation packet, despite an original flooding-propagation indication specified by the edge node. More specifically, a mesh network is composed of: edge nodes that can originate packets; relay nodes that support using flood-relaying to forward packets but do not support routing-relaying (the so-called "normal relay nodes"); and high end relay nodes that support both flood-relaying and routing-relay. An edge node originating a packet may or may not have routing-capability. If it has routing capability and determines that there is a valid route from the source node to the destination node, the edge node may set a routing protocol (RP) indication to indicate routing-propagation; otherwise, the RP indication is set to indicate flooding-propagation.

[0014] When a high end relay node receives a packet with a routing protocol (RP) indication indicating flooding-propagation or propagation mode unspecified, it determines whether there is an existent valid route from the source node (e.g., the edge node) toward the destination node. If yes, the high end relay node modifies the RP indication to indicate routing-propagation and forwards the packet through routing-relay. If the high end relay node determines that there is no existent valid route, it forwards the instant packet by flood-relaying and may initiate a route discovery process to discover a route to be used for subsequent packet routing-relaying. If a normal relay node receives a packet with the RP indication indicating routing-relay, it discards the packet without forwarding.

[0015] In some embodiments, a high end relay node designated to convert a flooding-propagation packet or a propagation mode-unspecified packet to a routing-propagation packet is directly linked to the edge node that originates the packet, e.g., a first forwarding relay node. In some embodiments, a high end relay node is configured to perform such conversion and/or initiate route discovery only for packets originated from a friend edge node. Further, in route discovery, the high end relay node may act as a proxy of the source node to discover a route between the source node to the destination node. Thus in some embodiments, when the high end relay node receives the packet, the indication may indicate 3 possible scenarios: flooding propagation, routing propagation and propagation mode unspecified. After the relay node processes the packet, the indication may indicate 2 possible scenarios: flooding propagation and routing propagation.

[0016] By using a high end relay node to autonomously determine routing-propagation viability of a packet and accordingly convert a flooding-propagation packet or a propagation mode-unspecified packet to a routing-propagation packet, the chances of using routing-relaying in a mesh network is advantageously and substantially expanded. As a result, the balance between cost and efficiency can be optimized, given that routing-relaying provided by high end relay nodes offers lower power consumption and network overhead. In addition, using a relay node to perform routing propagation related processes exempts the necessity of using an edge node for such processes, like route discovery and routing information maintenance. Therefore, even with an edge node lacking routing capability, the mesh network can still effectively take the benefit of routing propagation provided by the high end relay nodes.

[0017] According to one embodiment of the present disclosure, a method of forwarding a packet by a relay node in a mesh network includes receiving the packet at the relay node, the packet identifying an edge node that generates the packet and a destination node. The packet includes an indication for flooding-propagation or propagation mode unspecified. Responsive to a determination that a valid route toward the destination node exists, the relay node modifies the indication in the packet to indicate routing propagating. The relay node then forwards the packet to a next node by routing-relaying and according to the valid route.

BRIEF DESCRIPTION OF THE DRAWINGS



[0018] Embodiments of the present invention will be better understood from a reading of the following detailed description, taken in conjunction with the accompanying figures, in which like reference characters designate like elements.

Fig. 1 illustrates a mesh network system in which packet propagation is exclusively based on flooding in accordance with the prior art.

Fig. 2 illustrates a mesh network system allowing both flooding-based and routing-based packet propagation in accordance with the prior art.

Fig. 3 is a flow chart depicting an exemplary process of a high end relay node selecting a packet propagation mode in a mesh network system in accordance with an embodiment of the present disclosure.

Fig. 4 illustrates exemplary processes of forwarding a packet by a normal relay node and a high end relay node in accordance with an embodiment of the present disclosure.

Fig. 5 is a flow chart depicting an exemplary process of a high end relay node processing and forwarding a packet in accordance with an embodiment of the present disclosure.

Fig. 6 is a block diagram illustrating an exemplary configuration of a wireless communication device that can be used as a high end relay node and autonomously select a packet propagation mode in a mesh network system in accordance with an embodiment of the present disclosure.


DETAILED DESCRIPTION



[0019] Reference will now be made in detail to the preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings. While the invention will be described in conjunction with the preferred embodiments, it will be understood that they are not intended to limit the invention to these embodiments. On the contrary, the invention is intended to cover alternatives, modifications, which may be included within the scope of the invention as defined by the appended claims. Furthermore, in the following detailed description of embodiments of the present invention, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be recognized by one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components, and circuits have not been described in detail so as not to unnecessarily obscure aspects of the embodiments of the present invention. Although a method may be depicted as a sequence of numbered steps for clarity, the numbering does not necessarily dictate the order of the steps. It should be understood that some of the steps may be skipped, performed in parallel, or performed without the requirement of maintaining a strict order of sequence. The drawings showing embodiments of the invention are semi-diagrammatic and not to scale and, particularly, some of the dimensions are for the clarity of presentation and are shown exaggerated in the Figures. Similarly, although the views in the drawings for the ease of description generally show similar orientations, this depiction in the Figures is arbitrary for the most part. Generally, the invention can be operated in any orientation.

HYBRID FLOOD-RELAYING AND ROUTING MESH NETWORKS



[0020] Overall, embodiments of the present disclosure provide a mesh network communication protocol that enables a relay node with both routing-relaying and flood-relaying capability to select a packet propagation approach and a packet forwarding mode. More specifically, upon receiving a packet, which may carry an indication for flooding-propagation in the mesh network or propagation mode unspecified, the relay node autonomously determines whether the packet is eligible for routing-propagation based on a number of factors, such as whether there is an existent valid route from the source node to the destination node, whether the packet is originated from a friend edge node, and whether a route discovery process has been initiated. Based on the determination, the relay node may change the indication in the packet to routing propagation and forward the packet in the manner of routing-relaying. As a result, the packet can be advantageously propagated over the mesh network by routing propagation, despite the initial indication produced by the edge node. Thus, in some embodiments, when the high end relay node receives the packet, the indication may indicate 3 possible scenarios: flooding propagation, routing propagation and propagation mode unspecified. After the relay node processes the packet, the indication may indicate 2 possible scenarios: flooding propagation and routing propagation.

[0021] A mesh network referred herein may be a wired or wireless communication mesh network. In a wireless mesh network, mesh clients, mesh routers and gateways are arranged as the network nodes and can communicate with each other via over-the-air radio frequency links. Mesh clients may be laptops, cell phones and other communication devices, etc., while the mesh routers forward traffic to and from the gateways which may or may not be connected to the Internet.

[0022] A network node referred herein can send and receive messages, and can function as a router to relay messages for its neighbor nodes. The network nodes in a mesh network may communicate using wireless protocols and techniques compatible with one or more of wireless standards, such as IEEE 802.11x family for WLAN, IEEE 802.15 for WPAN, and IEEE 802.16 for WMAN. However the present disclosure is not limited thereto.

[0023] When an edge node originates a packet, a particular field in the packet is assigned a value which indicates routing propagation or flooding propagation. In the embodiments described in detail herein, a routing protocol (RP) flag in the packet is set to 1 if routing propagation is selected; otherwise RP is set to 0, e.g., by default. However, it will be appreciated that the present disclosure is not limited to any specific mechanism or indicia for indicating flooding or routing propagation in a packet, nor limited to any specific mechanism in a receiving node for interpreting such an indication.

[0024] For an edge node that supports only flooding propagation, a produced packet always has the RP flag be 0. However, if it supports both flooding and routing propagation, the edge node may first determine whether there is a valid route from the source node to the destination node, e.g., a valid route for previous packets. If yes, the RP flag is set as "1" and the edge node initiates routing propagation of the packet; otherwise, the RP flag is set as "0" and the edge node initiates the flooding propagation.

[0025] Conventionally, as described with reference to Fig. 2, once flooding is selected and set for propagating a packet at the edge node, the packet is propagated over the mesh network by flooding until delivered to the destination node. However, according to embodiments of the present disclosure, a relay node with routing capability (e.g., a high end relay node) may autonomously determine whether routing propagation is suitable and thereby override the propagation approach set by the edge node.

[0026] Fig. 3 is a flow chart depicting an exemplary process 300 of a high end relay node selecting a packet propagation mode in a mesh network system in accordance with an embodiment of the present disclosure. The mesh network has a combination of edge nodes, normal relay nodes and high end relay nodes. Each edge node supports producing and consuming packets, yet may be incapable of forwarding packets. Each normal relay node can produce and consume packets and forward packets by flood-relaying but not routing-relaying. Each high end relay node can produce and consume packets and can forward packets by routing-relaying and flood-relaying. For example, a high end relay node may have logic for network management, self-discovery, self-repair, routing tables and/or routing information management and communication, which are not included in the normal relay nodes with no routing-relaying capability.

[0027] As illustrated, at 300, a high end relay node receives a packet with an RP indication in the header, e.g., in the form of a flag. The packet may have been directly transmitted from the edge node originating the packet, or may have been forwarded from another relay node. At 302, the high end relay node determines whether the packet has been designated for flood propagation or routing propagation based on the RP indication. If routing propagation is indicated (RP=1) and if the relay node is on the specific route toward the destination node, the high end edge node forwards the packet by routing-relaying at 305. Thereafter, the packet is propagated through the mesh network via the specific route.

[0028] If the RP indication in the packet indicates flooding propagation (as determined at 302) or if neither propagation approach is specified in the packet, the high end relay node determines whether a valid route exists from the source node to the destination node, at 303. If yes, the high end relay node modifies the RP indication to indicate routing propagation at 304, and forwards the packets by routing-relaying at 305. However, if it is determined that no valid route exists at 303, the RP indication is unchanged and remains to indicate flooding propagation, and the high end edge node forwards the packet by flood-relaying at 306. Thereafter, as the packet propagates through the subsequent nodes in the mesh network, the indication continues to indicate flooding propagation.

[0029] As described in greater detail below, in some embodiments, only a high end relay node with a special status is designated to perform autonomous determination whether to convert a flooding-propagation packet to a routing-propagation one. For example, the high end relay node is directly linked to the edge node originating the packet (e.g., a first layer relay node), and/or a friend node with the edge node. Thus, if a high end relay node without the special status receives the packet, it simply forwards the packet as indicated by the RP indication in the packet, which was set by the edge node or the high end relay node with the special status by using process 300.

[0030] By using a high end relay node to autonomously determine routing-propagation viability of a packet and accordingly convert a flooding-propagation packet or a packet with no propagation mode specified to a routing-propagation packet, the chances of using routing-relaying in a mesh network is advantageously and substantially expanded. As a result, the balance between cost and efficiency can be optimized, given that routing-relaying provided by high end relay nodes offers lower power consumption and network overhead. In addition, using a relay node to perform routing propagation related processes obviates the necessity of using an edge node for such processes, like route discovery and routing information maintenance. Therefore, even with an edge node lacking routing capability, the mesh network can still effectively take the benefit of routing propagation provided by the high end relay nodes.

[0031] In some embodiments, if a high end relay node determines that no valid route exists for routing propagation (e.g., no prior record), the relay node may autonomously initiate a route discovery process to discover a valid route for the packet. Fig. 4 illustrates exemplary computer controlled processes 400 of forwarding a packet by a normal relay node and a high end relay node in accordance with an embodiment of the present disclosure. The packet may have been transmitted directly from an edge node or from another relay node. If a high end relay node receives the packet, the relay node follows the process flow on the left side of the Figure; and if a normal relay node receives the packet, the relay node follows the process flow on the right side of the Figure.

[0032] More specifically, at 402, the high end relay node determines whether the RP flag is 1 (indicating routing propagation). If yes, the high end relay node further determines whether it is the on the specific route at 403. If it is not on the valid route, meaning the relay node is not an intended recipient, it discards the packet without further processing at 404. However, if the relay node is on the valid route, meaning it is an intended recipient, it forwards the packet by routing-relaying as indicated by the RP flag at 406.

[0033] On the other hand, if the RP flag as received is 0 which indicates flooding propagation or propagation mode unspecified (as determined by the relay node at 402), the relay node autonomously determines whether the packet is suitable for routing propagation towards the destination node, rather than directly forwarding the packet by flood-relaying. Thus, at 404, the relay node determines whether it has a valid route for the packet from the source node to the destination node. If yes, the relay node modifies the RP flag value to 1 at 407 and forwards the packet by routing-relaying at 406. Thereafter, the packet is propagated through the mesh network via the valid route.

[0034] If no valid route exists (as determined at 404), the relay node forwards the packet by flood-relaying and also initiates route discovery in an attempt to discover a valid route for subsequent packets toward the destination node. In some embodiments, a route discovery process is only performed by a particular high end relay node, for example, which is directly linked to the edge node or befriended by the edge node, or otherwise designated with a certain special status in the mesh network. The present disclosure is not limited to any specific special status used for designating a relay node to convert a flooding-propagation packet to a routing-propagation packet, and/or initiate and perform routing discovery for a packet.

[0035] As shown in the process flow on the right side of the Figure, if a normal relay node without routing capability receives the packet, it identifies the value of the RP flag at 409. If RP= 0 which indicates flooding propagation or no specification for either flooding or routing, the relay node forwards the packet by flood-relaying. If the RP=0 which indicates routing propagation, the relay node discards the packet without further processing.

[0036] Fig. 5 is a flow chart depicting an exemplary computer controlled process 500 of a high end relay node processing and forwarding a packet in accordance with an embodiment of the present disclosure. At 501, the relay node receives a packet, e.g., from an edge node or from another relay node. At 502, the relay node determines whether the RP flag is set as 1 which indicates routing propagation. If yes, at 503, the relay node determines whether it is on the specific route for the routing propagation. If the relay node is on the specific route and thus is the intended recipient, it forwards the packet by routing-relaying at 505. If the relay node is not on the specific route (as determined at 503), it discards the packet without further processing.

[0037] If the packet as received has the RP flag set as 0 (as determined at 502), at 506, the relay node determines whether the packet is from a friend edge node, which means the relay node has previously established a friendship with (or befriended by) the edge node.

[0038] In general, two friend nodes can communicate packets using friendship security material or encrypted material. If a relay node outside the friend relation receives a packet with such security material, the relay node simply discards it. Further, if an edge node has routing capability, a friend relay node can buffer incoming messages for the edge node while the edge node is placed in a power-saving mode. When the edge node wakes up, its friend relay node can send the packets to the edge node for processing.

[0039] Further, if an edge node does not support routing propagation, its friend relay node can use friendship security material for outgoing messages and can act on behalf of the edge node to generate or process and route control messages and route data messages. When the relay node receives an outgoing message from the edge node on the advertising bearer using the friendship security material, if a valid route to the destination node already exists, the message can be delivered over the routing bearer. If not, the outgoing message is delivered over the advertising bearer and the relay node initiates route initialization as a friend route originator.

[0040] As shown in Fig. 5, if the relay node determines that the packet is from a friend edge node (at 506), it then determines whether there is an existent valid route from the source node to the destination node at 507. If yes, the relay node modifies the RP flag to 1 and forwards the packet by routing-relaying. Thereafter, the packet is propagated through the mesh network via the valid route. If there is no existent valid route known to the relay node (as determined at 507), the relay node further determines if a route discovery process to the same destination node is in progress at 509. If yes, meaning a route discovery process has been initialized, the relay node forwards the instant packet by flood-relaying while continuing the route discovery process. If a route discovery process is not in progress as determined at 509, the relay node initiates route discovery at 510 and also forwards the instant packet by flood-relaying at 511. A later discovered route may be used for routing subsequent packets to the same destination node.

[0041] In this embodiment, the relay node performs route discovery as a proxy relay for the edge node at 510 to discover a route from the edge/source node to the destination node. However, the present disclosure is not limited thereto. In some other embodiments, the relay node may discovery a route from itself to the destination node instead.

[0042] It will be appreciated that the present disclosure is not limited to any specific manner to implement the processes as shown in Figs. 3-5. In other words, hardware logic, software logic or a combination thereof can be used to configure and enable the processes disclosed herein.

[0043] Fig. 6 is a block diagram illustrating an exemplary configuration of a wireless communication device 600 that can be used as a high end relay node and autonomously select a packet propagation mode in a wireless mesh network in accordance with an embodiment of the present disclosure. Device 600 may be a general purpose computer, a laptop, a desktop, a mobile phone, smart TV, game console, or other type of computing devices, etc. The device 600 includes a wireless transceiver 610 having a baseband processing device 611, a radio frequency (RF) device 612 and antennas, e.g., 601 and 602. The baseband processing device 611 may include a variety of components configured to perform baseband processing, including Analog-to-Digital conversion (ADC), Digital-to-Analog Conversion (DAC), gain adjusting, modulation/demodulation, encoding/decoding, and so on.

[0044] The RF device 612 can receive the RF wireless signals via the antennas 601 and 602, convert received RF signals to baseband signals for supply to the baseband processing device 611. The RF device 612 can also receive baseband signals from the baseband processing device 611, convert them to RF wireless signals and send to the antennas 601-602 for transmission. The RF device 612 may include a variety of components that are well known in the art.

[0045] The wireless communication device 600 includes a memory 620 storing information, application programs and functional modules related to packet propagation, packet forwarding and route discovery, such as a route discovery module 621, a self-recovery module 622, a routing table 623, a self-repair module 624, a proxy management module 625 and a friendship management module 626. The route discovery module 621, in conjunction with the routing table 623, can be executed for discovering a valid route from the edge/source node to the destination node for a packet. The self-recovery module 622 and the self-repair module 624 implement algorithms to recover and repair a broken or unreliable link in the mesh network. The proxy management module 625 and the friendship management module 626 can be used for establishing and maintaining the respective special relations with other nodes, such as an edge node or another relay node.

[0046] The wireless communication device 600 further includes control logic, in combination with the software logic stored in the memory 620, that enables the device to perform packet generation, packet forwarding, packet propagation control and route discovery as described in greater detail with reference to Figs. 3-5. Herein, particularly, the control logic 630 includes a relaying mode selection module 633 operable to determine whether to forward the packet by routing-relaying or flood-relaying and further operable to convert a flooding propagation packet to a routing propagation packet, according to the processes described in greater detail with reference to Figs. 3-5. The relaying mode selection module 633 can also determine whether to initiate a route discovery process for a packet, and, if yes, the route discovery module 621 can be executed for route discovery.

[0047] Once a packet forwarding mode is selected, the flood-relaying control module 631 or the routing-relaying control module 632 operates to forward the packet to next node(s), according to any suitable process, method or protocol that is well known in the art. The control logic also includes a packet generation module 634 for controlling packet generation according to a suitable protocol and format. The control logic may be integrated in a central processing unit (CPU) or the transceiver, or may be a separate unit in the device. The control logic may include a range of other components and functions for packet processing and other applications that are well known in the art and may be implemented by using hardware logic, software logic or a combination thereof.

[0048] Although certain preferred embodiments and methods have been disclosed herein, it will be apparent from the foregoing disclosure to those skilled in the art that variations and modifications of such embodiments and methods may be made. It is intended that the invention shall be limited only to the extent required by the appended claims and the rules and principles of applicable law.


Claims

1. A method of forwarding a packet by a wireless relay node in a mesh network, said method comprising:

receiving (401, 501) said packet at said relay node, wherein said packet identifies an edge node being a source node that generated said packet, and a destination node and comprises an indication;

responsive to a determination (402, 502) that said indication indicates a propagation mode of said packet in said mesh network by flooding or propagation mode unspecified, and responsive to a determination (404, 507) that a valid route from said edge node to said destination node exists:

modifying (407, 508) said indication in said packet to indicate a propagation mode of said packet to said destination node by routing; and

forwarding (406, 505) said packet from said relay node to a next node by routing-relaying and in accordance with said valid route; and

responsive to a determination (402, 502) that said indication indicates a propagation mode of said packet to said destination node by routing through a valid route from said edge node to said destination node, and responsive to a determination (403, 503) that said relay node is not encompassed in said valid route, discarding (405, 504) said packet at said relay node.


 
2. The method of Claim 1 further comprising:

responsive to a determination (402, 502) that said indication indicates said propagation mode of said packet to said destination node by flooding or propagation mode unspecified, and

responsive to a determination (404, 507) that no valid route exists, forwarding (408, 511) said packet from said relay node to next nodes by flood-relaying.


 
3. The method of Claim 1 further comprising:

responsive to a determination (402, 502) that said indication indicates said propagation mode of said packet to said destination node by flooding or propagation mode unspecified, determining (404, 507) whether a valid route to said destination node exists; and

responsive to a determination that no valid route exists and responsive to a determination that no route discovery process is in progress at said relay node, initiating (408, 510) a route discovery process at said relay node to discover a route to said destination node.


 
4. The method of Claim 1, wherein responsive to a determination (502) that said indication indicates said propagation mode of said packet to said destination node by flooding or propagation mode unspecified, said determining (507) whether a valid route to said destination node exists is performed responsive to a determination (506) that said relay node is a friend node of said edge node, wherein the friend node and the edge node communicate using encrypted material.
 
5. The method of Claim 2, wherein said route discovery process comprises said relay node acting as a proxy relay of said edge node for route discovery.
 
6. The method of Claim 2 further comprising, responsive to a determination (507) that no valid route exists and a determination (509) that a route discovery process is in progress at said relay node, forwarding (511) said packet to next nodes by flood-relaying.
 
7. The method of Claim 1, wherein said relay node is directly linked to said edge node and another relay node, wherein said relay node is configured to participate in both flooding-based propagation and routing-based propagation, and wherein further said edge node and said another relay node are configured to participate in only flooding-based propagation.
 
8. A wireless communication device (600) operable to be a relay node in a mesh network, said wireless communication device comprising:

a memory;

communication circuitry configured to communicatively couple to said mesh network, wherein said communication circuitry comprises a transceiver configured to receive a packet originated from an edge node, being a source node of the packet, in said mesh network and to transmit said packet over said mesh network, and wherein further said packet identifies said edge node and a destination node and comprises an indication;

control logic coupled to said memory and said transceiver and configured to:

responsive to a determination that said indication indicates propagating said packet to said destination node by flooding or propagation mode unspecified and further responsive to a determination that a valid route from said edge node to said destination node exists, modify said indication to indicate propagating said packet to said destination node by routing; and

initiate forwarding of said packet to a next node according to said valid route, and

control logic configured to, responsive to a determination that said indication indicates propagating said packet to said destination node by routing through a valid route from said edge node to said destination node and responsive to a determination that said relay node is not encompassed in said valid route, discard said packet.


 
9. The wireless communication device of Claim 8, wherein said control logic is further configured to:

responsive to a determination that said indication indicates propagating said packet to said destination node by flooding or propagation mode unspecified, and

responsive to a determination that no valid route exists, initiate forwarding of said packet to next nodes by flood-relaying.


 
10. The wireless communication device (600) of Claim 8, wherein said control logic is further configured to:

responsive to a determination that said indication indicates propagating said packet to said destination node by flooding or propagation mode unspecified, determine whether a valid route to said destination node exists; and

responsive to a determination that no valid route exists and responsive to a determination that no route discovery process is in progress, initiate a route discovery process to discover a route to said destination node.


 
11. The wireless communication device (600) of Claim 8, wherein said control logic is further configured to:

establish a friendship with said edge node, in which said next node and the edge node communicates using encrypted material; responsive to a determination (502) that said indication indicates propagating said packet to said destination node by flooding or propagation mode unspecified, and

responsive to a determination that said edge node is a friend node, determine whether a valid route to said destination node exists, and responsive to a determination that no valid route exists and responsive to a determination that no route discovery process is in progress, initiate a route discovery process to discover a route to said destination node,

wherein said route discovery process comprises said wireless communication device acting as a proxy relay of said edge node for route discovery.


 
12. The wireless communication device (600) of Claim 11, wherein said control logic is further configured to, responsive to a determination that no valid route exists and responsive to a determination that route discovery process is in progress at said relay node, initiate forwarding of said packet to next nodes by flood-relaying.
 
13. The wireless communication device (600) of Claim 8, wherein said control logic is configured to participate in both flooding-based propagation and routing-based propagation, and wherein further said edge node and another relay node coupled to said edge node are configured to participate in only flooding-based propagation.
 


Ansprüche

1. Ein Verfahren zum Weiterleiten eines Datenpakets mittels eines drahtlosen Relaisknotens in einem Mesh-Netzwerk, das Verfahren aufweisend:

Empfangen (401, 501) des Datenpakets bei dem besagten Relaisknoten, wobei das besagte Datenpaket einen Randknoten, der ein Quellknoten ist, welcher das besagte Datenpaket erzeugt hat, und einen Zielknoten identifiziert und eine Indikation aufweist;

als Reaktion auf eine Feststellung (402, 502), dass die besagte Indikation einen Ausbreitungsmodus des besagten Datenpakets im besagten Mesh-Netzwerk mittels Überschwemmung angibt oder dass der Ausbreitungsmodus unspezifiziert ist, und als Reaktion auf eine Feststellung (404, 507), dass eine gültige Route von dem besagten Randknoten zu dem besagten Zielknoten existiert:

Modifizieren (407, 508) der besagten Indikation im besagten Datenpaket, damit diese einen Ausbreitungsmodus des besagten Datenpakets zum besagten Zielknoten hin mittels Routing angibt; und

Weiterleiten (406, 505) des besagten Datenpakets von dem besagten Relaisknoten zu einem nächsten Knoten mittels Routingvermittlung und in Übereinstimmung mit der besagten gültigen Route; und

als Reaktion auf eine Feststellung (402, 502), dass die besagte Indikation einen Ausbreitungsmodus des besagten Datenpakets zum besagten Zielknoten hin mittels Routing durch eine gültige Route von dem besagten Randknoten zu dem besagten Zielknoten angibt, und als Reaktion auf eine Feststellung (403, 503), dass der besagte Relaisknoten nicht in der besagten gültigen Route enthalten ist: Verwerfen (405, 504) des besagten Datenpakets beim besagten Relaisknoten.


 
2. Das Verfahren gemäß Anspruch 1, ferner aufweisend:

als Reaktion auf eine Feststellung (402, 502), dass die besagte Indikation den besagten Ausbreitungsmodus des besagten Datenpakets zu dem besagten Zielknoten mittels Überschwemmung angibt oder dass der Ausbreitungsmodus unspezifiziert ist, und

als Reaktion auf eine Feststellung (404, 507), dass keine gültige Route existiert: Weiterleiten (408, 511) des besagten Datenpakets von dem besagten Relaisknoten zu nächsten Knoten mittels Überschwemmungsvermittlung.


 
3. Das Verfahren gemäß Anspruch 1, ferner aufweisend:

als Reaktion auf eine Feststellung (402, 502), dass die besagte Indikation den besagten Ausbreitungsmodus des besagten Datenpakets zu dem besagten Zielknoten mittels Überschwemmung angibt oder dass der Ausbreitungsmodus unspezifiziert ist: Bestimmen (404, 507), ob eine gültige Route zu dem besagten Zielknoten existiert; und

als Reaktion auf eine Feststellung, dass keine gültige Route existiert, und als Reaktion auf eine Feststellung, dass kein Routenauffindungsprozess bei dem besagten Relaisknoten ausgeführt wird: Einleiten (408, 510) eines Routenauffindungsprozesses bei dem besagten Relaisknoten, um eine Route zu dem besagten Zielknoten aufzufinden.


 
4. Das Verfahren gemäß Anspruch 1, wobei als Reaktion auf eine Feststellung (502), dass die besagte Indikation den besagten Ausbreitungsmodus des besagten Datenpakets zu dem besagten Zielknoten mittels Überschwemmung angibt oder dass der Ausbreitungsmodus unspezifiziert ist, das besagte Bestimmen (507), ob eine gültige Route zu dem besagten Zielknoten existiert, als Reaktion auf eine Feststellung (506), dass der besagte Relaisknoten ein Freundknoten des Randknotens ist, ausgeführt wird, wobei der Freundknoten und der Randknoten unter Verwendung von verschlüsseltem Material kommunizieren.
 
5. Das Verfahren gemäß Anspruch 2, wobei der besagte Routenauffindungsprozess aufweist, dass der besagte Relaisknoten als ein Proxy-Relais des Randknotens zur Routenauffindung funktioniert.
 
6. Das Verfahren gemäß Anspruch 2, ferner aufweisend ein Weiterleiten (511) des besagten Datenpakets an nächsten Knoten mittels Überschwemmungsvermittlung als Reaktion auf eine Feststellung (507), dass keine gültige Route existiert, und als Reaktion auf eine Feststellung (509), dass ein Routenauffindungsprozess bei dem besagten Relaisknoten ausgeführt wird.
 
7. Das Verfahren gemäß Anspruch 1, wobei der besagte Relaisknoten direkt mit dem besagten Randknoten und einem weiteren Relaisknoten verbunden ist, wobei der besagte Relaisknoten konfiguriert ist zum Teilnehmen an sowohl Ausbreitung auf Basis von Überschwemmung als auch Ausbreitung auf Basis von Routing, und wobei der besagte Randknoten und der besagte weitere Relaisknoten des Weiteren dazu konfiguriert sind, nur an Ausbreitung auf Basis von Überschwemmung teilzunehmen.
 
8. Ein Gerät (600) zur drahtlosen Kommunikation, das als Relaisknoten in einem Mesh-Netzwerk betreibbar ist, das besagte Gerät zur drahtlosen Kommunikation aufweisend:

einen Speicher;

eine Kommunikationsschaltung, die zum kommunikativen Koppeln an das besagte Mesh-Netzwerk konfiguriert ist, wobei die besagte Kommunikationsschaltung einen Transceiver aufweist, der konfiguriert ist zum Empfangen eines Datenpakets, das von einem Randknoten, der ein Quellknoten des Datenpakets ist, in dem besagten Mesh-Netzwerk stammt, und zum Senden des besagten Datenpakets durch das besagte Mesh-Netzwerk, und wobei das besagte Datenpaket ferner den besagten Randknoten und einen Zielknoten identifiziert und eine Indikation aufweist;

eine Steuerungslogik, die an den besagten Speicher und den besagten Transceiver gekoppelt ist und konfiguriert ist zum:
als Reaktion auf eine Feststellung, dass die besagte Indikation eine Ausbreitung des besagten Datenpakets an den besagten Zielknoten mittels Überschwemmung angibt oder dass der Ausbreitungsmodus unspezifiziert ist, und ferner als Reaktion auf eine Feststellung, dass eine gültige Route von dem besagten Randknoten zu dem besagten Zielknoten existiert:

Modifizieren der besagten Indikation derart, dass diese eine Ausbreitung des besagten Datenpakets zum besagten Zielknoten hin mittels Routing angibt; und

Einleiten eines Weiterleitens des besagten Datenpakets zu einem nächsten Knoten gemäß der besagten gültigen Route; und

eine Steuerungslogik, die dazu konfiguriert ist, als Reaktion auf eine Feststellung, dass die besagte Indikation eine Ausbreitung des besagten Datenpakets zu dem besagten Zielknoten mittels Routing durch eine gültige Route von dem besagten Randknoten zu dem besagten Zielknoten hin, und als Reaktion auf eine Feststellung, dass der besagte Relaisknoten nicht in der besagten gültigen Route enthalten ist: Verwerfen des besagten Datenpakets.


 
9. Das Gerät zur drahtlosen Kommunikation gemäß Anspruch 8, wobei die besagte Steuerungslogik ferner konfiguriert ist zum:

als Reaktion auf eine Feststellung, dass die besagte Indikation ein Ausbreiten des besagten Datenpakets an den besagten Zielknoten mittels Überschwemmung angibt oder dass der Ausbreitungsmodus unspezifiziert ist, und

als Reaktion auf eine Feststellung, dass keine gültige Route existiert: Einleiten eines Weiterleitens des besagten Datenpakets zu nächsten Knoten mittels Überschwemmungsvermittlung.


 
10. Das Gerät (600) zur drahtlosen Kommunikation gemäß Anspruch 8, wobei die besagte Steuerungslogik ferner konfiguriert ist zum:

als Reaktion auf eine Feststellung, dass die besagte Indikation ein Ausbreiten des besagten Datenpakets an den besagten Zielknoten mittels Überschwemmung angibt oder dass der Ausbreitungsmodus unspezifiziert ist: Bestimmen, ob eine gültige Route zu dem besagten Zielknoten hin existiert; und

als Reaktion auf eine Feststellung, dass keine gültige Route existiert, und als Reaktion auf eine Feststellung, dass kein Routenauffindungsprozess ausgeführt wird: Einleiten eines Routenauffindungsprozesses, um eine Route zu dem besagten Zielknoten aufzufinden.


 
11. Das Gerät (600) zur drahtlosen Kommunikation gemäß Anspruch 8, wobei die besagte Steuerungslogik ferner konfiguriert ist zum:

Aufbauen einer Freundschaft mit dem besagten Randknoten, in welcher der besagte nächste Knoten und der Randknoten unter Verwendung von verschlüsseltem Material kommunizieren;

als Reaktion auf eine Feststellung (502), dass die besagte Indikation eine Ausbreitung des besagten Datenpakets an den besagten Zielknoten mittels Überschwemmung angibt oder dass der Ausbreitungsmodus unspezifiziert ist, und als Reaktion auf eine Feststellung, dass der besagte Randknoten ein Freundknoten ist: Bestimmen, ob eine gültige Route zu dem besagten Zielknoten existiert; und als Reaktion auf eine Feststellung, dass keine gültige Route existiert, und als Reaktion auf eine Feststellung, dass kein Routenauffindungsprozess ausgeführt wird: Einleiten eines Routenauffindungsprozesses, um eine Route zu dem besagten Zielknoten aufzufinden,

wobei der besagte Routenauffindungsprozess aufweist, dass das besagte Gerät zur drahtlosen Kommunikation als ein Proxy-Relais des Randknotens zur Routenauffindung funktioniert.


 
12. Das Gerät (600) zur drahtlosen Kommunikation gemäß Anspruch 11, wobei die besagte Steuerungslogik ferner konfiguriert ist zum Einleiten eines Weiterleitens des besagten Datenpakets an nächsten Knoten mittels Überschwemmungsvermittlung als Reaktion auf eine Feststellung, dass keine gültige Route existiert, und als Reaktion auf eine Feststellung, dass ein Routenauffindungsprozess bei dem besagten Relaisknoten ausgeführt wird.
 
13. Das Gerät (600) zur drahtlosen Kommunikation gemäß Anspruch 8, wobei die besagte Steuerungslogik ferner konfiguriert ist zum Teilnehmen an sowohl Ausbreitung auf Basis von Überschwemmung als auch Ausbreitung auf Basis von Routing, und wobei der besagte Randknoten und der besagte weitere Relaisknoten des Weiteren dazu konfiguriert sind, nur an Ausbreitung auf Basis von Überschwemmung teilzunehmen.
 


Revendications

1. Un procédé pour faire suivre un paquet par un nœud relais sans fil dans un réseau maillé, ledit procédé comprenant les étapes consistant à :

- recevoir (401, 501) ledit paquet audit nœud relais, selon lequel ledit paquet identifie un nœud de bord étant un nœud source qui a généré ledit paquet et un nœud de destination et comprend une indication ;

- en réponse à une détermination (402, 502) que ladite indication indique un mode de propagation dudit paquet dans ledit réseau maillé par inondation ou un mode de propagation non spécifié, et en réponse à une détermination (404, 507) qu'une route valide depuis ledit nœud de bord audit nœud de destination existe :

∘ modifier (407, 508) ladite indication dans ledit paquet pour indiquer un mode de propagation dudit paquet audit nœud de destination par routage ; et

∘ faire suivre (406, 505) ledit paquet depuis ledit nœud relais à un prochain nœud par relayage-routage et en accord avec ladite route valide; et

- en réponse à une détermination (402, 502) que ladite indication indique un mode de propagation dudit paquet audit nœud de destination par routage via une route valide depuis ledit nœud de bord audit nœud de destination, et en réponse à une détermination (403, 503) que ledit nœud relais n'est pas englobé dans ladite route valide, écarter (405, 504) ledit paquet audit nœud relais.


 
2. Le procédé selon la revendication 1 comprenant en outre les étapes consistant à :

- en réponse à une détermination (402, 502) que ladite indication indique ledit mode de propagation dudit paquet audit nœud de destination par inondation ou un mode de propagation non spécifié, et

- en réponse à une détermination (404, 507) qu'aucune route valide n'existe, faire suivre (408, 511) ledit paquet depuis ledit nœud relais aux prochains nœuds par relayage-inondation.


 
3. Le procédé selon la revendication 1 comprenant en outre les étapes consistant à :

- en réponse à une détermination (402, 502) que ladite indication indique ledit mode de propagation dudit paquet audit nœud de destination par inondation ou un mode de propagation non spécifié, déterminer (404, 507) si une route valide audit nœud de destination existe ; et

- en réponse à une détermination qu'aucune route valide n'existe et en réponse à une détermination qu'aucune processus de découverte de route n'est en œuvre audit nœud relais, initier (408, 510) un processus de découverte de route audit nœud relais pour découvrir une route jusqu'audit nœud de destination.


 
4. Le procédé selon la revendication 1, selon lequel en réponse à une détermination (502) que ladite indication indique ledit mode de propagation dudit paquet audit nœud de destination par inondation ou un mode de propagation non spécifié, ladite détermination (507) si une route valide audit nœud de destination existe est réalisée en réponse à une détermination (506) que ledit nœud relais est un nœud ami dudit nœud de bord, selon lequel le nœud ami et le nœud de bord communiquent en utilisant du matériel chiffré.
 
5. Le procédé selon la revendication 2, selon lequel ledit processus de découverte de route comprend que ledit nœud relais se comporte en tant que relais proxy dudit nœud de bord pour la découverte de route.
 
6. Le procédé selon la revendication 2, comprenant en outre, en réponse à une détermination (507) qu'aucune route valide n'existe et à une détermination (509) qu'un processus de découverte de route est en œuvre audit nœud relais, faire suivre (511) ledit paquet aux nœuds prochains par relayage-inondation.
 
7. Le procédé selon la revendication 1, selon lequel ledit nœud relais est directement lié audit nœud de bord et à un autre nœud relais, selon lequel ledit nœud relais est configuré pour participer à la fois un mode de propagation basé sur l'inondation et un mode de propagation basé sur le routage, et selon lequel en outre ledit nœud de bord et ledit autre nœud relais sont configurés pour participer seulement au mode de propagation basé sur l'inondation.
 
8. Un appareil de communication sans fil (600) adapté pour fonctionner comme nœud relais dans un réseau maillé, ledit appareil de communication sans fil comprenant :

- une mémoire ;

- des circuits de communication configurés pour se coupler de façon communicative audit réseau maillé, dans lequel lesdits circuits de communication comportent un émetteur-récepteur configuré pour recevoir un paquet originaire d'un nœud de bord, «étant un nœud source du paquet, dans ledit réseau maillé et pour transmettre ledit paquet sur ledit réseau maillé, et dans lequel en outre ledit paquet identifie ledit nœud de bord et ledit nœud de destination et comprend une indication ;

- une logique de contrôle couplée à ladite mémoire et audit émetteur-récepteur et configurée pour :
∘ en réponse à une détermination que ladite indication indique une propagation dudit paquet audit nœud de destination par inondation ou un mode de propagation non spécifié et en outre en réponse à une détermination qu'une route valide depuis ledit nœud de bord audit nœud de destination existe :

modifier ladite indication pour indiquer une propagation dudit paquet audit nœud de destination par routage ; et

initier de faire suivre ledit paquet à un prochain nœud en accord avec ladite route valide ; et

- une logique de contrôle configurée pour, en réponse à une détermination que ladite indication indique une propagation dudit paquet audit nœud de destination par routage via une route valide depuis ledit nœud de bord audit nœud de destination, et en réponse à une détermination que ledit nœud relais n'est pas englobé dans ladite route valide, écarter ledit paquet.


 
9. L'appareil de communication sans fil selon la revendication 8, dans lequel ladite logique de contrôle est en outre configurée pour :

- en réponse à une détermination que ladite indication indique une propagation dudit paquet audit nœud de destination par inondation ou un mode de propagation non spécifié, et

- en réponse à une détermination qu'aucune route valide n'existe, initier de faire suivre ledit paquet aux prochains nœuds par relayage-inondation.


 
10. L'appareil de communication sans fil (600) selon la revendication 8, dans lequel la logique de contrôle est configurée en outre pour :

- en réponse à une détermination que ladite indication indique une propagation dudit paquet audit nœud de destination par inondation ou un mode de propagation non spécifié, déterminer si une route valide audit nœud de destination existe ; et

- en réponse à une détermination qu'aucune route valide n'existe et en réponse à une détermination qu'aucun processus de découverte de route n'est en œuvre, initier un processus de découverte de route pour découvrir une route jusqu'audit nœud de destination.


 
11. L'appareil de communication sans fil (600) selon la revendication 8, dans lequel la logique de contrôle est configurée en outre pour :
établir une amitié avec ledit nœud de bord, dans lequel ledit prochain nœud et le nœud de bord communiquent en utilisant du matériel chiffré ; en réponse à une détermination (502) que ladite indication indique une propagation dudit paquet audit nœud de destination par inondation ou un mode de propagation non spécifié, et en réponse à une détermination qu'aucune route valide n'existe et en réponse à une détermination qu'aucun processus de découverte de route n'est en œuvre, initier un processus de découverte de route pour découvrir une route audit nœud de destination.
 
12. L'appareil de communication sans fil (600) selon la revendication 11, dans lequel la logique de contrôle est configurée en outre pour, en réponse à une détermination qu'aucune route valide n'existe et en réponse à une détermination qu'un processus de découverte de route est en œuvre audit nœud relais, initier de faire suivre ledit paquet aux nœuds prochains par relayage-inondation.
 
13. L'appareil de communication sans fil (600) selon la revendication 8, dans lequel la logique de contrôle est configurée pour participer à la fois à une propagation basée sur l'inondation et à une propagation basée sur le routage, et dans lequel en outre ledit nœud de bord et ledit autre nœud relais couplé audit nœud de bord sont configurés pour participer seulement à une propagation basée sur l'inondation.
 




Drawing























Cited references

REFERENCES CITED IN THE DESCRIPTION



This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.

Non-patent literature cited in the description