• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1359-1370
• /
• 2009

In wireless sensor networks, data dissemination is based on data-centric routing that well matches the publish/subscribe communication paradigm. The publish/subscribe paradigm requires decoupling properties: space, time, and synchronization decoupling. For large-scale applications, the three decoupling properties provide scalability and robust communication. However, existing data dissemination schemes for wireless sensor networks do not achieve full decoupling. Therefore, we propose a novel data dissemination scheme that fully accomplishes the three decoupling, called ARBIETER. ARBITER constructs an independent network structure as a logical software bus. Information interworking between publishers and subscribers is indirectly and asynchronously performed via the network structure. ARBITER also manages storage and mapping of queries and data on the structure because of supporting different time connection of publishers and subscribers. Our simulation proves ARBITER show better performance in terms of scalability, network robustness, data responsibility, mobility support, and energy efficiency.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.1-8
• /
• 2005

SPEC CPU2000 is an widely used benchmark program, both in industry and in academy, for measuring compute-intensive performance of computer systems with various architectures. However, there has been little effort to investigate its characteristics with respect to hardware components. This paper presents the performance scalability of SPEC CPU2000 benchmark over CPU clock speed. For an Intel x86-based system running at various clock speed, we measure the performance of SPEC CPU2000 benchmark, and analyze the characteristic of SPEC CPU2000 in a system aspect. In the experiment, we found that the overall performance of SPEC CPU2000 increases monotonically and linearly as the CPU clock speed increases and that the scale efficiencies of SPEC CPU2000 component benchmarks are quite evenly distributed.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.905-914
• /
• 2008

The paper studied the scheme of applying the MPEG-4 SVC signal to the Ka band satellite broadcasting system through the JSCC system to resolve the rain fading problem generated when providing the Ka band HDTV satellite broadcasting service. The Ka band satellite broadcasting system is based on the VCM mode of the DVB-S2, and the SVC signal is considered as one of the spatial scalability, the SNR scalability and the temporal scalability. The JSCC system jointed all the layers of the source coding system and the channel coding system, and allocated bit rate to source coding and channel coding for each layer to get the optimum receiving quality. The layers are consists of a base layer and an enhancement layer, and the bit rate of each layer is affected by the SVC signal. The applicability of the three SVC signals to the Ka band satellite broadcasting service is analyzed with respect to the rain fading, and the scheme of applying the most excellent SVC to the service is considered.

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

Communication infrastructure of wireless sensor networks significantly tends to depend on application requirements. Gossip communication is becoming one of the promising solutions for addressing its scalability problems in providing information propagation functionality based on the P (publish)/S (subscribe) paradigm. In particular, despite the importance of both guaranteeing message delivery order required and supporting overlapping groups in sensor networks, there exist little research works on development of gossip-style dissemination protocols to satisfy all these requirements. In this paper, we present the latest causal information transmission protocol between publishers and subscribers for overlapping groups. In this protocol, sensor leaders as publishers might guarantee consistently causally ordered message delivery among themselves by aggregating causality information. On the other hand, only the latest causal information piggybacked on each multicast message is transmitted from publishers to subscribers through gossip-style dissemination. Its scalability feature might be highly suitable for the area of the applications requiring only the minimum meaningful information.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.45-53
• /
• 2020

Blockchain can control transactions in a decentralized way and is already being considered for manufacturing, finance, banking, logistics, and medical industries due to its advantages such as transparency, security, and flexibility. And it is predicted to have a great economic effect. However, Blockchain has a Trilemma that is difficult to simultaneously improve scalability, decentralization and security characteristics. Among them, the biggest limitation of blockchain is scalability, which is very difficult to cope with the constantly increasing number of transactions and nodes. To make the blockchain scalable, higher performance should be achieved by modifying existing consensus methods or by improving the characteristics and network efficiency that affect many ways of scaling. Therefore, in this paper, we propose a cluster-based scalable PBFT consensus algorithm called CBS-PBFT which reduces the message complexity O(n²) of PBFT to O(n), which is a representative consensus algorithm of blockchain, and the validity is verified through simulation experiments.

• Journal of Advanced Navigation Technology
• /
• v.19 no.4
• /
• pp.330-337
• /
• 2015

A service in the environments of internet of things (IoT) exist various types with automation facilities and sensors. There can configure so many communication protocols to networking facilities and sensors. To provide efficient various kind of service, a middleware platform, is based on the internet protocol network, is needed a unified access with devices, controlling and monitoring huge kind of facilities and sensors, to provide a efficient IoT service and application configurations. In this paper, we propose a middleware that an application and service interact with automation facilities and monitor sensors. The proposed middleware is designed with adapter pattern that one of the software engineering design pattern. The adapter pattern is to ensure communication with each sensor and to make sure of service scalability. Finally, the proposed component middleware shows that variety sensors can be easily configure the service in the IoT environment.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.907-917
• /
• 2006

In this paper, we propose a strategy to improve fault-tolerance and scalability of replicated services in mobile agent systems by applying an appropriate passive replication protocol for each replicated service according to whether the service is deterministic or non-deterministic. For this purpose, two passive replication protocols, PRPNS and PRPDS, are designed for non-deterministic and deterministic services respectively. They both allow visiting mobile agents to be forwarded to and execute their tasks on any node performing a service agent, not necessarily the primary agent. Especially, in the protocol PRPDS, after a backup service agent has received each mobile agent request and obtained its delivery sequence number from the primary service agent, the backup is responsible for processing the request and coordinating with the other replica service agents. Therefore, our strategy using the two proposed protocols can promise high scalability of replicated services a large number of mobile agents attempt to access in mobile agent systems. Our simulation results show that the proposed strategy performs much better than the one using only the traditional passive replication protocol.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.541-549
• /
• 2015

A large volume of continuously growing BGP data files can raise two technical challenges regarding scalability and manageability. Due to the recent development of the open-source distributed computing infrastructure, Hadoop, it becomes feasible to handle a large amount of data in a scalable manner. In this paper, we present a new Hadoop-based BGP tool (BGPdoop) that provides the scale-out performance as well as the extensible and agile analysis capability. In particular, BGPdoop realizes a query-based BGP record exploration function using Hive on the partitioned BGP data structure, which enables flexible and versatile analytics of BGP archive files. From the experiments for the scalability with a Hadoop cluster of 20 nodes, we demonstrate that BGPdoop achieves 5 times higher performance and the user-defined analysis capability by expressing diverse BGP routing analytics in Hive queries.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.20-27
• /
• 2001

3D image coding and transmission technologies are essential for transmitting 3D image information through the limited transmission channel, and very important in the area of information and telecommunication services using 3D image media. In this paper, we propose the 3D image coding and transmission methods welch use disparity information and MPEG-2's scalability. Left and Fight image sequences are coded in base layer and enhancement layer, respectively. The enhancement layer contains the disparity and prediction informations. In order to reduce searching time for disparity information, we propose a method in which the disparity information of previous image paid is used in the next image pair, and we adopt the bit rate control method proposed in MPEG-2 TM6. An experimental result showed that the proposed searching method considerably reduced the entire encoding time and reached the desired bit rates.