• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.265-267
• /
• 2012

This paper analyzes network selection issues of secondary users (SUs) in Cooperative Cognitive Radio Networks (CRNs) by utilizing Queuing Model. Coordinating with Handover Cost-Based Network selection, this paper also addresses an opportunity for the secondary users (SUs) to enhance QoS as well as economics efficiency. In this paper, network selection of SUs is the optimal association between Overall System Time Minimization Problem evaluation of Secondary Connection (SC) and Handover Cost-Based Network selection. This will be illustrated by simulation results.

• 한국측량학회지
• /
• 제37권2호
• /
• pp.91-97
• /
• 2019

In automatic map generalization, the formalization of cartographic principles is important. This study proposes and evaluates the selection method for road network generalization that analyzes existing maps using reverse engineering and formalizes the selection rules for the road network. Existing maps with a 1:5,000 scale and a 1:25,000 scale are compared, and the criteria for selection of the road network data and the relative importance of each network object are determined and analyzed using $T{\ddot{o}}pfer^{\prime}s$ Radical Law as well as the logistic regression model. The selection model derived from the analysis result is applied to the test data, and road network data for the 1:25,000 scale map are generated from the digital topographic map on a 1:5,000 scale. The selected road network is compared with the existing road network data on the 1:25,000 scale for a qualitative and quantitative evaluation. The result indicates that more than 80% of road objects are matched to existing data.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2011년도 하계학술대회
• /
• pp.310-313
• /
• 2011

Broadcasting nature of wireless communications makes it possible to apply opportunistic network coding (OPNC) by overhearing transmitted packets from a source to sink nodes. However, it is difficult to apply network coding to the topology of multiple relay and sink nodes. We propose to use relay node selection, which finds a proper node for network coding since the OPNC alone in the topology of multiple relays and sink nodes cannot guarantee network coding gain. The proposed system is a novel combination of wireless network coding and relay selection, which is a key contribution of this paper. In this paper, with the consideration of channel state and potential network coding gain, we propose relay node selection techniques, and show performance gain over the conventional OPNC and a channel-based selection algorithm in terms of average system throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.240-259
• /
• 2020

Analyzing network traffic is the basis of dealing with network security issues. Most of the network security systems depend on the feature selection of network traffic data and the detection ability of malicious traffic in network can be improved by the correct method of feature selection. An FAFS method, which is short for Fuzzy Association Feature Selection method, is proposed in this paper for network malicious traffic detection. Association rules, which can reflect the relationship among different characteristic attributes of network traffic data, are mined by association analysis. The membership value of association rules are obtained by the calculation of fuzzy reasoning. The data features with the highest correlation intensity in network data sets are calculated by comparing the membership values in association rules. The dimension of data features are reduced and the detection ability of malicious traffic detection algorithm in network is improved by FAFS method. To verify the effect of malicious traffic feature selection by FAFS method, FAFS method is used to select data features of different dataset in this paper. Then, K-Nearest Neighbor algorithm, C4.5 Decision Tree algorithm and Naïve Bayes algorithm are used to test on the dataset above. Moreover, FAFS method is also compared with classical feature selection methods. The analysis of experimental results show that the precision and recall rate of malicious traffic detection in the network can be significantly improved by FAFS method, which provides a valuable reference for the establishment of network security system.

• 전기학회논문지
• /
• 제58권6호
• /
• pp.1238-1240
• /
• 2009

In the wireless sensor network, cooperative transmission is an effective technique to combat multi-path fading and reduce transmitted power. Relay selection and power allocation are important technical issues to determine the performance of cooperative transmission. In this paper, we proposed a new multi-relay selection and power allocation algorithm to increase network lifetime. The proposed relay selection scheme minimizes the transmitted power and increase the network lifetime by considering residual power as well as channel conditions. Simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

• ETRI Journal
• /
• 제40권5호
• /
• pp.604-612
• /
• 2018

To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권4호
• /
• pp.1817-1836
• /
• 2020

