• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.036 seconds

Hybrid Channel Model in Parallel File System (병렬 파일 시스템에서의 하이브리드 채널 모델)

  • Lee, Yoon-Young;Hwangbo, Jun-Hyung;Seo, Dae-Wha
    • The KIPS Transactions:PartA
    • /
    • v.10A no.1
    • /
    • pp.25-34
    • /
    • 2003
  • Parallel file system solves I/O bottleneck to store a file distributedly and read it parallel exchanging messages among computers that is connected multiple computers with high speed networks. However, they do not consider the message characteristics and performances are decreased. Accordingly, the current study proposes the Hybrid Channel model (HCM) as a message-management method, whereby the messages of a parallel file system are classified by a message characteristic between control messages and file data blocks, and the communication channel is divided into a message channel and data channel. The message channel then transfers the control messages through TCP/IP with reliability, while the data channel that is implemented by Virtual Interface Architecture (VIA) transfers the file data blocks at high speed. In tests, the proposed parallel file system that is implemented by HCM exhibited a considerably improved performance.

An Approach to Interoperability Test using an RTO Model (실시간 객체 모형을 이용한 상호운용성 시험 접급 방법)

  • Choe, Jin-Yeong;Min, Byeong-Jun;Kim, Mun-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.5
    • /
    • pp.1211-1220
    • /
    • 1997
  • Testing ineroperability among various impiementations provided by multi- vendors is not only cistly costly but also inpossible in many real situations. The comformance testing and it's extended testing methodologies are not suf- ficient to effectively guarantee the interoperability.This paper proposes an approach to the protocol interperability test based on a real-time object model which successfully abstracts compunents of real-time systens such as communication networks.In this approach,IUT (Implementation Under Test)and the testing environment are represented by means of the RTO.k model and the resultant objests are executed on the DREAM kemel with local monitors and s global monitor.The local monitors obeserve and control the events,and the global monitor manages the call control protocol of B-ISDN UNI Q.2931 as an example.It indicated that high fault coverage could be obtained with this approach.

  • PDF

The Coexistence of OFDM-Based Systems Beyond 3G with Fixed Service Microwave Systems

  • Jo Han-Shin;Yoon Hyun-Goo;Lim Jae-Woo;Chung Woo-Ghee;Yook Jong-Gwan;Park Han-Kyu
    • Journal of Communications and Networks
    • /
    • v.8 no.2
    • /
    • pp.187-193
    • /
    • 2006
  • In this paper, we study the coexistence of orthogonal frequency division multiplexing (OFDM)-based systems beyond 3G (B3G) and point-to-point (P-P) fixed service (FS) microwave systems. The advanced general analytical model derived via a power spectral density (PSD) analysis proposed in this paper has two advantages in comparison with the conventional minimum coupling loss (MCL) method. First, the interfering signal power that appears in the band of a victim system can be easily assessed without a spectrum emission mask. Second, when transmit power is not allocated to some subcarriers overlapping the band of the victim system in order to mitigate B3G OFDM-based systems interference with other systems, the general analytical model can successfully assess the interference from the B3G systems into FS systems, whereas the MCL method incorporating the spectrum emission mask cannot be applied in the presence of the same interference condition. The proposed model can be derived in a closed form and is simply implemented with the help of simulation, and thus the solution can be obtained in significantly reduced time. Through application of the proposed model, coexistence results are analyzed in a co-channel and adjacent channel with respect to guard band and minimum separation distance.

Network-Coding-Based Coded Cooperation

  • Wu, Suwen;Zhu, Jinkang;Qiu, Ling;Zhao, Ming
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.366-374
    • /
    • 2010
  • Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner's parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor, yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

