• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.5
• /
• pp.147-152
• /
• 2015

In general, there are two synchronization methods in parallel event-driven simulation, pessimistic approach and optimistic approach. In this paper, we propose a new approach, sporadic synchronization combining both for prediction-based parallel event-driven logic simulation. We claim this hybrid solution is pretty effective to minimize both checkpoint overhead and restart overhead, which are related problems with frequent false predictions for improving the performance of the prediction-based parallel event-driven logic simulation. The experiment has clearly shown the advantage of the proposed approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1479-1501
• /
• 2020

Dependable functioning of dynamic networks is essential for delivering ubiquitous services. Faults are the root causes of network outages. The comparison diagnosis model, which automates fault's identification, is one of the leading approaches to attain network dependability. Most of the existing research has focused on stationary networks. Nonetheless, the time-free comparison model imposes no time constraints on the system under considerations, and it suits most of the diagnosis requirements of dynamic networks. This paper presents a novel protocol that diagnoses faulty nodes in diagnosable dynamic networks. The proposed protocol comprises two stages, a testing stage, which uses the time-free comparison model to diagnose faulty neighbour nodes, and a disseminating stage, which leverages a Random Linear Network Coding (RLNC) technique to disseminate the partial view of nodes. We analysed and evaluated the performance of the proposed protocol under various scenarios, considering two metrics: communication overhead and diagnosis time. The simulation results revealed that the proposed protocol diagnoses different types of faults in dynamic networks. Compared with most related protocols, our proposed protocol has very low communication overhead and diagnosis time. These results demonstrated that the proposed protocol is energy-efficient, scalable, and robust.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.766-780
• /
• 1996

This paper presents a mapping scheme for parallel processing using an accurate characterization of the communication overhead. A set of objective functions is formulated to evaluate the optimality of mapping a problem graph into a system graph. One of them is especially suitable for real-time applications of parallel processing. These objective functions are different from the conventional objective functions in that the edges in the problem graph are weighted and the actual distance rather than the nominal distance for the edges in the system graph is employed. This facilitates a more accurate qualification of the communication overhead. An efficient mapping scheme has been developed for the objective functions, where two levels of assignment optimization procedures are employed: initial assignment and pairwise exchange. The mapping scheme has been tested using the hypercube as a system graph.

• Journal of information and communication convergence engineering
• /
• v.3 no.3
• /
• pp.157-162
• /
• 2005

Web services are key applications in business­to-business, business-to-customer, and enterprise applications integration solutions. As the mobile internet becomes one of the main methods for information delivery, mobile Web Services are regarded as a critical aspect of e-business architecture. In this paper, we proposed a mobile Web Services middleware that converts conventional internet services into mobile Web services. We implemented a WSDL (Web Service Description Language) builder that converts HTML/XML into WSDL and a SAOP (Simple Object Access Protocol) message processor that performs SOAP message handling, chain and handling of server requests. The former minimizes the overhead cost of rebuilding mobile Web Services and enables seamless services between wired and wireless internet services. The latter enhances SOAP processing performance by eliminating the Servlet container (Tomcat), a required component of typical Web services implementation. Our main contributions are to overcome the latency problem of current Web Services and to provide an easy mobile Web service implementation. Our system can completely support standard Web Services protocol, minimizing communication overhead, message processing time, and server overload. Finally we compare our empirical results with those of typical Web Services.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.6
• /
• pp.1229-1234
• /
• 2012

In this paper, we analyze the problems that the DDS middleware, which is a standard data-centric communication interface, uses the fixed packet transmission method by the pre-defined protocol for exchanging data packets. The packet transmission method selected in a fixed manner cannot handle appropriately the increasing of resource overhead in an environment where the load of the DDS network changes dynamically. If the load on the node and network exceeds the threshold, the performance of the packet transmission may be degraded rapidly. This results in a failure of ensuring the real-time characteristic of DDS middleware. To solve this problem, we propose the scheme of the adaptive packet transmission for adjusting the transmission method in real-time based on the overhead on the DDS network.

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

