• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.304-310
• /
• 2006

This paper evaluates the performance of three types of data delivery mechanisms in clustered sensor networks, as a basic research to develop an energy efficient topology management scheme. In the first mechanism, one node per cluster(clusterhead) turns on its radio(or wakes up) to transmit and receive RTS/CTS/DATA/ACK messages, but in the second one, k nodes per cluster wake up and participate in the message exchange. In the last mechanism, clusterheads turn on the radio to exchange RTS/CTS messages, and if a clusterhead receives RTS containing its cluster m as a destination, it makes k nodes in the cluster hun on the radio to receive DATA and transmit ACK. Through simulation, we show the energy consumption of the three types of data delivery mechanisms as functions of the number of active nodes per cluster, offered load, and packet loss probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9A
• /
• pp.868-877
• /
• 2006

Sensor network applications need synchronized time to the highest degree such as object tracking, consistent state updates, duplicate detection, and temporal order delivery. In addition, reliability issues and fault tolerance in sophisticated sensor networks have become a critical area of research today. In this paper, we proposed a fault tolerant clock management scheme in sensor networks considering two cases of fault model such as network faults and clock faults. The proposed scheme restricts the propagation of synchronization error when there are clock faults of nodes such as rapid fluctuation, severe changes in drift rate, and so on. In addition, it handles topology changes. Simulation results show that the proposed method has about $1.5{\sim}2.0$ times better performance than TPSN in the presence of faults.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.4
• /
• pp.279-290
• /
• 2013

In this paper, we propose a transmission scheme of MAC protocol that enables secure voice communications by exploiting the wide spectrum and low signal strength characteristics of the ultra wide band technology. In addition, it also supports high level of terminal mobility by deploying mobile ad hoc network schemes. While most of existing UWB MAC protocols are operated as a synchronous mode, the proposed scheme operates in an asynchronous mode for supporting high mobility and sends voice packets without RTS/CTS control packets for efficient voice traffic transmission without retransmission. With simulation program, we prove that the proposed scheme satisfies the required voice quality and packet delivery time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4519-4533
• /
• 2015

Hypertext Transfer Protocol (HTTP) adaptive streaming has become a new trend in video delivery. An HTTP adaptive streaming client needs to effectively estimate resource availability and demand. However, due to the bitrate of the video encoded in variable bitrate (VBR) mode, a bitrate mismatch problem occurs. With the rising demand for mobile devices, the likelihood of cases where two or more HTTP adaptive streaming clients share the same network bottleneck and competing for available bandwidth will increase. These mismatch and competition issues lead to network congestion, which adversely affects the Quality of Experience (QoE). To solve these problem, we propose a video rate adaptation scheme for the HTTP video streaming to guarantee and optimize the QoE. The proposed scheme estimates the available bandwidth according to the bitrate of each segment and also schedules the segment request time to expedite the response to the bandwidth variation. We used a multi-client simulation to prove that our scheme can effectively cope with drastic changes in the connection throughput and video bitrate.

• 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.

• The Korean Society of Law and Medicine
• /
• v.13 no.1
• /
• pp.295-329
• /
• 2012

A medical malpractice case requires special legal protection, considering its characteristics, such as seriousness and long term effects of its damages, medical information asymmetry between practitioners and patients, and difficulties in realization of liability. Taking the points above into consideration, Medical Malpractice Arbitration Act of 2012(MAA) has legislative intent to protect the rights of the injured from medical malpractice, while protecting the stability of medical practice by providing arbitration as an alternative dispute resolution. However, constitutional review is required for one new scheme of compensation for medical injuries during delivery, which is implemented in MAA of 2012, especially with regard to freedom to exercise occupation, property, equality under the Constitution. Two important aspects are 1. according to the law, absolute liability applies to compensation for damages during delivery without negligence of practitioners; and 2. the practitioner bears some portion of the cost, 30% in the law above. This article aims to analyze this new institution in various aspects of the Constitution, and, as a result, it does not comply with constitutional criteria.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.377-386
• /
• 2008

