• Title/Summary/Keyword: network-selection

Search Result 1,786, Processing Time 0.028 seconds

Cooperative spectrum leasing using parallel communication of secondary users

  • Xie, Ping;Li, Lihua;Zhu, Junlong;Jin, Jin;Liu, Yijing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.1770-1785
    • /
    • 2013
  • In this paper, a multi-hop transmission protocol based on parallel communication of secondary users (SUs) is proposed. The primary multi-hop network coexists with a set of SUs by cooperative spectrum sharing. The main optimization target of our protocol is the overall performance of the secondary system with the guarantee of the primary outage performance. The energy consumption of the primary system is reduced by the cooperation of SUs. The aim of the primary source is to communicate with the primary destination via a number of primary relays. SUs may serve as extra decode-and-forward relays for the primary network. When an SU acts as a relay for a primary user (PU), some other SUs that satisfy the condition for parallel communication are selected to simultaneously access the primary spectrum for secondary transmissions. For the proposed protocol, two opportunistic routing strategies are proposed, and a search algorithm to select the SUs for parallel communication is described. The throughput of the SUs and the PU is illustrated. Numerical results demonstrate that the average throughput of the SUs is greatly improved, and the end-to-end throughput of the PU is slightly increased in the proposed protocol when there are more than seven SUs.

Classification of Epileptic Seizure Signals Using Wavelet Transform and Hilbert Transform (웨이블릿 변환과 힐버트 변환을 이용한 간질 파형 분류)

  • Lee, Sang-Hong
    • Journal of Digital Convergence
    • /
    • v.14 no.4
    • /
    • pp.277-283
    • /
    • 2016
  • This study proposed new methods to classify normal and epileptic seizure signals from EEG signals using peaks extracted by wavelet transform(WT) and Hilbert transform(HT) based on a neural network with weighted fuzzy membership functions(NEWFM). This study has the following three steps for extracting inputs for NEWFM. In the first step, the WT was used to remove noise from EEG signals. In the second step, the HT was used to extract peaks from the wavelet coefficients. We also selected the peaks bigger than the average of peaks to extract big peaks. In the third step, statistical methods were used to extract 16 features used as inputs for NEWFM from peaks. The proposed methodology shows that accuracy, specificity, and sensitivity are 99.25%, 99.4%, 99% with 16 features, respectively. Improvement in feature selection method in view to enhancing the accuracy is planned as the future work for selecting good features from 16 features.

Resource Allocation Based on Location Information in D2D Cellular Networks (D2D 셀룰러 네트워크에서 위치기반 자원할당)

  • Kang, Soo-Hyeong;Seo, Bang-Won;Kim, Jeong-Gon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.4
    • /
    • pp.750-757
    • /
    • 2017
  • Recently, mobile internet traffic has rapidly increased as the huge increase of the smart phone and mobile devices. D2D get attention, because D2D is known that it reduce the traffic load of the base station and also improves the reliability of the network performance. However, D2D has a problem that the efficiency decreases as interference is increased. In this paper, we propose a resource allocation scheme to use the resources efficiently when the D2D link share the cellular resources in the cellular network based the uplink. D2D communication utilizes the location information for allocating resources when the eNB know the location of all devices. The proposed scheme select some cellular user using location informations in order to ensure performance of the D2D communication. and D2D link choose cellular user that performs resource allocation using only selected cellular user. Simulation results show optimal value of resource selection in order to ensure most performance of the D2D communication.

Selection of Scalable Video Coding Layer Considering the Required Peak Signal to Noise Ratio and Amount of Received Video Data in Wireless Networks (무선 네트워크에서 요구되는 평균 최대 신호 대 잡음비와 수신 비디오 데이터양을 고려하는 스케일러블 비디오 코딩 계층 선택)

  • Lee, Hyun-No;Kim, Dong-Hoi
    • Journal of Digital Contents Society
    • /
    • v.17 no.2
    • /
    • pp.89-96
    • /
    • 2016
  • SVC(Scalable Video Coding), which is one form among video encoding technologies, makes video streaming with the various frame rate, resolution, and video quality by combining three different scalability dimensions: temporal, spatial, and video quality scalability. As the above SVC-encoded video streaming consists of one base layer and several enhancement layers, and a wireless AP(Access Point) chooses and sends a suitable layer according to the received power from the receiving terminals in the changeable wireless network environment, the receiving terminals supporting SVC are able to receive video streaming with the appropriate resolution and quality according to their received powers. In this paper, after the performance analysis for the received power, packet loss rate, PSNR(Required Peak Signal to Noise Ratio), video quality level and amount of received video data based on the number of SVC layers was performed, an efficient method for selecting the number of SVC layer satisfying the RSNR and minimizing the amount of received video data is proposed.

Development of a Simulator for the Intermediate Storage Hub Selection Modeling and Visualization of Carbon Dioxide Transport Using a Pipeline (파이프라인을 이용한 이산화탄소 수송에서 중간 저장 허브 선정 모델링 및 시각화를 위한 시뮬레이터 개발)

  • Lee, Ji-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.12
    • /
    • pp.373-382
    • /
    • 2016
  • Carbon dioxide Capture and Storage/Sequestration (CCS) technology has attracted attention as an ideal method for most carbon dioxide reduction needs. When the collected carbon dioxide is transported to storage via pipelines, the direct transport is made if the storage is close, otherwise it can also be transported via an intermediate storage hub. Determining the number and the location of the intermediate storage hubs is an important problem. A decision-making algorithm using a mathematical model for solving the problem requires considerably more variables and constraints to describe the multi-objective decision, but the computational complexity of the problem increases and it also does not guarantee the optimality. This research proposes an algorithm to determine the location and the number of the intermediate storage hub and develop a simulator for the connection network of the carbon dioxide emission site. The simulator also provides the course of transportation of the carbon dioxide. As a case study, this model is applied to Korea.

