• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.25-30
• /
• 2010

Wireless sensor networks is composed of many similar sensor nodes with limited resources. They are randomly scattered over a specific area and self-organize the network. For guarantee of network life time, load balancing and scalability in sensor networks, sensor networks needs the clustering algorithm which distribute the networks to a local cluster. In existing clustering algorithms, the cluster head selection method has two problems. One is additional communication cost for finding location and energy of nodes. Another is unequal clustering. To solve them, this paper proposes a novel cluster head selection algorithm revised previous clustering algorithm, LEACH. The simulation results show that the energy compared with the previous clustering method is reduced.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.484-486
• /
• 2005

Passenger safety is a primary concern of railway system but, it has been urgent issue that dozens of people are killed every year when they falloff from train platforms. Recently, advancements in IT have enabled applying vision sensors to railway environments, such as CCTV and stereo camera sensors. In this paper, we propose a stereoscopic video coding scheme for subway accident monitoring system. The proposed scheme is designed for providing flexible video among various displays, such as control center, station employees and train driver. We uses MPEG-2 standard for coding the left-view sequence and IBMDC for predicting the P- and B-types of frames of the right-view sequence. IBMDC predicts matching block by interpolating both motion and disparity predicted macroblocks. To provide efficient stereoscopic video service. we define both temporally and spatially scalable layers for each eye's-view by using the concept of Spatio-Temporal scalability. According to the experimental results. we expect the proposed functionalities will play a key role in establishing highly flexible stereoscopic video codec for ubiquitous display environment where devices and network connections are heterogeneous.

• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.327-334
• /
• 2015

Various types of middle-ware were created for integration between legacy systems and newly built systems. RPC(Remote Procedure Call), MOM(Message Oriented Middle-ware) and TM(Transaction processing Monitor) are the typical types of middle-ware. One of the most known MOM type middle-ware is PS(Publish/Subscribe). PS enables to create a system which has low coupling and high scalability. But PS based systems also have low cohesiveness. On the contrary, RPC has high cohesiveness but also has high coupling. This paper proposed design and implementation of hybrid model which offset disadvantages of RPC and PS.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.107-114
• /
• 2017

In beacon-enabled mode, beacon collision is a significant problem for the scalability of cluster-tree wireless sensor networks. In this paper, multi-channel time division scheduling (MCTS) is proposed to prevent beacon collisions and provide scalability. A coordinator broadcasts a beacon frame, including information on allocated channels and time-slots, and a new node determines its own channel and time-slot. The performance of the proposed method is evaluated by comparing the proposed approach with a typical ZigBee. MCTS prevents beacon collisions in cluster-tree wireless sensor networks. It enables large-scale wireless sensor networks based on a cluster tree to be scalable and effectively constructed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.7
• /
• pp.17-27
• /
• 2011

In recent years, the interest and research for Future Internet are rapidly increasing. In domestic, MOFI (Mobile Oriented Future Internet) is proposed as one architecture of Future Internet. MOFI is a data transmission architecture which provides a mobility, name-based communication and routing scalability. In this paper we implement a basic MOFI testbed that supports HID-based communication, and verify the feasibility of HID-based communication through experimentation of general service such as PING and WWW service. We used "VirtualBox" as a virtual machine and implement a packet processing and a HCP header addition and translation function using "Click Modular Router".

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.117-125
• /
• 2003

The proposed mechanism has an group management server, which manages the information about both the receivers and the senders. Any receiver can dynamically join/leave the multicast VC. The signaling overload due to group membership changes is not concentrated on the sender, but it is distributed to many receivers for the scalability improvement. The associated signaling messages propagates from the receivers to the ATM switch dedicated to the multicast VC, and hence no signaling overload exists in the shared links there is no latency for the receiver to wait. Our proposed scheme is superior in the view of scalability, the efficiency and the latency to other schemes.

• The Korean Journal of Applied Statistics
• /
• v.29 no.6
• /
• pp.999-1005
• /
• 2016

The advent of big data brings the opportunity to answer many open scientic questions but also presents some interesting challenges. Main features of contemporary datasets are the high dimensionality and massive sample size. In this paper, we give an overview of major challenges caused by these two features: (1) noise accumulation and spurious correlations in high dimensional data; (ii) computational scalability for massive data. We also provide applications of big data in various fields including forecast of disasters, digital humanities and sabermetrics.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.526-534
• /
• 2014

Most of the multiplayer games available online are based on a client-server architecture because this architecture gives better administration control to the game providers than peer-to-peer architecture. In this architecture, the server is responsible for all the communication between the connected clients. The weakness of this architecture is its bandwidth requirement and scalability. Peer-to-peer architectures have then been proposed to solve these issues. In this paper, we propose a hybrid client-server architecture in which the game state is partially shared by the mobile terminal to achieve consistency among different players. Like a peer-to-peer architecture, this architecture uses client-side capacities to reduce bandwidth requirements for the server and improves consistency in wireless networks. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In the proposed architecture, either the server or the client applies consistency mechanism according to the priority level. Simulation experiments show that the bandwidth of the server in this architecture is smaller than that of the client-server architecture. As a result, the server in the proposed architecture can accommodate more clients with enhancing the scalability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.490-508
• /
• 2013

One of the most important scalability issues facing the current Internet is the rapidly increasing rate of BGP updates (BGP churn), to which route flap and path exploration are the two major contributors. Current countermeasures would either cause severe reachability loss or delay BGP convergence, and are becoming less attractive for the rising concern about routing convergence as the prevalence of Internet-based real time applications. Based on the observation that highly active prefixes usually repeatedly explore very few as-paths during path exploration, we propose a router-level mechanism, Path Exploration Aggregation (PEA), to scale BGP without either causing prefix unreachable or slowing routing convergence. PEA performs aggregation on the transient paths explored by a highly active prefix, and propagates the aggregated path instead to reduce the updates caused by as-path changes. Moreover, in order to avoid the use of unstable routes, PEA purposely prolongs the aggregated path via as-path prepending to make it less preferred in the perspective of downstream routers. With the BGP traces obtained from RouteViews and RIPE-RIS projects, PEA can reduce BGP updates by up to 63.1%, shorten path exploration duration by up to 53.3%, and accelerate the convergence 7.39 seconds on average per routing event.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1273-1293
• /
• 2010

Immune-inspired intrusion detection is a promising technology for network security, and well known for its diversity, adaptation, self-tolerance, etc. However, scalability and coverage are two major drawbacks of the immune-inspired intrusion detection systems (IIDSes). In this paper, we propose an IIDS framework, named GEP-IIDS, with improved basic system elements to address these two problems. First, an additional bio-inspired technique, gene expression programming (GEP), is introduced in detector (corresponding to detection rules) representation. In addition, inspired by the avidity model of immunology, new avidity/affinity functions taking the priority of attributes into account are given. Based on the above two improved elements, we also propose a novel immune algorithm that is capable of integrating two bio-inspired mechanisms (i.e., negative selection and positive selection) by using a balance factor. Finally, a pruning algorithm is given to reduce redundant detectors that consume footprint and detection time but do not contribute to improving performance. Our experimental results show the feasibility and effectiveness of our solution to handle the scalability and coverage problems of IIDS.