• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1208-1222
• /
• 2014

Due to the low utilization and scarcity of frequency spectrum in current spectrum allocation methodology, cognitive radio networks (CRNs) have been proposed as a promising method to solve the problem, of which spectrum sensing is an important technology to utilize the precious spectrum resources. In order to protect the primary user from being interfered, most of the related works focus only on the restriction of the missed detection probability, which may causes over-protection of the primary user. Thus the interference probability is defined and the interference-aware sensing model is introduced in this paper. The interference-aware sensing model takes the spatial conditions into consideration, and can further improve the network performance with good spectrum reuse opportunity. Meanwhile, as so many fading factors affect the spectrum channel, errors are inevitably exist in the reporting channel in cooperative sensing, which is improper to be ignored. Motivated by the above, in this paper, we study the throughput tradeoff for interference-aware cognitive radio networks over imperfect reporting channel. For the cooperative spectrum sensing, the K-out-of-N fusion rule is used. By jointly optimizing the sensing time and the parameter K value, the maximum throughput can be achieved. Theoretical analysis is given to prove the feasibility of the optimization and computer simulations also shows that the maximum throughput can be achieved when the sensing time and the parameter of K value are both optimized.

• Journal of KIISE:Information Networking
• /
• v.33 no.5
• /
• pp.355-368
• /
• 2006

This paper introduces a new split-TCP approach for improving TCP performance over IEEE 802.11-based wireless LANs. TCP over wireless LANs differently from wired networks is not aggressive, which is a fundamental reason for poor performance. Therefore, we propose TAS (TCP-Aware Sub-layer) to migigate this problem. Our scheme extends the split-connection approach that divides a connection into two different connections at a split point such as an access point (AP). Using TAS, a wireless node emulates TCP ACK packets using MAC ACK frames, instead of receiving real TCP ACK packets. We compared TAS with both normal TCP and I-TCP (Indirect TCP) by NS2 simulation. Results show that TAS achieves higher throughput, more fair resource allocation and, in power-saving mode, shorter delays.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.232-242
• /
• 2005

This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in BFG represents a coarse grain block such as FIR and DCT and a port in a block may consume multiple data samples per invocation, which distinguishes our approach from behavioral synthesis and complicates the problem. In the presented design methodology, a dataflow graph with specified algorithm can be mapped to various hardware structures according to the resource allocation and schedule information. This simplifies the management of the area/performance tradeoff in hardware design and widens the design space of hardware implementation of a dataflow graph compared with the previous approaches. Through experiments with some examples, the usefulness of the proposed technique is demonstrated.

• Korean Journal of Construction Engineering and Management
• /
• v.13 no.1
• /
• pp.87-94
• /
• 2012

The apartment reconstruction projects have the proper functions such as residential environment improvement and the new housing allocation system; however, intention of the projects are distorted by the combination of factors, like failure of relocation of the original occupants and income redistribution, speculation in real estate, sharp rise in housing price, disputation between various interested parties, inadequate system and etc and it makes the projects unable to go well. Disputations and litigations are due to spread of the small conflict. As a result of the problems, it could not going smoothly and that lead to increase or stop the period and cost. This study is to estimate the period and cost using the conflict index so as to prevent and solve the problem which is among the conflict in the reverse functions. The conflict index has estimated focus on the conflict impact and the period and cost has been estimated using an variable independent including the conflict index. Also, estimated the conflict index and estimate of the period and cost are able to succeed with a minimum of disputation and money.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.111-120
• /
• 2017

This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.169-176
• /
• 2015

The atomic write technique is a good solution to solve the problem of the double write buffer. The atomic write technique needs modified I/O subsystems (i.e., file system and I/O schedulers) and a special SSD that guarantees the atomicity of the write request. In this paper, we propose the writing unit aligned block allocation technique (for EXT4 file system) and the merge prevention of requests technique for the CFQ scheduler. We also propose an atomic write-supporting SSD which stores the atomicity information in the spare area of the flash memory page. We evaluate the performance of the proposed atomic write scheme in MariaDB using the tpcc-mysql and SysBench benchmarks. The experimental results show that the proposed atomic write technique shows a performance improvement of 1.4~1.5 times compared to the double write buffer technique.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.303-317
• /
• 2006

The process of segmenting customers in CRM should take into equal consideration both the companies' and customers' expected value. However, most of the current studies on customer segmentation have focused only on the companies view in terms of profitability. This study focuses on clarifying a problem and proposing a modified view in the customer segmentation step. The authors offer a proposition which is beneficial to both customers and companies, and thus makes the segmentation step more balanced. There is a two-pronged focus on customer segmentation in this study: first, this paper proposes a balanced view considering not only companies' expected value, but also that of the customers'. Secondly, such balanced segmentation will give a more accurate definition of loyal customers for a given company. This new approach can be expected to improve the level of satisfaction and the length of customer retention, and to increase effectiveness in corporate resource allocation for customer target marketing, as well as improve company insight into customer needs and preferences.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.1-6
• /
• 2017

Due to the recent advances in IoT technologies, reducing power consumption in battery-based IoT devices becomes an important issue. An IoT device is a kind of real-time systems, and processor voltage scaling is known to be effective in reducing power consumption. However, recent research has shown that power consumption in memory increases dramatically in such systems. This paper aims at combining processor voltage scaling and low-power NVRAM technologies to reduce power consumption further. Our main idea is that if a task is schedulable in a lower voltage mode of a processor, we can expect that the task will still be schedulable even on slow NVRAM memory. We incorporate the NVRAM memory allocation problem into processor voltage scaling, and evaluate the effectiveness of the combined approach.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.205-212
• /
• 2003

Because a wireless ad hoc network does not have fixed infrastructure, a call admission control approach researched in a wireless network is not feasible to this network. In this paper, we propose call admission control scheme to support this problem and the burst handoff traffic due to group mobility in a wireless ad hoc network. This scheme is an adaptive guard channel scheme which adapt the number of guard channels in each MBS(mobile base station) according to the current estimate of the potential handoff call rate derived from the number of ongoing calls within the coverage area of an MBS that initiate group handoff in a wireless ad hoc network. Our simulation studies are performed for comparisons of the proposed scheme with the other channel allocation schemes. Simulation results show that the proposed scheme efficiently reduces handoff call blocking probability in wireless ad hoc networks.

• 전자공학회논문지 IE
• /
• v.44 no.1
• /
• pp.20-26
• /
• 2007

Most researches on the mobile ad hoc network (MANET) have been focused on routing protocols, but for the real service provision DNS(Domain Name System) has to be supported first. Due to the inherent characteristics of the mobile ad hoc network, the DNS of the wired network is assumed to be not good for the MANET environment. The approach of distributed DNSs can easily adapt to the node mobility, but incurs the name conflict resolution overhead. On the other hand, the centralized approach performs the name resolution based on the unicast communication without causing the name conflict resolution overhead. The most important issue of the centralized approach is to provide the seamless name resolution service under server mobility. Therefore, in this paper, we propose a new centralized DNS, Manet DNS, which works efficiently on name allocation and management and solves the network merging and partitioning problem as well as providing the seamless name resolution service.