Almost disjunct codes in large scale multihop wireless network media access control

Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

Volumn 2005, Issue , 2005, Pages 453-460

  Engelhart, D Charles ^a   Sivasubramaniam, Anand ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; ACCESS PROTOCOLS; WIRELESS NETWORK;

CODES (SYMBOLS); CONTROL SYSTEM ANALYSIS; NETWORK PROTOCOLS; PROBLEM SOLVING; RADIO TRANSMISSION;

MOBILE COMPUTING;

EID: 33646921759     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOTS.2005.13     Document Type: Conference Paper

References (7)

1. A. J. MACULA, V. V. RYKOV, S. Y. Trivial two-stage group testing for complexes using almost disjunct matrices. Discrete and Applied Mathematics 137 (2004), 97-107.
2. CHLAMTAC, I., AND FARAGÓ, A. Making transmission schedules immune to topology changes in multihop packet radio networks. IEEE/ACM Transactions on Networking 2, 1 (February 1994), 23-29.
3. JU, J.-H., AND LI, V. O. K. An optimal topologytransparent scheduling method in multihop packet radio networks. IEEE/ACM Transactions on Networking 6, 3 (June 1998), 298-306.
4. KAUTZ, W. H., AND SINGLETON, R. Nonrandom binary superimposed codes. IEEE Transaction on Information Theory 10 (October 1964), 363-377.
5. MACULA, A. J. Simple construction of d-disjunct matrices with certain constant weights. Discrete Mathematics 162 (1996), 311-312.
6. SYROTIUK, V. R., COLBOURN, C. J., AND LING, A. C. H. Topology-transparent scheduling for manets using orthogonal arrays. Preprint, May 2003.
7. THE MATHWORKS, I. Matlab. http://www.mathworks.com/index.shtml.