• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.8
• /
• pp.825-834
• /
• 2018

Broadcasting is a basic data communication method for interconnection networks. There are two types of broadcasting. One-to-all broadcasting is to transmit a message from one node to all other nodes and all-to-all broadcasting is to transmit a message from all the nodes that have messages to other nodes. And by the using way of the transmission port per unit time, there are two schemes of broadcasting. Single port telecommunication(SLA) is to transmit messages from one node that contains the messages to one adjacent node only and all port telecommunication(MLA) is to transmit messages from one node to all adjacent nodes within a time of unit. Matrix hypercube is that an interconnection network has improved network cost than that of hypercube with the same number of nodes. In this paper, we analyze broadcasting scheme of matirx hypercube. First, we propose one-to-all and all-to-all broadcasting algorithms of matrix hypercube. And we prove that one-to-all broadcasting times are 2n+1 and $2{\lceil}{\frac{n}{2}}{\rceil}+1$ based on the SLA and MLA models, respectively. Also, we show all-to-all broadcasting time using SLA model is $5{\times}2^{\frac{n}{2}}-2$ when n=even, and is $5{\times}2^{\frac{n-1}{2}}+2$ when n=odd.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.482-491
• /
• 2007

This paper proposes a k-disjoint-path routing algorithm that provides energy efficient and reliable message transmission in wireless sensor networks. The proposed algorithm sends messages through a single path without the occurrence of critical events. However, it sends through k disjoint paths(k>1) under the occurrence of critical events. The proposed algorithm detects the occurrence of critical events by monitoring changing data patterns, and calculates k from a well-defined fault model and the target-delivery ratio. Our simulations reveal that the proposed algorithm is more resilient to node failure than other routing algorithms, and it also decreases energy consumption and reduces the average delay much more than multi-path and path-repair algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.244-253
• /
• 1994

Computer networks need a variety of services. Some services such as, video, voice and plantcontrol traffic require a real-time communication with explicit timing constraints. In this pater, we introduce a real-time communication technique which use a reservation technique on dualilnk networks. We introduce an enhanced technique that determines priorities of the message based on time constraints when real-time messages are transmitted. A simulation was conducted to compare and to analyze traditional technique. We used the SLAM II language to simulate this technique. Message loss rate were compared and analyzed as a performance criteria in this simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.43-49
• /
• 2012

Personalized message syndication is an important process for maximizing the effect of mobile marketing. This paper proposes an algorithm for determining clients satisfying target conditions in real-time. The proxy server as an intermediate node stores client profiles (gender, age, location, etc) and their respective summaries into a database. When a company syndicates messages at run time, the proxy server maps target conditions expressed by boolean expressions to integer value and determines target clients by comparing target value with profile summary. Thus, this approach provides efficient personalized message syndication in very large systems with millions of clients because it can determine target clients in real-time and work with a traditional database easily.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.7
• /
• pp.605-611
• /
• 2013

If an accident vehicle propagates emergency messages to other vehicles close to it, the other drivers may realize and avoid the accident spot. In this letter, we propose a broadcast scheme to propagate emergency messages fast in urban VANETs (Vehicular Ad-Hoc Networks) with the help of GPS (Global Position System). In our scheme, a transmitting vehicle chooses the farthest node as the next relay vehicle to propagate emergency messages. And, we suggest an algorithm for intersection recognition and SCF (Store-Carry-Forward) task by taking advantage of periodic hello packets to reduce the propagation time and enhance the delivery ratio.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.645-648
• /
• 2017

The existing embedded tester used TCP and shared file system for log processing. In addition, the existing processing method was treated as 1-N structure. This method wastes resources of the tester for exception handling. We implemented a log processing message layer that can be distributed by messaging system. And we compare the transmission method using the message layer and the transmission method using TCP and the shared file system. As a result of comparison, transmission using the message layer showed higher transmission bandwidth than TCP. In the CPU usage, the message layer showed lower efficiency than TCP, but showed no significant difference. It can be seen that the log processing using the message layer shows higher efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.278-287
• /
• 2012

In this paper, we propose an allocation scheme for variable message packings to increase efficiency of military operation using Link-16 which is well-known for tactical data link by delivering imagery information rapidly. We propose a variable message packing scheme using COC waveform to support variable data rate under some coverage limitation. Variety of message packing makes Link-16 vary transmission rate appropriately for tactical environment. We also propose a allocation scheme to assign message packing to time slot properly. Finally we verify the performance and superiority of proposed ideas by simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2678-2684
• /
• 2014

In this paper a new message control method that can reduce server load and network traffic in XMPP/SIP presence service system has been proposed. This presence service system can process both XMPP(Extensible Massaging and Presence Protocol) based presence information and SIP(Session Initiation Protocol) based presence information. A new XMPP stanza architecture with added elements for presence stanza and IQ stanza has been designed, and a new presence information data processing method which can reduce size of SIP notification message and SIP PUBLISH message has been suggested. Furthermore a messages exchanging procedure that can transfer presence information between XMPP domain and SIP domain has been also suggested. The performance of the proposed system has been analysed by simulation.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.347-354
• /
• 2004

The provision of location tracking for mobile agents is designed to deliver a message to a moving object in a network. Most tracking methods exploit relay stations that hold location information to forward messages to a target mobile agent. In this paper, we propose an efficient location tracking method for mobile agents using the domain-based proxy as a relay station. Mobile agents can reduce the length of their migration paths by visiting hosts in the same domain first, rather than selecting hosts randomly. The proposed method exploits the domain-based moving patterns of mobile agents and minimizes registration and message delivery costs. Since the long proxy chain can contribute to the high message delivery cost, we also propose a compressing method to reduce the message delivery cost.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.134-136
• /
• 1999

이동에이전트의 응용 분야가 다양해짐에 따라 에이전트 협력 작업이 요구되고 있다. 이런 협력 작업은 에이전트간의 정보 공유 및 작업 제어를 위해 빈번한 통신을 필요로 한다. 본 논문은 서로 다른 이동에이젼트(mobile agent)들의 통신과 협력 작업을 수행하는 그룹에이전트(group agent)를 위한 효율적인 통신 메커니즘을 제안한다. 제안된 통신 메커니즘은 네트워크 대역폭을 줄이기 위해 이동에이전트 시스템에 확장된 메시지 저장소를 두었으며, 시스템에서 제공하는 기본적인 통신 메소드(method)를 이용하여 동기적/비동기적으로 에이전트 상호간에 보다 융통성 있는 정보 전달을 수행한다. 또한, 제안된 메소드는 1:1 통신뿐만 아니라 다:다 통신을 지원하기 때문에 그룹에이전트 모델에서도 효율적인 수행이 가능하다.