[go: up one dir, main page]

WO2018151640A1 - Nœud de réseau et procédé associé pour transmettre un message dans un réseau maillé - Google Patents

Nœud de réseau et procédé associé pour transmettre un message dans un réseau maillé Download PDF

Info

Publication number
WO2018151640A1
WO2018151640A1 PCT/SE2017/050543 SE2017050543W WO2018151640A1 WO 2018151640 A1 WO2018151640 A1 WO 2018151640A1 SE 2017050543 W SE2017050543 W SE 2017050543W WO 2018151640 A1 WO2018151640 A1 WO 2018151640A1
Authority
WO
WIPO (PCT)
Prior art keywords
message
node
network
network node
received
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.)
Ceased
Application number
PCT/SE2017/050543
Other languages
English (en)
Inventor
Per Skillermark
Piergiuseppe DI MARCO
Roman CHIRIKOV
Pontus ARVIDSON
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of WO2018151640A1 publication Critical patent/WO2018151640A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1886—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with traffic restrictions for efficiency improvement, e.g. involving subnets or subdomains
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/21—Monitoring or handling of messages
    • H04L51/212—Monitoring or handling of messages using filtering or selective blocking
    • 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

Definitions

  • Embodiments herein relate to a network node and methods performed therein. In particular, embodiments herein relates to transmitting a message in a mesh network to a destination node.
  • Mesh networking is a means to increase the effective communication range of wireless nodes and may further ease their deployment.
  • all nodes in the network can communicate with all other nodes, either by direct message exchange if within range or by making use of intermediate nodes that help passing the message along when direct communication is not possible.
  • One message forwarding technique is routing, in which the message traverses an optimized path through the mesh network from a source node to the intended destination node.
  • Another message forwarding technique is referred to as flooding. In flooding mesh networks all nodes that receive a message re-transmit it to all their neighbors. In this way the message reaches all nodes in the network and hence eventually also the intended destination node.
  • flooding mesh In flooding mesh, a message may often find multiple paths from source node to destination node and hence flooding mesh networks are inherently robust to topology changes and node failures.
  • An obvious drawback of a flooding mesh network is, however, that every message induced in the system may create a very large amount of traffic over the air interface which in turn leads to that the system may suffer from severe congestion when the amount of traffic increases.
  • a node acting as a relay in a Bluetooth mesh network scans the advertisement channels for mesh packets. When a packet is detected and received the node checks if it is the destination of the packet. - If yes, the packet content is sent to an application in the node where it is processed. If the node is not the destination of the packet the node checks if it has already received and forwarded the packet. If yes, the packet is discarded. If not, the packet is forwarded in the mesh network by re-transmitting it over the advertisement channels so that the neighbors of the node can receive it. Typically, some random delay is introduced before forwarding the packet to avoid collisions. By means of this distributed mechanism the packet is forwarded from node to node(s) in the network until the packet arrives at the destination.
  • Bluetooth mesh defines two main methods to limit traffic flooding in the network: message cache and time to live.
  • the message cache is used to prevent a device such as a node from relaying a message that it previously received.
  • Message cache when used herein means a cache where information about messages previously encountered, relayed or transmitted, is stored in order to detect duplicates.
  • the stored information comprises source and sequence number. Any time a device such as node receives a message that it has already received it will be ignored. If the message cache on a given device is very small, then that device may retransmit a message unnecessarily but that message would then be ignored by other devices in the area that have already received the message.
  • Each message will also include a Time To Live (TTL) value. This will limit the number of times that a message can be retransmitted. Each time a message is received and then retransmitted by a device, the TTL value is decremented by one.
  • TTL Time To Live
  • Bluetooth mesh networks may be used to enhance the reliability of Bluetooth mesh networks.
  • One such method is repetition. By transmitting each message multiple times, it is possible to increase the probability that a message reaches the destination node.
  • Repetition may be implemented end-to-end such as source node-to-destination node, or hop-by-hop, and in different layers in the protocol stack.
  • hop-by-hop repetitions can be implemented in the network layer while end-to-end repetitions can be implemented in transport or application layer.
  • acknowledgements either hop-by-hop or end-to-end. With acknowledged data transfer, only failed messages will be retransmitted.
  • acknowledgement may be implemented on transport or application layer, but there is no support for hop-by-hop acknowledgements.
  • a drawback of both repetitions and acknowledgements is that the overall traffic in the network increases, and hence the interference and risk for collisions and decoding failure.
  • a method for efficient broadcasting of messages in an ad hoc wireless network is provided.
  • a node receives a broadcast message for re- broadcasting to other nodes in the network, it builds a list of identifiers of other nodes in the network from which the node requires reception of a broadcast message as an implicit acknowledgment that said other nodes in the network have received said broadcast message.
  • the node builds this implicit acknowledgment list based on stored data pertaining to an existing tree-based topology of the network. After this list is built, the node re-broadcasts the broadcast message.
  • Each node in the network executes this
  • a trickle algorithm described in Internet Engineering Task Force (IETF), Request for Comments (RFC) 6206, "The Trickle Algorithm", proposes a method to control
  • the Trickle algorithm targets state information type of data, such as a software revision number, or the last heard multicast message, which may be of interest to many or all nodes in the network.
  • the Trickle algorithm controls the transmissions of a node such that a node sends the message unless it hears a few other nodes transmitting the data, indicating the own transmission is redundant.
  • the Trickle algorithm works with the concept of "consistent” and “inconsistent” transmissions; the exact meaning of "consistent” and “inconsistent” transmission depends on how a protocol uses the Trickle algorithm. For a node that only hears "consistent” transmissions, the Trickle algorithm will reduce the expected transmission frequency, while if the node overhears an "inconsistent” transmission the expected transmission frequency is increased.
  • An object of embodiments herein is to improve the performance in a mesh network.
  • the object is achieved by example embodiments of a method performed by a network node for transmitting a message in a mesh network to a destination node.
  • the network node transmits, the message addressing the destination node.
  • the network node scans if any message considered to be a relayed copy of the transmitted message is received.
  • the network node repeats the transmitting of the message addressing the destination node.
  • the network node decides to not repeat to transmit the message addressing the destination node.
  • a network node for transmitting a message in a mesh network to a destination node, the network node being configured to:
  • Figure 1 is a diagram illustrating performance of a mesh network according to prior art.
  • Figure 2 is a diagram illustrating performance of a mesh network according to prior art.
  • Figure 3 is a diagram illustrating performance of a mesh network according to
  • Figure 4 is a schematic block diagram illustrating embodiments of a mesh network.
  • Figure 5 is a flowchart depicting embodiments of a method in a network node.
  • Figure 6 is a schematic block diagram illustrating embodiments of a network node,
  • Figure 7 is a flowchart depicting embodiments of a method in a network node,
  • Figure 8 is a flowchart depicting embodiments of a method in a network node.
  • end-to-end acknowledgement may be implemented on transport or application layer, but there is no support for hop-by-hop acknowledgements.
  • a drawback of both repetitions and acknowledgements is that the overall traffic in the network increases, and hence the interference and risk for collisions and decoding failure. Accordingly, it is delicate task to find an appropriate operating point that combines a high reliability with a low, or at least acceptable, interference level.
  • An object of embodiments herein is to improve the performance in a mesh network.
  • the plots in Figures 1 -3 illustrate the performance of a Bluetooth mesh network for different message repetition schemes and aim to quantify the performance improvement that can be expected by the embodiments herein in a deployment scenario.
  • Figure 1-2 relate to prior art and Figure 3 relates to an example embodiment herein.
  • Figures 1 - 3 illustrate the performance of a mesh network in terms of packet delays and ratio of delivered packets.
  • Figure 2 depicts performance with 3 repetitions at each transmission event.
  • Embodiments herein e.g. relate to an adaptive repetition scheme for mesh networks such as e.g. Bluetooth mesh.
  • Embodiments herein comprise a method where source and relay nodes in mesh networks such as e.g. Bluetooth mesh networks, adaptively repeat messages using received copies of the same message as decision basis.
  • Source nodes repeats messages until the overheard messages indicate that the message has been successfully injected into the network, or until the maximum number of repetitions have been reached, while relay nodes repeat messages until overheard messages indicate that the message has progressed further into the network or until the maximum number of repetitions have been reached.
  • overheard when used herein means that a message has been detected while scanning for messages.
  • An advantage of embodiments herein is that it may significantly increase the performance of a large mesh network such as e.g. a large Bluetooth mesh network. As the mechanism is completely autonomous and distributed, it also allows for deployment of larger systems without the need for detailed network planning or centralized coordination, as would otherwise be the case. Embodiments herein are applicable to Bluetooth mesh, and to many other mesh networking standards as well, and may be implemented with the purpose to improve the performance of a mesh network.
  • Figure 3 shows the performance using an adaptive repetition according to embodiments herein, the service ratio is close to 100% for all evaluated cases and the delay has low jitter.
  • FIG. 4 depicts an example of a mesh network 100 in which embodiments herein may be implemented.
  • the mesh network 100 implementing embodiments herein may comprise one or more RANs and one or more CNs.
  • the mesh network 100 may use a number of different technologies, such as e.g. Bluetooth mesh networks, ZigBee networks or Thread networks, just to mention a few possible implementations.
  • Network nodes 110 operate in the mesh network 100.
  • the network nodes 1 10 receive and send messages over radio links in the mesh network
  • a message may be sent from a network node being a source network node 110, 111 , via network nodes being relay network nodes 110, 112 to the network node being a destination network node 110, 113.
  • the network nodes 110, 11 1 , 112, 113 may be devices such as wireless devices which means any terminal, wireless communication terminal, user equipment, Machine Type Communication (MTC) device, Device to Device (D2D) terminal, or node e.g. smart phone, laptop, mobile phone, sensor, relay, mobile tablets or even a small base station communicating within a cell.
  • MTC Machine Type Communication
  • D2D Device to Device
  • the network nodes 1 10, 1 11 , 1 12, 1 13 may be a transmission and reception point e.g. a radio access network node such as a Wireless Local Area Network (WLAN) access point or an Access Point Station (AP STA), an access controller, a base station, e.g.
  • a radio access network node such as a Wireless Local Area Network (WLAN) access point or an Access Point Station (AP STA)
  • WLAN Wireless Local Area Network
  • AP STA Access Point Station
  • a base station e.g.
  • a radio base station such as a NodeB, an evolved Node B (eNB, eNode B), a 5G base station such as a gNB, a base transceiver station, a radio remote unit, an Access Point Base Station, a base station router, a transmission arrangement of a radio base station, a stand-alone access point or any other network unit capable of communicating with a wireless device within the service area served by the network nodes 110, 112 depending e.g. on the first radio access technology and terminology used.
  • a radio base station such as a NodeB, an evolved Node B (eNB, eNode B), a 5G base station such as a gNB, a base transceiver station, a radio remote unit, an Access Point Base Station, a base station router, a transmission arrangement of a radio base station, a stand-alone access point or any other network unit capable of communicating with a wireless device within the service area served by the network nodes 110, 112 depending e.g.
  • Methods for transmitting a message in a mesh network 100 to a destination node 1 13, is performed by the network node 110, 11 1 , 112.
  • a Distributed Node (DN) and functionality e.g. comprised in a cloud (not shown), may be used for performing or partly performing the methods.
  • An example object of embodiments herein is to choose the ideal amount of repetitions for each transmitted message in the mesh network 100. Performing more repetitions will increase the probability of the individual message to be received correctly, but it also has the drawback that it will cause more interference, especially in a deployment where the relay node 110, 112 density is high. Thus there is a trade-off between ensuring that an individual message reaches its destination and causing interference to other nodes.
  • Embodiments herein introduce a method where each network node 1 10, 1 12 may use relaying transmissions from other network nodes to assert that the message has reached the mesh network 100, and that it will be forwarded, and does therefore not need to be repeated any more.
  • the source nodes 110, 11 1 overhears transmissions to assure that the message has been successfully injected into the mesh network 110, while relay nodes overhear transmissions to assure that the message has made further progress into the network.
  • the wording injected when used herein means that a transmission from the source node 1 10, 1 11 has successfully reached any relay node belonging to the mesh network 100.
  • Example embodiments of a method performed by a network node 110, 11 1 , 112 for transmitting a message in a mesh network to a destination node 1 13, will now be described with reference to a flowchart depicted in Figure 5.
  • Embodiments herein comprise a method where source and relay nodes in mesh networks such as e.g. Bluetooth mesh networks, adaptively repeat messages using received copies of the same message as decision basis.
  • the actions may be performed by the network node 1 10, 1 11 , 1 12 when being a source network node 110, 1 11 and by the network node 1 10, 1 11 , 1 12 when being a relay node 1 10, 1 12.
  • the source node 1 10, 11 1 e.g. repeats messages until the overheard messages indicate that the message has been successfully injected into the network, or until the maximum number of repetitions have been reached, while the relay node 1 10, 1 12 repeat messages until overheard messages indicate that the message has progressed further into the network or until the maximum number of repetitions have been reached.
  • the network node is here referred to as the network node 1 10, 1 11 and the source node 1 10, 1 11 interchangeably. This will be followed by the embodiments wherein the actions performed by the network node 1 10, 1 11 , 1 12 when being a relay node 1 10, 1 11 will be described together with Figure 5.
  • the network node 110, 111, 112 being a source node 110, 111
  • the optional actions 501-502 are not performed by the source network node 110, 1 11 and are therefore not described here but will be described below.
  • the 10 method starts with Action 503.
  • the method comprises the following actions, which actions may be taken in any suitable order.
  • the network node 110, 11 1 transmits the message addressing the destination node 15 1 13.
  • the transmitted message or relevant parts of may be saved in the network node 110, 11 1 , e.g. in a database or memory so that the network node 110, 11 1 can compare with messages received during the first time interval and identify if the received message is a copy of the transmitted message.
  • the transmitting of the message addressing the destination node 113 is performed directly after the message is received form higher layers. This is to minimize delay.
  • the network node 1 10, 1 11 scans if any message considered to be a relayed copy of the transmitted message is received during a first time interval. This may be performed by comparing the
  • the duration of the first time interval may e.g. be 100 ms, but will typically depend on, e.g., application requirements and the capabilities of the Mesh network.
  • the message may e.g. be a relayed copy of the transmitted message when it is indicated by any one or more out of: the same source node, the same sequence number, and a smaller time to live as the transmitted message is received.
  • the network node 1 10, 1 11 When no message considered being a relayed copy of the transmitted message is received during the first time interval, the network node 1 10, 1 11 , repeats transmitting the message addressing the destination node 1 13. This is since, when no message received during the first time interval is considered to be a relayed copy of the transmitted message, the transmitted message is deemed not to be successfully injected. This means that the message transmitted from the source node 110, 11 1 has not reached any relay node belonging to the mesh network 100, and therefore shall be repeated according to embodiments herein.
  • the repeating to transmit the message addressing the destination node 1 13 is not performed when a repetition count threshold is exceeded.
  • the network node 110, 11 1 decides to not repeat transmitting the message addressing the destination node 1 13. The message is then considered to be injected. This is since, when a message received during the first time interval is considered to be a relayed copy of the transmitted message, the transmitted message is deemed to be successfully injected. This means that the message transmitted from the source node 110, 11 1 has reached at least one relay node belonging to the mesh network 100, and therefore shall not be repeated according to embodiments herein.
  • the network node 110, 111 , 112 being a relay node 110, 112
  • the method comprises the following actions, which actions may be taken in any suitable order.
  • This action is an optional action and may be performed when the network node 110, 1 11 , 112 is a relay node 110, 112.
  • the source node 110, 11 1 has already injected the message as described above and the method described below is started with the relay node 1 10, 1 12 receiving the message from the source node 110, 15 1 11 or another relay node 110, 112 in action 501.
  • the network node 1 10, 1 12 thus
  • This action is an optional action and may be performed when the network node 110, 1 11 , 1 12 is a relay node 110, 112.
  • the network node 110, 1 12 scans if any message considered being a relayed copy of the transmitted message is received. This is performed in order to determine if any other relay nodes in the vicinity relays the message.
  • 1 12 is a relay node 1 10, 1 12, the second time interval referred to in this action 502, occurs before the first time interval referred to in action 504.
  • the wordings "first” and “second” are just used to differentiate the two time intervals from each other and have nothing to do with the order they happen.
  • the duration of the second time interval may e.g. be 50 ms, but will typically depend on the capabilities of the Mesh network and the network configuration.
  • the network node 1 10, 1 12 When no message considered being a relayed copy of the transmitted message is 35 received during the second time interval the network node 1 10, 1 12 transmits the message addressing the destination node 113.
  • the transmitted message or relevant parts of it may be saved in the network node 1 10, 1 12 so that the network node 1 10, 1 12 can compare with messages received during the first time interval and identify if the received message is identical with the transmitted message.
  • the network node 110, 112 may save the message already in Action 501 , when the network node 110, 1 12 receives the message.
  • the network node 1 10, 1 11 , 112 scans if any message considered being a relayed copy of the transmitted message is received.
  • the message may e.g. be a relayed copy of the transmitted message when it is indicated by any one or more out of: the same source node, the same sequence number, and a smaller time to live as the transmitted message is received.
  • the second time interval referred to in action 502 occurs before the first time interval referred to in this action 504.
  • the network node 1 10, 1 11 , 112 repeats transmitting the message addressing the destination node 1 13. This is since, when no message received during the first time interval is considered to be a relayed copy of the transmitted message, the transmitted message is deemed to not having reached any relay node or destination node 1 10, 1 13 belonging to the mesh network 100, and therefore shall be repeated according to embodiments herein.
  • the repeating to transmit the message addressing the destination node 1 13 is not performed when a repetition count threshold is exceeded.
  • Action 506 When a message considered to be a relayed copy of the transmitted message is received, the network node 1 10, 11 1 , 112 decides to not repeat transmitting the message addressing the destination node 1 13. The message is then considered to be successfully transmitted. This is since, when a message received during the first time interval is considered to be a relayed copy of the transmitted message, the transmitted message is deemed to having reached at least one relay node or destination node 1 10, 1 13 belonging to the mesh network 100, and therefore shall not be repeated according to embodiments herein.
  • the transmitting node such as the network node 110, 11 1 , 112
  • the transmitting node can handover the responsibility of the message to these nodes and there is no need for the transmitting node to repeat the transmission further.
  • unnecessary repetitions are avoided, which in turn reduced the traffic in the Mesh network and lowers the interference.
  • the end result is improved performance, e.g., in terms of increased message delivery rate and reduced delay.
  • knowing early on that the transmission were not picked up by any node in the Mesh network facilitates the transmitting node, such as the network node 110, 11 1 , 1 12, to quickly decide that the message should be retransmitted without waiting for any acknowledgement from the destination node.
  • the mechanism is distributed and the decision may be taken locally by the transmitting, node such as the network node 110, 11 1 , 112.
  • Figure 6 is a schematic block diagram illustrating embodiments of the network node 1 10, 1 11 , 1 12 and will be referred to below.
  • the network node 110, 11 1 , 112 may comprise the following arrangement depicted in Figure 6.
  • the network node 110, 11 1 , 112 for transmitting a message in a mesh network 100 to a destination node 113, the network node 1 10, 1 11 , 112 is configured to: e.g. by means of a transmitting module 610 configured to, transmit, the message addressing the destination node 1 13,
  • a scanning module 620 configured to, scan if any message considered to be a relayed copy of the transmitted message is received
  • a repeat transmitting module 630 configured to, repeat to transmit the message addressing the destination node 113
  • a deciding module 640 configured to, decide to not repeat transmitting the message addressing the destination node 1 13.
  • a message is adapted to be a relayed copy of the transmitted message when it is indicated by any one or more out of: the same source node, the same sequence number, and a smaller time to live as the transmitted message is received.
  • the network node 110, 11 1 , 1 12 is a relay node 112
  • the network node 1 10, 1 11 , 112 further being configured to:
  • a receiving module 650 configured to, receive the message addressing the destination node 113, which message is originating from a source node 1 11 ,
  • the network node 110, 1 1 1 , 1 12 is further configured to not perform repeat to transmit the message addressing the destination node 1 13 when a repetition count threshold is exceeded, e.g. by means of the configured repeat transmitting module 630.
  • the network node 110, 11 1 , 112 is a source node 1 11
  • the network node 110, 11 1 , 1 12 further is configured to e.g. by means of the transmitting module 610 configured to, transmit, the message addressing the destination node 1 13 is performed directly after the message is received form higher layers.
  • the network node 1 10, 1 11 , 1 12 may comprise a communication module 660 configured to communicate with any source node 1 10, 11 1 , relay node 110, 112 and/or destination node 1 10, 113.
  • the communication module 660 may comprise a wireless receiver (not shown) and a wireless transmitter (not shown).
  • the embodiments herein for transmitting a message in a mesh network 100, the network node 1 10, 11 1 , 112, may be implemented through respective one or more processors, such as the processor 670 of a processing circuitry in the the network node 1 10, 1 11 , 1 12 depicted in Figure 6, together with computer program code for performing the functions and actions of the embodiments herein.
  • the program code mentioned above may also be provided as a computer program product, for instance in the form of a data carrier carrying computer program code for performing the embodiments herein when being loaded into the network node 110, 1 11 , 1 12.
  • One such carrier may be in the form of a CD ROM disc. It is however feasible with other data carriers such as a memory stick.
  • the computer program code may furthermore be provided as pure program code on a server and downloaded to the network node 110, 1 11 , 1 12.
  • the network node 1 10, 1 11 , 112 may further comprise a memory 680 comprising one or more memory units.
  • the respective memory comprises instructions executable by the processor in the network node 110, 1 11 , 1 12.
  • the memory 680 is arranged to be used to store e.g. information about assigned resources, data, configurations, and applications to perform the methods herein when being executed in the network node 110, 11 1 , 112.
  • the modules in the network node 1 10, 11 1 , 112 described above may refer to a combination of analog and digital circuits, and/or one or more processors configured with software and/or firmware, e.g. stored in the respective memory in the network node 110, 1 11 , 1 12, that when executed by the respective one or more processors such as the processors described above.
  • processors may be included in a single Application-Specific Integrated Circuitry (ASIC), or several processors and various digital hardware may be distributed among several separate components, whether individually packaged or assembled into a system-on-a-chip (SoC).
  • ASIC Application-Specific Integrated Circuitry
  • SoC system-on-a-chip
  • FIG. 7 shows a flowchart illustrating an example of a behavior of the source node
  • the source node 110, 11 1 shall instantly perform the first transmission 702, 503. This may be performed instantly since low delays are favorable and delaying the transmission will not affect chance of successful delivery. The message is then stored for possible later retransmission.
  • the source node 1 10, 1 11 After performing the transmission 702, the source node 1 10, 1 11 shall wait for a first time interval such as e.g. a fixed repetition interval, T, plus a randomized time, t, before performing the next transmission.
  • the randomized time, t may be added to decorrelate the transmissions in time with other repeating transmissions that it may collide with, such as e.g., transmissions from other source nodes or relay nodes whose transmissions collided with the first transmission from the source node 110, 11 1 , and are now also retransmitting their message.
  • the source node 1 10, 1 11 During the first time interval also referred to as the waiting time, the source node 1 10, 1 11 shall keep scanning 703, 504 for incoming messages.
  • the source node 1 10, 1 11 decides 704 whether or not incoming messages are considered to be a copy of the transmitted message. This may be performed by looking at message characteristics of the incoming messages, such as source, sequence number and/or time to live. If messages are considered to be a copy of the transmitted message 705, 506 such as e.g. with the same source and sequence number as the transmitted message are received during the first time interval, this is interpreted as an acknowledgement that the message has been received by the network, and more repetitions will not need to be 5 made. This may be decided by the source network node 110, 11 1.
  • the source node 110, 11 1 shall repeat the transmitting 702 and scanning 703 until copies are heard or until the number of performed transmissions reaches a configured maximum value.
  • a repetition count may be increased 707 by one.
  • the message may not be repeated any more when a repetition count threshold 708 is exceeded 709.
  • the source node 1 10, 1 11 may set the threshold for message repetition to an arbitrary value, here denoted Ns.
  • Ns an arbitrary value
  • a message 15 will then be repeated unless at east Ns copies of the message have been overheard from the network during the observation time T+t.
  • NS may take any integer value greater than 0, and the source node may determine the value of Ns based on knowledge of the number of relay nodes that are within single-hop communication range.
  • Figure 8 shows a flowchart describing the behavior of the network node when being a relay node 1 10, 1 12. Please also see Figure 5.
  • the algorithm shall act in a manner similar to what is described for a source network node 1 10, 1 11 , however, with the following exceptions:
  • the message received 801 from the source network node 110, 11 1 maybe via other relay network nodes 110, 112, e.g. via lower layers of the relay network
  • the transmission shall also be delayed 502 with a second time interval such as e.g. a random time, t 802 before performing first transmission 803, 503.
  • a second time interval such as e.g. a random time, t 802 before performing first transmission 803, 503.
  • the relay network node 1 10, 1 12 may also inspect the TTL of the
  • overheard messages and compare these to the TTL used when transmitted the message, in order to conclude if the message has made further progress into the network.
  • the relay network node 110, 112 shall wait for a first time interval such as_a fixed repetition interval, T, plus a randomized time, t,
  • the randomized time, t is added to decorrelate the transmissions in time with other repeating transmissions that it may collide with.
  • the node shall keep scanning 804, 504 for incoming messages.
  • the relay network node 1 10, 1 12 then decides 805 whether or not incoming messages are considered to be a copy of the transmitted message.
  • the relay network node 110, 112 shall repeat the transmitting 803 and scanning 804 incoming messages until copies are heard or until the number of performed transmissions reaches a configured maximum value.
  • a repetition count may be increased 808 by one.
  • the message may not be repeated any more when a repetition count threshold 809 is exceeded 810.
  • the relay network node 1 10, 1 12 may scan for messages also during the
  • a second alteration is that the relay network node 110, 112 only records copies of the message that have a TTL lower than the TTL used by the relay network node 110,
  • Embodiments herein may use the received copies of a previously transmitted message as acknowledgements to that transmission. This is used to avoid unnecessary repetitions of transmissions and reduce congestions of packets over the channel.
  • the source network node 1 10, 1 11 acts to assure that a transmitted message has been successfully injected into the mesh network 100. This can be assured since relayed copies of the same message have been detected.
  • relay network nodes 1 10, 1 12 act to assure that a forwarded message has been picked up by neighbor relay nodes and progressed further into the mesh network 100. This can be assured since relayed copies of the same message have been detected, the time to live of the messages may be used to indicate that the detected copies stem from later hops.
  • Embodiment 1 A method performed by a network node 1 10, 1 11 , 1 12 for transmitting a message in a mesh network 100 to a destination node 113, the method comprising:
  • scanning 504 if any message considered being a relayed copy of the transmitted message is received,
  • Embodiment 2 The method according to Embodiment 1 , wherein the network node 110, 11 1 , 112 is a relay node 1 12, the method further comprising: receiving 501 the message addressing the destination node 1 13, which message is originating from a source node 1 11 ,
  • scanning 502 if any message considered being a relayed copy of the transmitted message is received,
  • Embodiment 3 The method according to any of the Embodiments 1-2, wherein repeating transmitting 505 the message addressing the destination node 1 13 is not performed when a repetition count threshold is exceeded.
  • Embodiment 4 The method according to Embodiment 1 , wherein the network node 110, 11 1 , 1 12 is a source node 11 1 , and wherein transmitting 503, the message addressing the destination node 113 is performed directly after the message is received form higher layers.
  • Embodiment 5 The method according to any of the Embodiments 1-4, wherein a message is a relayed copy of the transmitted message when it is indicated by any one or more out of: the same source node, the same sequence number, and a smaller time to live as the transmitted message is received.
  • Embodiment 6 A computer program 690 comprising instructions, which when executed by a processor 670, cause the processor 670 to perform actions according to any of the Embodiments 1-5.
  • Embodiment 7 A carrier 695 comprising the computer program of Embodiment 6, wherein the carrier is one of an electronic signal, an optical signal, an electromagnetic signal, a magnetic signal, an electric signal, a radio signal, a microwave signal, or a computer-readable storage medium.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé exécuté par un nœud de réseau pour transmettre un message dans un réseau maillé à un nœud de destination. Le nœud de réseau transmet (503) le message adressant le nœud de destination. Pendant un premier intervalle de temps, le nœud de réseau explore (504) si un message considéré comme étant une copie relayée du message transmis est reçu. Lorsqu'aucun message considéré comme étant une copie relayée du message transmis est reçu pendant le premier intervalle de temps, le nœud de réseau répète la transmission (505) du message adressant le nœud de destination. Lorsqu'un message considéré comme étant une copie relayée du message transmis est reçu, le nœud de réseau décide (506) de ne pas répéter de transmettre le message adressant le nœud de destination.
