WO2017160223A1 - Procédés et agencements pour prendre en charge un routage dans un réseau maillé basé sur bluetooth ® - Google Patents

Procédés et agencements pour prendre en charge un routage dans un réseau maillé basé sur bluetooth ® Download PDF

Info

Publication number
WO2017160223A1
WO2017160223A1 PCT/SE2017/050262 SE2017050262W WO2017160223A1 WO 2017160223 A1 WO2017160223 A1 WO 2017160223A1 SE 2017050262 W SE2017050262 W SE 2017050262W WO 2017160223 A1 WO2017160223 A1 WO 2017160223A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
routing
response
receipt
Prior art date
Application number
PCT/SE2017/050262
Other languages
English (en)
Inventor
Jingcheng Zhang
Per Elmdahl
Thomas Rimhagen
Wei Shen
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
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 (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Publication of WO2017160223A1 publication Critical patent/WO2017160223A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1657—Implicit acknowledgement of correct or incorrect reception, e.g. with a moving window
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092—Error control systems characterised by the topology of the transmission link

Definitions

  • Embodiments herein relate to methods and arrangements for supporting routing between a source node and a destination node of a Bluetooth®, such as a Bluetooth Low Energy (BLE), based mesh network.
  • a Bluetooth® such as a Bluetooth Low Energy (BLE)
  • BLE Bluetooth Low Energy
  • wireless communication devices such as wireless communication devices, that simply may be named wireless devices, may also be known as e.g. User Equipments (UEs), mobile terminals, wireless terminals and/or Mobile Stations (MS).
  • UEs User Equipments
  • MS Mobile Stations
  • a wireless device is enabled to communicate wirelessly in a wireless communication network, which may also be referred to as a wireless communication system, or radio communication system.
  • the wireless device may further be referred to as a mobile telephone, cellular telephone, laptop,
  • Wireless devices may be so called Machine to Machine (M2M) devices or Machine Type of Communication (MTC) devices, i.e. a device that is not necessarily associated with a conventional user, such as a human, directly using the device.
  • M2M Machine to Machine
  • MTC Machine Type of Communication
  • a wireless device may be in principle any device or unit capable to wirelessly communicate over a radio link, e.g. in a wireless communication network.
  • the wireless device may be, for example, portable, pocket-storable, hand-held, computer-comprised, or vehicle-mounted mobile device, enabled to communicate voice and/or data, with another entity, such as another wireless device or a server.
  • Bluetooth® is a wireless communication technology for exchanging data over short distances.
  • Bluetooth Low Energy (BLE) is a wireless personal area network technology designed by the Bluetooth Special Interest Group (SIG) aimed at novel applications in the healthcare, fitness, security, and home automation industries. Compared to so called Classic Bluetooth, BLE is intended to provide considerably reduced power consumption and cost while maintaining a similar communication range. On the other hand, the amount of data being transmitted by BLE devices is much less than Classic Bluetooth devices.
  • BLE is e.g. described in Bluetooth Core Specification 4.2, and is also marketed under the mark Bluetooth Smart.
  • BLE is a wireless technology that may be used in so called Personal Area Networks (PAN).
  • PAN Personal Area Networks
  • BLE Smart Mesh There is on-going work that aim at extending the network coverage of BLE network, known as BLE Smart Mesh. This technology uses the BLE Advertisement Channel for data communication so that any two nodes can communicate within the network without establishing a BLE connection based on a data channel.
  • a mesh network is a network where each node of the network, which nodes may be referred to as mesh nodes, may be involved in relaying data, i.e. the mesh nodes may be considered to cooperate in delivery data in the network.
  • routing reduces the number of messages being
  • routes may be established between a source (SRC) node to a destination (DST) node. This may be compared with a flooding based network where each node simply forwards every received message.
  • SRC source
  • DST destination
  • An object is to provide one or more improvements regarding routing in a BLE mesh network, i.e. in a routing enabled BLE mesh network.
  • the object is achieved by a first method, performed by a first node of a Bluetooth based mesh network, for supporting routing in said mesh network between a source node and a destination node via one or more intermediate nodes.
  • the first node sends a message to another, second node of the mesh network, which second node is neighbouring the first node in said routing.
  • the message being any one of the following: a unicast message being routed according to said routing, a group-cast message being routed according to said routing, and a route response, "RREP", message sent as part of creating a route for said routing.
  • the first node then listens for a receipt acknowledging response sent by the second node in response to receipt of the sent message.
  • the object is achieved by a computer program comprising instructions that when executed by a first node of a Bluetooth based mesh network causes the first node to perform the method according to the first aspect.
  • the object is achieved by a computer readable medium comprising the computer program according to the second aspect.
  • the object is achieved by a second method, performed by a second node of a Bluetooth based mesh network, for supporting routing in said mesh network between a source node and a destination node via one or more intermediate nodes.
  • the second node receives a message from another, first node of the mesh network, which first node is neighbouring the second node in said routing.
  • the message being any one of the following: a unicast message being routed according to said routing, a group-cast message being routed according to said routing, and a RREP message, sent as part of creating a route for said routing.
  • the second node sends, in response to the received message, a receipt acknowledging response to the first node.
  • the object is achieved by a computer program comprising instructions that when executed by a second node of a Bluetooth based mesh network causes the second node to perform the method according to the fourth aspect.
  • the object is achieved by a computer readable medium comprising the computer program according to the fifth aspect.
  • the object is achieved by a first node, configured to operate as a node in a Bluetooth based mesh network, for supporting routing in said mesh network between a source node and a destination node via one or more intermediate nodes.
  • the first node is further configured to send a message to another, second node of the mesh network, which second node is neighbouring the first node in said routing.
  • the message being any one of the following: a unicast message being routed according to said routing, a group-cast message being routed according to said routing, and a RREP message sent as part of creating a route for said routing.
  • the first node is configured to listen for a receipt acknowledging response sent by the second node in response to receipt of the sent message.
  • the object is achieved by a first node, configured to operate as a node in a Bluetooth based mesh network for supporting routing in said mesh network between a source node and a destination node via one or more intermediate nodes.
  • the second node is further configured to receive a message from another, first node of the mesh network, which first node is neighbouring the second node in said routing.
  • the message being any one of the following: a unicast message being routed according to said routing, a group-cast message being routed according to said routing, and a RREP message sent as part of creating a route for said routing.
  • the second node is configured to send, in response to the received message, a receipt acknowledging response to the first node.
  • triplet messages and acknowledgements can be avoided to some extent, e.g. when not adding any value.
  • a message of a triplet may e.g. be acknowledged whereby later messages of the triplet, i.e. message copies, and/or related acknowledgements can be stopped and avoided. Thereby another, new message may be sent sooner than else would be the case, i.e. throughput increase. Also time redundant signalling can be avoided and thereby further energy be saved.
  • Figure 1 schematically illustrates mesh message triplet transmissions on three advertisement channels.
  • Figure 2 schematically shows a unicast routing path example.
  • Figure 3 schematically shows a group-cast routing example.
  • Figure 4 schematically shows a route request propagation example.
  • Figure 5 is a block diagram schematically depicting an example of a wireless communication network in which embodiments herein may be implemented.
  • Figure 6 schematically shows an example of implicit message acknowledgement according to some embodiments herein.
  • Figure 7 schematically illustrates advertising events and such that can be cancelled.
  • Figure 8 schematically shows an example of explicit acknowledgement for group- cast according to some embodiments herein.
  • Figure 9 is a combined signaling diagram and flowchart for describing some embodiments herein.
  • Figure 10 is a flowchart schematically illustrating a first method according to some embodiments herein.
  • Figure 11 is a functional block diagram for illustrating embodiments of a first node according to some embodiments herein and how it can be configured to carry out the first method.
  • Figure 12 is a flowchart schematically illustrating a second method according to some embodiments herein.
  • Figure 13 is a functional block diagram for illustrating embodiments of a second node according to some embodiments herein and how it can be configured to carry out the second method.
  • Figures 14a-c are schematic drawings illustrating embodiments relating to computer programs and computer readable media to cause the first node and the second node to perform the first and second method, respectively.
  • FIG. 1 schematically illustrates mesh message triplet transmissions on three advertisement channels.
  • each message is sent using 3 advertising events.
  • the message e.g. a mesh packet
  • the message is sent in three, i.e. typically all, advertisement channels.
  • a message thus needs to be repeated, i.e. transmitted, 9 times before a next message can be started to be sent.
  • the mesh node can immediately start sending another, second message. From the number of packets point of view, a mesh node can e.g. save the energy for sending the following 6 messages for two advertising events. More importantly, from the time point of view, this would increase the message sending rate of 66% by saving 2/3 of the message transmission time.
  • Figure 2 schematically shows a unicast routing path example, with an example of a created message route for unicast and will now be used to discuss an acknowledgement problem for unicast message routing. It will also be indicated a solution to this problem according to embodiments herein that will be further explained and discussed separately further below.
  • a node A tries to send message to a single destination mesh node B.
  • a message being forwarded along the path can be either a reliable message or an unreliable message, which is indicated by the message originator, i.e. source node, A.
  • the destination node B Upon receiving a reliable message, the destination node B will issue an application layer acknowledgement to the message originator; this is known as end to end acknowledgement.
  • the message originator does not expect any application layer acknowledgement.
  • Figure 3 schematically shows a group-cast routing example and will now be used for discussing an acknowledgement problem for group-cast message routing. It will also be indicated a solution to this problem according to embodiments herein that will be further explained and discussed separately further below.
  • Group-cast routing is used when a message needs to be sent to multiple destination nodes.
  • the destination address of the mesh packet is set to the group address which multiple devices subscribe to and thus are associated with.
  • FIG. 3 a device, or node, A sends a message to a group address B which nodes P, Q,
  • a mesh packet may be considered acknowledged only if the message sender receives the acknowledgements from all next hop nodes as the number of next hop devices. For example, when A first sends the message packet, it should receive three acknowledgement, from device Y, M and P.
  • device N forwards the mesh packet, it is considered acknowledged if it receives an acknowledgement from device X.
  • Figure 4 schematically shows a route request propagation example and will now be used for discussing an acknowledgement problem during route discovery. It will also be indicated a solution to this problem according to embodiments herein that will be further explained and discussed separately further below.
  • a route is created by mainly using two kinds of messages, route request (RREQ) messages and route response (RREP) messages.
  • RREQ route request
  • RREP route response
  • a route request is broadcast to the whole network.
  • each node potentially receives multiple route requests, i.e. RREQs.
  • a node A may initiate a route request, i.e. a RREQ, that looks for a node B.
  • node P receives in total 3 route request from nodes A, M, and E
  • node Q receives 4 requests from nodes M, N, P, and F.
  • a mesh node Upon receiving a RREQ, a mesh node responds by sending a unicast RREP to the node that sends the RREQ with the best metric.
  • This metric can for example be a
  • RSSI Received Signal Strength Indicator
  • the sender has to wait until the timeout of the current route discovery before it can retry to establish the route again.
  • the RREP sender can instead choose the next best
  • FIG. 5 is a block diagram schematically depicting a wireless communication network 100 comprising network nodes or simply nodes, such as a source node 121 , a first intermediate node 122, a second intermediate node 123 and a destination node
  • Said nodes may e.g.
  • the nodes may correspond to or be wireless communication devices, e.g. such wireless devices described elsewhere herein.
  • Such wireless devices and thus e.g. the nodes 121..124 may be configured to communicate according to one or more RATs, where at least one RAT should be Bluetooth, such as
  • a routing enabled BLE network e.g. a so called mesh network.
  • the wireless communication network 100 is thus preferably a Bluetooth network, such as a BLE network and may in particular be a routing enabled BLE mesh network. In the wireless communication network 100 routes may be established between a source
  • 35 node e.g. the source node 121
  • one or more destination nodes e.g. the destination node 124.
  • a route may in general be between a source, or originating, node for a message and one or more destination, or target or final recipient, nodes for the message.
  • the routing and/or the message may utilize and/or comprise only one layer of address, e.g. an address of the source node 121 and an address of the destination node 124. This may be inherent or given by the type of RAT that the nodes 121..124 operate according to in the wireless communication network 100, e.g. according to Bluetooth and/or BLE in a routing enabled mesh network.
  • the communication between the nodes 121..124 typically takes place of one or more wireless communication links, such as radio links, 115, 116, 117, that preferably are symmetric and may be common between one or more of the nodes 121..124.
  • the one or more wireless communication links 115..117 may thus be Bluetooth links and may be low power, short range wireless communication links, such as used in BLE. That is, the radio links may be based on BLE or be BLE wireless communication links.
  • low power wireless communication link may generally be meant that there is an upper limit associated with, e.g. of allowed and/or specified for and/or that restricts, transmit power over the communication link, and that this upper limit is comparatively low, e.g. compared to allowable transmit power according to other wireless communication technologies than of the wireless communication link.
  • Bluetooth and BLE use low power wireless communication links that, as recognized by the skilled person, are associated with substantially lower transmit power than e.g. base stations and user equipments in conventional wireless communication networks for telecommunication, e.g. based on Long Term Evolution (LTE).
  • LTE Long Term Evolution
  • the upper transmit power limit associated with each of the wireless communication links 115..117 may be e.g. 10 dBm, although normally even lower transmit power is used.
  • the low power also restricts the communication range.
  • communication range provided by a wireless communication link is also dependent on other factors associated with the wireless communication link, such as coding scheme, how communication errors are handled, interference and noise robustness, receiver sensitivity etc.
  • short range wireless communication link is generally meant that there is an upper communication range or distance associated with a satisfying or working communication over the wireless communication link, and that this range or distance is comparatively short, e.g. compared to communication ranges according to other wireless communication technologies than of the wireless
  • Bluetooth and BLE have short communication range, as recognized by the skilled person, compared to communication ranges between base stations and user equipments in LTE.
  • the upper communication range associated with any of the wireless communication links 115... 1 17 may e.g. be in the magnitude of one or a few hundred meters, such as 500 m, possibly up to e.g. 1 km, such as when a highest allowable transmit power is used and there is more or less perfect environmental circumstances, line of sight etc.
  • a wireless communication network or networks that in reality correspond(s) to the wireless communication network 100 will typically comprise several further network nodes, such as further wireless communication devices, etc., as realized by the skilled person, but which are not shown in the figure for the sake of simplifying.
  • embodiments are first split into three different groups.
  • a first group of embodiments is about an implicit
  • acknowledgement mechanism for use in unicast message forwarding is about an explicit acknowledgement mechanism for us in group-cast message forwarding.
  • a third group of embodiments is about an acknowledgement mechanism for route creation, i.e. for use in the route discovery process. Implicit acknowledgement for unicast message routing
  • Implicit acknowledgement does not require the node who receives the message to send back any specific or explicit acknowledgement message. Instead, as long as the message sender hears that its sent message is being forwarded by the message receiver, the message sender considers the message to be acknowledged according to these embodiments.
  • the implicit acknowledgement may be considered associated with the following assumptions on characteristics that may correspond to features that should be supported by the network comprising the nodes, such as the wireless communication network 100:
  • the radio link between the sender and the receiver is symmetric, i.e., if a message sent from A and be received from B, then a message sent from B can be received by A as well. For example, if a message is sent from the source node 121 over the wireless communication link 1 15 and is received by the first intermediate node 122 that sends it further to the second intermediate node 123 over the wireless communication link 116, then the source node 121 can also hear the message being sent further.
  • a Bluetooth based mesh network that is routing enabled and as discussed above has these characteristics.
  • FIG. 6 schematically shows an example of a mesh network 100a, e.g.
  • FIG. 6 schematically illustrates a situation regarding implicit acknowledgement for unicast message routing.
  • a unicast route exists between a node A, e.g. corresponding to the source node 121 , and a node B, e.g. corresponding to the destination node 124, via a node M, e.g. corresponding to the first intermediate node 122, and via a node N, e.g. corresponding to the second intermediate node 123.
  • a message "MSG AM" is sent from node A and received by node M.
  • node M Once node M receives this message, it will forward the message, as a message "MSG MN" in the figure, to node N. With a radio link being symmetric, "MSG MN" will typically also be received by node A. Once node A receives "MSG MN", it shall according to some embodiments consider the sent "MSG AM” as being acknowledged. Similarly, subsequent nodes performs similarly until the message reaches node B, i.e. the destination node 124 in this case. That is, in the example, node N forwards the message as a message "MSG NB" to node B.
  • a source address (SRC), e.g. of node A and/or the source node 121 , and a destination address (DST), e.g. of node B and/or the destination node 124, and any sequence number (SEQ) field shall not be changed during message forwarding.
  • SRC source address
  • DST destination address
  • SEQ sequence number
  • the only difference between "MSG AM” and "MSG MN” may therefore e.g. be a Time To Live (TTL) field of a packet associated with the message, e.g. a packet that the message is comprised in.
  • TTL Time To Live
  • the TTL value of "MSG MN” should be the TTL value of "MSG AM" minus 1.
  • the destination node i.e. node B in the example. Since node B here is the destination node, it would conventionally, when it receives message from A, not forward the message. However, in order for node N to be able to receive an implicit acknowledgement also in this case, node B should nevertheless, according to some embodiments herein, send out, i.e. forward, the received message but with TTL set to 0 meaning the message will and should not be forwarded further in any case. This "forwarding" by the destination node B is illustrated by a message "MSG BB" in Figure 5.
  • FIG. 7 schematically illustrates an example of this.
  • a node in a mesh network e.g. the node A and/or the source node 121 , starts sending a message using an advertisement event 0, and since there is no acknowledgement received, the same message is also sent by the same node using a next advertising event, an advertisement event 1.
  • the message is acknowledged in an advertisement (ADV) channel (Ch) 0.
  • ADV advertisement
  • Ch channel
  • the node A can cancel any further message transmissions of this message, which transmissions else should follow e.g. in an ADV Ch 1 and in an ADV Ch 2.
  • node A can instead already start sending a new message in a subsequent advertisement event, e.g. an advertisement event 2, that else would have been used for the first message.
  • this new message is acknowledged in ADV Ch 1 , and thus the node A can cancel further message
  • the above mentioned explicit acknowledgement mechanism is instead utilized.
  • a node Once a node receives a sent message, it returns an acknowledgement message to the sender. To increase the success rate for the message sender to receive the acknowledgement, the acknowledgement is advantageously sent back after a random delay.
  • the message Upon receiving the acknowledgements from all next hop nodes, i.e. the nodes that the message is sent to, the message may be considered acknowledged.
  • the explicit acknowledgement may be considered associated with the following assumptions on characteristics that may correspond to functionality that should be supported by a network comprising the nodes, e.g. the wireless communication network 100:
  • the message sender in each link should know, such as has information about, nodes, e.g. a node list, that it may expect acknowledgements from. • Once a message is received by an intermediate node on the path to the final destination, the intermediate node knows where the message comes from. This may e.g. be achieved by adding a previous hop, e.g. the preceding node, in a routing table.
  • FIG 8 schematically shows an example of a mesh network 100b, e.g.
  • Figure 8 schematically illustrates a situation regarding explicit acknowledgement for group-cast routing.
  • a node A' e.g. corresponding to the source node 121 , wants to send a message to a group address b that is associated with nodes X', ⁇ ', ⁇ ', ⁇ ', and Q'.
  • Each of these nodes thus corresponds to a destination node, i.e. may correspond to the destination node 124, and the nodes X', ⁇ ', ⁇ ', P' and Q' have therefore in the figure been named destination nodes 124a-e, respectively.
  • node A' is to send a message to the group address b
  • node A e.g.
  • node A sends a message "MSG A" and node A can know that there are three nodes that should receive this message, here nodes ⁇ ', ⁇ ', and ⁇ '. In this case, node A' may only consider "MSG A” as acknowledged when it has received all acknowledgements, i.e. from all these nodes, which acknowledgements are named "ACK YA", "ACK MA” and "ACK PA” in the figure.
  • acknowledgements are named "ACK YA", "ACK MA” and "ACK PA” in the figure.
  • each acknowledgement i.e. an explicit ACK in contrast to the implicit type of acknowledgement discussed above, can be sent as a new unicast message type, which e.g. may comprise fields as shown in Table 1 below.
  • node M' may be important to know the previous hop and next hop for the explicit acknowledgement and this information may be part of a routing table, see e.g. an exemplifying routing table of node M' shown in Table 2 below.
  • Table 2 thus schematically shows a routing table example for explicit acknowledgement in group-cast.
  • node M' receives a message with a source address of node A', i.e. a source address addr(A'), and with a destination address b, it knows that the message comes from node A according the information from the previous hop. So it will send a unicast
  • acknowledgement message to A'. Moreover, when it retransmits the message, it expects two acknowledgements from node N' and Q', which are recorded in the next hop field.
  • AODV Acknowledgement during route creation, i.e. for use in the route discovery process
  • a routing entry is created when a RREP is received.
  • AODV and RREP was explained above when Figure 4 was discussed.
  • AODV may be extended by making nodes send an acknowledgement which indicates successful reception of the RREP.
  • a current node routing status may also be included in this acknowledgement.
  • all the neighbor nodes that receive this acknowledgement e.g. an acknowledgement message, should update the routing status of the node in question.
  • the above embodiments relate to acknowledgement mechanisms suitable for a routing enabled BLE mesh network.
  • an implicit acknowledgement mechanism is proposed.
  • an explicit routing mechanism is proposed.
  • route creation another explicit acknowledgement mechanism is proposed that improves and enable optimizing the route selection and creation process.
  • a sent message may be considered acknowledged when the sender of a message has received the same message in response to that the message has been relayed by some other mesh node within the network.
  • a message may be considered acknowledged when the sender has received an explicit acknowledgement from the receiver or receivers of the message, i.e. the succeeding node or nodes in the route.
  • the acknowledgement mechanism proposed for route creation may both increase the route creation reliability and also better balance the load of the whole network.
  • the route can be created by utilizing the most up to date path information when deciding the route.
  • Said implicit acknowledgement mechanism e.g. increases a peer to peer message reliability without introducing any extra message transactions.
  • An exception is that it may require the destination node to broadcast its received message. However, the number of message retransmissions along the route should still be reduced compared to
  • Said proposed implicit and explicit acknowledgement mechanisms may e.g. be utilized to detect the link status between two nodes. If a message is not acknowledged, the link can be considered broken. As a result, a faster link broken detection can be achieved thanks to embodiments herein.
  • acknowledgement of RREP provides the possibility to balance the load of the network so that the load can be more evenly distributed over the network.
  • Figure 9 depicts a combined signalling diagram and flowchart, which will be used to discuss embodiments herein for supporting routing in a wireless communication network that may be exemplified by the wireless communication network 100 in the following, and/or by the mesh networks 100a and 100b when applicable for some embodiments, as should be recognized by the skilled person.
  • the embodiments are relating to methods and actions performed by, and to, nodes for communication in the wireless
  • routes may be established between a source node, e.g. the source node 121 , and one or more destination nodes, e.g. the destination node 124 or the destination nodes 124a-e.
  • the route is between a source, or originating, node for message and one or more destination, or target or final recipient, nodes for the message.
  • the routing and/or the message may utilize and/or comprise only one layer of address, e.g. an address of the source node and an address of the destination node.
  • first node e.g. any one of the nodes 121-123 and 124a
  • second node e.g. any one of the node 122-124, 124a-e.
  • the second node is a subsequent, or in some embodiments a preceding, node to the first node according to the routing, i.e. according to a route, between the source node and said one or more destination nodes.
  • the first node and the second node are neigbouring each other in the routing.
  • the second node may thus e.g. be a next hop node.
  • the first node sends, in association with a route for routing of a message, the message to the second node that accordingly may receive the message.
  • the second node may thus receive the message in association with a route for routing of a message.
  • Sending in association with the route may e.g. comprise or involve sending the message as part of routing of the message, or as part of finding, such as discovering or creating, the route for routing of the message.
  • receiving in association with the route may e.g. comprise or involve receiving the message as part of routing of the message, or as part of finding, such as discovering or creating, the route for routing of the message.
  • the second node is a node that is succeeding or preceding the first node in the route, or in other words a node that according to the route follows directly after or directly before the first node.
  • the second node may be referred to as a next hop node when it is succeeding the first node.
  • the message may be sent by forwarding it after the first node has received the message from another node, or the first node may be the source node.
  • the second node may be an intermediate node or the destination node.
  • the message is a unicast message, i.e. a message for unicast.
  • the message may hence be a message with a single destination node.
  • the routing may be unicast message routing.
  • the message is a group-cast message, i.e. a message for group casting.
  • the message may hence be a message with multiple destination nodes, or in other words a message for receipt by a group of nodes.
  • the routing may be group cast routing.
  • the message is a route response message, i.e. a RREP message, sent as part of finding said route.
  • the first node listens for a response sent by the second node in response to receipt of the sent message in Action 901.
  • the response may have a predetermined meaning that may be specific for the first node, i.e. may have a specific meaning to the first node, and which meaning is that receipt of the message has been acknowledged by the second node.
  • the response may thus correspond to an acknowledgement.
  • the acknowledgement need not be explicit, it may be implicit, such as when the response may have another meaning than
  • acknowledgement for other nodes of the network which may be other nodes associated with the route, including e.g. the second node.
  • the first node may stop listening for the response.
  • the trigger e.g. lapse of a time period
  • the time period may be based on when a response is no longer possible and/or not likely to occur and/or no longer relevant, e.g. no longer of any use.
  • the time period may be set based on that messages are sent in triplets with known timing, and/or the trigger may be receipt of a subsequent message of the triplet or acknowledgement of such message.
  • the response may be the message being forwarded, i.e. being sent forward, as part of the routing, i.e. according the route, by the second node.
  • the first node is the source node 121 and the second node is the first intermediate node 122 that forwards the message to a third node that is the second intermediate node 123
  • this forwarding of the message may be the response and an implicit acknowledgement for the source node 121 with a meaning that the message sent to first intermediate node 122 was received by the first intermediate node 122.
  • the forwarded message should be configured so that it is thereafter not forwarded by any further node, e.g. by having a time to live value (TTL) that is zero.
  • TTL time to live value
  • the message is thus forwarded by the second node despite that the second node is the destination node 124.
  • TTL time to live value
  • the second node is preferably sending the message using, such as over, a radio link that is symmetric and that may be common between the first node, the second node and/or the third node, e.g. radio links 1 15 and 1 16 that may be symmetric and common for communication between the source node 121 and the first intermediate node 122 and communication between the first intermediate node 122 and the second intermediate node 123.
  • a radio link that is symmetric and that may be common between the first node, the second node and/or the third node, e.g. radio links 1 15 and 1 16 that may be symmetric and common for communication between the source node 121 and the first intermediate node 122 and communication between the first intermediate node 122 and the second intermediate node 123.
  • the symmetric radio link may be inherent owing to the type of network and or radio access technology being used.
  • the response may be an acknowledgement message that is another message than the group cast message being acknowledged.
  • said another message may be a specific and/or explicit acknowledgement message, e.g. for group-cast messages.
  • the acknowledgement message is typically generated by the second node in response to receipt of the group cast message.
  • the acknowledgement message is advantageously sent by the second node after a random delay, e.g. a random time period, i.e. before sending the acknowledgement message the second node may first wait said random time period.
  • the random delay may be random within certain limits that typically are predetermined and/or predefined.
  • the delay may be randomized within a range of 0 to x s, where x is a predefined and/or predetermined number. If or when an upper limit of the delay, e.g. x, is known by the first node, it need of course not listen for the response after the delay has passed.
  • the response may be an acknowledgement message that is another message than the RREP message, in other words said another message may be a specific and/or explicit acknowledgement message, e.g. for RREP messages.
  • the acknowledgement message should be broadcasted, e.g. sent as a broadcast message, by the second node and should be configured so that it is not forwarded by any further node, e.g. by having a TTL that is zero.
  • the second node sends, in response to the received message in Action 901 , a response to the message, i.e. may send such a response that the first node is listening for in Action 902.
  • the response may thus be that the second node forward the message, sending the message forward as part of the routing, i.e. according the route, e.g. to said third node.
  • the forwarded message may be configured as described above.
  • the second node is preferably sending the message over a radio link as also described above.
  • the response may be an acknowledgement message as described above.
  • the acknowledgement message may be generated by the second node in response to receipt of the group cast message.
  • the second node preferable sends the acknowledgement message after a random delay as described above.
  • the response may be an acknowledgement message as described above.
  • the second node should broadcast the acknowledgement message, e.g. send it as a broadcast message, and it should preferably be configured so that it is not forwarded by any further node, e.g. by having a TTL that is zero.
  • the first node may identity, and may thus receive, the response that the first node is listening for and that was sent by the second node in Action 903.
  • the first node may then e.g. determine, based on the identified response, that the message sent in Action 901 was and has been received by the second node. That is, in other words, the first node may determine that it has been acknowledged that the message sent to the second node was received by the second node.
  • the first node may, in response to the identification and/or determination, e.g. update routing status for the second node.
  • explicit and implicit acknowledgments as described above and associated with the routing are enabled and/or accomplished, and thereby more robust routing is enabled and/or delays during routing can be avoided, and energy be saved.
  • triplet messages and acknowledgements can be avoided to some extent, e.g. when not adding any value.
  • a message of a triplet may be acknowledged whereby later messages of the triplet, i.e. message copies, and/or related
  • acknowledgements can be stopped and avoided. Thereby another, new message may be sent sooner than else would be the case, i.e. throughput increase. Also time redundant signalling can be avoided and energy thereby be saved.
  • Figure 10 is a flow chart schematically illustrating embodiments of a first method, performed by a first node of a Bluetooth based mesh network, e.g. of the wireless communication network 100, the mesh network 100a or the mesh network 100b.
  • the method is for supporting routing in said mesh network between a source node, in the following exemplified by the source node 121 and a destination node, in the following exemplified by the destination node 124, via one or more intermediate nodes, e.g. the first intermediate node 122 and/or the second intermediate node 123.
  • the first node may e.g. be the source node 121 , the first intermediate node 122 or the second intermediate node 123.
  • the method comprises the following actions, which actions may be taken in any suitable order and/or be carried out fully or partly overlapping in time when this is possible and suitable.
  • the first node sends a message to another, second node of said mesh network, which second node is neighbouring the first node in said routing.
  • the second node may e.g. be the first intermediate node 122 when the first node is the source node 121 , be the second intermediate node 123 when the first node is the first intermediate node 122, or be the destination node 124 when the first node is the second intermediate node 123.
  • the message is any one of the following:
  • a route response message i.a. a RREP message, sent as part of creating a route for said routing.
  • Action 1002 may fully or partly correspond to action 901 as described above.
  • Action 1002 may fully or partly correspond to action 901 as described above.
  • the first node listens for a receipt acknowledging response sent by the second node in response to receipt of the sent message.
  • the message is said unicast message, and said receipt acknowledging response is the message being sent forward by the second node as part of the routing to a third node of the mesh network.
  • said receipt acknowledging response may be the message being sent forward by the first intermediate node 122 to the second intermediate node 123 as part of the routing.
  • said receipt acknowledging response may be the message being sent forward by the destination node 124 and configured so that the message thereafter is not forwarded by any further node, e.g. by having a TTL value that is 0.
  • the message is said group-cast message
  • said receipt acknowledging response is a specific acknowledgement message for group cast messages that is generated by the second node to acknowledge receipt of said group- cast message.
  • the second node may advantageously send the specific acknowledgement message after a randomized delay that is random within certain predefined limits.
  • the message is said RREP message and said receipt acknowledging response is a specific acknowledgement message for RREP messages that is generated by the second node to acknowledge receipt of said RREP message.
  • the specific acknowledgement message is preferably broadcasted and configured so that it is not forwarded by any further node.
  • This action may fully or partly correspond to action 902 as described above.
  • the first node may identify the receipt acknowledging response that the first node is listening for.
  • Action 1004 may fully or partly correspond to action 904 as described above.
  • Action 1004 may fully or partly correspond to action 904 as described above.
  • the first node may determine, based on the identified receipt acknowledging response, that the message has been received by the second node.
  • FIG. 11 is a schematic block diagram for illustrating embodiments of a first node
  • the first node 1100 may be the first node discussed above, e.g. be the source node 121 , the first intermediate node 122 or the second intermediate node 123, and how it may be configured to perform the first method and/or one or more related actions described herein.
  • the first node 1100 is thus configured to operate as a node in said Bluetooth based mesh network and is for supporting routing in said mesh network between said source node, e.g. the source node 121 , and said destination node, e.g. the destination node 124, via one or more intermediate nodes, e.g. the first intermediate node 122 and/or the second intermediate node 123.
  • the first node 1100 may comprise:
  • a processing module 1101 such as a means, one or more hardware modules, including e.g. one or more processors, and/or one or more software modules for performing said method and/or actions.
  • a memory 1002 which may comprise, such as contain or store, a computer program 1103.
  • the computer program 1 103 comprises 'instructions' or 'code' directly or indirectly executable by the first node 1 100 so that it performs the said method and/or actions.
  • the memory 1 102 may comprise one or more memory units and may be further be arranged to store data, such as configurations and/or applications involved in or for performing functions and actions of embodiments herein.
  • a processing circuit 1104 as an exemplifying hardware module and may comprise or correspond to one or more processors.
  • the processing module 1101 may comprise, e.g. 'is embodied in the form of or 'realized by' the processing circuit 1104.
  • the memory 1102 may comprise the computer program 1103 executable by the processing circuit 1104, whereby the first node 1 100 is operative, or configured, to perform said method and/or actions.
  • An Input/Output (I/O) module 1105 configured to be involved in, e.g. by performing, any communication to and/or from other units and/or nodes, such as sending and/or receiving information to and/or from other external nodes or devices.
  • the I/O module 1105 may be exemplified by an obtaining, e.g. receiving, module and/or a sending module, when applicable.
  • the first node 1 100 may also comprise other exemplifying hardware and/or software module(s), which module(s) may be fully or partly implemented by the respective processing circuit.
  • the first node 1100 may further comprise a sending module 1106 and/or a listening module 1107 and/or an identifying module 1108. and/or a determining module 1109.
  • the first node 1 100 and/or the processing module 1101 and/or the processing circuit 1 104 and/or the I/O module 1105 and/or the sending module 1 106 are operative, or configured, to send said message to said another, second node.
  • first node 1 100 and/or the processing module 1101 and/or the processing circuit 1 104 and/or the I/O module 1105 and/or the listening module 1107 are operative, or configured, to listen for the receipt acknowledging response sent by the second node in response to receipt of the sent message.
  • first node 1 100 and/or the processing module 1101 and/or the processing circuit 1 104 and/or the identifying module 1108, may be operative, or configured, to identify the receipt acknowledging response that the first node is listening for.
  • Figure 12 is a flow chart schematically illustrating embodiments of a second method, performed by a second node of a Bluetooth based mesh network, e.g. of the wireless communication network 100, the mesh network 100a or the mesh network 100b.
  • the method is for supporting routing in said mesh network between a source node, in the following exemplified by the source node 121 and a destination node, in the following exemplified by the destination node 124, via one or more intermediate nodes, e.g. the first intermediate node 122 and/or the second intermediate node 123.
  • the second node may e.g. be the first intermediate node 122, the second intermediate node 123 or the destination node 124.
  • the method comprises the following actions, which actions may be taken in any suitable order and/or be carried out fully or partly overlapping in time when this is possible and suitable. Action 1201
  • the second node receives a message from another, first node of said mesh network, which first node is neighbouring the second node in said routing.
  • the first node may e.g. be the source node 121 when the second node is the first intermediate node 122, be the first intermediate node 122 when the second node is the second intermediate node 123, or be the second intermediate node 123 when the second node is the destination node 124.
  • the message is any one of the following:
  • a route response message i.a. a RREP message, sent as part of creating a route for said routing.
  • This action may fully or partly correspond to Action 901 as described above.
  • the second node sends, in response to the received message, a receipt acknowledging response to the first node.
  • the message is said unicast message, and said receipt acknowledging response is the message being sent forward by the second node as part of the routing to a third node of the mesh network.
  • said receipt acknowledging response may be the message being sent forward by the second intermediate node 123 to the destination node 124 as part of the routing.
  • said receipt acknowledging response is the message being sent forward by the destination node 124 and configured so that the message thereafter is not forwarded by any further node, e.g. by having a TTL value that is 0.
  • the message is said group-cast message, and said receipt acknowledging response is a specific acknowledgement message for group cast messages that is generated by the second node to acknowledge receipt of said group- cast message.
  • the second node may advantageously send the specific acknowledgement message after a randomized delay that is random within certain predefined limits.
  • the message is said RREP message and said receipt acknowledging response is a specific acknowledgement message for RREP messages that is generated by the second node to acknowledge receipt of said RREP message.
  • the specific acknowledgement message is preferably broadcasted 5 and configured so that it is not forwarded by any further node.
  • This action may fully or partly correspond to Action 902 as described above.
  • Figure 13 is a schematic block diagram for illustrating embodiments of a second node 1300, that may be the second node discussed above, e.g. be the first intermediate
  • the second node 1300 is thus configured to operate as a node in said Bluetooth based mesh network and is for supporting routing in said mesh network between said source node, e.g. the source node 121 , and a destination node, e.g. the destination node
  • the second node 1300 may comprise:
  • a processing module 1301 such as a means, one or more hardware modules, including e.g. one or more processors, and/or one or more software modules for performing said method and/or actions.
  • a memory 1302 which may comprise, such as contain or store, a computer program 1303.
  • the computer program 1303 comprises 'instructions' or 'code' directly or indirectly executable by the second node 1300 so that it performs the said method and/or actions.
  • the memory 1302 may comprise one or more memory units and may be further be arranged to store data, such as configurations and/or applications involved in or for
  • the processing module 1301 may comprise, e.g. 'is embodied in the form of or 'realized by' the processing circuit 1304.
  • the memory 1302 may comprise the
  • An Input/Output (I/O) module 1305, configured to be involved in, e.g. by performing, any communication to and/or from other units and/or nodes, such as sending and/or receiving information to and/or from other external nodes or devices.
  • the I/O module 1305 may be exemplified by an obtaining, e.g. receiving, module and/or a sending module, when applicable.
  • the first node 1300 may also comprise other exemplifying hardware and/or software module(s), which module(s) may be fully or partly implemented by the respective processing circuit.
  • the second node 1300 may further comprise a receiving module 1306 and/or an sending module 1307.
  • the second node 1300 and/or the processing module 1301 and/or the processing circuit 1304 and/or the I/O module 1305 and/or the receiving module 1306, are operative, or configured, to receive said message from said another, first node.
  • FIGS. 14a-c are schematic drawings illustrating embodiments relating to a computer program that may be any one of the computer programs 1 103 and 1303, and that comprises instructions that when executed by the respective processing circuit 1104, 1304 causes the first node 1 100 or the second node 1300 to perform the respective method as described above.
  • a computer program product i.e. a data carrier, comprising a computer-readable medium and the computer program stored on the computer-readable medium.
  • computer readable medium may be excluded a transitory, propagating signal and the computer readable medium may correspondingly be named non-transitory computer readable medium.
  • Non-limiting examples of the computer- readable medium are a memory card or a memory stick 1401 as in Figure 14a, a disc storage medium 1402 such as a CD or DVD as in Figure 14b, a mass storage device 1403 as in Figure 14c.
  • the mass storage device 1403 is typically based on hard drive(s) or Solid State Drive(s) (SSD).
  • SSD Solid State Drive
  • the mass storage device 1403 may be such that is used for storing data accessible over a computer network 1405, e.g. the Internet or a Local Area Network (LAN).
  • LAN Local Area Network
  • Each computer program 1103, 1303, may furthermore be provided as a pure computer program or comprised in a file or files.
  • the file or files may be stored on the computer-readable medium and e.g. available through download e.g. over the computer network 1405, such as from the mass storage device 1403 via a server.
  • the server may e.g. be a web or File Transfer Protocol (FTP) server.
  • FTP File Transfer Protocol
  • the file or files may e.g. be executable files for direct or indirect download to and execution on the node for carrying out the respective method, e.g. by the processing circuit 1104 or 1304, or may be for intermediate download and compilation to make them executable before further download and execution causing the node(s) to perform the respective method as described above.
  • any hardware module(s) and/or circuit(s) mentioned in the foregoing may e.g. be included in a single ASIC or FPGA, or be distributed among several separate hardware components, whether individually packaged or assembled into a System-on-a-Chip (SoC).
  • SoC System-on-a-Chip
  • modules and circuitry discussed herein may refer to a combination of hardware modules, software modules, analog and digital circuits, and/or one or more processors configured with software and/or firmware, e.g. stored in memory, that, when executed by the one or more processors make the first node and the second node to be configured to and/or to perform the above- described methods, respectively.
  • the term "memory” may refer to a hard disk, a magnetic storage medium, a portable computer diskette or disc, flash memory, random access memory (RAM) or the like. Furthermore, the memory may be an internal register memory of a processor.
  • Identification by any identifier herein may be implicit or explicit.
  • the identification may be unique in the wireless communication network 100 or at least in a part or some area thereof.
  • device or “wireless device” as used herein, may also be referred to as e.g. a wireless communication device or a radio communication device.
  • Examples include: target devices, device to device UE, device for Machine Type of Communication (MTC), MTC device, machine type UE or UE capable of machine to machine (M2M) communication, low-cost and/or low-complexity UE, a sensor equipped with UE, a tablet device, a mobile terminal, smart phone, laptop embedded equipped (LEE), laptop mounted equipment (LME), USB dongles, Customer Premises Equipment (CPE), an Internet of Things (loT) device, or a Narrowband loT (NB-IOT) device, Personal Digital Assistant (PDA), iPAD, Tablet, mobile terminals, smart phone, Laptop Embedded
  • PDA Personal Digital Assistant
  • iPAD Tablet
  • Tablet mobile terminals
  • smart phone Laptop Embedded
  • node as used herein may as such refer to any type of network node or wireless device, such as described above.

Abstract

Des modes de réalisation permettent de prendre en charge un routage dans un réseau maillé basé sur Bluetooth (100) entre un nœud source (121) et un nœud de destination (124) par l'intermédiaire d'un ou de plusieurs nœuds intermédiaires (122; 123). Un premier nœud (121; 122; 123) envoie (901; 1001) un message à un autre second nœud (122; 123; 124) du réseau maillé (100), lequel second nœud (122; 123; 124) est voisin du premier nœud (121; 122; 123) dans ledit routage. Le message est l'un quelconque des éléments suivants : un message de diffusion individuelle routé selon ledit routage, un message de diffusion de groupe routé en fonction dudit routage, et un message de réponse de route, " RREP ", envoyé en tant que partie de création d'une route pour ledit routage. Le premier nœud (122; 123) attend (902; 1002) une réponse d'acquittement de réception envoyée par le second nœud (123; 124) en réponse à la réception du message envoyé.
PCT/SE2017/050262 2016-03-18 2017-03-17 Procédés et agencements pour prendre en charge un routage dans un réseau maillé basé sur bluetooth ® WO2017160223A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201662310321P 2016-03-18 2016-03-18
US62/310,321 2016-03-18

Publications (1)

Publication Number Publication Date
WO2017160223A1 true WO2017160223A1 (fr) 2017-09-21

Family

ID=59851864

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2017/050262 WO2017160223A1 (fr) 2016-03-18 2017-03-17 Procédés et agencements pour prendre en charge un routage dans un réseau maillé basé sur bluetooth ®

Country Status (1)

Country Link
WO (1) WO2017160223A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019177505A1 (fr) 2018-03-16 2019-09-19 Telefonaktiebolaget Lm Ericsson (Publ) Procédés et nœuds pour obtenir des informations concernant un réseau maillé bluetooth
CN111711941A (zh) * 2020-04-30 2020-09-25 杭州涂鸦信息技术有限公司 数据传输方法以及相关设备、装置
EP3755019A1 (fr) * 2019-06-21 2020-12-23 Carrier Corporation Procédé et système pour la diffusion de données dans un réseau sans fil
US11546096B2 (en) 2019-06-21 2023-01-03 Carrier Corporation Method and system for data transfer in a Bluetooth low energy network

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050030921A1 (en) * 2003-07-25 2005-02-10 Royal Holloway University Of London Routing protocol for ad hoc networks
US20050073992A1 (en) * 2003-10-07 2005-04-07 Samsung Electronics Co., Ltd. Method for setting up route path through route discovery in a mobile ad hoc network using partial route discovery
US20060221891A1 (en) * 2005-03-29 2006-10-05 Nec Corporation Information distribution with improved reliability and efficiency for mobile ad hoc networks
WO2009143287A1 (fr) * 2008-05-20 2009-11-26 Live Meters, Inc. Système de surveillance et de commande à distance comprenant la technologie mesh et de synchronisation temporelle
WO2011043755A1 (fr) * 2009-10-06 2011-04-14 Thomson Licensing Procédé et appareil permettant une diffusion saut par saut fiable dans des réseaux sans fil
US20140036694A1 (en) * 2011-04-29 2014-02-06 Cooper Technologies Company Multi-path radio transmission input/output devices, network, systems and methods with on demand, prioritized routing protocol

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050030921A1 (en) * 2003-07-25 2005-02-10 Royal Holloway University Of London Routing protocol for ad hoc networks
US20050073992A1 (en) * 2003-10-07 2005-04-07 Samsung Electronics Co., Ltd. Method for setting up route path through route discovery in a mobile ad hoc network using partial route discovery
US20060221891A1 (en) * 2005-03-29 2006-10-05 Nec Corporation Information distribution with improved reliability and efficiency for mobile ad hoc networks
WO2009143287A1 (fr) * 2008-05-20 2009-11-26 Live Meters, Inc. Système de surveillance et de commande à distance comprenant la technologie mesh et de synchronisation temporelle
WO2011043755A1 (fr) * 2009-10-06 2011-04-14 Thomson Licensing Procédé et appareil permettant une diffusion saut par saut fiable dans des réseaux sans fil
US20140036694A1 (en) * 2011-04-29 2014-02-06 Cooper Technologies Company Multi-path radio transmission input/output devices, network, systems and methods with on demand, prioritized routing protocol

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019177505A1 (fr) 2018-03-16 2019-09-19 Telefonaktiebolaget Lm Ericsson (Publ) Procédés et nœuds pour obtenir des informations concernant un réseau maillé bluetooth
US11516682B2 (en) 2018-03-16 2022-11-29 Telefonaktiebolaget Lm Ericsson (Publ) Methods and nodes for obtaining information regarding a bluetooth mesh network
EP3755019A1 (fr) * 2019-06-21 2020-12-23 Carrier Corporation Procédé et système pour la diffusion de données dans un réseau sans fil
US11546096B2 (en) 2019-06-21 2023-01-03 Carrier Corporation Method and system for data transfer in a Bluetooth low energy network
US11716176B2 (en) 2019-06-21 2023-08-01 Carrier Corporation Method and system for broadcasting data in wireless network
CN111711941A (zh) * 2020-04-30 2020-09-25 杭州涂鸦信息技术有限公司 数据传输方法以及相关设备、装置
CN111711941B (zh) * 2020-04-30 2023-10-24 杭州涂鸦信息技术有限公司 数据传输方法以及相关设备、装置

Similar Documents

Publication Publication Date Title
US8218463B2 (en) System and method for mobile ad hoc network
EP3044981B1 (fr) Système et procédé de découverte de services par bonds multiples avec annonces de services par des stations membres mandataires
CN107852362B (zh) 网格网络系统和方法
US7917169B1 (en) System and method for mobile ad hoc network
KR100586233B1 (ko) 이동 애드혹 네트워크에서 최적 방향-기반 플러딩 방법
WO2017160223A1 (fr) Procédés et agencements pour prendre en charge un routage dans un réseau maillé basé sur bluetooth ®
EP3185472A1 (fr) Système et procédé pour éviter et résoudre des conflits dans un environnement multidiffusion d'interface numérique d'affichage mobile sans fil
TW201234908A (en) Methods and apparatuses for use in providing positioning assistance data to mobile stations via a self-organizing network
US10893457B2 (en) Route discovery in a mesh communication network
CN107124363B (zh) 报文广播方法及设备
US20100020740A1 (en) Wireless Communication System, Wireless Communication Device, Wireless Communication Method, and Program
KR20170056547A (ko) 다수의 채널들을 통한 데이터 링크 그룹의 루트 형성 및 메시지 송신
US20200084689A1 (en) Detecting Critical Links in Bluetooth Mesh Networks
JPWO2013077090A1 (ja) 通信装置およびアドホックネットワークシステム
JP5705030B2 (ja) 通信システム
CN108093457B (zh) 一种无线自组网的路由查找方法及其系统
US20160309392A1 (en) Operating a user equipment in a wireless mesh radio network
JP2007181056A (ja) 経路選択方法
EP3311535B1 (fr) Réduction de latence dans un réseau maillé
CN111869246B (zh) 消息传输的方法、ble设备和ble芯片
Mao et al. Building smartphone ad-hoc networks with long-range radios
JPWO2008114327A1 (ja) アドレス解決方法
JP2019075743A (ja) 制御装置、端末、通信システムおよび通信方法
US11646962B1 (en) Zero overhead efficient flooding (ZOEF) oriented hybrid any-cast routing for mobile ad hoc networks (MANET)
Bai et al. Extended multicast optimized link state routing protocol in manets with asymmetric links

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 17767074

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 17767074

Country of ref document: EP

Kind code of ref document: A1