• Title/Summary/Keyword: channel scheduling

Search Result 337, Processing Time 0.026 seconds

MIMO-aided Efficient Communication Resource Scheduling Scheme in VDES

  • Sung, Juhyoung;Cho, Sungyoon;Jeon, Wongi;Park, Kyungwon;Ahn, Sang Jung;Kwon, Kiwon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2736-2750
    • /
    • 2022
  • As demands for the maritime communications increase, a variety of functions and information are required to exchange via elements of maritime systems, which leads communication traffic increases in maritime frequency bands, especially in VHF (Very High Frequency) band. Thus, effective resource management is crucial to the future maritime communication systems not only to the typical terrestrial communication systems. VHF data exchange system (VDES) enables to utilize more flexible configuration according to the communication condition. This paper focuses on the VDES communication system among VDES terminals such as shore stations, ship stations and aids to navigation (AtoN) to address efficient resource allocation. We propose a resource management method considering a MIMO (Multiple Input Multiple Output) technique in VDES, which has been widely used for modern terrestrial wireless networks but not for marine environments by scheduling the essential communication resources. We introduce the general channel model in marine environment and give two metrics, spectral and the energy efficiencies to examine our resource scheduling algorithm. Based on the simulation results and analysis, the proposed method provides a possibility to enhance spectral and energy efficiencies. Additionally, we present a trade-off relationship between spectral and energy efficiencies. Furthermore, we examine the resource efficiencies related to the imperfect channel estimation.

A Study on the Intermediate Channel Assignment based on Channel Status in High-rate WPAN (HR-WPAN에서 채널 상태에 따른 우회 채널 할당에 관한 연구)

  • Lee Jung-Yun;Lee Kyung-Jin;Song Wang-Cheol
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.11a
    • /
    • pp.354-358
    • /
    • 2005
  • High-rate WPAN doesn't define the time slot assignment scheduling method of CAT So, there has been many studies regarding time slot assignment scheduling of CAT. However, present studies involve demerits about not applying various types of errors in air interface or having a starvation of a specific DEV. In this paper, we propose algorithms about supplying the intermediate channel assignment in order to avoid these demerits.

  • PDF

Joint Scheduling and Rate Optimization in Multi-channel Multi-radio Wireless Networks with Contention-based MAC

  • Bui, Dang Quang;Choi, Myeong-Gil;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.12
    • /
    • pp.1716-1721
    • /
    • 2008
  • Currently, Wireless Networks have some nice characteristics such as multi-hop, multi-channel, multi-radio, etc but these kinds of resources are not fully used. The most difficulty to solve this issue is to solve mixed integer optimization. This paper proposes a method to solve a class of mixed integer optimization for wireless networks by using AMPL modeling language with CPLEX solver. The result of method is scheduling and congestion control in multi-channel multi-radio wireless networks.

  • PDF

Cross-layer Design of Joint Routing and Scheduling for Maximizing Network Capacity of IEEE 802.11s based Multi-Channel SmartGrid NAN Networks (IEEE 802.11s 를 사용한 스마트그리드 NAN 네트워크의 최대 전송 성능을 위한 다중 채널 스케쥴링과 라우팅의 결합 설계)

  • Min, Seok Hong;Kim, Bong Gyu;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.5
    • /
    • pp.25-36
    • /
    • 2016
  • The goal of the SmartGrid is to maximize energy efficiency by exchanging bi-directional real-time power information with the help of ICT(Information and Communication Technology). In this paper, we propose a "JRS-MS" (Joint Routing and Scheduling for Multi-channel SmartGrid) algorithm that uses numerical modeling methods in IEEE 802.11s based STDMA multi-channel SmartGrid NAN networks. The proposed algorithm controls the amount of data transmission adaptively at the link layer and finds a high data-rate path which has the least interference between traffic flows in multi-channel SmartGrid NAN networks. The proposed algorithm improve transmission performance by enhancing network utilization. By comparing the results of performance analysis between the proposed algorithm and the JRS-SG algorithm in the previous paper, we showed that the JRS-MS algorithm can improve transmission performance by maximally utilizing given network resources when the number of flows are increasing in the multi-hop NAN wireless mesh networks.

