Sang H. Son

Bio: Sang H. Son is an academic researcher from Daegu Gyeongbuk Institute of Science and Technology. The author has contributed to research in topics: Database transaction & Wireless sensor network. The author has an hindex of 51, co-authored 393 publications receiving 11808 citations. Previous affiliations of Sang H. Son include University of Skövde & City University of Hong Kong.

Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms*

Abstract: We develop Feedback Control real-time Scheduling (FCS) as a unified framework to provide Quality of Service (QoS) guarantees in unpredictable environments (such as e-business servers on the Internet). FCS includes four major components. First, novel scheduling architectures provide performance control to a new category of QoS critical systems that cannot be addressed by traditional open loop scheduling paradigms. Second, we derive dynamic models for computing systems for the purpose of performance control. These models provide a theoretical foundation for adaptive performance control. Third, we apply established control methodology to design scheduling algorithms with proven performance guarantees, which is in contrast with existing heuristics-based solutions relying on laborious design/tuning/testing iterations. Fourth, a set of control-based performance specifications characterizes the efficiency, accuracy, and robustness of QoS guarantees. The generality and strength of FCS are demonstrated by its instantiations in three important applications with significantly different characteristics. First, we develop real-time CPU scheduling algorithms that guarantees low deadline miss ratios in systems where task execution times may deviate from estimations at run-time. We solve the saturation problems of real-time CPU scheduling systems with a novel integrated control structure. Second, we develop an adaptive web server architecture to provide relative and absolute delay guarantees to different service classes with unpredictable workloads. The adaptive architecture has been implemented by modifying an Apache web server. Evaluation experiments on a testbed of networked Linux PC's demonstrate that our server provides robust relative/absolute delay guarantees despite of instantaneous changes in the user population. Third, we develop a data migration executor for networked storage systems that migrate data on-line while guaranteeing specified I/O throughput of concurrent applications.

JAM: a jammed-area mapping service for sensor networks

Abstract: Preventing denial-of-service attacks in wireless sensor networks is difficult primarily because of the limited resources available to network nodes and the ease with which attacks are perpetrated Rather than jeopardize design requirements which call for simple, inexpensive, mass-producible devices, we propose a coping strategy that detects and maps jammed regions We describe a mapping protocol for nodes that surround a jammer which allows network applications to reason about the region as an entity, rather than as a collection of broken links and congested nodes This solution is enabled by a set of design principles: loose group semantics, eager eavesdropping, supremacy of local information, robustness to packet loss and failure, and early use of results Performance results show that regions can be mapped in 1-5 seconds, fast enough for real-time response With a moderately connected network, the protocol is robust to failure rates as high as 25 percent

ATPC: Adaptive Transmission Power Control for Wireless Sensor Networks

Abstract: Extensive empirical studies presented in this article confirm that the quality of radio communication between low-power sensor devices varies significantly with time and environment. This phenomenon indicates that the previous topology control solutions, which use static transmission power, transmission range, and link quality, might not be effective in the physical world. To address this issue, online transmission power control that adapts to external changes is necessary. This article presents ATPC, a lightweight algorithm for Adaptive Transmission Power Control in wireless sensor networks. In ATPC, each node builds a model for each of its neighbors, describing the correlation between transmission power and link quality. With this model, we employ a feedback-based transmission power control algorithm to dynamically maintain individual link quality over time. The intellectual contribution of this work lies in a novel pairwise transmission power control, which is significantly different from existing node-level or network-level power control methods. Also different from most existing simulation work, the ATPC design is guided by extensive field experiments of link quality dynamics at various locations over a long period of time. The results from the real-world experiments demonstrate that (1) with pairwise adjustment, ATPC achieves more energy savings with a finer tuning capability, and (2) with online control, ATPC is robust even with environmental changes over time.

A feedback control approach for guaranteeing relative delays in Web servers

Abstract: The paper presents the design, implementation, and evaluation of an adaptive architecture to provide relative delay guarantees for different service classes on Web servers under HTTP 1.1. The first contribution of the paper is the architecture based on a feedback control loop that enforces desired relative delays among classes via dynamic connection scheduling and process reallocation. The second contribution is our use of feedback control theory to design the feedback loop with proven performance guarantees. In contrast with ad hoc approaches that often rely on laborious tuning and design iterations, our control theory approach enables us to systematically design an adaptive Web server with established analytical methods. The design methodology includes using system identification to establish a dynamic model, and using the Root Locus method to design a feedback controller to satisfy performance specifications of a Web server. The adaptive architecture has been implemented by modifying an Apache Web server. Experimental results demonstrate that our adaptive server achieves robust relative delay guarantees even when workload varies significantly. Properties of our adaptive Web server include guaranteed stability, and satisfactory efficiency and accuracy in achieving the desired relative delay differentiation.

Event Detection Services Using Data Service Middleware in Distributed Sensor Networks

Abstract: This paper presents the real-time event detection service using Data Service Middleware (DSWare). DSWare provides data-centric and group-based services for sensor networks. The real-time event service handles unreliability of individual sensor reports, correlation among different sensor observations, and inherent real-time characteristics of events. The event service supports confidence functions which are designed based on data semantics, including relative importance of sub-events and historical patterns. When the failure rate is high, the event service enables partial detection of critical events to be reported in a timely manner. It can also be applied to differentiate between the occurrences of events and false alarms.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Comparative analysis of

Abstract: Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or 'prefixes' which designate network reachability among autonomous systems (AS). Point of concern in BGP is its lack of effective security measures which makes Internet vulnerable to different forms of attacks. Many solutions have been proposed till date to combat BGP security issues but not a single one is deployable in practical scenario. Any security proposal with optimal solution should offer adequate security functions, performance overhead and deployment cost. This paper critically analyzes the deployment issues of best three proposals considering trade-off between security functions and performance overhead.

[서평]「Applied Cryptography」

Abstract: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.