간행물

한국인터넷정보학회> KSII Transactions on Internet and Information Systems (TIIS)

KSII Transactions on Internet and Information Systems (TIIS) update

  • : 한국인터넷정보학회
  • : 공학분야  >  기타(공학)
  • : KCI등재
  • : SCI,SCOPUS
  • : 연속간행물
  • : 월간
  • : 1976-7277
  • :
  • :

수록정보
12권7호(2018) |수록논문 수 : 27
간행물 제목
12권7호(2018년) 수록논문
권호별 수록 논문
| | | |

KCI등재 SCI SCOPUS

1Clustering-Based Mobile Gateway Management in Integrated CRAHN-Cloud Network

저자 : Ling Hou , Angus K. Y. Wong , Alan K. H. Yeung , Steven S. O. Choy

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

다운로드

(기관인증 필요)

초록보기

The limited storage and computing capacity hinder the development of cognitive radio ad hoc networks (CRAHNs). To solve the problem, a new paradigm of cloud-based CRAHN has been proposed, in which a CRAHN will make use of the computation and storage resources of the cloud. This paper envisions an integrated CRAHN-cloud network architecture. In this architecture, some cognitive radio users (CUs) who satisfy the required metrics could perform as mobile gateway candidates to connect other ordinary CUs with the cloud. These mobile gateway candidates are dynamically clustered according to different related metrics. Cluster head and time-to-live value are determined in each cluster. In this paper, the gateway advertisement and discovery issues are first addressed to propose a hybrid gateway discovery mechanism. After that, a QoS-based gateway selection algorithm is proposed for each CU to select the optimal gateway. Simulations are carried out to evaluate the performance of the overall scheme, which incorporates the proposed clustering and gateway selection algorithms. The results show that the proposed scheme can achieve about 11% higher average throughput, 10% lower end-to-end delay, and 8% lower packet drop fractions compared with the existing scheme.

KCI등재 SCI SCOPUS

2Performance Evaluation and Analysis of Multiple Scenarios of Big Data Stream Computing on Storm Platform

저자 : Dawei Sun , Hongbin Yan , Shang Gao , Zhangbing Zhou

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

다운로드

(기관인증 필요)

초록보기

In big data era, fresh data grows rapidly every day. More than 30,000 gigabytes of data are created every second and the rate is accelerating. Many organizations rely heavily on real time streaming, while big data stream computing helps them spot opportunities and risks from real time big data. Storm, one of the most common online stream computing platforms, has been used for big data stream computing, with response time ranging from milliseconds to sub-seconds. The performance of Storm plays a crucial role in different application scenarios, however, few studies were conducted to evaluate the performance of Storm. In this paper, we investigate the performance of Storm under different application scenarios. Our experimental results show that throughput and latency of Storm are greatly affected by the number of instances of each vertex in task topology, and the number of available resources in data center. The fault-tolerant mechanism of Storm works well in most big data stream computing environments. As a result, it is suggested that a dynamic topology, an elastic scheduling framework, and a memory based fault-tolerant mechanism are necessary for providing high throughput and low latency services on Storm platform.

KCI등재 SCI SCOPUS

3A Novel Adaptive Turbo Receiver for Large-Scale MIMO Communications

저자 : Yu-kuan Chang , Fang-biau Ueng , Bo-yi Tsai

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

다운로드

(기관인증 필요)

초록보기

Massive (large-scale) MIMO (multiple-input multiple-output) is one of the key technologies in next-generation wireless communication systems. This paper proposes a high-performance low-complexity turbo receiver for SC-FDMA (single-carrier frequency-division multiple access) based MMIMO (massive MIMO) systems. Because SC-FDMA technology has the desirable characteristics of OFDMA (orthogonal frequency division multiple access) and the low PAPR (peak-to-average power ratio) of SC transmission schemes, the 3GPP LTE (long-term evolution) has adopted it as the uplink transmission to meet the demand high data rate and low error rate performance. The complexity of computing will be increased greatly in base station with massive MIMO (MMIMO) system. In this paper, a low-complexity adaptive turbo equalization receiver based on normalized minimal symbol-error-rate for MMIMO SC-FDMA system is proposed. The proposed receiver is with low complexity than that of the conventional turbo MMSE (minimum mean square error) equalizer and is also with better bit error rate (BER) performance than that of the conventional adaptive turbo MMSE equalizer. Simulation results confirm the effectiveness of the proposed scheme.

