• Journal of Information Technology Applications and Management
• /
• 제12권4호
• /
• pp.13-24
• /
• 2005

The sensor network is a key component of the ubiquitous computing system which is expected to be widely utilized in logistics control, environment/disaster control, medical/health-care services, digital home and other applications. Nodes in the sensor network are small-sized and exposed to adverse environments. They are demanded to perform their missions with very limited power supply only. Also the sensor network is composed of much more nodes than the wireless ad hoc networks are. In case that some nodes consume up their power capacity, the network topology should change, and rerouting/retransmission is necessitated. Communication protocols studied for conventional wireless networks or ad hoc networks are not suited for the sensor network resultantly. Schemes should be devised to control the efficient usage of node power in the sensor network. This paper proposes a medium access protocol to enhance the efficiency of energy consumption in the sensor network node. Its performance is analyzed by simulation.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2006년도 하계학술대회
• /
• pp.77-81
• /
• 2006

Because of the rapid increasing of network user, there are some problems to tolerate the network overhead. Recently, the research and technology of the user-level for high performance and low latency than TCP/IP which relied upon the kernel for processing the messages. For example, there is an Infiniband technology. The Infiniband Trade Association (IBTA) has been proposed as an industry standard for both communication between processing node and I/O devices and for inter-processor communication. It replaces the traditional bus-based interconnect with a switch-based network for connecting processing node and I/O devices. Also Infiniband uses RDMA (Remote DMA) for low latency of CPU and OS to communicate between Remote nodes. In this paper, we develop the SRP (SCSI RDMA Protocol) which is Storage Access Protocol on Infiniband network. And will compare to FC (Fibre Channle) based I-SCSI (Internet SCSI) that it is used to access storage on Etherent Fabric.

• 한국정보통신학회논문지
• /
• 제16권3호
• /
• pp.460-469
• /
• 2012

본 논문에서는 UWB 기술 기반 WiMedia Distributed Medium Access Control (D-MAC) 표준 프로토콜에 적용할 수 있는 협력 통신 프로토콜을 제안한다. 이를 위해 무선 채널 상태에 따라 변화하는 UWB 링크 전송 속도에 적응적인 릴레이 노드 선정 알고리즘을 제안한다. 본 논문에서 제안하는 UWB 링크에 적응적인 릴레이 통신 프로토콜은 분산적인 D-MAC 표준 기술 및 무선 USB 기술과 호환성을 갖고, 각 디바이스에서 독립적으로 실행되는 Relay Node Selection (RNS) 기준에 따라 실행된다.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.203-209
• /
• 2015

Although mobile applications are an essential characteristic of wireless sensor networks, most existing media access control (MAC) protocols focus primarily on static networks. In these protocols, fixed periodic neighbor discovery and schedule updating are used to connect and synchronize neighbors to provide successful data transmission; however, they cannot adapt to mobile speed variation and degrade the network performance dramatically. In this paper, we propose a mobile-supporting mechanism for MAC protocols, in which the decision to update the neighbors of a mobile node is made adaptively according to the mobile speed. Analysis and simulation results demonstrate that the mechanism efficiently avoids the disconnection of amobile node from its neighbors and achieves a better performance as compared with fixed periodic neighbor discovery.

• 한국통신학회논문지
• /
• 제41권7호
• /
• pp.747-749
• /
• 2016

본 논문에서는 시분할 다중 접속 릴레이 채널을 고려한다. 여기서 두 개의 송신 노드들은 서로 다른 데이터율을 가진 데이터를 네트워크 코딩을 수행하는 단일 릴레이 노드를 통해 단일 수신 노드에게 전송한다. 하지만 이러한 비대칭한 데이터율 때문에 릴레이 노드는 수신한 비트에 대하여 XOR 기반의 네트워크 코딩을 효율적으로 수행할 수 없다. 따라서 본 논문에서는 위와 같은 문제를 해결하기 위해 제로 패딩(Zero Padding) 방식과 계층 16QAM 방식을 개별적으로 네트워크 코딩과 결합하여 성능비교를 수행한다.

• 한국통신학회논문지
• /
• 제32권7B호
• /
• pp.463-471
• /
• 2007

