• Title/Summary/Keyword: 네트워크의 전체구조

Search Result 279, Processing Time 0.035 seconds

Reduction of Control Messages in a Multi-rate Based Ad hoc Network (Multi-rate의 애드혹 네트워크에서 제어메시지 감소 기법)

  • 김민수;김성천
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.673-675
    • /
    • 2004
  • 애드혹 네트워크지(ad hoc network)는 기존 유선 환경에서의 인프라가 없이도 각 무선 노드들이 필요한 상황에 맞게 동적으로 네트워크를 구성할 수 있는 무선 노드들의 집합을 말한다. 애드혹 네트워크는 제한된 파워 공급, 노드의 이동성으로 인한 잦은 경로 재설정 등으로 동적인 토폴로 구조를 갖는다. 유선 네트워크와 다른 이러한 특징들 때문에 기존의 라우팅 알고리즘을 수정한 다양한 라우팅 알고리즘이 등장 하였다. 그 중 multi-rate을 고려한 AODV 라우팅 기법은 기존의 single-rate을 이용하는 것보다 전송 연 시간의 감소, 패킷 처리율 증가와 같은 장점을 갖는다. 그러나 새로운 경로를 설정함에 있어서 네트워크 전반에 걸쳐 제어 메시 의 수가 증가하는 단점이 있다. 애드혹 네트워크에서 제어메시 는 데이터 패 킷보다 전송시 우선 순위를 가 기 때문에 제어메시 의 증가는 전체적인 패킷 처리율을 감소시킨다. 이러한 문제점을 해결하고자 본 논문에서는 경로 복구 매커니즘의 확장 및 검색지(expanding ring search)알고리즘에서 제어 메시 의 수를 효과적으로 줄일 수 있는 방법을 제안하였다. 기본 아이디어는 단절 이전의 정보를 이용하여 선택적으로 제어 메시 를 브로드 캐스트하는 것이다. NS-2로 제안 알고리즘을 시뮬레이션 한 결과. 기존방법에 비해 20%이상 제어 메시 가 감소하였고, 패킷 전송 연에 대해서는 최대 10%의 감소율을 보여 기존 방법보다 좋은 성능을 보임을 확인할 수 있었다.

  • PDF

Characterization of Diseasomal Proteins from Human Disease Network (인간 질병 네트워크로부터 얻은 질병 단백체의 특성 분석)

  • Lee, Yoon Kyeong;Ku, Jaeul;Yeo, Myeong Ho;Kang, Tae Ho;Song, MinDong;Yoo, Jae-Soo;Kim, Hak Yong
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.306-311
    • /
    • 2009
  • We initially obtained human diseases-related proteins dataset from the OMIM and the SWISS PROT and then constructed disease-related protein-protein interaction network. The protein network contains 40 hub proteins such as CALM1, ACTB and ABL2. The protein network can be derived the map of the relationship between different disease proteins, denoted disease interaction network. We demonstrate that the associations between diseases are directly correlated to their underlying protein-protein interaction networks. From constructed the disease-protein bipartite network, we derived 38 diseasomal proteins, including APP, ABL1 and STAT1. We previously demonstrated that hub proteins in the network tend to be diseasomal proteins in the disease-related protein sub-networks. However, we found that 18% hubs are only diseasomal proteins in the whole disease network. At this point, we could not elucidate difference in the hub-diseasomal proteins tendency between sub0network and whole network. In spite of we still have unsolved problems, our results elucidate that the discovery of protein interaction networks assigned by diseases will provide insight into the underlying molecular mechanisms and biological processes in complex human disease system.

  • PDF

A Study on the Design of Monitoring Architecture for the Grid NOC (그리드 NOC를 위한 모니터링 구조의 설계에 관한 연구)

  • 하지아;안성진;이혁로;노민기
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.4
    • /
    • pp.90-99
    • /
    • 2002
  • Grid makes it possible to cooperate with other network area by sharing and using distributed resources. In order to manage effectively large-scale Grid network resources, Grid NOC needs monitoring architecture that can manage distributed resources in one time. Being restricted within specific managing area conventional network management system has limitation in extension of managing area and in general management of heterogeneous resource. In this paper, we design a monitoring architecture that can take in the situation and has scalability. In the monitoring architecture the network areas publish information in a common directory service, and then Grid NOC can connect to the network areas directly by using this information. Therefore, it makes us possible to manage overall large-scale resource of Grid network reducing load.

  • PDF

