메뉴 건너뛰기




Volumn , Issue , 2007, Pages 2034-2039

Upper bound of the number of channels for conflict-free communication in multi-channel wireless networks

Author keywords

[No Author keywords available]

Indexed keywords

CONFLICT FREE COMMUNICATIONS; MULTICHANNEL WIRELESS NETWORKS; NETWORK INTERFERENCE RATIO; UPPER BOUNDS; WIRELESS NODES;

EID: 36349015588     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2007.381     Document Type: Conference Paper
Times cited : (6)

References (17)
  • 2
    • 32144442885 scopus 로고    scopus 로고
    • Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks
    • ALICHERRY, M., BHATIA, R., AND LI, L. Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. In Proceedings of MobiCom 2005 (2005), pp. 58-72.
    • (2005) Proceedings of MobiCom 2005 , pp. 58-72
    • ALICHERRY, M.1    BHATIA, R.2    LI, L.3
  • 3
    • 11244281584 scopus 로고    scopus 로고
    • BAHL, P., CHANDRA, R., AND DUNAGAN, J. SSCH: Slotted seeded channel hopping for capacity improvement in ieee 802.11 ad-hoc wireless networks. In Proceedings of MobiCom 2004.
    • BAHL, P., CHANDRA, R., AND DUNAGAN, J. SSCH: Slotted seeded channel hopping for capacity improvement in ieee 802.11 ad-hoc wireless networks. In Proceedings of MobiCom 2004.
  • 4
    • 0022499805 scopus 로고
    • On a circle placement problem
    • CHAZELLE, B., AND LEE, D. On a circle placement problem. Computing 36, 1 (1986), 1-16.
    • (1986) Computing , vol.36 , Issue.1 , pp. 1-16
    • CHAZELLE, B.1    LEE, D.2
  • 5
    • 0035190247 scopus 로고    scopus 로고
    • GERKE, S., AND MCDIARMID, C. Graph imperfection I. Journal of Combinatorial Theory (B) 83 (2001), 58-78.
    • GERKE, S., AND MCDIARMID, C. Graph imperfection I. Journal of Combinatorial Theory (B) 83 (2001), 58-78.
  • 7
    • 0020822226 scopus 로고
    • Efficient bounds for the stable set, vertex cover, and set packing problems
    • HOCHBAUM, D. Efficient bounds for the stable set, vertex cover, and set packing problems. Discrete Appl Math 6 (1983), 243-254.
    • (1983) Discrete Appl Math , vol.6 , pp. 243-254
    • HOCHBAUM, D.1
  • 8
    • 1542299160 scopus 로고    scopus 로고
    • Impact of interference on multi-hop wireless network performance
    • Sept
    • JAIN, K., PADHYE, J., PADMANABHAN, V. N., AND QIU, L. Impact of interference on multi-hop wireless network performance. In ACM MOBICOM (Sept. 2003).
    • (2003) ACM MOBICOM
    • JAIN, K.1    PADHYE, J.2    PADMANABHAN, V.N.3    QIU, L.4
  • 9
    • 0041525905 scopus 로고    scopus 로고
    • A multichannel csma mac protocol with receiver-based channel selection for multihop wireless networks
    • Phoenix, October
    • JAIN, N., DAS, S., AND NASIPURI, A. A multichannel csma mac protocol with receiver-based channel selection for multihop wireless networks. In Proc. IEEE IC3N (Phoenix, October 2001).
    • (2001) Proc. IEEE IC3N
    • JAIN, N.1    DAS, S.2    NASIPURI, A.3
  • 10
    • 32144440287 scopus 로고    scopus 로고
    • Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
    • KODIALAM, M., AND NANDAGOPAL, T. Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In Proceedings of MobiCom 2005 (2005), pp. 73-87.
    • (2005) Proceedings of MobiCom 2005 , pp. 73-87
    • KODIALAM, M.1    NANDAGOPAL, T.2
  • 11
    • 0035506896 scopus 로고    scopus 로고
    • Models and approximation algorithms for channel assignment in radio networks
    • KRUMKE, S., MARATHE, M., AND RAVI, S. Models and approximation algorithms for channel assignment in radio networks. ACM Wireless Networks 7, 6 (2001), 575-584.
    • (2001) ACM Wireless Networks , vol.7 , Issue.6 , pp. 575-584
    • KRUMKE, S.1    MARATHE, M.2    RAVI, S.3
  • 13
    • 32144457179 scopus 로고    scopus 로고
    • Capacity of multi-channel wireless networks: Impact of number of channels and interfaces
    • KYASANUR, P., AND VAIDYA, N. H. Capacity of multi-channel wireless networks: impact of number of channels and interfaces. In Proceedings of MobiCom 2005 (2005), pp. 43-57.
    • (2005) Proceedings of MobiCom 2005 , pp. 43-57
    • KYASANUR, P.1    VAIDYA, N.H.2
  • 15
    • 0035300091 scopus 로고    scopus 로고
    • Some simple distributed algorithms for sparse networks
    • PANCONESI, A., AND RIZZI, R. Some simple distributed algorithms for sparse networks. Distributed Computing, 14, 2 (2001), 97-100.
    • (2001) Distributed Computing , vol.14 , Issue.2 , pp. 97-100
    • PANCONESI, A.1    RIZZI, R.2
  • 17


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