The Study of Sensor Network for Information Retrieval and Communication Protocol High Performance Algorithm (센서 네트워크의 정보검색 및 통신프로토콜 성능향상 알고리즘에 관한 연구)

  • Kang, Jeong-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5B
    • /
    • pp.816-823
    • /
    • 2010
  • Recently research efforts for ubiquitous technology that includes RFID(Radio Frequency Deification and sensor networks are conducted very actively The architectural framework of the USN sensor network discovery service. The survey of the USN technology is conducted on four technological visions that contain USN system technology USN networking technology and USN middleware along with the service platform, With respect to each technological division domestic and worldwide leading research projects are primarily explored with their technical features and research projects are primarily explored with their technical features and research outputs. Boasted on the result of the survey we establish a USN software model that includes data sensing, sensor data storage sensor data storage sensor data naming and sensor feed name service. This main objective of this model is to provide a reference model for the facilitation of USN application developments.

Mechanism for Building Approximation Edge Minimum Spanning Tree Using Portals on Input Edges (선분상의 포탈을 이용한 근사 선분 최소 신장 트리의 생성)

  • Kim, In-Bum;Kim, Soo-In
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.509-518
    • /
    • 2009
  • In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

A Sensor Overlay Network Providing Middleware Services on Wireless Sensor Networks (무선 센서 네트워크에서 미들웨어 서비스를 제공하는 센서 오버레이 네트워크)

  • Kim, Yong-Pyo;Jung, Eui-Hyun;Park, Yong-Jin
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.653-660
    • /
    • 2009
  • A research for middleware of WSN can provide sensor applications with avoiding tight coupling of hardware, ease of development, and abstract data access. However, previous works have some limitations which should install their own middleware onto the all sensor nodes resulting in computational and communication overhead. In order to address it, we proposed a virtual sensor overlay network, called TinyONet-Lite which introduced virtual sensors to model a virtual counterpart of physical sensors. These virtual sensors dynamically grouped into an overlay network, Slice, which provides middleware services. We implemented TinyONet-Lite on mote class hardware with TinyOS. In accordance with experiments and comparison with existing researches, TinyONet-Lite was proved to show advantages of extensibility, dynamic service composition and reducing overhead.

Adaptive Indoor Localization Scheme to Propagation Environments in Wireless Personal Area Networks (WPAN에서 환경 변화에 적응력 있는 실내 위치 측위 기법)

  • Lim, Yu-Jin;Park, Jae-Sung
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.645-652
    • /
    • 2009
  • Location-based service providing the customized information or service according to the user's location has attracted a lot of attention from the mobile communication industry. The service is realized by means of several building blocks, a localization scheme, service platform, application and service. The localization scheme figures out a moving target's position through measuring and processing a wireless signal. In this paper, we propose an adaptive localization scheme in an indoor localization system based on IEEE 802.15.4 standard. In order to enhance the localization accuracy, the proposed scheme selects the best reference points and adaptively reflects the changes of propagation environments of a moving target to approximate distances between the target and the reference points in RSS(Received Signal Strength) based localization system using triangulation. Through the implementation of the localization system, we verify the performance of the proposed scheme in terms of the localization accuracy.

A Survey of the Self-Adaptive IoT Systems and a Compare and Analyze of IoT Using Self-Adaptive Concept (자가적응형 IoT 시스템 개발 동향과 자가적응형 개념을 활용한 IoT 비교분석)

  • Hwang, Seyoung;Seo, Jangill;Park, Sungjun;Park, Sangwon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.1
    • /
    • pp.17-26
    • /
    • 2016
  • IoT means things space networks that form the intelligent relationship such as sensing, networking, information processing about human being, things and service without explicit mutual cooperation of human being. Lately many IoT groups such as AllSeen Alliance, OIC launched a platform for IoT. Self-adaptive is aimed at implementation without the need for decisions of human being during the operation, so that the machine can respond to changes in its own determination. There is a need to apply the concept of self-adaptive to existing IoT and IoT platform. So In this paper, We look for trends of existing IoT, IoT platform and comparisons by applying a self-adaptive concept to IoT, IoT platform. In addition as an example of this paper, we suggest lacking self-adaptive elements to OIC.

A Study of Security for a Spam Attack of VoIP Vulnerability (VoIP 취약점에 대한 스팸 공격과 보안에 관한 연구)

  • Lee, In-Hee;Park, Dea-Woo
    • KSCI Review
    • /
    • v.14 no.2
    • /
    • pp.215-224
    • /
    • 2006
  • Regarding a spam attack and the interception that a spinoff is largest among Vulnerability of VoIP at these papers study. Write scenario of a spam attack regarding VoIP Vulnerability, and execute Call spam. Instant Messaging spam, Presence spam attack. A spam attack is succeeded in laboratories, and prove. and confirm damage fact of a user in proposals of a spam interception way of VoIP service, 1) INVITE Request Flood Attack 2) Black/White list, 3) Traceback, 4) Black Hole-Sink Hole, 5) Content Filtering, 6) Consent based Communication, 7) Call act pattern investigation, 8) Reputation System Propose, and prove. Test each interception plan proposed in VoIP networks, and confirm security level of a spam interception. Information protection of VoIP service is enlarged at WiBro, BcN. and to realize Ubiquitous Security through result of research of this paper contribute, and may make.

  • PDF