간행물

한국인터넷정보학회> 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)~13권7호(2019) |수록논문 수 : 2,391
KSII Transactions on Internet and Information Systems (TIIS)
13권7호(2019년 07월) 수록논문
최근 권호 논문
| | | |

KCI등재 SCI SCOPUS

1Multi-regional Anti-jamming Communication Scheme Based on Transfer Learning and Q Learning

저자 : Chen Han , Yingtao Niu

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 13권 7호 발행 연도 : 2019 페이지 : pp. 3333-3350 (18 pages)

다운로드

(기관인증 필요)

초록보기

The smart jammer launches jamming attacks which degrade the transmission reliability. In this paper, smart jamming attacks based on the communication probability over different channels is considered, and an anti-jamming Q learning algorithm (AQLA) is developed to obtain anti-jamming knowledge for the local region. To accelerate the learning process across multiple regions, a multi-regional intelligent anti-jamming learning algorithm (MIALA) which utilizes transferred knowledge from neighboring regions is proposed. The MIALA algorithm is evaluated through simulations, and the results show that the it is capable of learning the jamming rules and effectively speed up the learning rate of the whole communication region when the jamming rules are similar in the neighboring regions.

KCI등재 SCI SCOPUS

2Reaching Byzantine Agreement underlying VANET

저자 : Shu-ching Wang , Ya-jung Lin , Kuo-qin Yan

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 13권 7호 발행 연도 : 2019 페이지 : pp. 3351-3368 (18 pages)

다운로드

(기관인증 필요)

초록보기

The Internet of Things (IoT) enables machines and devices in a global network to connect and provide applications. The Vehicular Ad-hoc NETwork (VANET) allows vehicles in the network to communicate with each other as an application of the IoT. The safety and comfort of passengers can be improved through VANET related applications. In order to be able to provide related applications, there must be a reliable VANET topology. As a result of the Byzantine agreement (BA), fault tolerance can be solved in VANET. In order to improve the reliability of the system, even if some components in the system are damaged, a protocol is needed to assist the system to perform normally. Therefore, the BA problem in VANET with multiple impairments is revisited in this research. The proposed protocol allows all normal processing elements (PEs) to reach agreement using the least amount of information exchange. Moreover, the proposed protocol can tolerate the largest number of damaged PEs in VANET.

KCI등재 SCI SCOPUS

3THERA: Two-level Hierarchical Hybrid Road-Aware Routing for Vehicular Networks

저자 : Muhammad Tahir Abbas , Wang-cheol Song

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

다운로드

(기관인증 필요)

초록보기

There are various research challenges in vehicular ad hoc networks (VANETs) that need to be focused until an extensive deployment of it becomes conceivable. Design and development of a scalable routing algorithm for VANETs is one of the critical issue due to frequent path disruptions caused by the vehicle's mobility. This study aims to provide a novel road-aware routing protocol for vehicular networks named as Two-level hierarchical Hybrid Road-Aware (THERA) routing for vehicular ad hoc networks. The proposed protocol is designed explicitly for inter-vehicle communication. In THERA, roads are distributed into non-overlapping road segments to reduce the routing overhead. Unlike other protocols, discovery process does not flood the network with packet broadcasts. Instead, THERA uses the concept of Gateway Vehicles (GV) for the discovery process. In addition, a route between source and destination is flexible to changing topology, as THERA only requires road segment ID and destination ID for the communication. Furthermore, Road-Aware routing reduces the traffic congestion, bypasses the single point of failure, and facilitates the network management. Finally yet importantly, this paper also proposes a probabilistical model to estimate a path duration for each road segment using the highway mobility model. The flexibility of the proposed protocol is evaluated by performing extensive simulations in NS3. We have used SUMO simulator to generate real time vehicular traffic on the roads of Gangnam, South Korea. Comparative analysis of the results confirm that routing overhead for maintaining the network topology is smaller than few previously proposed routing algorithms.

KCI등재 SCI SCOPUS

4Trust based Secure Reliable Route Discovery in Wireless Mesh Networks

저자 : Navmani T M , Yogesh P

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 13권 7호 발행 연도 : 2019 페이지 : pp. 3386-3411 (26 pages)

다운로드

(기관인증 필요)

초록보기

