• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.035 seconds

Inferring genetic regulatory networks of the inflammatory bowel disease in human peripheral blood mononuclear cells

  • Kim, Jin-Ki;Lee, Do-Heon;Yi, Gwan-Su
    • Bioinformatics and Biosystems
    • /
    • v.2 no.2
    • /
    • pp.71-74
    • /
    • 2007
  • Cell phenotypes are determined by groups of functionally related genes. Microarray profiling of gene expression provides us response of cellular state to its perturbation. Several methods for uncovering a cellular network show reliable network reconstruction. In this study, we present reconstruction of genetic regulatory network of inflammation bowel disease in human peripheral blood mononuclear cell. The microarray based on Affymetrix Gene Chip Human Genome U133 Array Set HG-U133A is processed and applied network reconstruction algorithm, ARACNe. As a result, we will show that inferred network composed of 450 nodes and 2017 edges is roughly scale-free network and hierarchical organization. The major hub, CCNL2 (cyclin A2), in inferred network is shown to be associated with inflammatory function as well as apoptotic function.

  • PDF

Cluster-Based Quantization and Estimation for Distributed Systems

  • Kim, Yoon Hak
    • Journal of information and communication convergence engineering
    • /
    • v.14 no.4
    • /
    • pp.215-221
    • /
    • 2016
  • We consider a design of a combined quantizer and estimator for distributed systems wherein each node quantizes its measurement without any communication among the nodes and transmits it to a fusion node for estimation. Noting that the quantization partitions minimizing the estimation error are not independently encoded at nodes, we focus on the parameter regions created by the partitions and propose a cluster-based quantization algorithm that iteratively finds a given number of clusters of parameter regions with each region being closer to the corresponding codeword than to the other codewords. We introduce a new metric to determine the distance between codewords and parameter regions. We also discuss that the fusion node can perform an efficient estimation by finding the intersection of the clusters sent from the nodes. We demonstrate through experiments that the proposed design achieves a significant performance gain with a low complexity as compared to the previous designs.

QoS-Aware Scheduling for Multimedia Services in Wireless Networks (무선망상의 멀티미디어 서비스를 위한 QoS제공 스케줄링)

  • Jeong, Yong-Chan;Shin, Ji-Tae
    • Annual Conference of KIPS
    • /
    • 2003.11b
    • /
    • pp.1121-1124
    • /
    • 2003
  • 스케줄링은 네트워크상의 공유된 자원을 보다 효과적으로 이용하기 위한 것으로서 delay, delay jitter, packet loss rate, throughput과 같은 서비스 값들의 QoA(Quality of Service)를 보장하기 위한 핵심 요소이다. 유선망에서의 스케줄링은 이미 익숙한 영역으로 많은 발전이 되어왔지만, 무선채널의 불안정성이나 사용자의 움직임으로 인해 발생하는 다양한 링크 에러율과 용량 때문에 무선망에서의 직접적용은 많은 문제를 일으키게 된다. 이 논문에서는 기존에 나와 있는 여러 무선 스케줄링 기법중 채널 보상 모델을 이용하여 서비스 차별화(Service Differentiation)와 공평성(Fairness)에 초점을 맞춘 QoS제공 성능향상 스케줄링 알고리즘을 제안하였다.

  • PDF

Synchronization-based Power-Saving Protocols based on IEEE 802.11 Multi-hop Ad Hoc Network (IEEE 802.11 Multi-hop Ad Hoc Network에서의 동기식 에너지 절감 프로토콜)

  • Kim, Young-Man;Han, Wang-Won
    • Annual Conference of KIPS
    • /
    • 2005.11a
    • /
    • pp.1347-1350
    • /
    • 2005
  • 거의 모든 종류의 이동기기에서 에너지를 절감하는 것은 중요한 연구주제들중의 하나이다. 본 논문에서는 낮은 전원을 소모하는 슬립 모드로의 전환이 가능한 노드들로 구성된 MANET(mobile ad hoc networks)에서 에너지를 절감하는 새로운 프로토콜을 설계한다. 본 논문에서 고려하고 있는 MANET는 예측할 수 없는 호스트의 이동성, 멀티홉에서의 호스트들 간의 통신 그리고 비동기적인 메커니즘을 사용하는 특징을 가지고 있다. 특히 우리는 노드의 동기화가 에너지 절감 프로토콜의 복잡성에 어떤 영향을 미치는지에 대하여 연구한다. 또한 IEEE 802.11기반 multi-hop ad hoc network에 적용할 수 있고 동기적으로 전원을 관리하는 SPFAI(Synchoronous PFAI), ESPFAI(Efficient SPFAI), NSPFAI(Non-MTIM SPFAI)의 세가지 에너지 절감 프로토콜을 제안한다.

  • PDF

SDN Based Mobility Management To Reduce Packet Loss Using Anchor Switch Selection (Anchor 스위치 선정을 통해 패킷 손실을 줄이기 위한 SDN 기반의 이동성 기법)

  • Yang, Yunjung;Yeom, Sanggil;Choo, Hyunseung
    • Annual Conference of KIPS
    • /
    • 2016.10a
    • /
    • pp.119-122
    • /
    • 2016
  • 대표적인 네트워크 기반의 이동성 기법인 PMIPv6(Proxy Mobility IPv6)은 이동 단말에 대한 끊김 없는 서비스 지원이 가능하다. 하지만 PMIPv6 기법은 단말과 홈 에이전트 간 IP Tunnel을 생성해야 하며, 그에 따른 시그널링 비용이 발생하게 된다. 또한, 단말 이동에 따른 연속적인 서비스 지원만 고려할 뿐 이동 중 발생하는 패킷 손실은 고려하지 않는 문제점이 있다. 본 논문은 이러한 문제점을 해결하기 위해 SDN(Software Defined Networks)을 적용하였다. 데이터 플레인에서 Anchor 스위치를 선정하여 이동 전 위치의 단말로 전송되던 패킷을 이동한 위치의 단말로 Re-direction 함으로써 패킷 손실을 줄이기 위한 기법을 제안한다.

