메뉴 건너뛰기




Volumn , Issue , 2002, Pages 195-202

Channel assignment with separation for special classes of wireless networks: Grids and rings

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84966605249     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1016599     Document Type: Conference Paper
Times cited : (5)

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
    • 23044520219 scopus 로고    scopus 로고
    • Mappings for Conflict-Free Access of Paths in Elementary Data Structures
    • Sixth Annual Int'l Computing and Combinatorics Conference
    • A.A. Bertossi and M.C. Pinotti, "Mappings for Conflict-Free Access of Paths in Elementary Data Structures" Sixth Annual Int'l Computing and Combinatorics Conference, in LNCS 1858, 2000.
    • (2000) LNCS , vol.1858
    • Bertossi, A.A.1    Pinotti, M.C.2
  • 5
    • 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
    • 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
  • 9
    • 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
  • 10
    • 0000380901 scopus 로고
    • Labeling Chordal Graphs: Distance Two Condition
    • D. Sakai, "Labeling Chordal 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가 분석하여 추출한 것입니다.