• Title/Summary/Keyword: channel management algorithm

Search Result 134, Processing Time 0.025 seconds

Dynamic Contention Window Control Algorithm Using Genetic Algorithm in IEEE 802.11 Wireless LAN Systems for Logistics Information Systems (물류 정보시스템을 위한 IEEE 802.11 무선랜 시스템에서 유전자 알고리듬을 이용한 Dynamic Contention Window 제어 알고리듬)

  • Lee, Sang-Heon;Choi, Woo-Yong;Lee, Sang-Wan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.3
    • /
    • pp.10-19
    • /
    • 2009
  • Wireless LAN systems have been widely implemented for supporting the wireless internet services especially in the hotspot areas such as hospitals, homes, conference rooms, and so on. Compared with wired LAN systems, wireless LAN systems have the advantages of the users' mobility support and low implementation and maintenance costs. IEEE 802.11 wireless LAN systems employ the backoff algorithm to avoid contentions among STAs when two or more STAs attempt to transmit their data frames simultaneously. The MAC efficiency can be improved if the CW values are adaptively changed according to the channel state of IEEE 802.11 wireless LANs. In this paper, a dynamic contention window control algorithm is proposed using the genetic algorithm to improve the MAC throughput of IEEE 802.11 wireless LANs.

A Channel Management Technique using Neural Networks in Wireless Networks (신경망를 이용한 무선망에서의 채널 관리 기법)

  • Ro Cheul-Woo;Kim Kyung-Min;Lee Kwang-Eui;Kim Kwang-Baek
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.115-119
    • /
    • 2006
  • The channel is one of the precious and limited resources in wireless networks. There are many researches on the channel management. Recently, the optimization problem of guard channels has been an important issue. In this paper, we propose an intelligent channel management technique based on the neural networks. An SRN channel alteration model is developed to generate the learning data for the neural networks and the performance analysis of system. In the proposed technique, the neural network is trained to generate optimal guard channel number g, using backpropagation supervised learning algorithm. The optimal g is computed using the neural network and compared to the g computed by the SRN model. The numerical results show that the difference between the value of g by backpropagation and that value by SRN model is ignorable.

  • PDF

Power Efficient Precoding by Reducing the Effect of the Largest Singular Value of channel Inverse Matrix (채널 역변환 매트릭스의 가장 큰 싱귤러 값 영향을 줄이는 다중 사용자 프리코딩)

  • Ro, Se Yong;Yang, Hyun Wook;Chong, Jong Wha
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.115-120
    • /
    • 2012
  • In multi-user multi-input multi-output (MU-MIMO) system, zero forcing beamforming (ZFB) is regarded as a realistic solution for transmitting scheme due to its low complexity and simple structure. However, ZFB shows a significant performance degradation when channel matrix has large condition number. In this case, the largest singular value of the channel inversion matrix has a dominant effect on transmit power. In this paper, we propose a perturbation method for reducing an effect of the dominant singular value. In the proposed algorithm, channel inverse matrix is first decomposed by SVD for the transmit signal to be expressed as a combination of singular vectors. Then, the transmit signal is perturbed to reduce the coefficient of the singular vector corresponding to the largest singular value. When a number of transmit antennas is 4, the simulation results of this paper shows that the proposed method shows 8dB performance enhancement at 10-3 uncoded bit error rate (BER) compared with conventional ZFB. Also, the simulation results show that the proposed method provides a comparable performance to Tomlinson-Harashima Precoding (THP) with much lower complexity.

SARAPAN-A Simulated-Annealing-Based Tool to Generate Random Patterned-Channel-Age in CANDU Fuel Management Analyses

  • Kastanya, Doddy
    • Nuclear Engineering and Technology
    • /
    • v.49 no.1
    • /
    • pp.267-276
    • /
    • 2017
  • In any reactor physics analysis, the instantaneous power distribution in the core can be calculated when the actual bundle-wise burnup distribution is known. Considering the fact that CANDU (Canada Deuterium Uranium) utilizes on-power refueling to compensate for the reduction of reactivity due to fuel burnup, in the CANDU fuel management analysis, snapshots of power and burnup distributions can be obtained by simulating and tracking the reactor operation over an extended period using various tools such as the $^*SIMULATE$ module of the Reactor Fueling Simulation Program (RFSP) code. However, for some studies, such as an evaluation of a conceptual design of a next-generation CANDU reactor, the preferred approach to obtain a snapshot of the power distribution in the core is based on the patterned-channel-age model implemented in the $^*INSTANTAN$ module of the RFSP code. The objective of this approach is to obtain a representative snapshot of core conditions quickly. At present, such patterns could be generated by using a program called RANDIS, which is implemented within the $^*INSTANTAN$ module. In this work, we present an alternative approach to derive the patterned-channel-age model where a simulated-annealing-based algorithm is used to find such patterns, which produce reasonable power distributions.

An Intelligent Handover Scheme for the Next Generation Personal Communication Systems

  • Ming-Hui;Kuang, Eric-Hsiao;Chao-Hsu
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.245-257
    • /
    • 2004
  • Driven by the growing number of the mobile subscribers, efficient channel resource management plays a key role for provisioning multimedia service in the next generation personal communication systems. To reuse limited channel resources, diminishing the coverage areas of cells seems to be the ultimate solution. Thus, however, causes more handover events. To provide seamless connection environment for mobile terminals and applications, this article presents a novel handover scheme called the intelligent channel reservation (ICR) scheme, which exploits the location prediction technologies to accurately reserve channel resources for handover connections. Considering the fact that each mobile terminal has its individual mobility characteristic, the ICR scheme utilizes a channel reserving notification procedure (CRNP) to collect adequate parameters for predicting the future location of individual mobile terminals. These parameters will be utilized by the handover prediction function to estimate the expected handover blocking rate and the expected number of idle channels. Based on the handover prediction estimations, a cost function for calculating the damages from blocking the handover connections and idling channel resources, and a corresponding algorithm for minimizing the cost function are proposed. In addition, a guard channel decision maker (GCDM) determines the appropriate number of guard channels. The experimental results show that the ICR scheme does reduce the handover-blocking rate while keeping the number of idle channels small.

