• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.12-14
• /
• 2021

A sensor registry system (SRS) provides semantic metadata about a sensor based on location information of a mobile device in order to solve a problem of interoperability between a sensor and a device. However, if the GPS of the mobile device is incorrectly received, the SRS receives incorrect sensor information and has a problem in that it cannot connect with the sensor. This paper proposes a dual collaboration strategy based on geographical embedding and LSTM-based path prediction to improve the probability of successful requests between mobile devices and sensors to address this problem and evaluate with the Monte Carlo approach. Through experiments, it was shown that the proposed method can compensate for location abnormalities and is an effective multicasting mechanism.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.6
• /
• pp.1256-1264
• /
• 2011

MBS (Multicast Broadcast Service) is defined in WiBro networks for implementing multicast-based services. However, most of the WiBro networks currently used in Korea do not have the MBS functionality and it causes some difficulty in implementing multicast-based services. This paper evaluates the performance of VoIP-based group communication services when implementing using the following two cases: unicast-based and multicast-based group communication systems. The performance evaluation is done using QualNet for each case in terms of the amount of network resource for the service, the delay and delay jitter of packets, and the difference of the delay of members in a group. The simulation result shows that the number of groups and members in a group in a WiBro network is limited because the amount of network resource for the service is increased according to the number of members in a group, and so, the MBS service is required in a WiBro network for a fully-fledged service of VoIP-based group communications. The simulation result also shows that, when a packet bundling is used, the number of groups and members in a group that can be supported in a WiBro network can be increased due to the decrease of the amount of network resource for the service.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.583-594
• /
• 2002

Assuring the security of group communications such as tole-conference and software distribution requires a common group key be shared among the legal members in a secure manner. Especially for large groups with frequent membership change, efficient rekey mechanism is essential for scalability. One of the most popular ways to provide sealable rekey is to partition the group into several subgroups. In this paper, we propose a two-layered key management scheme which combines DEP and CBT, a protocol in which subgroup manager cannot access the multicast data and another that has a multi-core, respectively. We also select sub-group key management protocols suitable for our structure and design new rekey protocols to exclude the subgroup managers from the multicast data. Compared to previous protocols based on CBT, our scheme provides forward secrecy, backward secrecy and scalability. This would reduce the number of encryption and decryption for a rekey message and would improve the efficiency number of rekey messages and the amount of information related to group members that group managers must maintain compared to DEP.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.518-532
• /
• 2008

Broadcast scheme has been widely researched for efficient data delivery in the mobile environment because the downlink capacity of a mobile client is much greater than the uplink capacity, and the power of a mobile client is limited. In the proposed scheme, the index lets the client know when data items would be broadcasted and enables the client to minimize the tuning time and power consumption. Single channel index schemes are fit to flat broadcast that performs well when all the broadcasted data items are accessed with the same probability whereas the multi-disk broadcast scheme is proper when the data access distribution is skewed. The existing index schemes, however, cannot work on the Multi-disk broadcast scheme because they cannot point the replicating data items in a broadcast cycle. This paper proposes a Multi-disk Exponential Index (MDEI) which is a single channel index scheme fit to Multi-disk broadcast scheme. Because MDEI scheme organizes a separate index for each disk, it functions with multi-disk broadcast, resulting in a greater reduction of average access latency than that of other flat-broadcast index schemes when the data access distribution is skewed. The performance evaluation showed that MDEI has a good performance when data access distribution is skewed. MDEI has short average access latency and not much average tuning time when the data access distribution is skewed.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3047-3062
• /
• 1998

This paper deseribes the desihn and the implementation of the Realtime Transport Protocol(RTP)/ Rdaltime Control Protocol(RTCP) (RFC 1889,1890) that is used to transmit the audio/video data to any destination and to feedback the Quality of Service (QoS) information of the received media data to the sender, in the teleconferencing systems proposed by ITU-T. These protocols are implemented with multi thead technique and run on top of UDP/IP-Multicast through the socket interface as the underlying protocol. The upper layer is impelmented such that in can be accessed by the H245 comference control protocol. The RTP packetizes the digitized audio/video data from the encoder info a fixed format, and multieast to the participants. The RTCP monitors RTP packets and extracts the QoS values from it such as round-trip delay, jiter and packet loss to form RTCP packets and non periokically sends them to the sender site. In this Paper, we also descritx the study of measurement and analysis for QoS factors that observed on performing teleconferencing system over Internet. The results from this experiment is indicate that RTT and Jitter value are acceptable even entwork load is high. However, it appears that packet loss rate is high in daytime and most losses periods have length one or two.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.403-406
• /
• 2011

