No description available.

The following thesis describes and analyzes the development of the U.S. slot allocation system from 1968 until today, in order to draw relevant conclusions for a new European Slot Regulation. The European Commission is currently drafting a new Slot Regulation purporting to introduce market mechanisms. A similar approach was espoused in the United States from 1986 onward, but was ultimately supplanted by overriding legislation in 2000. The analysis of the U.S. slot allocation system reveals the reasons underlying its abolition and queries whether this experience can be successfully transposed in Europe. The thesis commences by providing general information on the definition of slots, slot allocation, and airport capacity. A brief review of the European Commission's current consultation process on the implementation of market mechanisms for slot allocation follows. The main part of the thesis discusses the U.S. High Density Rule and the Rules for the Allocation and Transfer of High Density Airport Slots in historical order. Some criticisms frequently voiced assert that the Rules artificially limited access to airports, constituted barriers to market entry, restricted airline competition, generated higher fares, and yielded adverse effects on smaller communities which, in turn, lost access to key markets. Through a favorable assessment of the Rules, the thesis analyses these concerns and concludes that the suppression of the Rules was rather prompted by local political motivations than by other rationalities. However, experiences drawn from the U.S. Rules demonstrate that a future European secondary market for slots, if implemented under a grand fathering system, will likely have a positive impact on the efficiency of airport capacity, but not on access to the market and competition.

No description available.

Advances in micro-sensor and wireless technology enable small but smart sensors to be developed for wide range environment-monitor applications. Since Sensor nodes only have limited power capacity and are difficult to recharge, how to prolong network lifetime is an important issue in wireless sensor networks design. Several topology control algorithms have been proposed to maintain the connectivity of wireless sensor network and reduce the energy consumption. Multi-hop Infrastructure Network Architecture (MINA) is a kind of Multi-layer Architecture for WSN topology, which utilizes hundred of sensors to transmit data to a sink. This architecture partitions sensor nodes into layers based on their distances (calculated by hop count) to BS. In this way, the node connected to more nodes will relay more data for other nodes. This make the node exhaust its battery power quickly and thus reduces the network lifetime. This study proposes an Efficient Energy Time-Slot Allocation (EETA) scheme which distributes time slots in accordance with the energy of neighbor nodes and the number of neighbor nodes. In addition, this work also devises an adaptive time slot size to reduce data packet drop in case when the node buffer is full. The simulation results show that the EETA performs better than the MINA in terms of network lifetime.

This work studies the allocation of bandwidth resources in wireless ad hoc networks. The highest-density clustering algorithm is presented to promote reuse of the spatial channel and a new slot allocation algorithm is proposed to achieve conflict-free scheduling for transmissions. Since the location-dependent contention is an important characteristic of ad hoc networks, in this paper we consider this feature of ad hoc networks to present a new cluster formation algorithm, by increasing the number of simultaneous links to enhance spatial channel reuse. Furthermore, because each cluster has its own scheduler and schedulers operate independently of each other, the transmissions may conflict among the clusters. In this paper, we classify the flows by the locations of their endpoints to prevent this problem. Finally, the proposed mechanism is implemented by simulation and the results reveal that the conflicts can be efficiently avoided without global information and the network throughput is improved without violating fairness.

The objective of this thesis research is to optimize network throughput and fairness, and enhance bandwidth utilization in wireless mobile multi-hop relay (MMR) networks. To enhance bandwidth utilization, we propose an adaptive OFDMA frame structure which is used by the base station and the non-transparent relay stations. To optimize throughput and fairness, we develop an adaptive OFDMA allocation algorithm by using the proposed adaptive OFDMA frame. The effectiveness of the proposed schemes has been verified by numeric simulations. Providing ubiquitous coverage with wireless metropolitan area networks (WMANs) can be costly, especially in sparsely populated areas. In this scenario, cheaper relay stations (RSs) can be used to provide coverage instead of expensive base stations (BSs). The RS extends the coverage area of traditional BSs. This sort of network is known as a wireless MMR network. This thesis focuses on MMR networks that use orthogonal frequency division multiple access (OFDMA) and time division duplex (TDD) as a multiple access scheme and a duplex communication technique (e.g., WiMAX). The use of OFDMA resources (e.g., OFDMA symbols and subcarriers) and how they are shared in current schemes can reduce system capacity and network throughput in certain scenarios. To increase the capacity of the MMR network, we propose a new protocol that uses an adaptive OFDMA frame structure for BSs and RSs. We also propose adaptive OFDMA resource allocation for subscriber stations (SSs) within a BS or RS. We derive the maximum OFDMA resources that RSs can be assigned and synchronize access zones and relay zones between a superior station and its subordinate RSs. This is bounded by three properties defined in this thesis: a data relay property, a maximum balance property, and a relay zone limitation property. Finally, we propose max-min and proportional fairness schemes that use the proposed adaptive frame structure. The proposed scheme is the first approach that incorporates the adaptive technique for wireless MMR networks. We evaluate our scheme using simulations and numerical analysis. Results show that our technique improves resource allocation in wireless MMR networks. Further, in asymmetric distributions of SSs between access zones and relay zones, the proposed OFDMA allocation scheme performs two times better than the non-adaptive allocation scheme in terms of average max-min fairness and 70% better in terms of average throughput.