PCT/SE2017/050543 2017-02-17 2017-05-23 Nœud de réseau et procédé associé pour transmettre un message dans un réseau maillé Ceased WO2018151640A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201762460107P 2017-02-17 2017-02-17
US62/460,107 2017-02-17

Publications (1)

Publication Number Publication Date
WO2018151640A1 true WO2018151640A1 (fr) 2018-08-23

Family

ID=63169960

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2017/050543 Ceased WO2018151640A1 (fr) 2017-02-17 2017-05-23 Nœud de réseau et procédé associé pour transmettre un message dans un réseau maillé

Country Status (1)

Country Link
WO (1) WO2018151640A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021176279A1 (fr) * 2020-03-06 2021-09-10 International Business Machines Corporation Configuration de nœuds informatiques dans une topologie maillée tridimensionnelle
US11153803B2 (en) 2017-10-27 2021-10-19 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for updating the number of retransmissions in a wireless mesh network
CN116137581A (zh) * 2021-11-16 2023-05-19 意法半导体股份有限公司 用于具有广播消息的网状通信网络的装置和方法
WO2023055853A3 (fr) * 2021-09-28 2023-06-15 Semitech Semiconductor Pty Ltd Routage amélioré pour algorithme trickle

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2512733A (en) * 2014-02-25 2014-10-08 Cambridge Silicon Radio Ltd Broadcast retransmission

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2512733A (en) * 2014-02-25 2014-10-08 Cambridge Silicon Radio Ltd Broadcast retransmission

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
LEVIS P. ET AL.: "The Trickle Algorithm", INTERNET ENGINEERING TASK FORCE (IETF) , RFC 6206, March 2011 (2011-03-01), XP055535853, Retrieved from the Internet <URL:https://www.ietf.org/rfc/rfc6206.txt> [retrieved on 20171017] *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11153803B2 (en) 2017-10-27 2021-10-19 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for updating the number of retransmissions in a wireless mesh network
WO2021176279A1 (fr) * 2020-03-06 2021-09-10 International Business Machines Corporation Configuration de nœuds informatiques dans une topologie maillée tridimensionnelle
US11184245B2 (en) 2020-03-06 2021-11-23 International Business Machines Corporation Configuring computing nodes in a three-dimensional mesh topology
GB2608556A (en) * 2020-03-06 2023-01-04 Ibm Configuring computing nodes in a three-dimensional mesh topology
US11646944B2 (en) 2020-03-06 2023-05-09 International Business Machines Corporation Configuring computing nodes in a three-dimensional mesh topology
WO2023055853A3 (fr) * 2021-09-28 2023-06-15 Semitech Semiconductor Pty Ltd Routage amélioré pour algorithme trickle
CN116137581A (zh) * 2021-11-16 2023-05-19 意法半导体股份有限公司 用于具有广播消息的网状通信网络的装置和方法
US12278673B2 (en) 2021-11-16 2025-04-15 Stmicroelectronics S.R.L. Apparatus and methods for mesh communication networks with broadcast messages

