메뉴 건너뛰기




Volumn , Issue , 2009, Pages 210-219

Coloring unstructured wireless multi-hop networks

Author keywords

Ad hoc networks; Bounded independence graphs; Coloring; Distributed algorithms; Growth bounded graphs; Local algorithms; Parallel algorithms; Sensor networks; Unit disk graphs; Unstructured radio networks

Indexed keywords

BOUNDED INDEPENDENCE GRAPHS; DISTRIBUTED ALGORITHMS; GROWTH BOUNDED GRAPHS; LOCAL ALGORITHMS; UNIT DISK GRAPHS; UNSTRUCTURED RADIO NETWORKS;

EID: 70350686457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582751     Document Type: Conference Paper
Times cited : (42)

References (17)
  • 3
    • 70350630521 scopus 로고    scopus 로고
    • Distributed (delta+1)-coloring in linear (in delta) time
    • L. Barenboim and M. Elkin. Distributed (delta+1)-coloring in linear (in delta) time. In 41st STOC, 2009.
    • (2009) 41st STOC
    • Barenboim, L.1    Elkin, M.2
  • 4
    • 74549168274 scopus 로고    scopus 로고
    • Broadcasting algorithms in radio networks with unknown topology
    • A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology . In 44th Symp. on FOCS, 2003.
    • (2003) 44th Symp. on FOCS
    • Czumaj, A.1    Rytter, W.2
  • 5
    • 35048842771 scopus 로고    scopus 로고
    • A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
    • T. Herman and S. Tixeuil. A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks. In Lecture Notes in Computer Science, volume 3121/2004, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3121 , Issue.2004
    • Herman, T.1    Tixeuil, S.2
  • 7
    • 0035176032 scopus 로고    scopus 로고
    • Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
    • S. Khot. Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring. In 42nd Symp. on FOCS, 2001.
    • (2001) 42nd Symp. on FOCS
    • Khot, S.1
  • 8
    • 27844547602 scopus 로고    scopus 로고
    • Broadcasting in undirected ad hoc radio networks
    • D. R. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. In Distributed Computing, volume 18, pages 43-57, 2005.
    • (2005) Distributed Computing , vol.18 , pp. 43-57
    • Kowalski, D.R.1    Pelc, A.2
  • 12
    • 0022807929 scopus 로고    scopus 로고
    • M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15, 1986.
    • M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15, 1986.
  • 15
    • 0035300091 scopus 로고    scopus 로고
    • Some Simple Distributed Algorithms for Sparse Networks
    • A. Panconesi and R. Rizzi. Some Simple Distributed Algorithms for Sparse Networks. In Distributed Computing, 14(2), pages 97-100, 2001.
    • (2001) Distributed Computing , vol.14 , Issue.2 , pp. 97-100
    • Panconesi, A.1    Rizzi, R.2
  • 16
    • 70350625295 scopus 로고    scopus 로고
    • A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs
    • J. Schneider and R. Wattenhofer. A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In 27th Symp. on PODC, 2008.
    • (2008) 27th Symp. on PODC
    • Schneider, J.1    Wattenhofer, R.2
  • 17
    • 0016643763 scopus 로고
    • Packet Switching in Radio Channels: Part II - The Hidden Terminal Problem in Carrier Sense Multiple Access and the Busy Tone Solution
    • F. A. Tobagi and L. Kleinrock. Packet Switching in Radio Channels: Part II - The Hidden Terminal Problem in Carrier Sense Multiple Access and the Busy Tone Solution. In COM-23(12), 1975.
    • (1975) COM-23(12)
    • Tobagi, F.A.1    Kleinrock, L.2


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