This dissertation aims at improving the efficiency, robustness, and flexibility of airport operations through intelligent gate assignment. Traditional research on gate assignment focuses on the accommodation of passengers' demands such as walking time of passengers, and the robustness of gate assignment. In spite of its importance on the ramp operations, there is a lack of research to account ramp congestion when gates are assigned. Therefore, this dissertation proposes a new perspective on the gate assignment that accounts for ramp congestion. For that purpose, a ramp operations model based on observations at Atlanta airport is presented to understand the characteristics of aircraft movement on the ramp. The proposed gate assignment problem minimizes passenger-time spent on ramp areas. In addition, this dissertation is conducted to satisfy the needs of passengers, aircraft, and operations from the perspectives of passengers. Using actual passenger data at a major hub airport, the proposed gate assignment is assessed by means of passengers' transit time, passengers' time spent on the ramp, and passengers' waiting time for a gate. Results show that the proposed gate assignment outperforms the current gate assignment in every metric. This dissertation also analyzes the impact of gate assignment on departure metering, which controls the number of pushbacks in order to reduce airport congestion. Then, some of departing flights are held at gates, so it increases the chance of gate conflict, which reduces the efficiency of departure metering as well as ramp operations. In order to analyze the impact of gate assignment on departure metering, this dissertation simulates departure processes at two airports. Results show that the proposed robust gate assignment reduces the occurrence of gate conflicts under departure metering and helps to utilize gate-holding times to some extent.

This paper considers the allocation of slots for a network of coordinated (congested) airports, where the term “slot” refers to a time on a specific day when a carrier is given permission to use the full range of airport infrastructure for the purpose of landing and take-off at a slot-controlled airport. We take into account the existing IATA rules and guidelines: priorities of requests for slots, the capacity limitations at each airport, the minimal turnaround time between arrival and subsequent departure of the same aircraft, and allocation to series of slots rather than to individual slots. Given the complexity of the problem, we propose an approach that consists of (i) a constructive heuristic procedure to generate a feasible and coherent allocation of slots for each airport from the network, and (ii) an iterative heuristic to improve the quality of an initial feasible solution in terms of the schedule delay (time difference between allocated time slots and airline requests). To evaluate whether the approach would be practical in real operation, we perform tests on a set of generated benchmark instances that span an entire scheduling season. The instances differ by the number of airports in the network and by the distribution of requests among airports from a given network - the largest number of airports forming a network is 100, while the maximum total number of aircraft movements considered on a half-yearly basis exceeds . We provide computational comparisons with solutions obtained when each airport from a network is considered independently (the en-route constraint is ignored). These results reveal that the consideration of the en-route constraint, which ensures a coherent allocation of slots at origin and destination airports, introduces only a minor degradation in the schedule delay and in the number of unaccommodated requests. Furthermore, we investigate the heuristic performance for reduced-capacity scenarios.

