• Annual Conference of KIPS
• /
• 2012.11a
• /
• pp.818-821
• /
• 2012

M2M 서비스 지원을 위한 이동통신 인프라 기술은 3GPP에서 MTC(Machine Typer Communications)라 부른다. 최근 3GPP SA1, SA2 에서는 MTC 디바이스와 MTC 서버 통신 모델 기반의 서비스 모델 및 지원에 관한 네트워크 구조 기술표준이 추진되었다. 이 후 후속 작업으로 3GPP SA1에서는 TR 22.888(MTCe: Study on Enhancements for MTC) 문서를 통해 MTC 디바이스 간 통신 시나리오 및 use case 개발이 추진 중이다. TR 22.888 문서에는 MTC 디바이스 간 통신 접속 시나리오 및 use case를 정의하고 이에 대한 3GPP 네트워크 요구사항을 개발하고 있다. 현재 TR 22.888v0.7 에서는 5가지의 MTC 디바이스 간 통신 시나리오가 개발되었다. 각 시나리오는 MTC 디바이스가 접속을 원하는 원격 MTC 디바이스와 연결 설정 과정에서 직접연결, MTC 서버를 통한 연결, 네트워크/MTC 서버 내에 이름 분석 기능(name resolution function) 지원을 통한 연결, 그룹 통신 내 MTC 디바이스 간 연결, 네트워크 코디네이션(network Coordination) 지원을 통한 연결 등으로 구분된다. 본 논문에서는 이와 같은 M2M에서 디바이스간 직접 통신에 관한 시나리오 및 usecase를 분석한다.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.414-426
• /
• 2021

In the task of data routing in Internet of Things enabled volatile underwater environments, providing better transmission and maximizing network communication performance are always challenging. Many network issues such as void holes and network isolation occur because of long routing distances between nodes. Void holes usually occur around the sink because nodes die early due to the high energy consumed to forward packets sent and received from other nodes. These void holes are a major challenge for I-UWSANs and cause high end-to-end delay, data packet loss, and energy consumption. They also affect the data delivery ratio. Hence, this paper presents an energy efficient watchman based flooding algorithm to address void holes. First, the proposed technique is formally verified by the Z-Eves toolbox to ensure its validity and correctness. Second, simulation is used to evaluate the energy consumption, packet loss, packet delivery ratio, and throughput of the network. The results are compared with well-known algorithms like energy-aware scalable reliable and void-hole mitigation routing and angle based flooding. The extensive results show that the proposed algorithm performs better than the benchmark techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2400-2413
• /
• 2019

Doubly-selective (DS) fading channel is often occurred in many orthogonal frequency division multiplexing (OFDM) communication systems, such as high-speed rail communication systems and underwater acoustic (UWA) wireless networks. It is challenging to provide an accurate and fast estimation over the doubly-selective channel, due to the strong Doppler shift. This paper addresses the doubly selective channel estimation problem based on complex exponential basis expansion model (CE-BEM) in OFDM systems from the perspective of distributed compressive sensing (DCS). We propose a novel DCS-based improved sparsity adaptive matching pursuit (DCS-IMSAMP) algorithm. The advantage of the proposed algorithm is that it can exploit the joint channel sparsity information using dynamic threshold, variable step size and tailoring mechanism. Simulation results show that the proposed algorithm achieves 5dB performance gain with faster operation speed, in comparison with traditional DCS-based sparsity adaptive matching pursuit (DCS-SAMP) algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.260-263
• /
• 2019

Recently, the need of researches and developments about WSN(Wireless Sensor Network) technologies, which can be applied to services to regions where the access is difficult or services that require continuous monitoring, has gradually increased due to its expansion and efficiency of the application areas. In this paper, we analyze existing researches which focused on reducing packet loss rate and increasing lifetime of sensor nodes. Then, we conduct studies about performance improvement factors where some schemes - clustering and location-based approaches - are applied and compare our study results with existing researches. Based on our studies, we are planning to conduct researches about a new scheme that could contribute to improve WSN's performance in terms of packet loss rate and network lifetime.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.103-109
• /
• 2019

Due to the development of ICT technology, the IoT environment for connecting objects in the vicinity to networks and utilizing information about objects in various fields is getting attention, and security threats are also increasing. In order to solve the increasing security problem in IoT environment, we are studying methods that use certificate, encryption, hash calculation and block chain in the private sector. However, the security authentication method which overcomes the performance gap between devices and has compatibility with various devices It has not been proposed yet. In this paper, we propose an authentication method that can achieve wide compatibility by minimizing the influence of IoT device environment.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.4
• /
• pp.611-616
• /
• 2021

This paper investigates the improved outage probability of correlated superposition coding(CSC)/non-successive interference cancellation(SIC) non-orthogonal multiple access(NOMA) scheme. For this, first, we calculate the outage probability of the conventional independent superposition coding(ISC)/SIC NOMA scheme. Then, simulations demonstrate that the outage probability of CSC/non-SIC NOMA improves greatly, with respect to that of conventional ISC/SIC NOMA. As a result, CSC/non-SIC NOMA schemes could be a promising technique in 5G networks, especially with such improved outage probability.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.73-78
• /
• 2019

This paper proposes polynomial-time rule for maximum weighted independent set(MWIS) problem that is well known NP-hard. The well known distributed algorithm selects the maximum weighted node as a element of independent set in a local. But the merged independent nodes with less weighted nodes have more weights than maximum weighted node are frequently occur. In this case, existing algorithm fails to get the optimal solution. To deal with these problems, this paper constructs maximum weighted independent set in local area. Application result of proposed algorithm to various networks, this algorithm can be get the optimal solution that fail to existing algorithm.

• International journal of advanced smart convergence
• /
• v.9 no.4
• /
• pp.34-41
• /
• 2020

Nowadays, the advanced smart convergences of the artificial intelligence (AI) and the internet of things (IoT) have been more and more important, in the fifth generation (5G) and beyond 5G (B5G) mobile communication. In 5G and B5G mobile networks, non-orthogonal multiple access (NOMA) has been extensively investigated as one of the most promising multiple access (MA) technologies. In this paper, we investigate the achievable data rate for the asymmetric binary pulse amplitude modulation (2PAM), in non-orthogonal multiple access (NOMA). First, we derive the closed-form expression for the achievable data rate of the asymmetric 2PAM NOMA. Then it is shown that the achievable data rate of the asymmetric 2PAM NOMA reduces for the stronger channel user over the entire range of power allocation, whereas the achievable data rate of the asymmetric 2PAM NOMA increases for the weaker channel user improves over the power allocation range less than 50%. We also show that the sum rate of the asymmetric 2PAM NOMA is larger than that of the conventional standard 2PAM NOMA, over the power allocation range larger than 25%. In result, the asymmetric 2PAM could be a promising modulation scheme for NOMA of 5G systems, with the proper power allocation.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1011-1016
• /
• 2020

Rapid change in network topology in high-speed VANET(: Vehicular Ad Hoc Network) is an important task for routing protocol design. Selecting the next hop relay node that affects the performance of the routing protocol is a difficult process. The disadvantages of AODV(: Ad Hoc On-Demand Distance Vector) related to VANET are end-to-end delay and packet loss. This paper proposes the AAODV (Advanced AODV) technique to reduce the number of RREQ (: Route Request) and RREP (: Route Reply) messages by modifying the AODV routing protocol and adding direction parameters and 2-step filtering. It can be seen that the proposed AAODV reduces packet loss and minimizes the effect of direction parameters, thereby increasing packet delivery rate and reducing end-to-end delay.