On a tree collision resolution algorithm in presence of capture

U. Schmid

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1992)

  • Volume: 26, Issue: 2, page 163-197
  • ISSN: 0988-3754

How to cite

top

Schmid, U.. "On a tree collision resolution algorithm in presence of capture." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 26.2 (1992): 163-197. <http://eudml.org/doc/92413>.

@article{Schmid1992,
author = {Schmid, U.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {random access broadcast system; collision-type channel; collision resolution; tree-algorithm; capture effects; packets},
language = {eng},
number = {2},
pages = {163-197},
publisher = {EDP-Sciences},
title = {On a tree collision resolution algorithm in presence of capture},
url = {http://eudml.org/doc/92413},
volume = {26},
year = {1992},
}

TY - JOUR
AU - Schmid, U.
TI - On a tree collision resolution algorithm in presence of capture
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1992
PB - EDP-Sciences
VL - 26
IS - 2
SP - 163
EP - 197
LA - eng
KW - random access broadcast system; collision-type channel; collision resolution; tree-algorithm; capture effects; packets
UR - http://eudml.org/doc/92413
ER -

References

top
  1. 1. P. MATHYS and Ph. FLAJOLET, Q-ary Collision Resolution Algorithms in Random Access Systems with Free or Blocked Channel Access, IEEE Trans. Inf. Th. 1985, IT-31, No. 2, pp. 217-243. Zbl0566.94001MR793093
  2. 2. G. FAYOLLE, Ph. FLAJOLET, M. HOFRI and P. JACQUET, The Evaluation of Packet Transmission Characteristics in a Multi-Access Channel with Stack Resolution Protocol, INRIA Rapports de Recherche, 1983, No. 245. 
  3. 3. M. SIDI and I. CIDON, Splitting Protocols in presence of Capture, IEEE Trans. Inf. Th., 1985, IT-31, No. 2, pp. 295-301. Zbl0563.94002MR793099
  4. 4. Ph. FLAJOLET and R. SEDGEWICK, Digital Search Trees revisited, SIAM J. Algorithms, August 1986, 15, (3), pp. 748-767. Zbl0611.68041MR850421
  5. 5. D. E. KNUTH, The Art of Computer Programming, Addison-Wesley, Reading, Mass., 1983. MR378456
  6. 6. G. ANDREWS, The Theory of Partitions, Addison-Wesley, Reading, Mass, 1976. Zbl0371.10001MR557013
  7. 7. N. E. NÖRLUND, Vorlesungen über Differenzenrechnung, Chelsea Publishing Company, New York, 1954. 
  8. 8. J. RIORDAN, Combinatorial Identities, John Wiley & Sons, New York, 1968. Zbl0194.00502

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.