A improved back-off algorithm using the gaussian model in the vehicular networks (차량 간 통신에서 가우시안 모델을 적용한 개선된 백오프 알고리즘)

  • Oh, Sang-Yeob
    • Journal of Digital Convergence
    • /
    • v.10 no.6
    • /
    • pp.225-230
    • /
    • 2012
  • When a car accident happened, the accident vehicle should broadcast a safe message to its neighbors in multi-hop. However, the pure flooding is difficult to protect a chain-reaction collision because of the frequent collision and the communication delay. To solve this problem, we proposes a back-off algorithm applied to the estimation of the neighbor node count using the t-distribution. And we proposes a MAC protocol preventing the communication delay by separating the neighbor's count collection channel and data channel. As a result, we show the frame reception success rate of our protocol improved more 10% than the previous protocol.

A Cluster-Based Channel Assignment Algorithm for IEEE 802.11b/g Wireless Mesh Networks (IEEE 802.11b/g 무선 메쉬 네트워크를 위한 클러스터 기반 채널 할당 알고리즘)

  • Cha, Si-Ho;Ryu, Min-Woo;Cho, Kuk-Hyun;Jo, Min-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.87-93
    • /
    • 2009
  • Wireless mesh networks (WMNs) are emerging technologies that provide ubiquitous environments and wireless broadband access. The aggregate capacity of WMNs can be improved by minimizing the effect of channel interference. The IEEE 802.11b/g standard which is mainly used for the network interface technology in WMNs provides 3 multiple channels. We must consider the channel scanning delay and the channel dependency problem to effectively assign channels in like these multi-channel WMNs. This paper proposes a cluster-based channel assignment (CB-CA) algorithm for multi-channel WMNs to solve such problems. The CB-CA does not perform the channel scanning and the channel switching through assigning co-channel to the inter-cluster head (CH) links. In the CB-CA, the communication between the CH and cluster member (CM) nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-CA can minimize the interference within multi-channel environments. Our simulation results show that CB-CA can improve the performance of WMNs.

Packet Scheduling in Interactive Satellite Return Channels for Mobile Multimedia Services Using Hybrid CDMA/TDMA

  • Lee Ki-Dong;Kim Ho-Kyom;Lee Ho-Jin
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.744-748
    • /
    • 2003
  • Developing an interactive satellite multi­media system, such as a digital video broadcasting (DVB) return channel via satellite (RCS) system, is gaining popularity over the world To accommodate the increasing traffic demand we are motivated to investigate an alternative for improving return channel utilization We develop an efficient method for optimal packet scheduling in an interactive satellite multimedia system using hybrid CDMA/TDMA channels. We formulate the timeslot-code assignment problem as a binary integer programming (BIP) problem, where the throughput maximization is the objective, and decompose this BIP problem into two sub-problems for the purpose of solution efficiency. With this decomposition, we promote the computational efficiency in finding the optimal solution of the original BIP problem Since 2001, ETRI has been involved in a development project where we have successfully completed an initial system integration test on broadband mobile Internet access via Ku-band channels using the proposed resource allocation algorithm.

  • PDF

Design of Mutual Authentication and Grouping Protocol Based On Network Control Server Applicable to General Purpose (범용적으로 적용 가능한 네트워크제어서버 기반의 상호인증 및 그룹핑 프로토콜 설계)

  • Park, Jungoh
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.4
    • /
    • pp.13-23
    • /
    • 2017
  • In order to protect personal information and important information (confidential information, sales information, user information, etc.) in the internal network, companies and organizations apply encryption to the Server-To-Server or Server-To-Client communication section, And are experiencing difficulties due to the increasing number of known attacks and intelligent security attacks. In order to apply the existing S / W encryption technology, it is necessary to modify the application. In the financial sector, "Comprehensive Measures to Prevent the Recurrence of Personal Information Leakage in the Domestic Financial Sector" has been issued, and standard guidelines for financial computing security have been laid out, and it is required to expand the whole area of encryption to the internal network. In addition, even in environments such as U-Health and Smart Grid, which are based on the Internet of Things (IoT) environment, which is increasingly used, security requirements for each collection gateway and secure transmission of the transmitted and received data The requirements of the secure channel for the use of the standard are specified in the standard. Therefore, in this paper, we propose a secure encryption algorithm through mutual authentication and grouping for each node through H / W based Network Control Server (NCS) applicable to internal system and IoT environment provided by enterprises and organizations. We propose a protocol design that can set the channel.

Design of serializability Algorithm for Concurrency Control of Multi Transaction in Database (데이터베이스에서 다중 트랜잭션의 동시성 제어를 위한 직렬성 알고리즘 설계)

  • 김홍진;오상엽;김영선
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.2
    • /
    • pp.1-7
    • /
    • 2001
  • The database development is in need or transaction management composed of operations about data, efficiency database management and security of information data in necessity of as well as the new thinking about data security. When users approach data, transaction concurrency is controlled by the users security authentication and security level of data. So, existing secure algorithm occurred the problems which don't satisfy serializability of high level transaction which is delayed high level transaction repeatedly by the low level transaction, because existing secure algorithm is focused on the part which removes the security channel. Therefore this proposed algorithm which prevents waste of resource from the high level transaction reexecution and delay by stopping serializability offense problem by the increase of efficiency of concurrency control.