Abstract: A prioritization method for random access, comprising receiving one or more first packet flow for transmission, wherein the one or more first packet flow is assigned a respective access category queue, initiating a random access procedure for the first packet flow, receiving a packet of a second packet flow for transmission, wherein the second packet flow is assigned an access category queue having priority over the access category queue assigned to the first packet flow, issuing an indication configured to interrupt the random access procedure for the first packet flow, and performing a random access procedure for the received packet of the second packet flow wherein idle time slots previously sensed by the random access procedure for the first packet flow are considered as sensed also for the random access procedure for the second packet flow. Corresponding apparatus and computer program product are also disclosed.

Abstract: Embodiments described herein relate to methods and apparatus for performing link adaptation processes in a network. A method in a transmitting node in a wireless local area network comprises obtaining a first traffic flow for transmitting to a receiving node, wherein the first traffic flow is associated with a first category based on a reliability requirement associated with the first traffic flow; selecting a first link adaptation process from a plurality of link adaptation processes based on the first category; and transmitting the first traffic flow to the receiving node based on the first link adaptation process.

Abstract: In one example aspect, a method of transmitting packets wirelessly is provided. The method comprises, for each packet, requesting to transmit the packet, waiting for a respective random or pseudorandom time period before transmitting the packet, and transmitting the packet containing a respective data portion, wherein a position of the respective data portion in the packet is selected such that a time interval between transmission of respective data portions in adjacent packets is a constant time interval.

Abstract: Systems and methods are disclosed herein for ensuring network control of simultaneous access to network slices with application awareness. In one embodiment, a method performed in a cellular communications system comprises, at a wireless communication device, sending, to a Policy and Control Function (PCF) via an Access and Mobility Management Function (AMF), application identifiers (IDs) of applications used by the wireless communication device and receiving, from the PCF via the AMF, one or more User Equipment (UE) Route Selection Policy (URSP) rules that are based on the application IDs. The method further comprises, at the PCF, obtaining information about one or more mutually exclusive network slices, generating the one or more URSP rules based on the application IDs and the information about the one or more mutually exclusive network slices, and sending the one or more URSP rules to the wireless communication device via the AMF.

Abstract: In one example aspect, a method of transmitting packets wirelessly is provided. The method comprises, for each packet, requesting to transmit the packet, waiting for a respective random or pseudorandom time period before transmitting the packet, and transmitting the packet containing a respective data portion, wherein a position of the respective data portion in the packet is selected such that a time interval between transmission of respective data portions in adjacent packets is a constant time interval.

Abstract: A method of scheduling data transmission of a group of wireless devices, in a wireless communication network, comprising: determining a relative transmission timing relation between a reference wireless device out of the group of wireless devices and at least one wireless device out of the group of wireless devices; and scheduling the data transmission of the at least one wireless devices based on the indicated relative transmission timing relation in response to a scheduling request.

Abstract: Embodiments described herein relate to methods and apparatus for performing link adaptation processes in a network. A method in a transmitting node in a wireless local area network comprises obtaining a first traffic flow for transmitting to a receiving node, wherein the first traffic flow is associated with a first category based on a reliability requirement associated with the first traffic flow; selecting a first link adaptation process from a plurality of link adaptation processes based on the first category; and transmitting the first traffic flow to the receiving node based on the first link adaptation process.

Abstract: A prioritization method for random access, comprising receiving one or more first packet flow for transmission, wherein the one or more first packet flow is assigned a respective access category queue, initiating a random access procedure for the first packet flow, receiving a packet of a second packet flow for transmission, wherein the second packet flow is assigned an access category queue having priority over the access category queue assigned to the first packet flow, issuing an indication configured to interrupt the random access procedure for the first packet flow, and performing a random access procedure for the received packet of the second packet flow wherein idle time slots previously sensed by the random access procedure for the first packet flow are considered as sensed also for the random access procedure for the second packet flow. Corresponding apparatus and computer program product are also disclosed.

Abstract: In one example aspect, a method of transmitting packets wirelessly is provided. The method comprises, for each packet, requesting to transmit the packet, waiting for a respective random or pseudorandom time period before transmitting the packet, and transmitting the packet containing a respective data portion, wherein a position of the respective data portion in the packet is selected such that a time interval between transmission of respective data portions in adjacent packets is a constant time interval.

Abstract: A transmitter is arranged to transmit binary information using a binary amplitude shift keying where information symbols are represented by a signal including a first power state and a second power state. The first power state has a higher signal power than the second power state. A ratio in powers between the first and second power states is below a first value. The ratio in powers between the first and second power states is above a second value such that the states are distinguishably decodable. A network node having such a transmitter, a corresponding method, and a computer program for implementing the method in a transmitter are also disclosed.

Abstract: A method of scheduling data transmission of a group of wireless devices, in a wireless communication network, comprising: determining a relative transmission timing relation between a reference wireless device out of the group of wireless devices and at least one wireless device out of the group of wireless devices; and scheduling the data transmission of the at least one wireless devices based on the indicated relative transmission timing relation in response to a scheduling request.