• Title/Summary/Keyword: link scheduling

Search Result 132, Processing Time 0.024 seconds

An Algorithm for Iterative Detection and Decoding MIMO-OFDM HARQ with Antenna Scheduling

  • Kim, Kyoo-Hyun;Kang, Seung-Won;Mohaisen, Manar;Chang, Kyung-Hi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.4
    • /
    • pp.194-208
    • /
    • 2008
  • In this paper, a multiple-input-multiple-output (MIMO) hybrid-automatic repeat request (HARQ) algorithm with antenna scheduling is proposed. It retransmits the packet using scheduled transmit antennas according to the state of the communication link, instead of retransmitting the packet via the same antennas. As a result, a combination of conventional HARQ systems, viz. chase combining (CC) and incremental redundancy (IR) are used to achieve better performance and lower redundancy. The proposed MIMO-OFDM HARQ system with antenna scheduling is shown to be superior to conventional MIMO HARQ systems, due to its spatial diversity gain.

Prioritized Dynamic Rate Scheduling for Interactive GEO Satellite Networks (대화형 GEO 위성 네트워크를 위한 우선권기반 동적 데이터 전송률 스케줄링 체계)

  • Chang, Kun-Nyeong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.3
    • /
    • pp.1-15
    • /
    • 2007
  • In this paper, the return link of interactive GEO satellite network providing multimedia services is considered. First, we classify data by delay characteristics, and analyze the numbers of expected lost packets and expected delay packets for each data class of each terminal. Next we mathematically formulate optimal rate scheduling model to minimize the weighted sum of the numbers of expected lost packets and expected delay packets considering priority of each data class. We also suggest a dynamic rate scheduling scheme based on Lagrangean relaxation technique and subgradient technique to solve the proposed model in a fast time. Extensive experiments show that the proposed scheme provides encouraging results.

Efficient Channel Scheduling Technique Using Release Time Unscheduled Channel Algorithm in OBS WDM Networks (OBS WDM 망에서 비 할당된 채널 개방시간을 이용한 효율적인 채널 스케줄링 기법)

  • Cho Seok-man;Kim Sun-myeng;Choi Dug-kyoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10A
    • /
    • pp.912-921
    • /
    • 2005
  • Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

Cooperative Priority-based Resource Allocation Scheduling Scheme for D2D Communications Underlaying 5G Cellular Networks (5G 셀룰러 네트워크 하의 D2D통신을 위한 협력적 우선순위 기반의 자원할당 스케줄링)

  • Lee, Chong-Deuk
    • Journal of Digital Convergence
    • /
    • v.18 no.10
    • /
    • pp.225-232
    • /
    • 2020
  • The underlaying communication scheme in 5G cellular network is a very promising resource sharing scheme, and it is an effective scheme for improving service performance of 5G and reducing communication load between a cellular link and a device to device (D2D) link. This paper proposes the algorithm to minimize the resource interference that occurs when performing 5G-based multi-class service on gNB(gNodeB) and the cooperative priority-based resource allocation scheduling scheme (CPRAS) to maximize 5G communication service according to the analyzed control conditions of interference. The proposed CPRAS optimizes communication resources for each device, and it optimizes resource allocation according to the service request required for 5G communication and the current state of the network. In addition, the proposed scheme provides a function to guarantee giga-class service by minimizing resource interference between a cellular link and a D2D link in gNB. The simulation results show that the proposed scheme is better system performance than the Pure cellular and Force cellular schemes. In particular, the higher the priority and the higher the cooperative relationship between UE(User Equipment), the proposed scheme shows the more effective control of the resource interference.

Link Error Analysis and Modeling for Video Streaming Cross-Layer Design in Mobile Communication Networks

  • Karner, Wolfgang;Nemethova, Olivia;Svoboda, Philipp;Rupp, Markus
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.569-595
    • /
    • 2007
  • Particularly in wireless communications, link errors severely affect the quality of the services due to the high error probability and the specific error characteristics (burst errors) in the radio access part of the network. In this work, we show that thorough analysis and appropriate modeling of radio-link error behavior are essential to evaluate and optimize higher layer protocols and services. They are also the basis for finding network-aware cross-layer processing algorithms which are capable of exploiting the specific properties of the link error statistics, such as predictability. This document presents the analysis of the radio link errors based on measurements in live Universal Mobile Telecommunication System (UMTS) radio access networks as well as new link error models originating from that analysis. It is shown that the knowledge of the specific link error characteristics leads to significant improvements in the quality of streamed video by applying the proposed novel network- and content-aware cross-layer scheduling algorithms. Although based on live UMTS network experience, many of the conclusions in this work are of general validity and are not limited to UMTS only.

  • PDF