Multi-Parameter Based Scheduling for Multi-user MIMO Systems

  • Chanthirasekaran, K.;Bhagyaveni, M.A.;Parvathy, L. Rama
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.6
    • /
    • pp.2406-2412
    • /
    • 2015
  • Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

Worst-case Guaranteed Scheduling Algorithm for HR-WPAN (HR-WPAN을 위한 Worst-case Guaranteed Scheduling Algorithm)

  • Kim, Je-Min;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5B
    • /
    • pp.270-276
    • /
    • 2007
  • The proposed LDS(Link-status Dependent Scheduling) algorithm in HR-WPAN(High Rate-Wireless Personal Area Network) up to now aims at doing only throughput elevation of the whole network, when the crucial device is connected with worst-link relatively, throughput of this device becomes aggravation. The proposed the WGS(Worst-case Guaranteed Scheduling) algorithm in this paper guarantees throughput of the device which is connected with worst-link in a certain degree as maintaining throughput of all devices identically even if a link-status changes, decreases delay of the whole network more than current LDS algorithm. Therefore proposed WGS algorithm in this paper will be useful in case of guaranteeing throughput of a device which is connected worst-link in a certain degree in a design of HR-WPAN hereafter.

Multi-Channel Allocation Scheme for Multi-Hop Transmission in Ad-hoc Cognitive Radio Networks (애드혹 인지 무선네트워크에서 멀티 홉 전송을 위한 멀티채널할당기법)

  • Kwon, Young-Min;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.1
    • /
    • pp.35-41
    • /
    • 2017
  • To solve the shortage of radio spectrum and utilize spectrum resource more efficiently, cognitive radio technologies are proposed, and many studies on cognitive radio have been conducted. Multi-hop routing is one of the important technologies to enable the nodes to transmit data further with lower power in ad-hoc cognitive radio networks. In a multi-channel cognitive radio networks, each channel should be allocated to minimize interference to primary users. In the multi-hop routing, channel allocation should consider the inter-channel interference to maximize network throughput. In this paper, we propose multi-channel scheduling scheme which minimizes inter-channel interferences and avoids collision with primary users for the multi-hop multi-channel cognitive radio networks. The proposed scheduling is designed to determine both of routing path and channel selection. The performance of proposed channel allocation scheme is evaluated by the computer simulation in the aspect of capacity and collision rate.

Time Utility and Channel State based Wireless Downlink Packet Scheduling Algorithm for OFDMA System (OFDMA 무선 시스템에서의 시간-효용과 채널 상태 기반의 하향 링크 패킷 스케줄링)

  • Ryu, Seung-Wan;Seo, Hyun-Hwa;Chung, Soo-Jung;Lim, Soon-Yong;Park, Sei-Kwon
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.111-121
    • /
    • 2004
  • In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.

An Efficient Packet Scheduling Scheme to support Real-Time Traffic in OFDMA Systems (OFDMA 시스템에서 실시간 트래픽 전송을 위한 효율적 스케쥴링 기법)

  • Park, Jeong-Sik;Cho, Ho-Shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1A
    • /
    • pp.13-23
    • /
    • 2007
  • In this paper, a packet scheduling scheme that supports real-time traffic having multi-level delay constraints in OFDMA systems is proposed. The proposed scheme pursues to satisfy the delay constraint first, and then manage the residual radio resource in order to enhance the overall throughput. A parameters named tolerable delay time (TDT) is newly defined to deal with the differentiated behaviors of packet scheduling according to the delay constraint level. Assuming that the packets violating the delay constraint are discarded, the proposed scheme is evaluated in terms of the packet loss probability, throughput, channel utilization. It is then compared with existing schemes for real-time traffic support such as the Exponential Scheduling (EXP) scheme, the Modified Largest Weighted Delay First (M-LWDF) scheme, and the Round robin scheme. The numerical results show that the proposed scheduling scheme performs much better than the aforementioned scheduling schemes in terms of the packet loss probability, while slightly better in terms of throughput and channel utilization.

Opportunistic Scheduling with QoS Constraints for Multiclass Services HSUPA System

  • Liao, Dan;Li, Lemin
    • ETRI Journal
    • /
    • v.29 no.2
    • /
    • pp.201-211
    • /
    • 2007
  • This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

  • PDF