논문 상세보기

한국인터넷정보학회> KSII Transactions on Internet and Information Systems (TIIS)> Improved Hybrid Symbiotic Organism Search Task-Scheduling Algorithm for Cloud Computing

KCI등재SCISCOUPUS

Improved Hybrid Symbiotic Organism Search Task-Scheduling Algorithm for Cloud Computing

Songil Choe , Bo Li , Ilnam Ri , Changsu Paek , Jusong Rim , Subom Yun
  • : 한국인터넷정보학회
  • : KSII Transactions on Internet and Information Systems (TIIS) 12권8호
  • : 연속간행물
  • : 2018년 08월
  • : 3516-3541(26pages)

DOI


목차

1. Introduction
2. Related Work
3. Task Scheduling Model in Cloud Computing
4. Hybrid SA-CLS-SOS Algorithm for task Scheduling in Cloud Computing
5. Simulation and Results
6. Conclusion
References

키워드 보기


초록 보기


						
Task scheduling is one of the most challenging aspects of cloud computing nowadays, and it plays an important role in improving overall performance in, and services from, the cloud, such as response time, cost, makespan, and throughput. A recent cloud task-scheduling algorithm based on the symbiotic organisms search (SOS) algorithm not only has fewer specific parameters, but also incurs time complexity. SOS is a newly developed metaheuristic optimization technique for solving numerical optimization problems. In this paper, the basic SOS algorithm is reduced, and chaotic local search (CLS) is integrated into the reduced SOS to improve the convergence rate. Simulated annealing (SA) is also added to help the SOS algorithm avoid being trapped in a local minimum. The performance of the proposed SA-CLS-SOS algorithm is evaluated by extensive simulation using the Matlab framework, and is compared with SOS, SA-SOS, and CLS-SOS algorithms. Simulation results show that the improved hybrid SOS performs better than SOS, SA-SOS, and CLS-SOS in terms of convergence speed and makespan.

ECN


UCI

간행물정보

  • : 공학분야  > 기타(공학)
  • : KCI 등재
  • : SCI / SCOPUS
  • : 월간
  • : 1976-7277
  • :
  • : 학술지
  • : 연속간행물
  • : 2007-2018
  • : 2134


저작권 안내

한국학술정보㈜의 모든 학술 자료는 각 학회 및 기관과 저작권 계약을 통해 제공하고 있습니다.

이에 본 자료를 상업적 이용, 무단 배포 등 불법적으로 이용할 시에는 저작권법 및 관계법령에 따른 책임을 질 수 있습니다.

발행기관 최신논문
| | | | 다운로드

1Improved Hybrid Symbiotic Organism Search Task-Scheduling Algorithm for Cloud Computing

저자 : Songil Choe , Bo Li , Ilnam Ri , Changsu Paek , Jusong Rim , Subom Yun

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3516-3541 (26 pages)

다운로드

(기관인증 필요)

초록보기

Task scheduling is one of the most challenging aspects of cloud computing nowadays, and it plays an important role in improving overall performance in, and services from, the cloud, such as response time, cost, makespan, and throughput. A recent cloud task-scheduling algorithm based on the symbiotic organisms search (SOS) algorithm not only has fewer specific parameters, but also incurs time complexity. SOS is a newly developed metaheuristic optimization technique for solving numerical optimization problems. In this paper, the basic SOS algorithm is reduced, and chaotic local search (CLS) is integrated into the reduced SOS to improve the convergence rate. Simulated annealing (SA) is also added to help the SOS algorithm avoid being trapped in a local minimum. The performance of the proposed SA-CLS-SOS algorithm is evaluated by extensive simulation using the Matlab framework, and is compared with SOS, SA-SOS, and CLS-SOS algorithms. Simulation results show that the improved hybrid SOS performs better than SOS, SA-SOS, and CLS-SOS in terms of convergence speed and makespan.

2Relaying Protocols and Delay Analysis for Buffer-aided Wireless Powered Cooperative Communication Networks

저자 : Jun Zhan , Xiaohu Tang , Qingchun Che

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3543-3567 (25 pages)

다운로드

