ScholarWorks@Soongsil University: SUH, CHANG JIN

Detailed Information

SUH, CHANG JIN (서창진)

College of Information Technology (School of Software)

Research Area

Tel
Homepage

ResearcherID ORCiD Scopus Google Scholar ID ResearchGate

Keyword

PEGASIS:5||PEDAP:4||FST:3||LECSEN:3||라우팅:3||Prim algorithm:3||WSN:3||Kruskal algorithm:3||Travelling Salesman&apos:2||센서 네트워크:2||Kruskal 알고리즘:2||Prim 알고리즘:2||Chain topology:2||체인 토폴로지:2||Routing:2||routing:2||Linear Programming:2||s Problem:2||Link Exchange:2||Sensor network:2||BGP:2||Fusion:2||Spanning tree:2||Minimum Spanning Chain:2||backup:1||bridging:1||chain routing with even energy consumption (CREEC):1||chain topology:1||eBGP stability:1||eBGP 안정성:1||fair energy consumption:1||link swap:1||lowenergy adaptive clustering hierarchy (LEACH):1||minimum spanning trees:1||reachability:1||s minimum spanning tree (MST):1||safeness:1||transit service:1||wireless sensor networks:1||wireless sensor networks (WSNs):1||도달성:1||링크 교환:1||백본망:1||백업:1||브리징:1||선형 프로그래밍:1||스패닝 트리:1||안전성:1||외판원의 최소동선 문제(TSP):1||이더넷:1||최소 스패닝 체인(MSC):1||최소 스패닝 트리:1||통과 서비스:1||Analytic model:1||퓨전:1||Carrier Ethernet:1||Chain:1||Combination:1||Combinatorial:1||Equal Cost Tree (ECT):1||Equal Cost Tree(ECT):1||Ethernet:1||Ethernet routing:1||Flow:1||Kruskal&apos:1||LEACH:1||MMSTP:1||MSTP:1||Packets deletion policy:1||Permutation:1||Provider Backbone Bridged Networks (PBBN):1||Rpermutation:1||Recursive function:1||SPB:1||STP:1||Shortest Path Bridging (SPB):1||Shortest Path Bridging(SPB):1||Throughput:1||

STATISTICS: Total View :7,895,993; Today View :1,452

RSS_1.0 RSS_2.0 ATOM_1.0

Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733

Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.

Detailed Information

Keyword

BROWSE