• Title/Summary/Keyword: channel scheduling

Search Result 337, Processing Time 0.025 seconds

Packet Scheduling Scheme to Enhance Throughput at IEEE 802.11e WLAN System (IEEE 802.11e 무선 LAN 시스템에서 서비스 처리율 증대를 위한 패킷 스케줄링 기법)

  • Jang Jae-Shin;Jeon Hyung-Ik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4A
    • /
    • pp.412-420
    • /
    • 2006
  • With the appearance of various types of traffic services in communication networks, a study on QoS(Quality of Service) packet scheduling mechanisms which can support differentiated service to each traffic service becomes very important. To meet this requirement, IEEE 802.11 Working Group established the IEEE 802.11e MAC protocol which categorizes every traffic services into 4 access categories(AC) and provides the differentiated service to each AC. In addition, the physical layer of IEEE 802.11a/g standards provide up to 54 Mbps transmission rate per one wireless LAN terminal. However, since the radio resource is hardly limited in wireless channel, it is necessary to find an efficient packet scheduling scheme to maximize the transmission efficiency. Therefore, in this paper, we proposed a new packet scheduling scheme that can enhance the total throughput by setting different contention windows(CW) of CSMA-CA channel access scheme to each wireless LAN terminal according its current channel states. Numerical results derived from using NS-2 network simulator have shown that our proposed packet scheduling scheme can enhance the performance of IEEE 802.11e more and more.

Performance Analysis of Reservation-based Multicast Scheduling Algorithm (예약기반 멀티캐스트 스케줄링 알고리즘의 성능분석)

  • 김도규
    • The Journal of Information Technology
    • /
    • v.4 no.4
    • /
    • pp.65-72
    • /
    • 2001
  • This paper investigates the Performance of MSA l (group partition based reservation scheduling algorithm) and MSA ll (group based reservation scheduling algorithm) for multicast service in single-hop WDM networks. Simulation results show that MSA l produces lower mean packet delay than MSA ll when the channel resource is sufficient. However, when the channel resource is limited, MSA ll produces lower mean packet delay than MSA I when traffic load is heavy.

  • PDF

Survey on Physical Layer Security in Downlink Networks

  • Abbas, Mohammed Adil;Hong, Jun-Pyo
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.1
    • /
    • pp.14-20
    • /
    • 2017
  • In this paper, we discuss physical layer security techniques in downlink networks, including eavesdroppers. The main objective of using physical layer security is delivering a perfectly secure message from a transmitter to an intended receiver in the presence of passive or active eavesdroppers who are trying to wiretap the information or disturb the network stability. In downlink networks, based on the random feature of channels to terminals, opportunistic user scheduling can be exploited as an additional tool for enhancing physical layer security. We introduce user scheduling strategies and discuss the corresponding performances according to different levels of channel state information (CSI) at the base station (BS). We show that the availability of CSI of eavesdroppers significantly affects not only the beamforming strategy but also the user scheduling. Eventually, we provide intuitive information on the effect of CSI on the secrecy performance by considering three scenarios: perfect, imperfect, and absence of eavesdropper's CSI at the BS.

Novel Beamforming and User Scheduling Algorithm for Inter-cell Interference Cancellation

  • Kim, Kyunghoon;Piao, Jinhua;Choi, Seungwon
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.5
    • /
    • pp.346-348
    • /
    • 2016
  • Coordinated multi-point transmission is a candidate technique for next-generation cellular communications systems. We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information, which mitigates inter-cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method that considers both ICI and intra-cell orthogonality. Due to the influence of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method, by an average of 0.55bps/Hz for different numbers of total users per cell.

Novel Beamforming and Scheduling Method for Interference Mitigation at Cell Edge (셀 경계 지역 간섭 완화를 위한 효율적 빔포밍 및 스케쥴링 방법)

  • Kim, Kyung Hoon;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.129-133
    • /
    • 2012
  • Coordinated multi-point transmission (CoMP) is a candidate technique for next generation cellular communications systems. One of the primary elements discussed in LTE-Advanced technology is CoMP, which can improve cell edge user data rate as well as spectral efficiency due to multiple input multiple output - orthogonal frequency division multiplex (MIMO-OFDM). We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information (CSI), which mitigates inter cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method by an average of 0.55bps/Hz in different number of total users per cell. It also outperforms the conventional method by approximately 0.38bps/Hz using different SNRs.