(기관인증 필요)

초록보기

In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

3Feasibility of Societal Model for Securing Internet of Things

저자 : Hiroshi Tsunoda , Rodrigo Roman , Javier Lopez , Glenn Mansfield Keeni

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3567-3588 (22 pages)

다운로드

(기관인증 필요)

초록보기

In the Internet of Things (IoT) concept, devices communicate autonomously with applications in the Internet. A significant aspect of IoT that makes it stand apart from present-day networked devices and applications is a) the very large number of devices, produced by diverse makers and used by an even more diverse group of users; b) the applications residing and functioning in what were very private sanctums of life e.g. the car, home, and the people themselves. Since these diverse devices require high-level security, an operational model for an IoT system is required, which has built-in security. We have proposed the societal model as a simple operational model. The basic concept of the model is borrowed from human society - there will be infants, the weak and the handicapped who need to be protected by guardians. This natural security mechanism works very well for IoT networks which seem to have inherently weak security mechanisms. In this paper, we discuss the requirements of the societal model and examine its feasibility by doing a proof-of-concept implementation.

4Individual Channel Estimation Based on Blind Interference Cancellation for Two-Way MIMO Relay Networks

저자 : Xianwen He , Gaoqi Dou , Jun Gao

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3589-3605 (17 pages)

다운로드

(기관인증 필요)

초록보기

In this paper, we investigate an individual channel estimation problem for multiple-input multiple-output (MIMO) two-way amplify-and-forward (AF) relay networks. To avoid self-interference during the estimation of the individual MIMO channels, a novel blind interference cancellation (BIC) approach is proposed based on an orthogonal preceding framework, where a pair of orthogonal precoding matrices is utilized at the source nodes. By designing an optimal decoding scheme, we propose to decompose the bidirectional transmission into a pair of unidirectional transmissions. Unlike most existing approaches, we make the practical assumption that the nonreciprocal MIMO channel and the mutual interference of multiple antennas are both taken into consideration. Under the precoding framework, we employ an orthogonal superimposed training strategy to obtain the individual MIMO channels. However, the AF strategy causes the noise at the terminal to be the sum of the local noise and the relay-propagated noise. To remove the relay-propagated noise during the estimation of the second-hop channel, a partial noise-nulling method is designed. We also derive a closed-form expression for the total mean square error (MSE) of the MIMO channel from which we compute the optimal power allocation. The simulation results demonstrate that the analytical and simulated curves match fully.

5High Utility Itemset Mining over Uncertain Datasets Based on a Quantum Genetic Algorithm

저자 : Ju Wang , Fuxian Liu , Chunjie Jin

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3606-3629 (24 pages)

다운로드

(기관인증 필요)

초록보기

The discovered high potential utility itemsets (HPUIs) have significant influence on a variety of areas, such as retail marketing, web click analysis, and biological gene analysis. Thus, in this paper, we propose an algorithm called HPUIM-QGA (Mining high potential utility itemsets based on a quantum genetic algorithm) to mine HPUIs over uncertain datasets based on a quantum genetic algorithm (QGA). The proposed algorithm not only can handle the problem of the non-downward closure property by developing an upper bound of the potential utility (UBPU) (which prunes the unpromising itemsets in the early stage) but can also handle the problem of combinatorial explosion by introducing a QGA, which finds optimal solutions quickly and needs to set only very few parameters. Furthermore, a pruning strategy has been designed to avoid the meaningless and redundant itemsets that are generated in the evolution process of the QGA. As proof of the HPUIM-QGA, a substantial number of experiments are performed on the runtime, memory usage, analysis of the discovered itemsets and the convergence on real-life and synthetic datasets. The results show that our proposed algorithm is reasonable and acceptable for mining meaningful HPUIs from uncertain datasets.

6MFSC: Mean-Field-Theory and Spreading-Coefficient Based Degree Distribution Analysis in Social Network

저자 : Chongze Lin , Yi Zheng

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3630-3656 (27 pages)

다운로드

(기관인증 필요)

초록보기