Ad-hoc networks have the dynamic topology characteristics and most of the applications on ad-hoc networks require the group communication capability. Previously proposed multicast mechanisms on mobile ad-hoc networks build multicast-infrastructures like the tree or mesh for the group communication and these infrastructures nay cause significant overhead especially in a highly dynamic mobile ad-hoc network environment. Therefore, in this paper, we propose a new multicast mechanism supporting multicast services based on only the underlying unicast routing tables, hence any multicast-related infrastructures like trees and meshes are not required to be constructed.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.5
• /
• pp.205-214
• /
• 2020

With the recent development of hardware and software technology, interest in the development of wearable devices is increasing. In particular, wearable devices require algorithms suitable for low-power and low-capacity embedded devices. Among them, there is an increasing demand for a signal compression algorithm that reduces communication overhead, in order to increase the efficiency of storage and transmission of electrocardiogram (ECG) signals requiring long-time measurement. Because normal beats occupy most of the signal with similar shapes, a high rate of signal compression is possible if normal beats are represented by a template. In this paper, we propose an algorithm for determining the normal beat template using the template cluster and Pearson similarity. Also, the template is expressed effectively as a few vertices through linear approximation algorithm. In experiment of Datum 234 of MIT-BIH arrhythmia database (MIT-BIH ADB) provided by Physionet, a compression ratio was 33.44:1, and an average distribution of root mean square error (RMSE) was 1.55%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.253-258
• /
• 2014

In smartphone sensing which monitors various social phenomena of the individuals by using embedded sensors, managing metadata is one of the important issue to process large-scale data, improve the data quality, and share collected data. In this paper, we proposed a document clustering scheme for the large-scale metadata management architecture which is designed as a hybrid back-end consisting of a cluster head and member nodes to reduce the server-side overhead. we also verified that the proposed scheme is more efficient than the distance based clustering scheme in terms of the server-side overhead through simulation results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1744-1765
• /
• 2014

A client stores data in the cloud and uses remote data checking (RDC) schemes to check the integrity of the data. The client can detect the corruption of the data using RDC schemes. Recently, robust RDC schemes have integrated forward error-correcting codes (FECs) to ensure the integrity of data while enabling dynamic update operations. Thus, minor data corruption can be recovered by FECs, whereas major data corruption can be detected by spot-checking techniques. However, this requires high communication overhead for dynamic update, because a small update may require the client to download an entire file. The Variable Length Constraint Group (VLCG) scheme overcomes this disadvantage by downloading the RS-encoded parity data for update instead of the entire file. Despite this, it needs to download all the parity data for any minor update. In this paper, we propose an improved RDC scheme in which the communication overhead can be reduced by downloading only a part of the parity data for update while simultaneously ensuring the integrity of the data. Efficiency and security analysis show that the proposed scheme enhances efficiency without any security degradation.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.34-39
• /
• 2012

Collisions between tags greatly reduce the identification speed in radio frequency identification (RFID) systems and increase communication overhead. In particular for an active RFID system, tags are powered by small batteries, and a large number of re-transmissions caused by collisions can deteriorate and exhaust the tag energy which may result in missing tags. An efficient collision-free arbitration protocol for active RFID systems is proposed in this paper. In this protocol, a new mechanism involving collision detection, collision avoidance, and fast tag access is introduced. Specifically, the pulse burst duration and busy-tone-detection delay are introduced between the preamble and data portion of a tag-to-reader (T-R) frame. The reader identifies tag collision by detecting pulses and transmits a busy tone to avoid unnecessary transmission when collision occurs. A polling process is then designed to quickly access the collided tags. It is shown that the use of the proposed protocol results in a system throughput of 0.612, which is an obvious improvement when compared to the framed-slotted ALOHA (FSA) arbitration protocol for ISO/IEC 18000-7 standard. Furthermore, the proposed protocol greatly reduces communication overhead, which leads to energy conservation.