• Title/Summary/Keyword: spatial scheduling

Search Result 68, Processing Time 0.027 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.

Opportunistic Scheduling and Power Control for Cross-Layer Design of Ad Hoc Networks (Ad Hoc네트워크의 Cross-Layer설계를 위한 Opportunistic Scheduling과 Power Control기법)

  • Casaquite Reizel;Ham Byung-Woon;Hwang Won-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9A
    • /
    • pp.856-867
    • /
    • 2006
  • This paper proposes a new algorithm for opportunistic scheduling that take advantage of both multiuser diversity and power control. Motivated by the multicast RTS and priority-based CTS mechanism of OSMA protocol, we propose an opportunistic packet scheduling with power control scheme based on IEEE 802.11 MAC protocol. The scheduling scheme chooses the best candidate receiver for transmission by considering the SINR at the nodes. This mechanism ensures that the transmission would be successful. The power control algorithm on the other hand, helps reduce interference between links and could maximize spatial reuse of the bandwidth. We then formulate a convex optimization problem for minimizing power consumption and maximizing net utility of the system. We showed that if a transmission power vector satisfying the maximum transmission power and SINR constraints of all nodes exist, then there exists an optimal solution that minimizes overall transmission power and maximizes utility of the system.

Advanced Alignment-Based Scheduling with Varying Production Rates for Horizontal Construction Projects

  • Greg Duffy;Asregedew Woldesenbet;David Hyung Seok Jeong;Garold D. Oberlender
    • International conference on construction engineering and project management
    • /
    • 2013.01a
    • /
    • pp.403-411
    • /
    • 2013
  • Horizontal construction projects such as oil and gas pipeline projects typically involve repetitive-work activities with the same crew and equipment from one end of the project to the other. Repetitive scheduling also known as linear scheduling is known to have superior schedule management capabilities specifically for such horizontal construction projects. This study discusses on expanding the capabilities of repetitive scheduling to account for the variance in production rates and visual representation by developing an automated alignment based linear scheduling program for applying temporal and spatial changes in production rates. The study outlines a framework to apply changes in productions rates when and where they will occur along the horizontal alignment of the project and illustrates the complexity of construction through the time-location chart through a new linear scheduling model, Linear Scheduling Model with Varying Production Rates (LSMVPR). The program uses empirically derived production rate equations with appropriate variables as an input at the appropriate time and location based on actual 750 mile natural gas liquids pipeline project starting in Wyoming and terminating in the center of Kansas. The study showed that the changes in production rates due to time and location resulted in a close approximation of the actual progress of work as compared to the planned progress and can be modeled for use in predicting future linear construction projects. LSMVPR allows the scheduler to develop schedule durations based on minimal project information. The model also allows the scheduler to analyze the impact of various routes or start dates for construction and the corresponding impact on the schedule. In addition, the graphical format lets the construction team to visualize the obstacles in the project when and where they occur due to a new feature called the Activity Performance Index (API). This index is used to shade the linear scheduling chart by time and location with the variation in color indicating the variance in predicted production rate from the desired production rate.

  • PDF

Range Query Processing of Distributed Moving Object Databases using Scheduling Technique (스케쥴링 기법을 이용한 분산 이동 객체 데이타베이스의 범위 질의 처리)

  • Jeon, Se-Gil;Hwang, Jae-Il;Nah, Youn-Mook
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.2 s.12
    • /
    • pp.51-62
    • /
    • 2004
  • Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries. To improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structures of GALIS architecture,which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

  • PDF

Spatial Reuse Algorithm Using Interference Graph in Millimeter Wave Beamforming Systems

  • Jo, Ohyun;Yoon, Jungmin
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.255-263
    • /
    • 2017
  • This paper proposes a graph-theatrical approach to optimize spatial reuse by adopting a technique that quantizes the channel information into single bit sub-messages. First, we introduce an interference graph to model the network topology. Based on the interference graph, the computational requirements of the algorithm that computes the optimal spatial reuse factor of each user are reduced to quasilinear time complexity, ideal for practical implementation. We perform a resource allocation procedure that can maximize the efficiency of spatial reuse. The proposed spatial reuse scheme provides advantages in beamforming systems, where in the interference with neighbor nodes can be mitigated by using directional beams. Based on results of system level measurements performed to illustrate the physical interference from practical millimeter wave wireless links, we conclude that the potential of the proposed algorithm is both feasible and promising.