Similar Documents

Publication Publication Date Title
US10477543B2 (en) Methods and systems for improved communication in multi-hop networks
US11284295B1 (en) Reliable efficient flooding in MANET
AU2003296959B2 (en) System and method for link-state based proxy flooding of messages in a network
US7697450B2 (en) Method and apparatus for broadcast in an ad hoc network with dynamic selection of relay nodes
KR100943174B1 (ko) 중계확률 기반의 무선 네트워크에서 메시지 전달 방법
US8068491B2 (en) Methods for reliable multicasting in local peer group (LPG) based vehicle ad hoc networks
US9531632B2 (en) Method for controlling flood broadcasts in a wireless mesh network
JP5328793B2 (ja) 中継ネットワークのマルチキャスト／ブロードキャストサービスにおけるアイドル期間を利用したａｒｑ対応型事前送信のための方法
KR100943175B1 (ko) 동적 기반의 메시지 전달 방법을 이용한 무선 센서네트워크 및 그 제어방법
US20030227934A1 (en) System and method for multicast media access using broadcast transmissions with multiple acknowledgements in an Ad-Hoc communications network
US20100157888A1 (en) System and method for improving efficiency and reliability of broadcast communications in a multi-hop wireless mesh network
US20100157889A1 (en) System and method for improving efficiency of broadcast communications in a multi-hop wireless mesh network
JP5653535B2 (ja) 通信装置およびアドホックネットワークシステム
US20170117978A1 (en) Method for selecting ttl for a mesh network
JP2004274753A (ja) アドホックネットワーク環境で確実にブロードキャストするシステム及び方法
WO2018151640A1 (fr) Nœud de réseau et procédé associé pour transmettre un message dans un réseau maillé
Xiong et al. Optimal strategies for cooperative MAC-layer retransmission in wireless networks
US20140010138A1 (en) Confirmed link level broadcast using parallel receivers
US10624017B2 (en) Method for operating a communication apparatus and communication apparatus
EP2692071B1 (fr) Transmission collaborative
KR101136051B1 (ko) 무선 이동 멀티홉 네트워크 시스템에서의 멀티캐스트 라우팅 방법
US12317167B2 (en) Method of, and a node device for, supporting establishment of a path from a source node to a destination node in wireless mesh network
KR101008978B1 (ko) 애드 혹 네트워크 환경에서 신뢰성 있게 브로드캐스팅하는시스템 및 방법
KR101293159B1 (ko) 무선 애드혹 네트워크에서의 브로트캐스트 패킷 전송 방법 및 장치, 및 브로드캐스트 패킷 송수신 시스템
JP2021500798A (ja) 無線メッシュネットワークにおける再送回数を更新するための方法およびデバイス

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17896739

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17896739

Country of ref document: EP

Kind code of ref document: A1