In this paper, a new handover management scheme has been proposed to reduce handover latency and to support fast handover without packet losses, so that it may be applicable to the wireless mobile Internet system such as IPv6-based WiBro system. To minimize the handover latency in processing of movement detection, we propose the handover management scheme which simplifies the handover message exchanging procedure between mobile subscriber station (MSS) and network by integrating layer 2 and layer 3 handovers efficiently based on the layer2 information. To reduce the processing delay from new care-of-address (NCoA) configuration during handover, we propose that NCoA is created, distributed and managed by new access control router (NACR). In addition, in order to minimize the packet transmission delay and eliminate the packet losses, the proposed scheme employs a crossover router (CR) which is upper network located over PACR and NACR and employs the packet buffering for MSS. The simulation study shows that the proposed scheme achieves loss-free packet delivery and low latency in the environment of narrow overlapped cell area or high velocity of the MSS, comparing the performance with the conventional schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1144-1156
• /
• 2014

In Internet, IP multicast has been used successfully to provide an efficient, best-effort delivery service for group communication applications. However, applications such as multiparty private conference, distribution of stock market information, pay per view and other subscriber services may require secure multicast to protect integrity and confidentiality of the group traffic, and validate message authenticity. Providing secure multicast for group communication is problematic without a robust group key management. In this paper, we propose a group key management scheme based on the secret sharing technology to require each member by itself to generate the group key when receiving a rekeying message multicast by the group key distributor. The proposed scheme enforces mutual authentication between a member and the group key distributor while executing the rekeying process, and provides forward secrecy and backward secrecy properties, and resists replay attack, impersonating attack, group key disclosing attack and malicious insider attack.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3302-3320
• /
• 2014

An allocation of sensing and reporting times is proposed to improve the sensing performance by scheduling them in an efficient way for cognitive radio networks with cluster-based cooperative spectrum sensing. In the conventional cooperative sensing scheme, all secondary users (SUs) detect the primary user (PU) signal to check the availability of the spectrum during a fixed sensing time slot. The sensing results from the SUs are reported to cluster heads (CHs) during the reporting time slots of the SUs and the CHs forward them to a fusion center (FC) during the reporting time slots of the CHs through the common control channels for the global decision, respectively. However, the delivery of the local decision from SUs and CHs to a CH and FC requires a time which does not contribute to the performance of spectrum sensing and system throughput. In this paper, a super-allocation technique, which merges reporting time slots of SUs and CHs to sensing time slots of SUs by re-scheduling the reporting time slots, has been proposed to sense the spectrum more accurately. In this regard, SUs in each cluster can obtain a longer sensing duration depending on their reporting order and their clusters except for the first SU belonged to the first cluster. The proposed scheme, therefore, can achieve better sensing performance under -28 dB to -10 dB environments and will thus reduce reporting overhead.

• The Journal of Information Systems
• /
• v.29 no.3
• /
• pp.1-34
• /
• 2020

Purpose Due to the complexity of policy environment in modern society, it is accepted as common basics of policy design to mix up a variety of policy instruments aiming the multiple functions. However, under the current situation of written-down policy specification, not only the public officers but also the policy researchers cannot easily grasp such frameworks as policy portfolio. The purpose of this study is to develop "Policy Attributes Taxonomy" identifying and classifying the public programs to help making decisions for allocative efficiency with effectiveness-based information. Design/methodology/approach To figure out the main scheme and classification criteria of Policy Attributes Taxonomy which represents characteristics of public policies, previous theories and researches on policy components were explored. In addition, to test taxonomic feasibility of certain information system, a set of "Feasibility Standards" was drawn from "requirements for well-organized criteria" of eminent taxonomy literatures. Finally, current government classification system in the area of social service was tested to visualize the application of Taxonomy and Standards. Findings Program Taxonomy Schemes were set including "policy goals", "policy targets", "policy tools", "logical relation" and "delivery system". Each program and project could be condensed into these attributes, making their design more easily distinguishable. Policy portfolio could be readily made out by extracting certain characteristics according to this scheme. Moreover, this taxonomy could be used for rearrangement of present "Program Budget System" or estimation of "Basic Income".