Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks

IEEE/ACM Transactions on Networking

Volumn 3, Issue 4, 1995, Pages 441-449

  Bertossi, Alan A ^a   Bonuccelli, Maurizio A ^b  

^a UNIVERSITY OF TRENTO   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; FREQUENCY ALLOCATION; HEURISTIC METHODS; MULTIPLEXING; NETWORK PROTOCOLS; PACKET SWITCHING; RADIO INTERFERENCE; RADIO SYSTEMS;

CODE ASSIGNMENT; CODE DIVISION MULTIPLE ACCESS; HIDDEN TERMINAL INTERFERENCE; PACKET RADIO NETWORKS;

COMPUTER NETWORKS;

EID: 0029354351     PISSN: 10636692     EISSN: 15582566     Source Type: Journal    
DOI: 10.1109/90.413218     Document Type: Article

References (15)

1. N. Abrahmson, “The ALOHA system Another alternative for computer communications,” in Proc. FJCC, 1970, pp. 281-285.
2. I. Cidon and M. Sidi, “Distributed assignment algorithms for multihop packet radio networks,” IEEE Trans. Comput., vol. 38, pp. 1353-1361, Oct. 1989.
3. P. Duchet, Y. Hamidoune, M. Las Vergnas, and H. Meyniel, “Representing a planar graph by vertical lines joining different levels,” Discrete Math., vol. 46, pp. 319-321, Oct. 1983.
4. M. R. Garey and D. S. Johnson, Computers and Intractability a Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
5. B. Hajek and G. Sasaki, “Link scheduling in polynomial time,” IEEE Trans. Inform. Theory, vol. 34, pp. 910-917, Sept. 1988.
6. L. Hu, “Distributed code assignments for CDMA packet radio networks,” in Proc. INFOCOM91, Apr. 1991, pp. 1500-1509.
7. T. Makansi, “Transmitted-oriented code assignment for multihop packet radio,” IEEE Trans. Commun., vol. 35, pp. 1379-1382, Dec. 1987.
8. R. Nelson and L. Kleinrock, “Spatial TDMA: A collision-free multihop channel access protocol,” IEEE Trans. Commun., vol. 33, pp. 934-944, Sept. 1985.
9. M. J. Post, A. S. Kershenbaum, and P. E. Sarachik, “Scheduling multihop CDMA networks in the presence of secondary conflicts,” Algorithmica, vol. 4, pp. 365-394, Dec. 1989.
10. C. G. Prohazka, “Decoupling link scheduling constraints in multihop packet radio networks,” IEEE Trans. Comput., vol. 38, pp. 455-458, Mar. 1989.
11. M. Raynal, Distributed Algorithms and Protocols. New York: Wiley, 1988.
12. M. Schwartz, Telecommunications Networks: Protocols, Modeling, and Analysis. Reading, MA: Addison-Wesley, 1987.
13. L. Stockmeyer, “Planar 3-colorability is polynomial complete,” SIGACT News, vol. 3, pp. 19-25, July 1973.
14. A. S. Tanenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1989, 2nd ed.
15. F. A. Tobagi and L. Kleinrock, “Packet switching in radio channels, part II: The hidden terminal problem in CSMA and the busy tone solution,” IEEE Trans. Commun., vol. 23, pp. 1417-1433, Dec. 1975.