Some Complexity Results about Packet Radio Networks

IEEE Transactions on Information Theory

Volumn 30, Issue 4, 1984, Pages 681-685

  Arikan, Erdal ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RADIO SYSTEMS;

EID: 0021465991     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1984.1056928     Document Type: Article

References (6)

1. R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C. Kunzelman “Advances in packet-radio technology,” Proc. IEEE, vol. 66, pp. 1468–1496, Nov. 1978.
2. P. D. Shapiro, “Conditions for optimal routing in a radio network,” B.S. thesis, M.I.T., Cambridge, MA, May 1979.
3. M. Sidi and A. Segall “Two interfering queues in packet-radio networks,” IEEE Trans. Comm., vol. COM-31, no. 1, pp. 123–129, Jan. 1983.
4. S. Toueg and K. Steiglitz “The complexity of optimal addressing in radio networks,” IEEE Trans. Comm., vol. COM-30, no. 11, pp. 2455–2457, Nov. 1982.
5. E. Arikan, “Multi-access in packet-radio networks,” M.S. thesis, LIDS-TH-1234, TH-1234, M.I.T., Cambridge, MA, Aug. 1982.
6. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization. Englewood Cliffs, NJ: Prentice Hall, 1982, p. 428.