Degree distribution can provide basic information for structural characteristics and internal relationship in social network. It is a critical procedure for social network topology analysis. In this paper, based on the mean-field theory, we study a special type of social network with exponential distribution of time intervals. First of all, in order to improve the accuracy of analysis, we propose a spreading coefficient algorithm based on intimate relationship, which determines the number of the joined members through the intimacy among members. Then, simulation show that the degree distribution of follows the power-law distribution and has small-world characteristics. Finally, we compare the performance of our algorithm with the existing algorithms, and find that our algorithm improves the accuracy of degree distribution as well as reducing the time complexity significantly, which can complete 29.04% higher precision and 40.94% lower implementation time.

7BtPDR: Bluetooth and PDR-Based Indoor Fusion Localization Using Smartphones

저자 : Yingbiao Yao , Qiaojing Bao , Qi Han , Ruili Yao , Xiaorong Xu , Junrong Yan

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3657-3682 (26 pages)

다운로드

(기관인증 필요)

초록보기

This paper presents a Bluetooth and pedestrian dead reckoning (PDR)-based indoor fusion localization approach (BtPDR) using smartphones. A Bluetooth and PDR-based indoor fusion localization approach can localize the initial position of a smartphone with the received signal strength (RSS) of Bluetooth. While a smartphone is moving, BtPDR can track its position by fusing the localization results of PDR and Bluetooth RSS. In addition, BtPDR can adaptively modify the parameters of PDR. The contributions of BtPDR include: a Bluetooth RSS-based Probabilistic Voting (BRPV) localization mechanism, a probabilistic voting-based Bluetooth RSS and PDR fusion method, and a heuristic search approach for reducing the complexity of BRPV. The experiment results in a real scene show that the average positioning error is < 2m, which is considered adequate for indoor location-based service applications. Moreover, compared to the traditional PDR method, BtPDR improves the location accuracy by 42.6%, on average. Compared to state-of-the-art Wireless Local Area Network (WLAN) fingerprint + PDR-based fusion indoor localization approaches, BtPDR has better positioning accuracy and does not need the same offline workload as a fingerprint algorithm.

8EEC-FM: Energy Efficient Clustering based on Firefly and Midpoint Algorithms in Wireless Sensor Network

저자 : Ravuri Daniel , Kuda Nageswara Rao

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3683-3703 (21 pages)

다운로드

(기관인증 필요)

초록보기

Wireless sensor networks (WSNs) consist of set of sensor nodes. These sensor nodes are deployed in unattended area which are able to sense, process and transmit data to the base station (BS). One of the primary issues of WSN is energy efficiency. In many existing clustering approaches, initial centroids of cluster heads (CHs) are chosen randomly and they form unbalanced clusters, results more energy consumption. In this paper, an energy efficient clustering protocol to prevent unbalanced clusters based on firefly and midpoint algorithms called EEC-FM has been proposed, where midpoint algorithm is used for initial centroid of CHs selection and firefly is used for cluster formation. Using residual energy and Euclidean distance as the parameters for appropriate cluster formation of the proposed approach produces balanced clusters to eventually balance the load of CHs and improve the network lifetime. Simulation result shows that the proposed method outperforms LEACH-B, BPK-means, Park's approach, Mk-means, and EECPK-means with respect to balancing of clusters, energy efficiency and network lifetime parameters. Simulation result also demonstrate that the proposed approach, EEC-FM protocol is 45% better than LEACH-B, 17.8% better than BPK-means protocol, 12.5% better than Park's approach, 9.1% better than Mk-means, and 5.8% better than EECPK-means protocol with respect to the parameter half energy consumption (HEC).

9Turbo MIMO-OFDM Receiver in Time-Varying Channels

저자 : Yu-kuan Chang , Fang-biau Ueng , Yi-wei Jhang

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3704-3724 (21 pages)

다운로드

(기관인증 필요)

초록보기