Research Networking in Convergence Relations: A Network Analytic Approach to Interdisciplinary Cooperation (연결망 분석을 활용한 인문사회기반 융합연구 구조에 관한 연구: 네트워크 중심성과 중개자 역할을 중심으로)

  • Yang, Chang Hoon;Heo, Jungeun
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.12
    • /
    • pp.49-63
    • /
    • 2017
  • Interdisciplinary convergence research is widely seen as a collaborative research between different disciplines, which is often driven by common agenda or problems in pursuit of a particular common objective. Thus, the purpose of interdisciplinary cooperation in convergence research is to bring each discipline's unique perspective together with the academic expertise of researchers in order to share common problems that cannot be solved effectively without research partnership. We present empirical evidence on how interdisciplinary research relationships are formed to facilitate research networking in convergence relations. In particular, we used network analysis to investigate how interdisciplinary linkages and convergence research networks has formed over time. We found that the convergence research networks were implemented by the interdisciplinary convergence research support program as intended. We did find that research field with high indegree and outdegree in a network played critical roles on the dynamics and degree of interdisciplinarity. Finally, we could find evidence that the role of liaison brokers triggered relational dynamics in interdisciplinary research collaboration.

All-port Broadcasting Algorithms on Wormhole Routed Star Graph Networks (웜홀 라우팅을 지원하는 스타그래프 네트워크에서 전 포트 브로드캐스팅 알고리즘)

  • Kim, Cha-Young;Lee, Sang-Kyu;Lee, Ju-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.2
    • /
    • pp.65-74
    • /
    • 2002
  • Recently star networks are considered as attractive alternatives to the widely used hypercube for interconnection networks in parallel processing systems by many researchers. One of the fundamental communication problems on star graph networks is broadcasing In this paper we consider the broadcasting problems in star graph networks using wormhole routing. In wormhole routed system minimizing link contention is more critical for the system performance than the distance between two communicating nodes. We use Hamiltonian paths in star graph to set up link-disjoint communication paths We present a broadcast algorithm in n-dimensional star graph of N(=n!) nodes such that the total completion time is no larger than $([long_n n!]+1)$ steps where $([long_n n!]+1)$ is the lower bound This result is significant improvement over the previous n-1 step broadcasting algorithm.

Time Synchronization using the Accumulative Time Information in Wireless Sensor Networks (센서 네트워크에서의 누적 시간 정보를 이용한 시간 동기화)

  • No, Jin-Hong;Hong, Young-Sik
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.44-49
    • /
    • 2006
  • 최근 무선 통신의 발달과 임베디드 시스템의 확산으로 주변 상황을 감지하고 통신할 수 있는 저전력 장치인 무선 센서 네트워크에 대한 연구가 많이 진행되고 있다. 무선 센서 네트워크를 구성하는 노드들 간의 동기화, 순서화, 그리고 일관성 유지를 위하여 시간 동기화는 반드시 필요하다. 하지만 지난 20여 년간 연구되어진 분산 시스템에서의 시간 동기화 방법들은 풍부하지 않은 자원과 에너지 소모 등을 고려해야 하는 무선 센서 네트워크의 특성상 그대로 적용하기에는 어려운 점이 많다. 이에 본 논문에서는 무선 센서 네트워크에서의 누적 시간 정보를 이용한 시간 동기화 방법을 제안한다. 무선 브로드캐스트의 특성을 활용하여 시간 동기화의 제약 조건을 완화하여 높은 정확성을 제공하면서 한 번의 브로드캐스트 메시지만으로 시간을 동기화함으로써 에너지 손실을 최소화하였다. 이를 위해 송신자-수신자 방식의 구조에서 송신자는 시간 동기화를 위한 시간 정보를 브로드캐스트하고, 수신자는 누적된 시간 정보를 통해 편차와 편차율을 계산하여 송신자의 시간을 추정하고 동기화된 시간인 가상 시간을 계산하였다. 전체 센서노드들의 시간이 동기화할 수 있음을 분석하고 실험을 통해 효율성을 확인하였다.

  • PDF

