Abstract: In a hybrid network comprising both guided and wireless communications technologies, a grandmaster clock is designated in one portion of the network and can be propagated across to the other portion by means of a timing synchronization message. This message may include timestamping information and other information to enable recipient devices to correctly synchronize to the grandmaster clock.

Abstract: A method of generating a communication schedule for a plurality of nodes in a multi-hop network, the plurality of nodes comprising a first node, a second node and a third node, wherein: the second node is a primary parent of the first node and the third node is a secondary parent of the first node. The method comprises requesting, by the first node, a first resource in the communication schedule for communication from the first node to the second node and a second resource in the communication schedule for communication from the first node to the third node.

Abstract: An IEEE 802.11 compatible processor configured to identify, using an indication received from a first station in a network and from among a plurality of further stations within the network, a second station to transmit data to during receipt of a next transmission from the first station using information indicating which stations amongst the further stations data can be transmitted to while receiving data from the first station; and information regarding the duration required to transmit next data scheduled to be transmitted to the second station, wherein the indication is an indication of the duration of the next data transmission scheduled to be transmitted by the first station.

Abstract: In general terms, network resource allocation takes place within a wireless communication channel in which resource is defined with respect to time and frequency; a resource allocation process involves joint allocation of resource for communication to and from group of devices, to enable a cyclic exchange of information between the devices and a base-station and thus to enable wireless closed loop control of the device. By jointly allocating resources in one go, overheads are reduced thereby providing a more efficient resource allocation mechanism. Furthermore, bundled transmissions are scheduled, including repetitions of transmissions to increase the likelihood of transmission success. By determining a minimum bundle length required to meet a predefined threshold for received signal quality, the reliability of the transmissions can be ensured.

Abstract: Network resource allocation takes place within a wireless communication channel in which resource is defined with respect to time and frequency; a resource allocation process involves joint allocation of resource for communication to and from a controlled device, to enable a cyclic exchange of information and thus to enable wireless closed loop control of the device.

Abstract: A method of resource slicing in a wireless communication network. The communication network includes a device domain, a radio access network and a core network. The device domain includes at least one device and is connected to the radio access network over a wireless interface. The method includes abstracting the device domain, the radio access network and the core network as a plurality of network functions using a slicing controller to provide end-to-end resource slicing. Network functions provide protocol functionality as part of connectivity in the network.

Abstract: A method of randomly accessing wireless communication resources in a LTE uplink comprising transmitting, by a user device, a plurality of random access requests wherein each request is transmitted on a different communication channel from a plurality of communication channels and each request comprises a preamble generated using a different root sequence. The method further comprises receiving, at the user device, at least one random access response via the plurality of communication channels; and completing a random access procedure on the communication channel which conveyed the random access response.

Abstract: A WiFi system comprising two or more access points operating in the same network and a plurality of nodes. Each node is in communicative association with each access point. A plurality of nodes transmits data in a scheduled communication with a first access point of the two or more access points and subsequently re-transmits some or all of the data in a scheduled communication with a second access point of the two or more access points.

Abstract: A method of resource slicing in a wireless communication network. The communication network includes a device domain, a radio access network and a core network. The device domain includes at least one device and is connected to the radio access network over a wireless interface. The method includes abstracting the device domain, the radio access network and the core network as a plurality of network functions using a slicing controller to provide end-to-end resource slicing. Network functions provide protocol functionality as part of connectivity in the network.

Abstract: A multi-hop mesh network comprising a plurality of nodes, the plurality of nodes each comprising a receiver, a transmitter, a controller and memory storing program instructions. The plurality of nodes are suitable for participating in data relaying within the network. The plurality of nodes comprise a plurality of source nodes and a plurality of relay nodes. The plurality of source nodes advertise, via the respective transmitter at least one message in one or more advertising events, and adapt the duration of the advertising event. Each advertising event comprises the at least one message being advertised over one or more primary advertising channels.

Abstract: A method of generating a communication schedule for a plurality of nodes in a multi-hop network, the plurality of nodes comprising a first node, a second node and a third node, wherein: the second node is a primary parent of the first node and the third node is a secondary parent of the first node. The method comprises requesting, by the first node, a first resource in the communication schedule for communication from the first node to the second node and a second resource in the communication schedule for communication from the first node to the third node.

