Name
Abstract | ||
|---|---|---|
Consider a multiaccess channel shared by an infinite set of users, each of which, independently, has a message to transmit with probability p. Pairwise enabling is the scheduling algorithm which enables the users to transmit by pairs, and, if a collision occurs, it lets the two users transmit separately in the next two time slots. M.L. Molle (see ibid., vol.36, no.5, p.1127-33, 1990) showed that pairwise enabling is optimal for 0.5⩽p⩽1/√2 and is not optimal for p⩽0.430. Let p0 denote the cutoff point for pairwise enabling, i.e. pairwise enabling is optimal for p 0⩽p⩽1/√2 but not optimal for p⩽p0. In the present work, Molle's results are improved by showing that 0.4300<p0<0.4745. In addition, it is shown that 0.4400<p0 holds when it is assumed that the 1-feedback also reveals the identity of the transmitter |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/18.57225 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
channel capacity,multi-access systems,probability,protocols,scheduling,telecommunication channels,cutoff point,infinite users,multiaccess channel,pairwise enabling,probability,protocols,scheduling algorithm,telecommunication | Discrete mathematics,Topology,Pairwise comparison,Computer science,Scheduling (computing),Cutoff,Computer network,Communication channel,Collision,Infinite set,Transmission protocol,Channel capacity | Journal |
Volume | Issue | ISSN |
36 | 5 | 0018-9448 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. C. Yao | 1 | 23 | 5.36 |
| F. K. Hwang | 2 | 332 | 100.54 |