간행물

한국인터넷정보학회> 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권10호(2018) |수록논문 수 : 2,134
KSII Transactions on Internet and Information Systems (TIIS)
12권10호(2018년) 수록논문
최근 권호 논문
| | | |

KCI등재 SCI SCOPUS

1A Study of Fronthaul Networks in CRANs - Requirements and Recent Advancements

저자 : Muhammad Waqar , Ajung Kim , Peter K. Cho

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

다운로드

(기관인증 필요)

초록보기

One of the most innovative paradigms for the next-generation of wireless cellular networks is the cloud-radio access networks (C-RANs). In C-RANs, base station functions are distributed between the remote radio heads (RHHs) and base band unit (BBU) pool, and a communication link is defined between them which is referred as the fronthaul. This leveraging link is expected to reduce the CAPEX (capital expenditure) and OPEX (operating expense) of envisioned cellular architectures as well as improves the spectral and energy efficiencies, provides the high scalability, and efficient mobility management capabilities. The fronthaul link carries the baseband signals between the RRHs and BBU pool using the digital radio over fiber (RoF) based common public radio interface (CPRI). CPRI based optical links imposed stringent synchronization, latency and throughput requirements on the fronthaul. As a result, fronthaul becomes a hinder in commercial deployments of C-RANs and is seen as one of a major bottleneck for backbone networks. The optimization of fronthaul is still a challenging issue and requires further exploration at industrial and academic levels. This paper comprehensively summarized the current challenges and requirements of fronthaul networks, and discusses the recently proposed system architectures, virtualization techniques, key transport technologies and compression schemes to carry the time-sensitive traffic in fronthaul networks.

KCI등재 SCI SCOPUS

2A Dynamic Placement Mechanism of Service Function Chaining Based on Software-defined Networking

저자 : Yicen Liu , Yu Lu , Xingkai Chen , Xi Li , Wenxin Qiao , Liyun Chen

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

다운로드

(기관인증 필요)

초록보기

To cope with the explosive growth of Internet services, Service Function Chaining (SFC) based on Software-defined Networking (SDN) is an emerging and promising technology that has been suggested to meet this challenge. Determining the placement of Virtual Network Functions (VNFs) and routing paths that optimize the network utilization and resource consumption is a challenging problem, particularly without violating service level agreements (SLAs). This problem is called the optimal SFC placement problem and an Integer Linear Programming (ILP) formulation is provided. A greedy heuristic solution is also provided based on an improved two-step mapping algorithm. The obtained experimental results show that the proposed algorithm can automatically place VNFs at the optimal locations and find the optimal routing paths for each online request. This algorithm can increase the average request acceptance rate by about 17.6% and provide more than 20-fold reduction of the computational complexity compared to the Greedy algorithm. The feasibility of this approach is demonstrated via NetFPGA-10G prototype implementation.

KCI등재 SCI SCOPUS

3Reduction of the Retransmission Delay for Heterogeneous Devices in Dynamic Opportunistic Device-to-device Network

저자 : Sixuan Chen , Weixia Zou , Xuefeng Liu , Yang Zhao , Zheng Zhou

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

다운로드

(기관인증 필요)

초록보기

The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.

KCI등재 SCI SCOPUS

4A Novel Compressed Sensing Technique for Traffic Matrix Estimation of Software Defined Cloud Networks

저자 : Sameer Qazi , Syed Muhammad Atif , Muhammad Bilal Kadri

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

다운로드

(기관인증 필요)

초록보기