Abstract: A method performed in a system comprising a plurality of autonomous vehicles. The method comprises a first vehicle transmitting a geometric configuration information to be adopted by one or more other vehicles participating in a transport operation in combination with the first vehicle, wherein the geometric configuration information comprises information regarding respective distances and orientations the one or more other vehicles are required to adopt relative to the first vehicle, a second vehicle, upon receipt of the geometric configuration information, adopting a position relative to the first vehicle or to a further vehicle participating in the transport operation, the position of the second vehicle defined by the geometric configuration information and the first and second vehicles performing a transport operation in a synchronised manner once the second vehicle has adopted said position.

Abstract: A method of randomly accessing wireless communication resources in a LTE uplink comprising transmitting, by a user device, a plurality of random access requests wherein each request is transmitted on a different communication channel from a plurality of communication channels and each request comprises a preamble generated using a different root sequence.

Abstract: A multi-hop mesh network comprising a plurality of nodes, the plurality of nodes each comprising a receiver, a transmitter, a controller and memory storing program instructions. The plurality of nodes are suitable for participating in data relaying within the network. The plurality of nodes comprise a plurality of source nodes and a plurality of relay nodes. The plurality of source nodes advertise, via the respective transmitter at least one message in one or more advertising events, and adapt the duration of the advertising event. Each advertising event comprises the at least one message being advertised over one or more primary advertising channels.

Abstract: A method for re-transmitting data from nodes in a multi-hop wireless network to a control node, wherein each node is a child node to a corresponding parent node, each child node configured to communicate with the control node via its intervening parent node. The method comprises the control node determining or initiating determination of a transmission schedule for the nodes and the nodes re-transmitting previously transmitted data towards the control node using the schedule.

Abstract: Method for Efficient Retransmissions in Multi-hop Control Networks A method for re-transmitting data from nodes in a multi-hop wireless network to a control node, wherein each node is a child node to a corresponding parent node, each child node configured to communicate with the control node via its intervening parent node. The method comprises the control node determining or initiating determination of a transmission schedule for the nodes and the nodes re-transmitting previously transmitted data towards the control node using the schedule.

Abstract: A WiFi system comprising two or more access points operating in the same network and a plurality of nodes. Each node is in communicative association with each access point. A plurality of nodes transmits data in a scheduled communication with a first access point of the two or more access points and subsequently re-transmits some or all of the data in a scheduled communication with a second access point of the two or more access points.

Abstract: Arrangements described herein provide a distributed means of scheduling communications directed towards a sink node from other nodes in a multi-hop wireless network. By listening for other messages assigning schedules to other nodes, each node is able to create its own local record of scheduled transmissions in its area. This allows each node to determine a preliminary schedule. Having said this, the parent node of the node will have additional information regarding the scheduled local transmissions. Accordingly, the node sends the preliminary schedule to its parent node for confirmation that it provides no collisions/conflicts with other scheduled transmissions. As the parent node is involved in the scheduling of each child node, it is better able to determine whether the child nodes are proposing schedules that may conflict with each other.

Abstract: Methods and devices are provided for assisting bidirectional communication within a wireless network, the wireless network comprising a central node and a plurality of outer nodes within wireless communication range of the central node, the method comprising a first outer node: listening for a downlink communication from the central node to a second outer node and an uplink response from the second outer node to the central node; determining whether the downlink communication or the uplink response has failed to be received by its intended recipient; in response to a determination that the downlink communication or the uplink response has failed to be received by its intended recipient, determining whether the first outer node should transmit the failed communication to the intended recipient; and, in response to a determination that the first outer node should transmit the failed communication to the intended recipient, transmitting the failed communication to the intended recipient.

Abstract: Arrangements described herein provide a distributed means of scheduling communications originating from a control node to nodes in a multi-hop wireless network. By listening for other messages assigning schedules to other nodes, each node is able to create its own local record of scheduled transmissions in its area. This allows each node to determine a preliminary schedule. Having said this, the parent node of the node will have additional information regarding the scheduled local transmissions. Accordingly, the node sends the preliminary schedule to its parent node for confirmation that it provides no collisions/conflicts with other scheduled transmissions. As the parent node is involved in the scheduling of each child node, it is better able to determine whether the child nodes are proposing schedules that may conflict with each other.