• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1397-1402
• /
• 2010

While MOST is an in-vehicle network which transfers concurrently synchronous data, asynchronous data and control data, it provides high bandwidth synchronous section which can transfer video and audio without buffering. To transfer real time data using synchronous section, connections between source node and sink node, and channel allocation for connections are required. In this paper, we proposed synchronous data transfer method and channel allocation method by constructing MOST network after designing and implementing channel allocation module for using synchronous data section.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.247-256
• /
• 2007

In this paper, we propose Geographical Back-off Routing (Geo-Back Routing) protocol for wireless sensor networks. Geo-Back uses the positions of nodes, a packet's destination and a optimal back-off time to make the packet forwarding decisions using only source and destination's location information without information about neighbor nodes' location or the number of one hop neighbor nodes. Under the frequent topology changes in WSNs, the proposed protocol can find optimal next hop location quickly without broadcast algorithm for update. In our analysis, Geo-Back's scalability and better performance is demonstrated on densely deployed wireless sensor networks.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.186-191
• /
• 2014

Previous work only focuses on a maximization of network coding opportunity since it can reduce the number of packets in network system. However, it can make congestion in a relay node as each source node may transmit each packet with the maximum transmission rate based on the channel qualities. Therefore, in this paper, we propose CmNC (Congestion minimized Network Coding over unreliable wireless links) performing opportunistic network coding to guarantee the network coding gain with the consideration of the congestion and channel qualities. The relay node selects the best network code set based on the objective function for reducing the packet loss and congestion via a dynamic programming. With Qualnet simulations, we show CmNC is better up to 20% than the previous work.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.2
• /
• pp.6-12
• /
• 2001

When CBR source traffics are loaded to ATM switch and broadband network termination, CTD values of ATM switch and broadband network termination are measured and then the values of CTD in the domestic region arc estimated. The estimation values of CTD satisfy the objective of CTD in the domestic region allocated by allocation rules of 1.356. The peak-to-peak CDV allocation method based On Chernoff accumulation method is proposed and applied to the nodes of national portion. From the result of numerical analysis, the proposed method is more accurate than the equal allocation method for peak -to-peak CDV in case that the CDVs at each node and the number of ATM nodes on the path increase.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.110-112
• /
• 2019

블록체인은 4차 산업혁명 핵심 키워드 중 하나이다. 하지만 현재 블록체인 기술을 접목시킨 사례는 굉장히 적다. 그것은 블록체인 시스템에서 트랜잭션을 처리하는 속도가 느린 것을 이유로 볼 수 있다. 기존에 빠른 속도로 많은 트랜잭션을 처리하던 시스템에 비해 느린 블록체인 기술을 접목시키는 것은 어려움이 있다. 때문에 블록체인 연구는 합의 알고리즘, 다양한 네트워크 구성 등을 이용하여 트랜잭션 처리 속도를 늘리는 연구들이 진행 중이다. 본 논문에서는 오픈소스 프로젝트인 하이퍼레저 패브릭의 트랜잭션 처리 속도를 향상시키기 위한 방법을 제안한다. 패브릭은 블록에 트랜잭션을 추가하기 위해 독립적으로 수행되는 3단계를 거쳐 수행된다. 그 중 1번째 단계인 보증 단계의 최적화를 진행한다. 패브릭에서 클라이언트로부터 피어가 반복적인 요청을 받을 때 매번 같은 네트워크에 속해 있는 노드인지 확인을 하게 되는데, 한번 보증을 완료한 노드는 일정 기간 동안 노드 확인을 거치지 않고 체인 코드를 수행하여 트랜잭션을 처리하도록 하는 방법을 제안한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4536-4544
• /
• 2014

This paper proposes a development tool to efficiently develop node software for various operating system platforms in a sensor network. The proposed tool consisted of several modules, such as writing graphical model diagram, PIM and PSM design, code generation, and deployment file generation. Through the proposed tool, the users can graphically draw a sensor network model and design the PIM and PSM of the node software by setting the values of the predefined attributes. The source code of the node software is generated automatically from the PSM using the code templates of the target platform. The deployment files for installing node software on each node are generated automatically. The proposed tool helps the users to develop node software easily for a range of target platforms, even though they do not have details of the low-level information for a sensor network.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.29-36
• /
• 2016

A wireless passive sensor network is a network which, by letting separate RF sources supply energy to sensor nodes, is able to live an eternal life without batteries. Against expectations about an eternal life, however, a wireless passive sensor network still has many problems; scarcity of energy, non-simultaneity of energy reception and data transmission and inefficiency in resource allocation. In this paper, we focus on a wireless passive sensor network providing a packet service which is tolerable to packet losses but requires timely delivery of packets. Perceiving the practical constraints, we then consider a contending-type MAC scheme, rooted in framed and slotted ALOHA, for supporting many sensor nodes to deliver packets to a sink node. Next, we investigate the network-wide throughput achieved by the MAC scheme when the packets transmitted by geographically scattered sensor nodes experience path losses hence capture phenomena. Especially, we derive an exact formula of network-wide throughput in a closed form when 2 sensor nodes reside in the network. By controlling design parameters, we finally optimize the contending-type MAC scheme as to attain the maximum network-wide throughput.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.531-538
• /
• 2008

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.

• Journal of Advanced Navigation Technology
• /
• v.18 no.3
• /
• pp.236-241
• /
• 2014

In a mobile ad hoc networks, multi-hop transmission is used to transfer data from source node to destination node and the routing protocol is the one of the important technical issues. The links between nodes can be unstable due to the changes of node location and channel conditions, and it can induce link error. To solve this problem, multipath routing was proposed. Multipath routing can reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing technique in the multi-rate MANET. The proposed multipath routing can avoid interference without the knowledge of node location. Simulation results show that the proposed multipath routing can reduce transmission delay and error.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.23-29
• /
• 2011

In some applications of wireless sensor networks, requirements such as energy efficiency, real-time, and reliable delivery need to be considered. In this paper, we propose a novel routing algorithm for wireless sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In the proposed algorithm, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that the proposed algorithm is suitable for providing energy efficient, real-time, reliable communications.