A Study on the Design of Monitoring Architecture for the Grid NOC (그리드 NOC를 위한 모니터링 구조의 설계에 관한 연구)

  • 하지아;안성진;이혁로;노민기
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2002.06a
    • /
    • pp.97-106
    • /
    • 2002
  • Grid makes it possible to cooperate with other network area by sharing and using distributed resources. In order to manage effectively large-scale Grid network resources, Grid NOC needs monitoring architecture that can manage distributed resources in one time. Being restricted within specific managing area, conventional network management system has limitation in extension of managing area and in general management of heterogeneous resource. In this paper, we design a monitoring architecture that can take in the situation and has scalability. In the monitoring architecture the network areas publish information in a common directory service, and then Grid NOC can connect to the network areas directly by using this information. Therefore, it makes us possible to manage overall large-scale resource of Grid network reducing load.

  • PDF

A intelligent network weather map framework using mobile agent (이동 에이전트 기반 지능형 네트워크 weather map 프레임워크)

  • Kang, Hyun-Joong;Nam, Heung-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.3
    • /
    • pp.203-211
    • /
    • 2006
  • Today, Internet covers a world wide range and most appliances of our life are linked to network from enterprise server to household electric appliance. Therefore, the importances of administrable framework that can grasp network state by real-time is increasing day by day. Our objective in this paper is to describe a network weather report framework that monitors network traffic and performance state to report a network situation including traffic status in real-time. We also describe a mobile agent architecture that collects state information in each network segment. The framework could inform a network manager of the network situation. Through the framework. network manager accumulates network data and increases network operating efficiency.

  • PDF

A Analytical Study on the Properties of Coauthorship Network Based on the Co-author Frequency (공저빈도에 따른 공저 네트워크의 속성 연구 - 문헌정보학 분야 4개 학술지를 중심으로 -)

  • Lee, Soo-Sang
    • Journal of Korean Library and Information Science Society
    • /
    • v.42 no.2
    • /
    • pp.105-125
    • /
    • 2011
  • This paper grasps about various features of the coauthorship network based on the co-author frequency in the Korean LIS Research Community. This issue includes many topics such as changable aspects of coauthorship network, properties of higher cooperative authors groups. This work is mostly analyzed through a bibliographic analysis of articles which is published from 2000 to 2009(10 years) in Korean Library & Information Science major four journals. The results show three major implications. 1) There is a various structural changes of coauthorship network on the change of the co-author frequency. 2) There are 21 research pairs in the higher cooperative authors groups with the co-author frequency more than five. 3) There seems that any subjective relations between the articles which is produced by 21 research pairs were not clearly presents.

Analysis of Inauguration Address of Previous Korean Presidents Based on Network (네트워크 기반 대한민국 역대 대통령 취임사 분석)

  • Kim, Hak Yong
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.11
    • /
    • pp.11-19
    • /
    • 2021
  • The presidential inaugural address is a very useful means of presenting the national vision and conveying the president's political philosophy and policy direction to the people. For this reason, analyzing the address will help to understand the president him/herself and the presidential times. The address can be analyzed in various academic fields, but in this study, it was considered as only content and analyzed based on the network. It is widely used for word cloud analysis based on the frequency of words appearing in the address. If it is analyzed based on a network, it will be a useful method because it is possible to derive the context contained in the sentence. The entire network of the addresses of past presidents of the Republic of Korea was established and structural factors were presented. The president and political direction were derived by comparatively analyzing the key words derived from the network and the word cloud. The characteristics of the address were presented by comparing and analyzing key words and closeness centrality, which is a structural factor of the network, by constructing a network of each president's inaugural address. It is expected that the network-based analysis of past presidential inaugural addresses can ultimately be used as data for understanding and evaluating presidents.