This paper proposes an advanced turbo receiver with joint inter-carrier interference (ICI) self cancellation and channel equalization for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems over rapidly time-varying channel environment. The ICI caused by impairment of local oscillators and carrier frequency offset (CFO) is the major problem for MIMO-OFDM communication systems. The existing schemes (conjugate cancellation (CC) and phase rotated conjugate cancellation (PRCC)) that deal with the ICI cancellation and channel equalization can't provide satisfactory performance over time-varying channels. In term of error rate performance and low computational complexity, ICI self cancellation is the best choice. So, this paper proposes a turbo receiver to deal with the problem of joint ICI self cancellation and channel equalization. We employ the adaptive phase rotations in the receiver to effectively track the CFO variations without feeding back the CFO estimate to the transmitter as required in traditional existing scheme. We also give some simulations to verify the proposed scheme. The proposed schene outperforms the existing schemes.

10A Novel Feature Selection Method in the Categorization of Imbalanced Textual Data

저자 : Jafar Pouramini , Behrouze Minaei-bidgoli , Mahdi Esmaeili

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 12권 8호 발행 연도 : 2018 페이지 : pp. 3725-3748 (24 pages)

다운로드

(기관인증 필요)

초록보기

Text data distribution is often imbalanced. Imbalanced data is one of the challenges in text classification, as it leads to the loss of performance of classifiers. Many studies have been conducted so far in this regard. The proposed solutions are divided into several general categories, include sampling-based and algorithm-based methods. In recent studies, feature selection has also been considered as one of the solutions for the imbalance problem. In this paper, a novel one-sided feature selection known as probabilistic feature selection (PFS) was presented for imbalanced text classification. The PFS is a probabilistic method that is calculated using feature distribution. Compared to the similar methods, the PFS has more parameters. In order to evaluate the performance of the proposed method, the feature selection methods including Gini, MI, FAST and DFS were implemented. To assess the proposed method, the decision tree classifications such as C4.5 and Naive Bayes were used. The results of tests on Reuters-21875 and WebKB figures per F-measure suggested that the proposed feature selection has significantly improved the performance of the classifiers.

123
주제별 간행물
간행물명 수록권호

KCI등재

한국안전학회지(구 산업안전학회지)
33권 5호 ~ 33권 5호

한국감성과학회 추계학술대회
2018권 0호 ~ 2018권 0호

한국전과정평가학회지
19권 1호 ~ 19권 1호

KCI등재 SCI SCOUPUS

KSII Transactions on Internet and Information Systems (TIIS)
12권 10호 ~ 12권 10호

KCI등재

인터넷정보학회논문지
19권 5호 ~ 19권 5호

KCI등재

복합신소재구조학회논문집
9권 3호 ~ 9권 3호

KCI등재

감성과학
21권 3호 ~ 21권 3호

KCI등재 SCI SCOUPUS

KSII Transactions on Internet and Information Systems (TIIS)
11권 12호 ~ 12권 1호

한국화상학회지
24권 2호 ~ 24권 2호

KCI등재

공학기술논문지
11권 3호 ~ 11권 3호

KCI등재 SCI SCOUPUS

KSII Transactions on Internet and Information Systems (TIIS)
12권 9호 ~ 12권 9호

복합신소재구조학회지
9권 2호 ~ 9권 2호

KCI등재 SCI SCOUPUS

KSII Transactions on Internet and Information Systems (TIIS)
12권 8호 ~ 12권 8호

KCI등재

인터넷정보학회논문지
19권 4호 ~ 19권 4호

인터넷정보학회지
19권 1호 ~ 19권 1호

KCI등재

한국안전학회지(구 산업안전학회지)
33권 1호 ~ 33권 4호

KCI등재 SCI SCOUPUS

KSII Transactions on Internet and Information Systems (TIIS)
12권 8호 ~ 12권 8호

KCI등재

인터넷정보학회논문지
19권 4호 ~ 19권 4호

KCI등재 SCI SCOUPUS

KSII Transactions on Internet and Information Systems (TIIS)
12권 7호 ~ 12권 7호

한국화상학회지
24권 1호 ~ 24권 1호
발행기관 최신논문
자료제공: 네이버학술정보
발행기관 최신논문
자료제공: 네이버학술정보

내가 찾은 최근 검색어

최근 열람 자료

맞춤 논문

보관함

내 보관함
공유한 보관함

1:1문의

닫기