간행물

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

KSII Transactions on Internet and Information Systems (TIIS) update

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

수록정보
수록범위 : 1권1호(2007)~12권9호(2018) |수록논문 수 : 2,106
KSII Transactions on Internet and Information Systems (TIIS)
12권9호(2018년 09월) 수록논문
최근 권호 논문
| | | |

KCI등재 SCI SCOPUS

1An open Scheduling Framework for QoS resource management in the Internet of Things

저자 : Weipeng Jing , Qiucheng Miao , Guangsheng Chen

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

다운로드

(기관인증 필요)

초록보기

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.

KCI등재 SCI SCOPUS

2A Mass-Processing Simulation Framework for Resource Management in Dense 5G-IoT Scenarios

저자 : Lusheng Wang , Kun Chang , Xiumin Wang , Zhen Wei , Qingxin Hu

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

다운로드

(기관인증 필요)

초록보기

Because of the increment in network scale and test expenditure, simulators gradually become main tools for research on key problems of wireless networking, such as radio resource management (RRM) techniques. However, existing simulators are generally event-driven, causing unacceptably large simulation time owing to the tremendous number of events handled during a simulation. In this article, a mass-processing framework for RRM simulations is proposed for the scenarios with a massive amount of terminals of Internet of Things accessing 5G communication systems, which divides the time axis into RRM periods and each period into a number of mini-slots. Transmissions within the coverage of each access point are arranged into mini-slots based on the simulated RRM schemes, and mini-slots are almost fully occupied in dense scenarios. Because the sizes of matrices during this process are only decided by the fixed number of mini-slots in a period, the time expended for performance calculation is not affected by the number of terminals or packets. Therefore, by avoiding the event-driven process, the proposal can simulate dense scenarios in a quite limited time. By comparing with a classical event-driven simulator, NS2, we show the significant merits of our proposal on low time and memory costs.

KCI등재 SCI SCOPUS

3Different QoS Constraint Virtual SDN Embedding under Multiple Controllers

저자 : Zhiyuan Zhao , Xiangru Meng , Siyuan Lu , Yuze Su

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

다운로드

(기관인증 필요)

초록보기

Software-defined networking (SDN) has emerged as a promising technology for network programmability and experiments. In this work, we focus on virtual network embedding in multiple controllers SDN network. In SDN virtualization environment, virtual SDN networks (vSDNs) operate on the shared substrate network and managed by their each controller, the placement and load of controllers affect vSDN embedding process. We consider controller placement, vSDN embedding, controller adjustment as a joint problem, together considering different quality of service (QoS) requirement for users, formulate the problem into mathematical models to minimize the average time delay of control paths, the load imbalance degree of controllers and embedding cost. We propose a heuristic method which places controllers and partitions control domains according to substrate SDN network, embeds different QoS constraint vSDN requests by corresponding algorithms, and migrates switches between control domains to realize load balance of controllers. The simulation results show that the proposed method can satisfy different QoS requirement of tenants, keep load balance between controllers, and work well in the acceptance ratio and revenue to cost ratio for vSDN embedding.

KCI등재 SCI SCOPUS

4Interference Pricing based Resource Allocation for D2D Communications in Cellular Networks

저자 : Xiaomeng Li , Tiejun Lv

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

다운로드

(기관인증 필요)

초록보기

We consider the Device-to-Device (D2D) communications in cellular networks where each cellular user (CU) shares the same resource with multiple D2D users (DUs). In this paper, we aim to maximize the energy efficiency (EE) of the D2D networks, subject to an interference constraint required by the CU. Since the cellular and D2D communications belong to different networks, we consider to incentivize base station (BS) while assisting the DUs. To this end, we propose a Stackelberg game based interference pricing framework for the considered D2D communications in cellular networks. Unlike most of the existing methods, we use interference pricing framework to jointly address the EE resource allocation problem and the interference management in our networks rather than only improve the EE of the DUs or protect cellular networks. In particular, BS and all the users do not need all channel state information, which is more realistic in practice. In addition, two different pricing strategies are also proposed. Based on the two strategies, we analyze the equilibrium of the game. Moreover, in the first strategy, the upper and lower boundaries of the interference price are obtained. The closed-form expression is gained with a backward induction for the second strategy. Both offer valuable insights to the considered scenarios. Finally, compared with the existing work, the EE of the D2D communications is significantly improved. The advantageous performance of our scheme are demonstrated by the simulation results.

KCI등재 SCI SCOPUS

5Efficient Geographical Information-Based En-route Filtering Scheme in Wireless Sensor Networks

저자 : Chuanjun Yi , Geng Yang , Hua Dai , Liang Liu , Yunhua Chen

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

다운로드

(기관인증 필요)

초록보기

The existing en-route filtering schemes only consider some simple false data injection attacks, which results in lower safety performance. In this paper, we propose an efficient geographical information-based en-route filtering scheme (EGEFS), in which each forwarding node verifies not only the message authentication codes (MACs), but also the report identifier and the legitimacy and authenticity of locations carried in a data report. Thus, EGEFS can defend against not only the simple false data injection attacks and the replay attack, but also the collusion attack with forged locations proposed in this paper. In addition, we propose a new method for electing the center-of-stimulus (CoS) node, which can ensure that only one detecting node will be elected as the CoS node to generate one data report for an event. The simulation results show that, compared to the existing en-route filtering schemes, EGEFS has higher safety performance, because it can resist more types of false data injection attacks, and it also has higher filtering efficiency and lower energy expenditure.

KCI등재 SCI SCOPUS

