This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bounding the Maximum Size of a Packet Radio Network
October 1988 (vol. 37 no. 10)
pp. 1184-1190
The author addresses the problem, arising in the topology design of packet radio networks (PRNs) which use time-division multiplexing and have a diameter constraint, of what is the maximum number n/sub c/(f,k) of users which can be contained in a diameter-k PRN with f time slots per frame. The author assumed that users cannot transmit and receive simultaneously and cannot transmit/receive more

[1] C. Prohazka, "The design of time-scheduled packet radio networks," Ph.D. dissertation, Univ. of Massachusetts, Amherst, MA, 1981.
[2] M. Garey and D. Johnson,Computers and Intractability. San Francisco, CA: Freeman, 1979.
[3] Y. Gold, W. Franta, and S. Moran, "A distributed channel-access protocol for fully-connected networks with mobile nodes,"IEEE Trans. Comput., vol. C-32, pp. 133-147, 1983.
[4] R. Sinha and S. Gupta, "Mobile packet radio networks: State-of-the-art,"IEEE Communications, vol. 23, no. 3, pp. 53-61, 1985.
[5] E. Arikan, "Some complexity results about packet radio networks,"IEEE Trans. Inform. Theory, vol. IT-30, pp. 681-685, 1984.
[6] S. Fiorini and R. Wilson,Edge-Colourings of Graphs. Marshfield, MA: Pitman, 1979.
[7] I. Holyer, "The NP-completeness of edge-coloring,"SIAM J. Comput., vol. 10, no. 4, pp. 718-720, 1981.
[8] I. Holyer, "The NP-completeness of some edge-partition problems,"SIAM J. Comput., vol. 10, no. 4, pp. 713-717, 1981.
[9] K. Noshita, "On proving the complexity of a certain graph-coloring problem,"J. Inform. Processing, vol. 7, pp. 106-110, 1984.
[10] R. Irving, "NP-completeness of a family of graph-coloring problems,"Discrete Appl. Math., vol. 5, pp. 111-117, 1983.
[11] M. Kubale, "A generalized implicit enumeration algorithm for graph coloring,"Commun. ACM, vol. 28, no. 4, pp. 412-418, 1985.
[12] D. Brelaz, "New methods to color the vertices of a graph,"Commun. ACM, vol. 22, no. 4, pp. 251-256, 1979.
[13] J. Peemöller, "A correction to Brelaz's modification of Brown's coloring algorithm,"Commun. ACM, vol. 26, no. 8, pp. 595-597, 1983.
[14] E. Arjomandi, "An efficient algorithm for colouring the edges of a graph withΔ+ 1 colours,"INFOR Canad. J. Oper. Res. Inform. Processing, vol. 20, no. 2-3, pp. 82-101, 1982.
[15] O. Terada and T. Nishizeki, "Approximate algorithms for the edge coloring of graphs,"Trans. IECE Japan, section E, vol. E65, no. 11, p. 704, 1982.
[16] U. Manber and M. Tompa, "The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem,"SIAM J. Comput., vol. 13, no. 1, pp. 109-115, 1984.
[17] A. Proskurowski and M. Syslo, "Efficient vertex- and edge-coloring of outerplanar graphs,"SIAM J. Algebraic Discrete Meth., vol. 7, p. 131, 1986.
[18] L. Eggan and M. Plantholt, "The chromatic index of nearly bipartite multigraphs,"J. Combinatorial Theory, series B, vol. 40, p. 71, 1986.
[19] H. Krawczyk and M. Kubale, "An approximation algorithm for diagnostic test scheduling in multicomputer systems,"IEEE Trans. Comput., vol. 34, p. 869, 1985.
[20] R. Tarjan, "Decomposition by clique separators,"Discrete Math., vol. 55, p. 221, 1985.
[21] I. Holyer and E. Cockayne, "On the sum of cardinalities of extremum maximal independent sets,"Discrete Math., vol. 26, p. 243, 1979.
[22] M. Plantholt, "The chromatic index of graphs with large maximum degree,"Discrete Math., vol. 47, p. 91, 1983.
[23] R. Dutton, "A new graph coloring algorithm,"Comput. J. (GB), vol. 24, no. 1, pp. 85-86, 1981.
[24] A. Brouwer, "On the edge-coloring problem for unions of complete uniform hypergraphs,"Discrete Math., vol. 34, no. 3, pp. 241-260, 1981.
[25] S. Poljak and V. Rodl, "On the arc-chromatic number of a digraph,"J. Combinatorial Theory, series B, vol. 31, no. 2, pp. 190-198, 1981.
[26] M. Goldberg, "Construction of class 2 graphs with maximum vertex degree 3,"J. Combinatorial Theory, series B, vol. 31, no. 3, pp. 282-291, 1981.
[27] D. de Werra, "On the existence of generalized good and equitable edge colorings,"J. Graph Theory, vol. 5, no. 3, pp. 247-258, 1981.
[28] D. Geller and A. Hilton, "How to color the lines of a bigraph,"Networks, vol. 4, pp. 281-282, 1974.
[29] D. Greenwell and H. Kronk, "Uniquely line-colorable graphs,"Canad. Math. Bull., vol. 16, pp. 525-529, 1973.
[30] S. Fiorini, "On the chromatic index of a graph,"J. Combinatorial Theory, series B, vol. 18, pp. 35-38, 1975.
[31] D. de Werra, "Some remarks on good colorations,"J. Combinational Theory, series B, vol. 21, pp. 57-64, 1976.
[32] R. Gupta, "On decompositions of a multigraph into spanning subgraphs,"Bull. Amer. Math. Soc., vol. 80, pp. 500-502, 1974.
[33] P. Cameron, "Minimal edge-colourings of complete graphs,"J. London Math. Soc. (2), vol. 11, pp. 337-346, 1975.

Index Terms:
maximum size bounding; packet radio network; topology design; time-division multiplexing; f-edge colorable directed graph; graph colouring; packet switching; radio networks.
Citation:
C.G. Prohazka, "Bounding the Maximum Size of a Packet Radio Network," IEEE Transactions on Computers, vol. 37, no. 10, pp. 1184-1190, Oct. 1988, doi:10.1109/12.5980
Usage of this product signifies your acceptance of the Terms of Use.