Traffic Matrix estimation has always caught attention from researchers for better network management and future planning. With the advent of high traffic loads due to Cloud Computing platforms and Software Defined Networking based tunable routing and traffic management algorithms on the Internet, it is more necessary as ever to be able to predict current and future traffic volumes on the network. For large networks such origin-destination traffic prediction problem takes the form of a large under- constrained and under-determined system of equations with a dynamic measurement matrix. Previously, the researchers had relied on the assumption that the measurement (routing) matrix is stationary due to which the schemes are not suitable for modern software defined networks. In this work, we present our Compressed Sensing with Dynamic Model Estimation (CS-DME) architecture suitable for modern software defined networks. Our main contributions are: (1) we formulate an approach in which measurement matrix in the compressed sensing scheme can be accurately and dynamically estimated through a reformulation of the problem based on traffic demands. (2) We show that the problem formulation using a dynamic measurement matrix based on instantaneous traffic demands may be used instead of a stationary binary routing matrix which is more suitable to modern Software Defined Networks that are constantly evolving in terms of routing by inspection of its Eigen Spectrum using two real world datasets. (3) We also show that linking this compressed measurement matrix dynamically with the measured parameters can lead to acceptable estimation of Origin Destination (OD) Traffic flows with marginally poor results with other state-of-art schemes relying on fixed measurement matrices. (4) Furthermore, using this compressed reformulated problem, a new strategy for selection of vantage points for most efficient traffic matrix estimation is also presented through a secondary compression technique based on subset of link measurements . Experimental evaluation of proposed technique using real world datasets Abilene and GEANT shows that the technique is practical to be used in modern software defined networks. Further, the performance of the scheme is compared with recent state of the art techniques proposed in research literature.

KCI등재 SCI SCOPUS

5Cell Virtualization with Network Partition for Initial User Association in Software Defined Small-cell Networks

저자 : Guolin Sun , Li Lu , Daniel Ayepah-mensah , Xiufen Fang , Wei Jiang

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

다운로드

(기관인증 필요)

초록보기

In recent years, dense small cell network has been deployed to address the challenge that has resulted from the unprecendented growth of mobile data traffic and users. It has proven to be a cost efficeient solution to offload traffic from macro-cells. Software defined heterogeneous wireless network can decouple the control plane from the data plane. The control signal goes through the macro-cell while the data traffic can be offloaded by small cells. In this paper, we propose a framework for cell virtualization and user association in order to satisfy versatile requirements of multiple tenants. In the proposed framework, we propose an interference graph partioning based virtual-cell association and customized physical-cell association for multi-homed users in a software defined small cell network. The proposed user association scheme includes 3 steps: initialization, virtual-cell association and physical-cell association. Simulation results show that the proposed virtual-cell association outperforms the other schemes. For physical-cell association, the results on resource utilization and user fairness are examined for mobile users and infrastructure providers.

KCI등재 SCI SCOPUS

6There's No Such Thing as Free Lunch but Envy among Young Facebookers

저자 : Tassawar Iqbal , Muhammad Tariq Yousafzai , Sabeen Ali , Kinza Sattar , Muhammad Qaiser Saleem , Usman Habib , Atta Ur Rehman Khan

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

다운로드

(기관인증 필요)

초록보기

Facebook has quickly infused across cultures worldwide to become a common household term for diverse spectra of netizens, especially youngsters. Inherently, interactive in nature, Facebook provides a common cyber enabled platform for online interactions with social friends, living across the world. However, despite its merits, users also experience certain disadvantages, which include but are not limited to rise in feelings of social comparison, decline in self-esteem, contentment and general subjective well-being. This work aims to determine the role of Facebook in spreading envy and identify factors that trigger such emotions. Due to abductive nature of the study, we used pilot interviews and consulted relevant literature to formulate hypotheses. Further, we used deductive approach and conducted a survey. The results showed that frequent use of Facebook, particularly passive following is main predictor of envy, and social interaction is the biggest cause for development of envious feelings in Facebook users. However, insignificant variation was found while investigating relationship between envy and factors, such as pretentiousness, time spent, accomplishment, everything in life, likes on posts, popularity across genders, marital status and genre.

KCI등재 SCI SCOPUS

7A Rendezvous Node Selection and Routing Algorithm for Mobile Wireless Sensor Network

저자 : Yifan Hu , Yi Zheng , Xiaoming Wu , Hailin Liu

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

다운로드

(기관인증 필요)

초록보기

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

KCI등재 SCI SCOPUS

8MDA-SMAC: An Energy-Efficient Improved SMAC Protocol for Wireless Sensor Networks

저자 : Xu Donghong , Wang Ke

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

다운로드

(기관인증 필요)

초록보기