Secured and reliable routing is a crucial factor for improving the performance of Wireless Mesh Networks (WMN) since these networks are susceptible to many types of attacks. The existing assumption about the internal nodes in wireless mesh networks is that they cooperate well during the forwarding of packets all the time. However, it is not always true due to the presence of malicious and mistrustful nodes. Hence, it is essential to establish a secure, reliable and stable route between a source node and a destination node in WMN. In this paper, a trust based secure routing algorithm is proposed for enhancing security and reliability of WMN, which contains cross layer and subject logic based reliable reputation scheme with security tag model for providing effective secured routing. This model uses only the trusted nodes with the forwarding reliability of data transmission and it isolates the malicious nodes from the providing path. Moreover, every node in this model is assigned with a security tag that is used for efficient authentication. Thus, by combining authentication, trust and subject logic, the proposed approach is capable of choosing the trusted nodes effectively to participate in forwarding the packets of trustful peer nodes successfully. The simulation results obtained from this work show that the proposed routing protocol provides optimal network performance in terms of security and packet delivery ratio.

KCI등재 SCI SCOPUS

5Joint Optimization of Mobile Charging and Data Gathering for Wireless Rechargeable Sensor Networks

저자 : Xianzhong Tian , Jiacun He , Yuzhe Chen , Yanjun Li

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

다운로드

(기관인증 필요)

초록보기

Recent advances in radio frequency (RF) power transfer provide a promising technology to power sensor nodes. Adoption of mobile chargers to replenish the nodes' energy has recently attracted a lot of attention and the mobility assisted energy replenishment provides predictable and sustained power service. In this paper, we study the joint optimization of mobile charging and data gathering in sensor networks. A wireless multi-functional vehicle (WMV) is employed and periodically moves along specified trajectories, charge the sensors and gather the sensed data via one-hop communication. The objective of this paper is to maximize the uplink throughput by optimally allocating the time for the downlink wireless energy transfer by the WMV and the uplink transmissions of different sensors. We consider two scenarios where the WMV moves in a straight line and around a circle. By time discretization, the optimization problem is formulated as a 0-1 programming problem. We obtain the upper and lower bounds of the problem by converting the original 0-1 programming problem into a linear programming problem and then obtain the optimal solution by using branch and bound algorithm. We further prove that the network throughput is independent of the WMV's velocity under certain conditions. Performance of our proposed algorithm is evaluated through extensive simulations. The results validate the correctness of our proposed theorems and demonstrate that our algorithm outperforms two baseline algorithms in achieved throughput under different settings.

KCI등재 SCI SCOPUS

6Single-channel Demodulation Algorithm for Non-cooperative PCMA Signals Based on Neural Network

저자 : Chi Wei , Hua Peng , Junhui Fan

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 13권 7호 발행 연도 : 2019 페이지 : pp. 3433-3446 (14 pages)

다운로드

(기관인증 필요)

초록보기

Aiming at the high complexity of traditional single-channel demodulation algorithm for PCMA signals, a new demodulation algorithm based on neural network is proposed to reduce the complexity of demodulation in the system of non-cooperative PCMA communication. The demodulation network is trained in this paper, which combines the preprocessing module and decision module. Firstly, the preprocessing module is used to estimate the initial parameters, and the auxiliary signals are obtained by using the information of frequency offset estimation. Then, the time-frequency characteristic data of auxiliary signals are obtained, which is taken as the input data of the neural network to be trained. Finally, the decision module is used to output the demodulated bit sequence. Compared with traditional single-channel demodulation algorithms, the proposed algorithm does not need to go through all the possible values of transmit symbol pairs, which greatly reduces the complexity of demodulation. The simulation results show that the trained neural network can greatly extract the time-frequency characteristics of PCMA signals. The performance of the proposed algorithm is similar to that of PSP algorithm, but the complexity of demodulation can be greatly reduced through the proposed algorithm.

KCI등재 SCI SCOPUS

7Performance Analysis of a Novel Distributed C-ARQ Scheme for IEEE 802.11 Wireless Networks

저자 : Fan Wang , Suoping Li , Zufang Dou , Shexiang Hai

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

다운로드

(기관인증 필요)

초록보기

It is well-known that the cooperative communication and error control technology can improve the network performance, but most existing cooperative MAC protocols have not focused on how to cope with the contention process caused by cooperation and how to reduce the bad influence of channel packet error rate on the system performance. Inspired by this, this paper first modifies and improves the basic rules of the IEEE 802.11 Medium Access Control (MAC) protocol to optimize the contention among the multi-relay in a cooperative ARQ scheme. Secondly, a hybrid ARQ protocol with soft combining is adopted to make full use of the effective information in the error data packet and hence improve the ability of the receiver to decode the data packet correctly. The closed expressions of network performance including throughput and average packet transmission delay in a saturated network are then analyzed and derived by establishing a dedicated two-dimensional Markov model and solving its steady-state distribution. Finally, the performance evaluation and superiority of the proposed protocol are validated in different representative study cases through MATLAB simulations.

