Title :
Optimal contention among three senders
Author :
Christen, Claude A.
Author_Institution :
Dept. d´´Inf. et de Res. Opera., Montreal Univ., Que., Canada
fDate :
7/1/1988 12:00:00 AM
Abstract :
The tests allowed in conflict resolution problems have usually three types of outcomes, according to whether the test contains zero, one, or at least two senders. The question of locating three elements in a given interval of the real line with the least number of such tests is studied. A nested detection algorithm is provided which is then proven to be optimal. For this purpose, extensive use is made of a principle allowing interpolation between lower bounds
Keywords :
information theory; multi-access systems; packet switching; conflict resolution problems; interpolation; lower bounds; nested detection algorithm; optimal contention; packet transmission; three senders; time-slotted multiple access system; Councils; Detection algorithms; Equations; Feedback; Interpolation; Testing; Throughput;
Journal_Title :
Information Theory, IEEE Transactions on