한국해양연구원에서는 국토해양부의 지원을 받아 2010년 7월부터 새로운 개념의 해저로봇 개발에 착수하였다. 새로이 개발되는 해저로봇은 프로펠러 방식으로 추력을 얻는 기존의 해저로봇과는 달리 여러 개의 관절로 이루어진 6개의 다리를 이용하여 해저면에 근접해서 보행과 유영으로 이동하는 해저로봇으로 강조류와 악시계의 환경에서도 운용이 가능한 로봇이다. 이 해저보행로봇 시스템은 선상시스템과 완충기, 그리고 해저보행로봇으로 구성되며, 이들 사이는 광변환기를 통해서 광케이블로 연결된다. 선상시스템에는 해저로봇의 제어 및 모니터링을 위하여 10대의 컴퓨터가 설치되어 있고, 완충기와 해저로봇에 각각 1대의 입출력 컴퓨터가 내장되어 장착된 센서와 모터의 인터페이스를 담당한다. 본 논문에서는 해저보행로봇의 통신 시스템을 소개하고, 이 통신 시스템에서 사용되기 위하여 설계된 메시지의 통신 프로토콜을 설명한다. 해저보행로봇 시스템의 주 네트워크는 기가비트 이더넷이며, 안정된 통신 환경의 소규모 독립 네트워크이다. 완충기와 해저보행로봇에는 최대 100㎐로 동작하는 다양한 직렬 통신 방식을 갖는 다수의 센서와 모터가 장착되어 있는데, 입출력 컴퓨터가 이더넷 네트워크와의 인터페이스 역할을 수행하여 계층적 네트워크를 구성한다. 로봇 제어에서는 실시간성이 중요하기 때문에 이더넷에서 통신 메시지는 한 번의 전송으로 여러 컴퓨터에 전달할 수 있도록 멀티캐스팅을 사용하여 전송된다. 설계된 통신 프로토콜은 이러한 해저로봇 시스템의 특성에 적합한 간결한 구조로 설계되었으며, 최대 255개의 주소를 지정할 수 있고 255 종류의 메시지 형태를 설정할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.23-31
• /
• 2000

In this paper, we propose an adaptive handover scheme in wireless network. The proposed handover scheme is a hybrid type of virtual path extension and rerouting. The proposed handover scheme chooses the virtual path management scheme according to the service QoS instead of the network topology which is used in the previous hybrid handover schemes. The proposed scheme supports the seamless service and small buffering during virtual path rerouting handover through the multicasting service. To evaluate the performance of the proposed scheme, we computed the number of signaling message used for handover and perform computer simulation. The simulation results show that the proposed scheme provides more efficiency in the handover delay and seamless service than the previous methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.72-81
• /
• 2013

In this paper, we propose the architecture and user interaction mechanism to implement N-Screen services on Multi-Vision System (MVS) that are not supported in existing systems. N-Screen services enable users to control the MVS displays through any of their devices and share contents among MVS displays and user's active-devices with service continuation at any location. We provide N-Screen interactive services on MVS by introducing N-Screen interaction & session management server and agent. Furthermore, we present some examples of the protocols such as application launching, user interaction for service control and visualcasting to support N-Screen services. In addition, we explain the N-Screen service scenarios for providing split sessions on user's active-devices and launching metadata content on any of his devices at any location supported by these protocols. The simulation result demonstrates the feasibility and performance improvement of the proposed visualcasting mechanisms.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.61-68
• /
• 2010

As the mobile technology advances, file searching among the mobile device users becomes more important. In this paper, we propose the uniform grid, greedy, and MIS P2P systems that have double-layered topology to search files efficiently for mobile ad-hoc networks. In these systems, peers are classified into two groups, super-peers and sub-peers, and each super-peer manages its neighboring sub-peers. In the proposed systems, each super-peer maintains the appropriate information of its sub-peers so that when a peer requests a file, the request is sent to its super-peers and then to neighboring super-peers. Hence the proposed systems could avoid multi-broadcasting and reduce network overheads. The experimental results show that the proposed systems outperform a single-layered P2P system in terms of the average number of messages to find target files. Especially the MISsystem improves by reducing the average number of messages by 48.9% while maintaining the same search accuracy.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.39-43
• /
• 2007

In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.