KCI등재 SCI SCOPUS

8Adaptive Wireless Network Coding for Infrastructure Wireless Mesh Networks

저자 : Ernesto Carrillo , Victor Ramos

발행기관 : 한국인터넷정보학회 간행물 : KSII Transactions on Internet and Information Systems (TIIS) 13권 7호 발행 연도 : 2019 페이지 : pp. 3470-3493 (24 pages)

다운로드

(기관인증 필요)

초록보기

IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

KCI등재 SCI SCOPUS

9MCRO-ECP: Mutation Chemical Reaction Optimization based Energy Efficient Clustering Protocol for Wireless Sensor Networks

저자 : Ravuri Daniel , Kuda Nageswara Rao

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

다운로드

(기관인증 필요)

초록보기

Wireless sensor networks encounter energy saving as a major issue as the sensor nodes having no rechargeable batteries and also the resources are limited. Clustering of sensors play a pivotal role in energy saving of the deployed sensor nodes. However, in the cluster based wireless sensor network, the cluster heads tend to consume more energy for additional functions such as reception of data, aggregation and transmission of the received data to the base station. So, careful selection of cluster head and formation of cluster plays vital role in energy conservation and enhancement of lifetime of the wireless sensor networks. This study proposes a new mutation chemical reaction optimization (MCRO) which is an algorithm based energy efficient clustering protocol termed as MCRO-ECP, for wireless sensor networks. The proposed protocol is extensively developed with effective methods such as potential energy function and molecular structure encoding for cluster head selection and cluster formation. While developing potential functions for energy conservation, the following parameters are taken into account: neighbor node distance, base station distance, ratio of energy, intra-cluster distance, and CH node degree to make the MCRO-ECP protocol to be potential energy conserver. The proposed protocol is studied extensively and tested elaborately on NS2.35 Simulator under various senarios like varying the number of sensor nodes and CHs. A comparative study between the simulation results derived from the proposed MCRO-ECP protocol and the results of the already existing protocol, shows that MCRO-ECP protocol produces significantly better results in energy conservation, increase network life time, packets received by the BS and the convergence rate.

KCI등재 SCI SCOPUS

10ER-Fuzz:Conditional Code Removed Fuzzing

저자 : Xiaobin Song , Zehui Wu , Yan Cao , Qiang Wei

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

다운로드

(기관인증 필요)

초록보기

Coverage-guided fuzzing is an efficient solution that has been widely used in software testing. By guiding fuzzers through the coverage information, seeds that generate new paths will be retained to continually increase the coverage. However, we observed that most samples follow the same few high-frequency paths. The seeds that exercise a high-frequency path are saved for the subsequent mutation process until the user terminates the test process, which directly affects the efficiency with which the low-frequency paths are tested. In this paper, we propose a fuzzing solution, ER-Fuzz, that truncates the recording of a high-frequency path to influence coverage. It utilizes a deep learning-based classifier to locate the high and low-frequency path transfer points; then, it instruments at the transfer position to promote the probability low-frequency transfer paths while eliminating subsequent variations of the high-frequency path seeds. We implemented a prototype of ER-Fuzz based on the popular fuzzer AFL and evaluated it on several applications. The experimental results show that ER-Fuzz improves the coverage of the original AFL method to different degrees. In terms of the number of crash discoveries, in the best case, ER-Fuzz found 115% more unique crashes than did AFL. In total, seven new bugs were found and new CVEs were assigned.

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

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

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

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

다운로드

2미국의 비트코인 규제

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

다운로드

가장 많이 참고한 논문

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

가장 많이 참고한 논문

다운로드

2미국의 비트코인 규제

(2006)홍길동41회 피인용

다운로드

해당 간행물 관심 구독기관

경상대학교 통일부 단국대학교 서울대학교 고려대학교
 8
 8
 5
 3
 3
  • 1 경상대학교 (8건)
  • 2 통일부 (8건)
  • 3 단국대학교 (5건)
  • 4 서울대학교 (3건)
  • 5 고려대학교 (3건)
  • 6 성균관대학교 (3건)
  • 7 혜전대학교 (3건)
  • 8 동국대학교 (3건)
  • 9 인하대학교 (2건)
  • 10 경북대학교 (2건)

내가 찾은 최근 검색어

최근 열람 자료

맞춤 논문

보관함

내 보관함
공유한 보관함

1:1문의

닫기