Rate-Compatible LDPC Codes Based on the PEG Algorithm for Relay Communication Systems

  • Zhou, Yangzhao;Jiang, Xueqin;Lee, Moon Ho
    • Journal of Communications and Networks
    • /
    • v.17 no.4
    • /
    • pp.346-350
    • /
    • 2015
  • It is known that the progressive edge-growth (PEG) algorithm can be used to construct low-density parity-check (LDPC) codes at finite code lengths with large girths through the establishment of edges between variable and check nodes in an edge-by-edge manner. In [1], the authors derived a class of LDPC codes for relay communication systems by extending the full-diversity root-LDPC code. However, the submatrices of the parity-check matrix H corresponding to this code were constructed separately; thus, the girth of H was not optimized. To solve this problem, this paper proposes a modified PEG algorithm for use in the design of large girth and full-diversity LDPC codes. Simulation results indicated that the LDPC codes constructed using the modified PEG algorithm exhibited a more favorable frame error rate performance than did codes proposed in [1] over block-fading channels.

BER Performance of OFDM Combined with TDM Using Frequency-Domain Equalization

  • Gacanin, Haris;Takaoka, Shinsuke;Adachi, Fumiyuki
    • Journal of Communications and Networks
    • /
    • v.9 no.1
    • /
    • pp.34-42
    • /
    • 2007
  • Orthogonal frequency division multiplexing (OFDM) combined with time division multiplexing (TDM), in this paper called OFDM/TDM, can overcome the high peak-to-average-power ratio (PAPR) problem of the conventional OFDM and improve the robustness against long time delays. In this paper, the bit error rate (BER) performance of OFDM/FDM in a frequency-selective Rayleigh fading. channel is evaluated by computer simulation. It is shown that the use of frequency-domain equalization based on minimum mean square error criterion (MMSE-FDE) can significantly improve the BER performance, compared to the conventional OFDM, by exploiting the channel frequency-selectivity while reducing the PAPR or improving the robustness against long time delays. It is also shown that the performance of OFDM/FDM designed to reduce the PAPR can bridge the conventional OFDM and single-carrier (SC) transmission by changing the design parameter.

A Parallel Collaborative Sphere Decoder for a MIMO Communication System

  • Koo, Jihun;Kim, Soo-Yong;Kim, Jaeseok
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.620-626
    • /
    • 2014
  • In this paper, we propose a parallel collaborative sphere decoder with a scalable architecture promising quasi-maximum likelyhood performance with a relatively small amount of computational resources. This design offers a hardware-friendly algorithm using a modified node operation through fixing the variable complexity of the critical path caused by the sequential nature of the conventional sphere decoder (SD). It also reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by tree pruning using collaboratively operated node operators. A Monte Carlo simulation shows that our proposed design can be implemented using only half the parallel operators compared to the approach using an ideal fully parallel scheme such as FSD, with only about a 7% increase of the normalized decoding time for MIMO dimensions of $16{\times}16$ with 16-QAM modulation.

Clustering Optimal Design in Wireless Sensor Network using Ant Colony Optimization (개미군 최적화 방법을 적용한 무선 센서 네트워크에서의 클러스터링 최적 설계)

  • Kim, Sung-Soo;Choi, Seung-Hyeon
    • Korean Management Science Review
    • /
    • v.26 no.3
    • /
    • pp.55-65
    • /
    • 2009
  • The objective of this paper is to propose an ant colony optimization (ACO) for clustering design in wireless sensor network problem. This proposed ACO approach is designed to deal with the dynamics of the sensor nodes which can be adaptable to topological changes to any network graph in a time. Long communication distances between sensors and a sink in a sensor network can greatly consume the energy of sensors and reduce the lifetime of a network. We can greatly minimize the total communication distance while minimizing the number of cluster heads using proposed ACO. Simulation results show that our proposed method is very efficient to find the best solutions comparing to the optimal solution using CPLEX in 100, 200, and 400 node sensor networks.

A Study on the Method of CAN Identifier assignment for Real-Time Network (실시간 네트워크를 위한 CAN 식별자 지정 방법에 관한 고찰)

  • 정의헌;이홍희
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.34-34
    • /
    • 2000
  • One of the basic goals, when considering networks for communication in industrial control applications, is the reduction of complexity of related wiring harnesses. In addition, the networking offers the advantages for industrial control applications, such as ease of cabling, ease of changes in the cabling, ease of adding controller modules, etc. CAN (Controller Area Network) is generally applied in car networking in order to reduce the complexity of the related wiring harnesses. These traditional CAN application techniques are modified to achieve the real time communication for the industrial control applications. In this paper, we propose the method of CAN Identifier assignment for Real-Time network system. This method is can be used to scheduling messages on CAN for Real-Time network system. And also, the real-time network system is developed and the proposed moth(Ids are verified experimentally.

  • PDF