A Study on method of load attribute for Spatial Scheduling (공간일정계획에서의 부하조정을 위한 방법론 연구)

  • Back Dong-Sik;Yoon Duck-Young;Kwak Hyun Ho
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.96-100
    • /
    • 2004
  • In the ship building industry various problems of erection is counterfeited due to formation of bottle necks in the block erection flow pattern This kind of problems cause accumulated problems in real-time erection right on the floor, When such a problem is approached, a support data of the entire erection sequence should be available, Here planning is done by reasoning about the future events in order to verify the existence of a reasonable series of actions to accomplish a goal. This technique helps in achieving benefits like handling search complications, in resolving goal conflicts and anticipation of bottleneck formation well in advance to take necessary countermeasures and boosts the decision support system, The data is being evaluated and an anticipatory function is to be developed This function is quite relevant in day to day planning operation. The system updates database with rearrangement of off-critical blocks in the erection sequence diagram, As a result of such a system, planners can foresee months ahead and can effectively make decisions regarding the control of loads on the man, machine and work flow pattern, culminating to an efficient load management. Such a foreseeing concept helps us in eliminating backtracking related adjustment which is less efficient compared to the look-ahead concept. An attempt is made to develop a computer program to update the database of block arrangement pattern based on heuristic formulation.

  • PDF

Task Scheduling to Minimize the Effect of Coincident Faults in a Duplex Controller Computer (고성능 컴퓨터의 고신뢰도 보장을 위한 이중(Duplex) 시스템의 작업 시퀀싱/스케쥴링 기법 연구)

  • Im, Han-Seung;Kim, Hak-Bae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.3124-3130
    • /
    • 1999
  • A duplex system enhances reliability by tolerating faults through spatial redundancy. Faults can be detected by duplicating identical tasks in pairs of modules. However, this kind of systems cannot even detect the fault if it occurs coincidently due to either malfunctions of common component such as power supply and clock or due to such environmental disruption as EMI. In the paper, we propose a method to reduce those effects of coincident faults in the duplex controller computer. Specifically, a duplex system tolerates coincident faults by using a sophistication sequencing of scheduling technique with certain timing redundancy. In particular when all tasks should be completed in the sense of real-time, the suggested scheduling method works properly to minimize the probability of faulty tasks due to coincident fault without missing the timing constraints.

  • PDF

Fair Scheduling for Throughput Improvement in Wireless Mesh Networks

  • Tran, Nguyen H.;Hong, Choong-Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1310-1312
    • /
    • 2007
  • Throughput improvement problem in wireless mesh network can be alleviated by equipped mesh router with multiple radios tuned into orthogonal channels. However, some links on the same channel also can be activated concurrently if the Signal-to-Noise and Interference Ratio (SNIR) at their receiver endpoints is not lower than the threshold. We propose a greedy algorithm to investigate the problem of how to schedule a set of feasible transmission under physical interference model by using the spatial time-division multiple-access (STDMA) scheme. We also consider the fairness in scheduling to prevent some border nodes from starvation. We evaluate our algorithms through extensive simulation and the results show that our algorithms can achieve better aggregate throughput and fairness performance than 802.11 standard.

  • PDF

GIS Oriented Platform For Solving Real World Logistic Vehicle Routing Problem

  • Md. Shahid Uz Zaman;Chen, Yen-Wei;Hayao Miyagi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1248-1251
    • /
    • 2002
  • Logistics optimization problems related with vehicle routing such as warehouse locating, track scheduling, customer order delivery, wastage pickup etc. are very interesting and important issues to date. Many Vehicle Routing and Scheduling Systems (VRSS) have been developed/proposed to optimize the logistics problems. But majority of them are dedicated to a particular problem and are unable to handle the real world spatial data directly. The system developed for one problem may not be suitable for others due to inter-problem constraint variations. The constraints may include geographical, environmental and road traffic nature of the working region along with other constraints related with the problem. So the developer always needs to modify the original routing algorithm in order to fulfill the purpose. In our study, we propose a general-purpose platform by combining GIS road map and Database Management System (DBMS), so that VRSS can interact with real world spatial data directly to solve different kinds of vehicle routing problems. Using the features of our developed system, the developer can frequently modify the existing algorithm or create a new one to serve the purpose.

  • PDF

Design and Development of Simulation Framework for Processing Window Query in Wireless Spatial Data Broadcasting Environment (무선 공간 데이터 방송 환경에서 범위 질의 처리를 위한 시뮬레이션 프레임워크의 설계와 구현)

  • Im, Seokjin;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.173-178
    • /
    • 2014
  • Smart devices linked to high speed networks enable us to obtain location dependent data at anywhere and anytime. In this environment, a wireless data broadcast system can deal with enormous data request from a great number of clients effectively. In order to set up an efficient wireless data broadcast system, various data scheduling and indexing schemes have been proposed. However, a simulation framework to evaluate the schemes is not reported yet. In this paper, we design and develop a simulation framework for a wireless data broadcast system. The developed simulation framework can evaluate quickly a wireless data broadcast system and has scalability to adopt various data scheduling and indexing schemes for wireless data broadcasting.