Vertical Handover Framework for Maritime Multi-band Networks (해상 멀티대역 네트워크를 위한 수직 핸드오버 프레임워크 설계)

  • Cho, A-Ra;Yun, Changho;Park, Jong-Won;Lim, Yong-Kon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.12
    • /
    • pp.2847-2856
    • /
    • 2014
  • It is necessary for maritime multi-band networks, which provide ships with diverse and seamless multimedia services, to perform vertical handover. As IEEE 802.21 WG has standardized vertical handover technologies for terrestrial wireless networks that do not consider VHF, HF, satellite networks, they cannot be directly applied to maritime multi-band networks. In this paper, the vertical handover framework for use in maritime mutlti-band networks is proposed, which includes the logical architecture, the communication reference model, re-defined handover primitives, and the handover process. The proposed vertical handover for maritime multi-band network can be applied in the ocean alone, as well as to the heterogeneous wireless networks which embrace both terrestrial and maritime networks.

A Study on the Link Cost Estimation for Data Reliability in Wireless Sensor Network (무선 센서 네트워크에서 데이터 신뢰성을 위한 링크 비용 산출 방안에 관한 연구)

  • Lee, Dae-hee;Cho, Kyoung-woo;Kang, Chul-gyu;Oh, Chang-heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.571-573
    • /
    • 2018
  • Wireless sensor networks have unbalanced energy consumption due to the convergence structure in which data is concentrated to sink nodes. To solve this problem, in the previous research, the relay node was placed between the source node and the sink node to merge the data before being concentrated to the sink node. However, selecting a relay node that does not consider the link quality causes packet loss according to the link quality of the reconfigured routing path. Therefore, in this paper, we propose a link cost calculation method for data reliability in routing path reconfiguration for relay node selection. We propose a link cost estimation formula considering the number of hops and RSSI as the routing metric value and select the RSSI threshold value through the packet transmission experiment between the sensor modules.

  • PDF

Multihop Connection Establishment Algorithms in Wavelength-Routed Optical Networks (파장분할다중화방식 전광통신망에서 다중홉 연결 알고리즘)

  • 김상완;서승우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.7A
    • /
    • pp.951-958
    • /
    • 2000
  • In wavelength-routed all-optical networks, signals are transmitted on a direct optical path, or a lightpath, in a single-hop manner without opto-electronic/electro-optic(OE/EO) conversion at intermediate nodes. However, due to the physical constraints of optical elements such as ASE noise and crosstalk signals can be degraded un a long path. To establish a connection under such impairments, the optical signal may need to be regenerated at intermediate nodes, dividing a lightpath into two or more fragments. However, since signal regeneration at intermediate nodes requires additional network resources, the selection of these nodes should be made carefully to minimize blocking of other lightpaths. In this paper, we deal with the problem of establishing a lightpath in a multihop manner under physical constraints. We provide both minimal-cost and heuristic algorithms for locating signal regeneration nodes(SRNs). For a minimal-cost algorithm, we formulate the problem using dynamic programming(DP) such that blocking of other lightpaths due to the lack of transmitters/receivers(TXs/RXs) and wavelengths is minimized throughout the network.

  • PDF

An Adaptive Peer-to-Peer Search Algorithm for Reformed Node Distribution Rate (개선된 노드 분산율을 위한 적응적 P2P 검색 알고리즘)

  • Kim, Boon-Hee;Lee, Jun-Yeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.93-102
    • /
    • 2005
  • Excessive traffic of P2P applications in the limited communication environment is considered as a network bandwidth problem. Moreover, Though P2P systems search a resource in the phase of search using weakly connected systems(peers' connection to P2P overlay network is very weakly connected), it is not guaranteed to download the very peer's resource in the phase of download. In previous P2P search algorithm (1), we had adopted the heuristic peer selection method based on Random Walks to resolve this problems. In this paper, we suggested an adaptive P2P search algorithm based on the previous algorithm(1) to reform the node distribution rate which is affected in unit peer ability. Also, we have adapted the discriminative replication method based on a query ratio to reduce traffic amount additionally. In the performance estimation result of this suggested system, our system works on a appropriate point of compromise in due consideration of the direction of searching and distribution of traffic occurrence.

  • PDF

Route Selection in the Network of Public Transportation using the GA and the GIS (유전자 알고리즘과 GIS를 이용한 대중교통 경로선택에 관한 연구)

  • 전철민
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.21 no.4
    • /
    • pp.323-330
    • /
    • 2003
  • GIS-based applications for route guidance are increasingly developed recently, but most of them are for self$.$driven cars. Although some of them are intended for public transportation, they show limitations in dealing with time constraints problems taken place in transfer areas. Developing a public transportation guidance system requires the fallowing aspects: (i) people may change transportation means not only within the same type but also among different modes such as between buses and subways, and (ii) the system should take into account the time taken in transfer from one mode to the other. This study suggests the framework for developing a public transportation guidance system that generates optimized paths in the transportation network of mixed means including buses, subways and other modes. For this study, the Genetic Algorithms are used to find the best routes that take into account transfer time and other service-time constraints. The method for constructing the data structure in the GIS was also suggested.