Ad hoc 무선망의 동적인 특성으로 인하여 히든노드 문제가 나타날 수 있기 때문에 ad hoc 무선망에서는 분산방식으로 네트워크가 동작되어야 한다. Ad hoc 무선망에서 CSMA/CA는 비동기적 데이터 트래픽을 위해 가장 많이 사용되는 MAC Protocol 중의 하나이다. 그러나 CSMA/CA는 멀티미디어 데이터의 특성을 보장하지 못한다. 또한 경쟁형(Contention)이므로 채널을 먼저 잡은 하나의 스테이션이 채널을 독점해서 사용하여 채널 기아(starvation)로 인한 공평성문제(fairness problem)가 발생한다. 본 논문에서는 무선 ad hoc망에서 멀티미디어 데이터의 특성을 고려하여, QoS 보장을 위한 MAC protocol을 제안한다.

• 전자공학회논문지
• /
• 제52권12호
• /
• pp.32-40
• /
• 2015

코드 분할 다중 접속 기법은 주파수 선택적 페이딩과 다중 경로 페이딩에 강인할 뿐만 아니라 주파수 재사용 효율이 좋으므로 수중 환경에서의 유망한 매체 접속 제어 기법으로 많은 연구가 진행되고 있다. 본 논문에서는 시변 수중 음향 채널에서 코드 분할 다중 접속 방식의 폐루프 전력 제어 기법을 설계한다. 본 기법에서는 싱크 노드가 센서 노드로부터 수신한 패킷의 수신 전력을 바탕으로 시변하는 상향 링크를 분석하고 각 센서 노드의 경로 손실의 크기를 포함한 제어 패킷을 센서 노드로 전송한다. 센서 노드는 이를 바탕으로 전력 제어를 수행함으로써 시변 수중 채널에서 효율적인 전력 제어가 가능하다.

• 전자공학회논문지A
• /
• 제30A권5호
• /
• pp.1-15
• /
• 1993

In DQDB networks, the bandwidth can be increased considerably be using the EN(Erasure Node) algorithms and DR(Destination Release) algorithms. However, the important issue in implementing them is using method of extra capacity fairly. To improve it, this paper proposes AEN(Adaptive Erasure Node) algorithm which erasure function is activated by network traffic load. Its functional architecture consists of SESM, RCSM, LMSM in addition to the basic DQDB state machines (DQSM, RQM). The SESM and RCSM state machines are placed in front of the DQSM and RQM state machines in order for the node to take advantage of the newly cleared slots. This paper also presents some simulation results showing the effect of AEN algorithm on access delay, throughput and segment erasing ratio in the single and multiple priority networks. The results show that the AEN algorithm offer the better performance characteristics than existing algorithms under overload conditions.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.157-159
• /
• 2007

The conventional hard disk has been the dominant database storage system for over 25 years. Recently, hybrid systems which incorporate the advantages of flash memory into the conventional hard disks are considered to be the next dominant storage systems to support databases for desktops and server computers. Their features are satisfying the requirements like enhanced data I/O, energy consumption and reduced boot time, and they are sufficient to hybrid storage systems as major database storages. However, we need to improve traditional index node management schemes based on B-Tree due to the relatively slow characteristics of hard disk operations, as compared to flash memory. In order to achieve this goal, we propose a new index node management scheme called FNC-Tree. FNC-Tree-based index node management enhanced search and update performance by caching data objects in unused free area of flash leaf nodes to reduce slow hard disk I/Os in index access processes.

• 한국시뮬레이션학회논문지
• /
• 제6권2호
• /
• pp.89-104
• /
• 1997

Performance bottleneck of parallel computer systems has mostly been I/O devices because of disparity between processor speed and I/O speed. Therefore I/O node placement strategy is required such that it can minimize the number of I/O nodes, I/O access time and I/O traffic in an interconnection network. In this paper, we propose an optimal distance-k embedding algorithm, and analyze its effect on system performance when this algorithm is applied to n x n torus architecture. We prove this algorithm is an efficient I/O node placement using software simulation. I/O node placement using the proposed algorithm shows the highest performance among other I/O node placements in all cases. It is because locations of I/O nodes are uniformly distributed in the whole network, resulting in reduced traffic in the intE'rconnection network.