메뉴 건너뛰기




Volumn , Issue , 2000, Pages 18-27

Efficient use of radio spectrum in wireless networks with channel separation between close stations

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; GRAPH THEORY; RADIO SYSTEMS; TRANSMITTERS;

EID: 0034592862     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/345848.345853     Document Type: Conference Paper
Times cited : (26)

References (12)
  • 1
    • 0032673680 scopus 로고    scopus 로고
    • Assigning codes in wireless networks: Bounds and scaling properties
    • R. Battiti, A.A. Bertossi, and M.A. Bonuccelli, "Assigning Codes in Wireless Networks: Bounds and Scaling Properties", Wireless Networks, Vol. 5, 1999, pp. 195-209.
    • (1999) Wireless Networks , vol.5 , pp. 195-209
    • Battiti, R.1    Bertossi, A.A.2    Bonuccelli, M.A.3
  • 2
    • 0029354351 scopus 로고
    • Code assignment for hidden terminal interference avoidance in multihop packet radio networks
    • A.A. Bertossi and M.A. Bonuccelli, "Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks", IEEE/ACM Transactions on Networking, Vol. 3, 1995, pp. 441-449.
    • (1995) IEEE/ACM Transactions on Networking , vol.3 , pp. 441-449
    • Bertossi, A.A.1    Bonuccelli, M.A.2
  • 3
    • 0013039846 scopus 로고    scopus 로고
    • Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
    • Depatment of Mathematics, University of Trento
    • A.A. Bertossi and M.C. Pinotti, "Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees", Tec. Rep. UTM-563, Depatment of Mathematics, University of Trento, 1999.
    • (1999) Tec. Rep. UTM-563
    • Bertossi, A.A.1    Pinotti, M.C.2
  • 6
    • 0023363240 scopus 로고
    • Distributed nodes organizations algorithm for channel access in a multihop dynamic radio network
    • I. Chlamtac and S.S. Pinter, "Distributed nodes Organizations Algorithm for Channel Access in a Multihop Dynamic Radio Network", IEEE Transactions on Computers, Vol. 36, 1987, pp. 728-737.
    • (1987) IEEE Transactions on Computers , vol.36 , pp. 728-737
    • Chlamtac, I.1    Pinter, S.S.2
  • 7
  • 8
    • 0019213982 scopus 로고
    • Frequency assignment: Theory and application
    • W.K. Hale, "Frequency Assignment: Theory and Application", Proceedings of the IEEE, Vol. 68, 1980, pp. 1497-1514.
    • (1980) Proceedings of the IEEE , vol.68 , pp. 1497-1514
    • Hale, W.K.1
  • 9
    • 0030172707 scopus 로고    scopus 로고
    • Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
    • June
    • I. Katzela and M. Naghshineh, "Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey", IEEE Personal Communications, June 1996, pp. 10-31.
    • (1996) IEEE Personal Communications , pp. 10-31
    • Katzela, I.1    Naghshineh, M.2
  • 10
    • 0023669849 scopus 로고
    • Transmitted oriented code assignment for multihop packet radio
    • T. Makansi, "Transmitted Oriented Code Assignment for Multihop Packet Radio", IEEE Transactions on Communications, Vol. 35, 1987, pp. 1379-1382.
    • (1987) IEEE Transactions on Communications , vol.35 , pp. 1379-1382
    • Makansi, T.1
  • 11
    • 0020765471 scopus 로고
    • Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
    • S.T. McCormick, "Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem", Mathematical Programming, Vol. 26, 1983, pp. 153-171.
    • (1983) Mathematical Programming , vol.26 , pp. 153-171
    • McCormick, S.T.1
  • 12
    • 0000380901 scopus 로고
    • Labeling cordal graphs: Distance two condition
    • D. Sakai, "Labeling Cordal Graphs: Distance Two Condition", SIAM Journal on Discrete Mathematics, Vol. 7, 1994, pp. 133-140.
    • (1994) SIAM Journal on Discrete Mathematics , vol.7 , pp. 133-140
    • Sakai, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.