6CANCAR - Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

저자 : Erik Pertovt , Kemal Ali , Ales Svigelj , Mihael Mohorcic

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

다운로드

(기관인증 필요)

초록보기

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

KCI등재 SCI SCOPUS

7An Efficient Optimization Technique for Node Clustering in VANETs Using Gray Wolf Optimization

저자 : Muhammad Fahad Khan , Farhan Aadil , Muazzam Maqsood , Salabat Kha

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

다운로드

(기관인증 필요)

초록보기

Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.

KCI등재 SCI SCOPUS

8A Practical Intent Fuzzing Tool for Robustness of Inter-Component Communication in Android Apps

저자 : Kwanghoon Choi , Myungpil Ko , Byeong-mo Chang

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

다운로드

(기관인증 필요)

초록보기

This research aims at a new practical Intent fuzzing tool for detecting Intent vulnerabilities of Android apps causing the robustness problem. We proposed two new ideas. First, we designed an Intent specification language to describe the structure of Intent, which makes our Intent fuzz testing tool flexible. Second, we proposed an automatic tally method classifying unique failures. With the two ideas, we implemented an Intent fuzz testing tool called Hwacha, and evaluated it with 50 commercial Android apps. Our tool offers an arbitrary combination of automatic and manual Intent generators with executors such as ADB and JUnit due to the use of the Intent specification language. The automatic tally method excluded almost 80% of duplicate failures in our experiment, reducing efforts of testers very much in review of failures. The tool uncovered more than 400 unique failures including what is unknown so far. We also measured execution time for Intent fuzz testing, which has been rarely reported before. Our tool is practical because the whole procedure of fuzz testing is fully automatic and the tool is applicable to the large number of Android apps with no human intervention.

KCI등재 SCI SCOPUS

9Energy Efficiency Enhancement of TICK -based Fuzzy Logic for Selecting Forwarding Nodes in WSNs

저자 : Muhammad Ashraf , Cho Tae Ho

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

다운로드

(기관인증 필요)

초록보기

Communication cost is the most important factor in Wireless Sensor Networks (WSNs), as exchanging control keying messages consumes a large amount of energy from the constituent sensor nodes. Time-based Dynamic Keying and En-Route Filtering (TICK) can reduce the communication costs by utilizing local time values of the en-route nodes to generate one-time dynamic keys that are used to encrypt reports in a manner that further avoids the regular keying or re-keying of messages. Although TICK is more energy efficient, it employs no re-encryption operation strategy that cannot determine whether a healthy report might be considered as malicious if the clock drift between the source node and the forwarding node is too large. Secure SOurce-BAsed Loose Synchronization (SOBAS) employs a selective encryption en-route in which fixed nodes are selected to re-encrypt the data. Therefore, the selection of encryption nodes is non-adaptive, and the dynamic network conditions (i.e., The residual energy of en-route nodes, hop count, and false positive rate) are also not focused in SOBAS. We propose an energy efficient selection of re-encryption nodes based on fuzzy logic. Simulation results indicate that the proposed method achieves better energy conservation at the en-route nodes along the path when compared to TICK and SOBAS.

KCI등재 SCI SCOPUS

10Performance Analysis of NOMA-based Relaying Networks with Transceiver Hardware Impairments

저자 : Chao Deng , Xiaoya Zhao , Di Zhang , Xingwang Li , Jingjing Li

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

다운로드

(기관인증 필요)

초록보기

In this paper, the performance of non-orthogonal multiple access (NOMA) dual-hop (DH) amplify-and-forward (AF) relaying networks is investigated, where Nakagami-m fading channel is considered. In order to cover more details, in our analysis, the transceiver hardware impairments at source, relay and destination nodes are comprehensively considered. To characterize the effects of hardware impairments brought in NOMA DH AF relaying networks, the analytical closed-form expressions for the exact outage probability and approximate ergodic sum rate are derived. In addition, the asymptotic analysis of the outage probability and ergodic sum rate at high signal-to-noise ratio (SNR) regime are carried out in order to further reveal the insights of the parameters for hardware impairments on the network performance. Simulation results indicate the performance of asymptotic ergodic sum rate are limited by levels of distortion noise.

123
권호별 보기
가장 많이 인용된 논문

(자료제공: 네이버학술정보)

가장 많이 인용된 논문
| | | |
1연안해역에서 석유오염물질의 세균학적 분해에 관한 연구

(2006)홍길동 외 1명심리학41회 피인용

다운로드

2미국의 비트코인 규제

(2006)홍길동심리학41회 피인용

다운로드

가장 많이 참고한 논문

(자료제공: 네이버학술정보)

가장 많이 참고한 논문

다운로드

2미국의 비트코인 규제

(2006)홍길동41회 피인용

다운로드

해당 간행물 관심 구독기관

한동대학교 부산대학교 연세대학교 서울대학교 서울과학기술대학교(구 서울산업대학교)
 5
 5
 5
 3
 3
  • 1 한동대학교 (5건)
  • 2 부산대학교 (5건)
  • 3 연세대학교 (5건)
  • 4 서울대학교 (3건)
  • 5 서울과학기술대학교(구 서울산업대학교) (3건)
  • 6 George Washington University (3건)
  • 7 한국전통문화대학교 (3건)
  • 8 고려대학교 (2건)
  • 9 덕성여자대학교 (2건)
  • 10 계명대학교 (2건)

내가 찾은 최근 검색어

최근 열람 자료

맞춤 논문

보관함

내 보관함
공유한 보관함

1:1문의

닫기