Telefonaktiebolaget Lm Ericsson (publ)

Roman Chirikov

Per Skillermark

Piergiuseppe Di Marco

Pontus Arvidson

Per Elmdahl

Wei Shen

A method by an end node () operating in a Mesh communications network () is described herein. The end node () monitors (), a first channel, for transmissions of first information from one or more relay nodes () operating in the network. The first information indicates transmission, from the one or more relay nodes (), of second information on a second channel associated with the first channel. The second information indicates transmission, from the one or more relay nodes (), of third information on a third channel. The third channel is associated with the second channel and the first channel. The end node () then determines (), based on the second information, time periods during which no transmission of the third information is predicted to be performed by the one or more relay nodes () on the third channel. The end node () then schedules () a transmission of fourth information in a fourth channel during the determined time periods.

End node, relay node, and methods performed therein for handling transmission of information

A node operable in a mesh communication network and a method performed thereby for routing a received packet towards a destination are provided. The method includes receiving a packet addressed to a destination node in the mesh network, the packet including information related to address of source node, last hop address, address of destination node, and a hop counter. The method further includes determining whether the destination address is included in a routing table of the node in the mesh communication network. When the destination address is included in a routing table, the received packet is forwarded according to the routing table; or when the destination address is not included in a routing table, the received packet is flooded by broadcasting it in the mesh communication network.

Node and a method performed by the node operable in a mesh communication network for routing a received packet towards a destination

There is provided a method and corresponding arrangements and network nodes/devices for enabling packet forwarding in a wireless mesh network comprising a plurality of nodes. Basically, the method comprises conforming, for transmission of the same network layer information from at least two different nodes, the corresponding over-the-air packets to be node-independent, and scheduling the conformed over-the-air packets for synchronized and simultaneous transmission from the at least two different nodes.

Packet forwarding in a wireless mesh network

A method of sharing an established connection between a primary device in a network and one of a plurality of secondary devices. The method comprising the steps of receiving from an unconnected secondary device said plurality of secondary devices, an advertising packet for identifying said unconnected secondary device, sending, to said unconnected secondary device, a connection request based on said received advertising packet for establishing a connection between said unconnected secondary device and said primary device, said connection being shared among said unconnected secondary device and said one of said plurality of secondary devices, and transmitting, to secondary devices sharing an established connection, connection parameters, wherein said connection parameters define a time shared multiplexing scheme thereby facilitating sharing of said established connection. A complementary method and device for performing a method according to the present disclosure are also presented herein.

Method and device for sharing an established connection between a primary device and one of a plurality of secondary devices in a network

A method performed by a first network node for reducing the number of colliding transmissions in a mesh network is provided. The first network node and the second network node are configured to use periodic advertising for transmissions in the mesh network. The first network node calculates () a first duration related to a transmission of data of a first size to be transmitted to the second network node. The first network node further calculates () a second duration related to a period of time until a reception or a transmission of data is scheduled for second network node will occur. Based on the first and second duration the first network node decides () whether or not to decrease the first size of the transmission to a second size, so that first duration becomes shorter than the second duration. The first network then performs () the transmission according to the outcome of the deciding ().

Network node and methods in a mesh network

A first Bluetooth device and a method performed thereby for operating in a network of Bluetooth devices, the first Bluetooth device being capable of operating according to at least two different configurations, wherein a first configuration is of lower functionality than a second configuration. The method comprises, when the Bluetooth device is being switched on: associating () with other Bluetooth devices by (i) when the first Bluetooth device is operating according to the any configuration not being the highest functionality, transmitting a request, REQ, message in order to discover Bluetooth devices operating according to the configuration having the highest functionality; and (ii) when the first Bluetooth device is operating according to the configuration having the highest functionality, periodically and/or upon reception of the REQ, transmitting an announcement, ANN, message; determining () which configuration to operate according to, based at least partly on the association with the other Bluetooth devices; and operating () according to the determined configuration.

Energy efficient BLE mesh initialisation and operation

In one aspect, a node in a mesh network receives presence messages from neighbor node in the mesh network, and determines a number of neighbor nodes, based on the received presence messages. The node determines a duty cycle percentage to be requested of the neighbor nodes, based on the number of the neighbor nodes, the duty cycle percentage indicating a minimum percentage of time the neighbor nodes should be awake to receive messages, so as to ensure a predetermined probability of successful reception of messages transmitted by the node. The node broadcasts the duty cycle percentage for reception by the neighbor nodes. The node also receives requested duty cycle percentages from corresponding neighbor nodes, sets an operating duty cycle of the node based on a greatest duty cycle percentage of the received duty cycle percentages, and sleeps and wakes according to the set duty cycle of the node.

Growing community of inventors

Stockholm, Sweden

Roman Chirikov