Strung together, a set of transmitters can offer coverage to a location like an airport.
More specifically, a Conservative CTS (CCTS) is a set of transmitter-destination pairs, such that all links are usable when all transmitters in CCTS are active.
Moreover, there are scenarios where the set of transmitter-receiver pairs (links) operate simultaneously in a shared medium, and interference mitigation techniques must be employed.
Similarly, a Greedy CTS (GCTS) is a set of transmitter-destination pairs such that for each transmitter in GCTS, there exists at least one link, that is usable when other transmitters in GCTS are active.
The RSS values of a given message may be used to estimate a set of transmitter-receiver (T-R) distances using a least squares approach, as suggested by Zhong et al. [14] and Liu et al. [15, 16].
In both games, the set of transmitters K is the set of players.
Prx: the received power level from a set of transmitters (cell and/or tag), IDSrx: the particular set of "visible" transmitter identifiers (those that are received with at least a certain minimum power) at the particular location.
On receiving multiple RTS frames, the receiver broadcasts a clear-to-send (CTS) frame, which includes the set of transmitters that are permitted to transmit.
To account for this, Greedy CTS (GCTS) is a set of transmitters (including the BTs) that when all of them are transmitting data simultaneously, at least one link associated with each transmitter is usable.
Here, the identification of the current position can be based in two different comparable variables: Prx: the received power level from a set of transmitters (cell and/or tag), IDSrx: the particular set of "visible" transmitter identifiers (those that are received with at least a certain minimum power) at the particular location.