Reducing Feedback Overhead in Opportunistic Scheduling of Wireless Networks Exploiting Overhearing

  • Baek, Seung-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.593-609
    • /
    • 2012
  • We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in wireless access networks. We study the case where CSI is partially overheard by mobiles and thus one can suppress transmitting CSI reports for time varying channels of inferior quality. We model the mechanism of feedback suppression as a Bayesian network, and show that the problem of minimizing the average feedback overhead is NP-hard. To deal with hardness of the problem we identify a class of feedback suppression structures which allow efficient computation of the cost. Leveraging such structures we propose an algorithm which not only captures the essence of seemingly complex overhearing relations among mobiles, but also provides a simple estimate of the cost incurred by a suppression structure. Simulation results are provided to demonstrate the improvements offered by the proposed scheme, e.g., a savings of 63-83% depending on the network size.

Cross-Layer Resource Allocation with Multipath Routing in Wireless Multihop and Multichannel Systems

  • Shin, Bong-Jhin;Choe, Jin-Woo;Kang, Byoung-Ik;Hong, Dae-Hyoung;Park, Young-Suk
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.221-231
    • /
    • 2011
  • A joint multipath routing algorithm and channel allocation and scheduling for wireless multihop and multichannel systems is discussed. In packet transmission, distribution of packets to multiroutes makes it possible to reduce the transmission cost of the channels. Cross-layer cooperation of routing, channel allocation, and scheduling is an effective method of packet distribution. As a framework for the cooperation, we propose a multiroute distance vector routing (MDVR) scheme. In the MDVR scheme, the routing table is logically placed in between the routing and link layers, and the table plays the role of a service access point between these two layers. To evaluate the performance of MDVR, simulation is performed in a multichannel, multihop environment. The simulation results show that the MDVR framework can be efficiently implemented in the form of a distributed routing algorithm. It is also shown that in MDVR, the system-wise channel efficiency is almost 25% higher than that in a conventional single-route routing approach.

Dynamic Feedback Selection Scheme for User Scheduling in Multi-user MIMO Systems (다중 사용자 MIMO 시스템의 사용자 스케쥴링을 위한 동적 피드백 선택 기법)

  • Kim, I-Cheon;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.4
    • /
    • pp.646-652
    • /
    • 2015
  • In this paper, the system-level performance is evaluated for the feedback scheme on the pre-coding matrix index (PMI) and channel quality indication (CQI), which are required for user selection in the multi-user MIMO system. Our analysis demonstrates that the number of users, the number of selected users, and codebook size are the key factors that govern the performance of the best companion grouping (BCG)-based user scheduling. Accordingly, we have confirmed that the probability of forming the co-scheduled user group is determined by these factors, which implies that the number of PMI's and codebook size can be dynamically determined so as to maximize the average system throughput as the number of users varies in the cell.

Fairness Scheduling Algorithm Using Adaptive Channel Assignment Based on SIR in HSDPA System (HSDPA시스템에서 수신 SIR기반의 유연한 채널 할당 방식의 공평한 스케줄링 기법에 관한 연구)

  • Lee, Seung-Hwan;Kim, Sung-Won;Park, Yong-Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9A
    • /
    • pp.878-887
    • /
    • 2007
  • In this paper, a fairness scheme is proposed that assigns different number of HS-PDSCH to the service user according to the received SIR of CPICH. Assigned channel number is determined by the SIR level. The highest SIR user gets the number of channels based on the SIR table and the remained channels are assigned to the other SIR users. This scheme can serve the similar maximum service throughput and higher fairness than MAX CIR packet scheduling algorithm. This scheme can also serve the higher service throughput than Proportional Fairness scheme.

A combination of periodic and on-demand scheduling for data broadcasting in mobile convergence networks (모바일 융합망에서 주기적방법과 on-demand 방법을 결합한 데이터 방송 스케줄링 기법)

  • Kang, Sang-Hyuk;Ahn, Hee-June
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.189-196
    • /
    • 2009
  • We propose a hybrid broadcast scheduling based on a combination of periodic and on-demand data scheduling methods for mobile data broadcasting in convergence networks from communication and broadcasting. We consider an environment in which the forward channel is for data broadcasting and the reverse channel is for sending data requests via cellular phones, WLAN, WiBro, etc. Collecting statistics of requests from clients, the server partitions the data items into hot-item and cold-item sets. Hot items are sent based on a push-based scheduling. An on-demand scheduling method is applied to cold items. Performance evaluation from simulations shows that our proposed scheduling algorithm yields small response time with high successful response ratio.