KCI등재 SCI SCOPUS

4T-START: Time, Status and Region Aware Taxi Mobility Model for Metropolis

저자 : Haiquan Wang , Shuo Lei , Binglin Wu , Yilin Li , Bowen Du

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

다운로드

(기관인증 필요)

초록보기

The mobility model is one of the most important factors that impacts the evaluation of any transportation vehicular networking protocols via simulations. However, to obtain a realistic mobility model in the dynamic urban environment is a very challenging task. Several studies extract mobility models from large-scale real data sets (mostly taxi GPS data) in recent years, but they do not consider the statuses of taxi, which is an important factor affected taxi's mobility. In this paper, we discover three simple observations related to the taxi statuses via mining of real taxi trajectories: (1) the behavior of taxi will be influenced by the statuses, (2) the macroscopic movement is related with different geographic features in corresponding status, and (3) the taxi load/drop events are varied with time period. Based on these three observations, a novel taxi mobility model (T-START) is proposed with respect to taxi statuses, geographic region and time period. The simulation results illustrate that proposed mobility model has a good approximation with reality in trajectory samples and distribution of nodes in four typical time periods.

KCI등재 SCI SCOPUS

5K-Hop Community Search Based On Local Distance Dynamics

저자 : Tao Meng , Lijun Cai , Tingqin He , Lei Chen , Ziyun Deng

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

다운로드

(기관인증 필요)

초록보기

Community search aims at finding a meaningful community that contains the query node and also maximizes (minimizes) a goodness metric. This problem has recently drawn intense research interest. However, most metric-based algorithms tend to include irrelevant subgraphs in the identified community. Apart from the user-defined metric algorithm, how can we search the natural community that the query node belongs to? In this paper, we propose a novel community search algorithm based on the concept of the k-hop and local distance dynamics model, which can naturally capture a community that contains the query node. The basic idea is to envision the nodes that k-hop away from the query node as an adaptive local dynamical system, where each node only interacts with its local topological structure. Relying on a proposed local distance dynamics model, the distances among nodes change over time, where the nodes sharing the same community with the query node tend to gradually move together, while other nodes stay far away from each other. Such interplay eventually leads to a steady distribution of distances, and a meaningful community is naturally found. Extensive experiments show that our community search algorithm has good performance relative to several state-of-the-art algorithms.

KCI등재 SCI SCOPUS

6REVIEW ON ENERGY EFFICIENT OPPORTUNISTIC ROUTING PROTOCOL FOR UNDERWATER WIRELESS SENSOR NETWORKS

저자 : Nasarudin Ismail , M. M. Mohamad

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

다운로드

(기관인증 필요)

초록보기

Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

KCI등재 SCI SCOPUS

7Adaptive Algorithms for Bayesian Spectrum Sensing Based on Markov Model

저자 : Shengliang Peng , Renyang Gao , Weibin Zheng , Kejun Lei

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

다운로드

(기관인증 필요)

초록보기

Spectrum sensing (SS) is one of the fundamental tasks for cognitive radio. In SS, decisions can be made via comparing the test statistics with a threshold. Conventional adaptive algorithms for SS usually adjust their thresholds according to the radio environment. This paper concentrates on the issue of adaptive SS whose threshold is adjusted based on the Markovian behavior of primary user (PU). Moreover, Bayesian cost is adopted as the performance metric to achieve a trade-off between false alarm and missed detection probabilities. Two novel adaptive algorithms, including Markov Bayesian energy detection (MBED) algorithm and IMBED (improved MBED) algorithm, are proposed. Both algorithms model the behavior of PU as a two-state Markov process, with which their thresholds are adaptively adjusted according to the detection results at previous slots. Compared with the existing Bayesian energy detection (BED) algorithm, MBED algorithm can achieve lower Bayesian cost, especially in high signal-to-noise ratio (SNR) regime. Furthermore, it has the advantage of low computational complexity. IMBED algorithm is proposed to alleviate the side effects of detection errors at previous slots. It can reduce Bayesian cost more significantly and in a wider SNR region. Simulation results are provided to illustrate the effectiveness and efficiencies of both algorithms.

