CONSTRUCTION OF LARGE PACKET RADIO NETWORKS-Reference-Cited by-同舟云学术

CONSTRUCTION OF LARGE PACKET RADIO NETWORKS

Published:1992-03 Issue:01 Volume:02 Page:3-12
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

BERMOND JEAN-CLAUDE¹,HELL PAVOL²,QUISQUATER JEAN-JACQUES³

Affiliation:

1. CNRS, Université de Nice — Sophia Antipolis, 250 avenue A. Einstein, Bat. 4, Sophia-Antipolis 1, 06560 Valbonne Cedex, France

2. School of Computing Science, Simon Fraser University, Burnaby, British Columbia, V5A IS6, Canada

3. Philips Research Laboratory, Louvain-la-Neuve, Belgium

Abstract

We outline constructions of packet radio networks (with time division multiplexing) that achieve much better parameters than those previously proposed. Given the desired diameter and number of slots per time frame, our networks seek to maximize the possible number of users. We model this as a problem of constructing large graphs or digraphs with given diameter and chromatic index, and relate it to extant work on large graphs with given diameter and maximum degree.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S012962649200012X

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Line Directed Hypergraphs;Cryptography and Security: From Theory to Applications;2012

2. A surprising permanence of old motivations (a not-so-rigid story);Discrete Mathematics;2009-09

3. Optimal edge coloring of large graphs;Networks;1999-08

4. A proof of Jean de Rumeur's conjecture;Discrete Applied Mathematics;1997-05

5. On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs;Journal of Graph Theory;1993-11