Even if 3rd and 4th generation wireless systems aim to achieve multimedia services at high speed, it is rather difficult to have full-fledged multimedia services due to insufficient capacity of the systems. There are many technical challenges placed on us in order to realize the real multimedia services. One of those challenges is how efficiently to allocate resources to traffic as the wireless systems evolve. The review of the literature shows that strategic manipulation of traffic can lead to an efficient use of resources in both wire-line and wireless networks. This aspect brings our attention to the role of link layer protocols, which is to orchestrate the transmission of packets in an efficient way using given resources. Therefore, the Media Access Control (MAC) layer plays a very important role in this context. In this research, we investigate technical challenges involving resource control and management in the design of MAC protocols based on the characteristics of traffic, and provide some strategies to solve those challenges. The first and foremost matter in wireless MAC protocol research is to choose the type of multiple access schemes. Each scheme has advantages and disadvantages. We choose Wireless Code Division Multiple Access/Time Division Duplexing (WCDMA/TDD) systems since they are known to be efficient for bursty traffic. Most existing MAC protocols developed for WCDMA/TDD systems are interested in the performance of a unidirectional link, in particular in the uplink, assuming that the number of slots for each link is fixed a priori. That ignores the dynamic aspect of TDD systems. We believe that adaptive dynamic slot allocation can bring further benefits in terms of efficient resource management. Meanwhile, this adaptive slot allocation issue has been dealt with from a completely different angle. Related research works are focused on the adaptive slot allocation to minimize inter-cell interference under multi-cell environments. We believe that these two issues need to be handled together in order to enhance the performance of MAC protocols, and thus embark upon a study on the adaptive dynamic slot allocation for the MAC protocol. This research starts from the examination of key factors that affect the adaptive allocation strategy. Through the review of the literature, we conclude that traffic characterization can be an essential component for this research to achieve efficient resource control and management. So we identify appropriate traffic characteristics and metrics. The volume and burstiness of traffic are chosen as the characteristics for our adaptive dynamic slot allocation. Based on this examination, we propose four major adaptive dynamic slot allocation strategies: (i) a strategy based on the estimation of burstiness of traffic, (ii) a strategy based on the estimation of volume and burstiness of traffic, (iii) a strategy based on the parameter estimation of a distribution of traffic, and (iv) a strategy based on the exploitation of physical layer information. The first method estimates the burstiness in both links and assigns the number of slots for each link according to a ratio of these two estimates. The second method estimates the burstiness and volume of traffic in both links and assigns the number of slots for each link according to a ratio of weighted volumes in each link, where the weights are driven by the estimated burstiness in each link. For the estimation of burstiness, we propose a new burstiness measure that is based on a ratio between peak and median volume of traffic. This burstiness measure requires the determination of an observation window, with which the median and the peak are measured. We propose a dynamic method for the selection of the observation window, making use of statistical characteristics of traffic: Autocorrelation Function (ACF) and Partial ACF (PACF). For the third method, we develop several estimators to estimate the parameters of a traffic distribution and suggest two new slot allocation methods based on the estimated parameters. The last method exploits physical layer information as another way of allocating slot to enhance the performance of the system. The performance of our proposed strategies is evaluated in various scenarios. Major simulations are categorized as: simulation on data traffic, simulation on combined voice and data traffic, simulation on real trace data. The performance of each strategy is evaluated in terms of throughput and packet drop ratio. In addition, we consider the frequency of slot changes to assess the performance in terms of control overhead. We expect that this research work will add to the state of the knowledge in the field of link-layer protocol research for WCDMA/TDD systems. / Ph. D.

Improving the predictability of airline schedules in the National Airspace System (NAS) has been a constant endeavor, particularly as system delays grow with ever-increasing demand. Airline schedules need to be resistant to perturbations in the system including Ground Delay Programs (GDPs) and inclement weather. The strategic search heuristic proposed in this dissertation significantly improves airline schedule reliability by assigning airport departure and arrival slots to each flight in the schedule across a network of airports. This is performed using a multi-objective optimization approach that is primarily based on historical flight and taxi times but also includes certain airline, airport, and FAA priorities. The intent of this algorithm is to produce a more reliable, robust schedule that operates in today's environment as well as tomorrow's 4-Dimensional Trajectory Controlled system as described the FAA's Next Generation ATM system (NextGen). This novel airline schedule optimization approach is implemented using a multi-objective evolutionary algorithm which is capable of incorporating limited airport capacities. The core of the fitness function is an extensive database of historic operating times for flight and ground operations collected over a two year period based on ASDI and BTS data. Empirical distributions based on this data reflect the probability that flights encounter various flight and taxi times. The fitness function also adds the ability to define priorities for certain flights based on aircraft size, flight time, and airline usage. The algorithm is applied to airline schedules for two primary US airports: Chicago O'Hare and Atlanta Hartsfield-Jackson. The effects of this multi-objective schedule optimization are evaluated in a variety of scenarios including periods of high, medium, and low demand. The schedules generated by the optimization algorithm were evaluated using a simple queuing simulation model implemented in AnyLogic. The scenarios were simulated in AnyLogic using two basic setups: (1) using modes of flight and taxi times that reflect highly predictable 4-Dimensional Trajectory Control operations and (2) using full distributions of flight and taxi times reflecting current day operations. The simulation analysis showed significant improvements in reliability as measured by the mean square difference (MSD) of filed versus simulated flight arrival and departure times. Arrivals showed the most consistent improvements of up to 80% in on-time performance (OTP). Departures showed reduced overall improvements, particularly when the optimization was performed without the consideration of airport capacity. The 4-Dimensional Trajectory Control environment more than doubled the on-time performance of departures over the current day, more chaotic scenarios. This research shows that airline schedule reliability can be significantly improved over a network of airports using historical flight and taxi time data. It also provides for a mechanism to prioritize flights based on various airline, airport, and ATC goals. The algorithm is shown to work in today's environment as well as tomorrow's NextGen 4-Dimensional Trajectory Control setup.