Abstract: A method of fair scheduling for channel access in a wireless network comprising a plurality of nodes including a first node and at least one second node is described, the method comprising the steps of: arranging (RICP) a packet to be transmitted at the first node; calculating (COMP) a waiting time (ta) for the first node; the first node attempting (ATTX) the transmission of the packet on the channel at least after the calculated waiting time; characterised in that said calculation step includes an evaluation step of a first size representative of the ratio between a real use of the channel by the first node and a real use of the channel by a group of the plurality of nodes, during the transmission on the network of further packets preceding said packet.

Abstract: A method of fair scheduling for channel access in a wireless network comprising a plurality of nodes including a first node and at least one second node is described, the method comprising the steps of: arranging (RICP) a packet to be transmitted at the first node; calculating (COMP) a waiting time (ta) for the first node; the first node attempting (ATTX) the transmission of the packet on the channel at least after the calculated waiting time; characterised in that said calculation step includes an evaluation step of a first size representative of the ratio between a real use of the channel by the first node and a real use of the channel by a group of the plurality of nodes, during the transmission on the network of further packets preceding said packet.