Reliable Dynamic TDMA Scheme with new Packing method for Image Transmission over Link-16 (Link-16에서 이미지 전송을 위한 신뢰성 기반의 동적 TDMA 기법과 새로운 패킹 방법)

  • Baek, Hoki;Lim, Jaesung;Koo, Jayeul;Jin, Jeonghwan;Chun, Philseong;Oh, Ilhyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1045-1053
    • /
    • 2012
  • Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

Bidirectional Link Resource Allocation Strategy in GFDM-based Multiuser SWIPT Systems

  • Xu, Xiaorong;Sun, Minghang;Zhu, Wei-Ping;Feng, Wei;Yao, Yingbiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.1
    • /
    • pp.319-333
    • /
    • 2022
  • In order to enhance system energy efficiency, bidirectional link resource allocation strategy in GFDM-based multiuser SWIPT systems is proposed. In the downlink channel, each SWIPT user applies power splitting (PS) receiver structure in information decoding (ID) and non-linear energy harvesting (EH). In the uplink channel, information transmission power is originated from the harvested energy. An optimization problem is constructed to maximize weighted sum ID achievable rates in the downlink and uplink channels via bidirectional link power allocation as well as subcarriers and subsymbols scheduling. To solve this non-convex optimization problem, Lagrange duality method, sub-gradient-based method and greedy algorithm are adopted respectively. Simulation results show that the proposed strategy is superior to the fixed subcarrier scheme regardless of the weighting coefficients. It is superior to the heuristic algorithm in larger weighting coefficients scenario.

A Distribution Scheme for Continuous Media Contens over Peer-to-Peer Networks (P2P 네트웍에서 연속형 미디어 컨텐츠의 분산형 배포 기법)

  • Kwon Jin Baek;Yeom Heon Young;Lee Jeong Bae
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.511-520
    • /
    • 2004
  • A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme called fixed-length slotted scheduling, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming ca-pacity increases, called FAST.

MAC Scheduling Algorithm for Supporting Efficient Scatternet Operations of Bluetooth (블루투스의 효율적 스캐터넷 동작을 지원하기 위한 MAC 스케줄링 기법)

  • 주양익;김용석;이태진;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.467-476
    • /
    • 2003
  • In this paper, we propose an efficient MAC scheduling algorithm for supporting Bluetooth scatternet operations. Our proposed algorithm improves overall performances of scatter mode[2, 3] and considers QoS requirements of each link of the bridge node of a scatternet. Scatter mode is based on time division scheduling and provides every links of a scatternet with fair service opportunities. However, since each Bluetooth devices has various traffic characteristics. fair allocation of service opportunities is not efficient and may cause extravagance of wireless resources. Therefore, we propose a new efficient inter-piconet scheduling algorithm compliant with the current Bluetooth specification[1], and demonstrate its improved performances via computer simulations.

An Improved Adaptive Scheduling Strategy Utilizing Simulated Annealing Genetic Algorithm for Data Center Networks

  • Wang, Wentao;Wang, Lingxia;Zheng, Fang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5243-5263
    • /
    • 2017
  • Data center networks provide critical bandwidth for the continuous growth of cloud computing, multimedia storage, data analysis and other businesses. The problem of low link bandwidth utilization in data center network is gradually addressed in more hot fields. However, the current scheduling strategies applied in data center network do not adapt to the real-time dynamic change of the traffic in the network. Thus, they fail to distribute resources due to the lack of intelligent management. In this paper, we present an improved adaptive traffic scheduling strategy utilizing the simulated annealing genetic algorithm (SAGA). Inspired by the idea of software defined network, when a flow arrives, our strategy changes the bandwidth demand dynamically to filter out the flow. Then, SAGA distributes the path for the flow by considering the scheduling of the different pods as well as the same pod. It is implemented through software defined network technology. Simulation results show that the bisection bandwidth of our strategy is higher than state-of-the-art mechanisms.