In sensor medium access control (SMAC) protocol, sensor nodes can only access the channel in the scheduling and listening period. However, this fixed working method may generate data latency and high conflict. To solve those problems, scheduling duty in the original SMAC protocol is divided into multiple small scheduling duties (micro duty MD). By applying different micro-dispersed contention channel, sensor nodes can reduce the collision probability of the data and thereby save energy. Based on the given micro-duty, this paper presents an adaptive duty cycle (DC) and back-off algorithm, aiming at detecting the fixed duty cycle in SMAC protocol. According to the given buffer queue length, sensor nodes dynamically change the duty cycle. In the context of low duty cycle and low flow, fair binary exponential back-off (F-BEB) algorithm is applied to reduce data latency. In the context of high duty cycle and high flow, capture avoidance binary exponential back-off (CA-BEB) algorithm is used to further reduce the conflict probability for saving energy consumption. Based on the above two contexts, we propose an improved SMAC protocol, micro duty adaptive SMAC protocol (MDA-SMAC). Comparing the performance between MDA-SMAC protocol and SMAC protocol on the NS-2 simulation platform, the results show that, MDA-SMAC protocol performs better in terms of energy consumption, latency and effective throughput than SMAC protocol, especially in the condition of more crowded network traffic and more sensor nodes.

KCI등재 SCI SCOPUS

9Soft Fault Detection Using an Improved Mechanism in Wireless Sensor Networks

저자 : Mojtaba Montazeri , Rasoul Kiani

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

다운로드

(기관인증 필요)

초록보기

Wireless sensor networks are composed of a large number of inexpensive and tiny sensors used in different areas including military, industry, agriculture, space, and environment. Fault tolerance, which is considered a challenging task in these networks, is defined as the ability of the system to offer an appropriate level of functionality in the event of failures. The present study proposed an intelligent throughput descent and distributed energy-efficient mechanism in order to improve fault tolerance of the system against soft and permanent faults. This mechanism includes determining the intelligent neighborhood radius threshold, the intelligent neighborhood nodes number threshold, customizing the base paper algorithm for distributed systems, redefining the base paper scenarios for failure detection procedure to predict network behavior when running into soft and permanent faults, and some cases have been described for handling failure exception procedures. The experimental results from simulation indicate that the proposed mechanism was able to improve network throughput, fault detection accuracy, reliability, and network lifetime with respect to the base paper.

KCI등재 SCI SCOPUS

10Modified WFRFT-based Transform Domain Communication System Incorporating with Spectrum Mismatching

저자 : Ruiyang Xu , Xinyu Da , Yuan Liang , Hang Hu

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

다운로드

(기관인증 필요)

초록보기

The transform domain communication system (Hereinafter referred to as TDCS) takes on numerous advantages, inclusive of anti-jamming and low probability of detection. Yet its application is confined by the consistent spectrum in the transmitter and receiver, which is not possible in the case of a huge distance exsits between them. In this paper, a TDCS based modified weighted fractional fourier transform (WFRFT) is proposed to solve the problem resulting from spectrum mismatching for TDCS application. The amplitude and phase information are incorporated with the TDCS signals and transmit to the receiver together in the wake of a modified WFRFT. The basic function and the TDCS signals shall be accessible to the receivers in the wake of an inverse WFRFT transform, which make sure that the original information can be demodulated properly. The system's reliability while transmitting signals with different modulation methods and with spectrum mismatching is demonstrated by bit error rate (BER). In the meantime, the constellations of the signals and the BER performances at the eavesdropper demonstrate the proposed system is better secured.

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

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

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

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

다운로드

2미국의 비트코인 규제

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

다운로드

가장 많이 참고한 논문

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

가장 많이 참고한 논문

다운로드

2미국의 비트코인 규제

(2006)홍길동41회 피인용

다운로드

해당 간행물 관심 구독기관

경북대학교 Australian National University 고려대학교 성균관대학교 공군사관학교
 12
 7
 5
 4
 4
  • 1 경북대학교 (12건)
  • 2 Australian National University (7건)
  • 3 고려대학교 (5건)
  • 4 성균관대학교 (4건)
  • 5 공군사관학교 (4건)
  • 6 단국대학교 (4건)
  • 7 중앙대학교(서울) (4건)
  • 8 숭실대학교 (3건)
  • 9 한양대학교 (3건)
  • 10 연세대학교 (2건)

내가 찾은 최근 검색어

최근 열람 자료

맞춤 논문

보관함

내 보관함
공유한 보관함

1:1문의

닫기