KCI등재 SCI SCOPUS

8Clustering Algorithm for Time Series with Similar Shapes

저자 : Jungyu Ahn , Ju-hong Lee

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

다운로드

(기관인증 필요)

초록보기

Since time series clustering is performed without prior information, it is used for exploratory data analysis. In particular, clusters of time series with similar shapes can be used in various fields, such as business, medicine, finance, and communications. However, existing time series clustering algorithms have a problem in that time series with different shapes are included in the clusters. The reason for such a problem is that the existing algorithms do not consider the limitations on the size of the generated clusters, and use a dimension reduction method in which the information loss is large. In this paper, we propose a method to alleviate the disadvantages of existing methods and to find a better quality of cluster containing similarly shaped time series. In the data preprocessing step, we normalize the time series using z-transformation. Then, we use piecewise aggregate approximation (PAA) to reduce the dimension of the time series. In the clustering step, we use density-based spatial clustering of applications with noise (DBSCAN) to create a precluster. We then use a modified K-means algorithm to refine the preclusters containing differently shaped time series into subclusters containing only similarly shaped time series. In our experiments, our method showed better results than the existing method.

KCI등재 SCI SCOPUS

9Evaluation criterion for different methods of multiple-attribute group decision making with interval-valued intuitionistic fuzzy information

저자 : Junda Qiu , Lei Li

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

다운로드

(기관인증 필요)

초록보기

A number of effective methods for multiple-attribute group decision making (MAGDM) with interval-valued intuitionistic fuzzy numbers (IVIFNs) have been proposed in recent years. However, the different methods frequently yield different, even sometimes contradictory, results for the same problem. In this paper a novel criterion to determine the advantages and disadvantages of different methods is proposed. First, the decision-making process is divided into three parts: translation of experts' preferences, aggregation of experts' opinions, and comparison of the alternatives. Experts' preferences aggregation is considered the core step, and the quality of the collective matrix is considered the most important evaluation index for the aggregation methods. Then, methods to calculate the similarity measure, correlation, correlation coefficient, and energy of the intuitionistic fuzzy matrices are proposed, which are employed to evaluate the collective matrix. Thus, the optimal method can be selected by comparing the collective matrices when all the methods yield different results. Finally, a novel approach for aggregating experts' preferences with IVIFN is presented. In this approach, experts' preferences are mapped as points into two-dimensional planes, with the plant growth simulation algorithm (PGSA) being employed to calculate the optimal rally points, which are inversely mapped to IVIFNs to establish the collective matrix. In the study, four different methods are used to address one example problem to illustrate the feasibility and effectiveness of the proposed approach.

KCI등재 SCI SCOPUS

10Passive Overall Packet Loss Estimation at the Border of an ISP

저자 : Haoliang Lan , Wei Ding , Yumei Zhang

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

다운로드

(기관인증 필요)

초록보기

In this paper, a heuristic method that leverages packet traces captured at the entire boarder of an ISP to distinguish and estimate the overall packet loss within an ISP's management domain (Intra_Path_Loss) and that in the outside Internet (Inter_Path_Loss) is proposed. Our method is inspired by that packet losses happened at different locations will cause different TCP sequence number patterns at the border of an ISP. Thereby, we leverage these TCP sequence number patterns to build a series of heuristic rules to estimate Intra_Path_Loss and Inter_Path_Loss, respectively. We do this work with an eye towards showing that the overall packet losses defined and estimated in this paper can provide the operators with some valuable information to help them precisely grasp the overall performance of network paths and narrow down the range of network anomalies. The proposed method is rigorously validated with simulations, and finally the results from a regional academic network JSERNET verify its effectiveness and practicability.

123

내가 찾은 최근 검색어

최근 열람 자료

맞춤 논문

보관함

내 보관함
공유한 보관함

1:1문의

닫기