Network convergence is considered as one of the key solutions to the problem of achieving future high-capacity and reliable communications. This approach overcomes the limitations of separate wireless technologies. Efficient interface selection is one of the most important issues in convergence networks. This paper solves the problem faced by users of selecting the most appropriate interface in the heterogeneous radio-access network (RAN) environment. Our proposed scheme combines a hierarchical evaluation of networks and game theory to solve the network-selection problem. Instead, of considering a fixed weight system while ranking the networks, the proposed scheme considers the service requirements, as well as static and dynamic network attributes. The best network is selected for a particular service request. To establish a hierarchy among the network-evaluation criteria for service requests, an analytical hierarchy process (AHP) is used. To determine the optimum network selection, the network hierarchy is combined with game theory. AHP attains the network hierarchy. The weights of different access networks for a service are calculated. It is performed by combining AHP scores considering user's experienced static network attributes and dynamic radio parameters. This paper provides a strategic game. In this game, the network scores of service requests for various RANs and the user's willingness to pay for these services are used to model a network-versus-user game. The Nash equilibria signify those access networks that are chosen by individual user and result maximum payoff. The examples for the interface selection illustrate the effectiveness of the proposed scheme.

• KNOM Review
• /
• 제21권2호
• /
• pp.35-45
• /
• 2018

네트워크 슬라이싱 기능이 모바일 네트워킹에 적용되면서 네트워크 슬라이스를 선택할 수 있는 메커니즘이 필수적이다. 5G 아키텍처에 대한 3GPP 표준 기술 사양에 따라 슬라이스 선택 프로세스를 활용하기 위해 Network Slice Selection Function (NSSF)가 포함되어 있다. 이 네트워크 기능의 실제 구현은 네트워크 인스턴스의 동적 변경 사항을 처리해야하므로 가상 네트워크 기능 (VNF)의 오케스트레이션을 지원하는 플랫폼이 필요하다. 제안 된 솔루션은 Central Office Rearchitected as a Data Center (CORD) 플랫폼에서 모바일 네트워크용으로 특화된 M-CORD를 사용하고 있다. 이는 서비스 오케스트레이터인 XoS를 통합하는 플랫폼 및 Software Defined Networking (SDN), Network Function Virtualization (NFV) 및 클라우드를 관리하는 OpenStack에 기반하고 있다. 이 플랫폼을 통해, 본 논문에서 제시된 NSSF 구현은 백엔드 서비스와 네트워크 기능 인스턴스 간의 동기화를 통해서 동적으로 슬라이스 정보를 얻을 수 있는 적절한 생태계를 제공하고 있다.

• 한국통신학회논문지
• /
• 제32권6B호
• /
• pp.358-366
• /
• 2007

최근 FCC(Federal Communications Commission)에서는 통신 채널의 부족을 극복하기 위해 기존의 허가된 사용자의 무선 주파수에 대한 비 허가 사용자의 사용을 고려하고 있다. 이에 채널을 실시간으로 감지하고 선택하는 CR의 개념이 도입되어 IEEE 802.22 WRAN(Wireless Regional Area Networks) 워킹 그룹에서 CR(Cognitive Radio)의 기술개발을 진행 중에 있다. CR의 기술을 사용함에 있어서 채널을 선택하는 기준에 따라 네트워크의 통신 효율에 상당한 영향을 미치기 때문에 최적의 채널을 선택하는 방법이 중요하다. 따라서 본 논문에서는 효율적인 통신을 위해 무선인지 기술 기반의 정책에 따른 동적 채널 선택 구조(Policy-based Dynamic Channel Selection Architecture for Cognitive Radio Network)를 제안한다. 제안하는 동적 주파수 선택 방법에는 가중치 채널 선택 방법(weighted channel selection)과 순차적 채널 선택 방법(sequential channel selection)곡 혼합 채널 선택 방법(combined channel selection)의 세 가지 방법이 있으며 제안하는 방법을 사용함으로써 최적의 채널 리스트를 구성해 줄 수 있을 뿐만 아니라 동적으로 채널을 할당해 줄 수 있다.

• ETRI Journal
• /
• 제31권1호
• /
• pp.31-41
• /
• 2009

Optical burst switching is a promising switching paradigm for the next IP-over-optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider.