메뉴 건너뛰기




Volumn , Issue , 2011, Pages 251-256

Topology partitioning in wireless sensor networks using multiple sinks

Author keywords

k NNG; Multiple sinks; Partitioning network; Routing; Wireless Sensor Network

Indexed keywords

DESIGN CRITERION; K-NEAREST NEIGHBOURS; K-NNG; MULTIPLE SINKS; NETWORK LIFETIME; NETWORK PARTITIONING; PARTITIONED NETWORKS; RESEARCH TOPICS; ROUTING; ROUTING DATA; SOURCE NODES;

EID: 84859958478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCITechn.2011.6164793     Document Type: Conference Paper
Times cited : (17)

References (9)
  • 9
    • 0030577307 scopus 로고    scopus 로고
    • Approximating the Maximally Balanced Connected Partition Problem in graphs
    • J. Chlebikova, "Approximating the Maximally Balanced Connected Partition Problem in graphs,"in Information Processing Letters 60, 1996.
    • (1996) Information Processing Letters , pp. 60
    • Chlebikova, J.1


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