Bibliographies thématiques / Time slot allocation

Sommaire

Articles de revues
Thèses
Chapitres de livres
Actes de conférences

Littérature scientifique sur le sujet « Time slot allocation »

Auteur : Grafiati

Publié le 9 mars 2023

Mis à jour le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Time slot allocation ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Time slot allocation"

Letanovská, Mária. « Different Allocation Systems ». Transport and Communications 2, n^o 1 (2014) : 12–15. http://dx.doi.org/10.26552/tac.c.2014.1.4.

Texte intégral

Résumé :

Based on the London´s airports example it is obvious that there are differences between 3rd level airports. If the same coordination system would be introduced within various coordinated airports it could lead to various results. The results of analysis of intra-EU route data indicate that larger aircraft have been used at the 3rd level airports and there is no strong evidence of inefficient slot hoarding at these airports, not only before but also after the EC’s recognition of secondary slot trading. In contrast, the analysis of slot trading at Heathrow and Gatwick show that slot trading has taken place more likely within alliance and the chances have been very small for carriers to obtain slots from their actual or potential competitors. For the time being, there may be no need for additional regulatory interventions into secondary slot trading as there is little evidence of inefficient slot hoarding. However, the scarce opportunity of slot trading may lead to less intense competition and then to less efficient use of slots in the long run.

Styles APA, Harvard, Vancouver, ISO, etc.

Wu, Yuhan. « Financial and Economic Sequence Forecasting Based on Time Slot Allocation Algorithm ». Security and Communication Networks 2022 (16 mai 2022) : 1–13. http://dx.doi.org/10.1155/2022/2340521.

Texte intégral

Résumé :

Financial and economic series prediction was very important for the study of economic time series. Because the traditional time series analysis method was mainly suitable for stable data and cannot be applied to unstable economic variables, this paper proposed a knowledge model of financial and economic series prediction time slot algorithm, which provided the basis for solving unstable financial data. Firstly, based on the analysis of relevant financial and economic series prediction methods at home and abroad, this paper applied the time slot allocation algorithm to economic series analysis and prediction and designed a path level time slot allocation algorithm, which introduced a fixed time slot to shorten the time required to complete the path level time slot allocation. Secondly, this paper abstracted the calculation of slot allocation as a convex optimization problem and proposed a round slot allocation algorithm based on constraints and optimal solution. The algorithm can improve the end-to-end throughput and the effective utilization of slots. Finally, the model proposed in this paper was used to predict the indicators of relevant industries, and the simulation results were compared with the standard data. The experimental results showed that the financial and economic series prediction system based on time slot allocation algorithm proposed in this paper can effectively improve the accuracy of financial and economic series prediction, which verified the effectiveness and feasibility of this model.

Styles APA, Harvard, Vancouver, ISO, etc.

Zeng, Bin, Jing Zhang et Hai Qing Liu. « Optimal Channel Assignment Algorithm for Wireless Networks ». Advanced Materials Research 211-212 (février 2011) : 993–97. http://dx.doi.org/10.4028/www.scientific.net/amr.211-212.993.

Texte intégral

Résumé :

In wireless cellular network, users will share the time-slots channel and bandwidth with voice users. With the characteristic of dynamic slot allocation, some time slots can be allocated to one single user. How to choose the slot allocation methodology is a significant problem when considering the system revenue and users’ satisfaction. A new model based on improvement of Markov Decision Process) is developed that can combines the original maximum system revenue model and the call blocking constraints, and will find out the optimal policy of time slots allocation. The experiment result shows that the new algorithm and model is efficient in the channel assignment area of wireless networks.

Styles APA, Harvard, Vancouver, ISO, etc.

Dr. R. Ashok kumar, V. M. Jemin, Dr M. N. Saravana kumar, Dr M. Ayyadurai,. « CONGESTION FREE CHANNEL ALLOCATION FOR HIGH TRAFFIC USING MAC IN WSN ». INFORMATION TECHNOLOGY IN INDUSTRY 9, n^o 1 (18 mars 2021) : 1230–35. http://dx.doi.org/10.17762/itii.v9i1.262.

Texte intégral

Résumé :

Slot Allocation Medium Access Channel (SAMAC), an efficient slot allocating MAC protocol is proposed for predicting the timely channel access for time-critical data operations and also to reduce data congestion. In this scheme the time of non-periodic critical traffic grabs the time slots allotted for the periodic non-critical data traffic. Additionally, Earliest Deadline First (EDF) scheduling algorithm is used to offer efficient channel access in emergency conditions where numerous sensor nodes are prompted concurrently to transmit the periodic time-critical data to the controller. SAMAC protocol is analyzed with the delay in data delivery rates for the time-critical traffic. Simulation analysis is carried out for proving the efficiency of SAMAC in terms of network throughput.

Styles APA, Harvard, Vancouver, ISO, etc.

Yu, Xueyong. « 5G Wireless Networking Connection and Playback Technology Assist the Low-Latency Propagation of New Media ». Journal of Sensors 2021 (17 novembre 2021) : 1–11. http://dx.doi.org/10.1155/2021/3082280.

Texte intégral

Résumé :

This article conducts an indepth study on the delay caused by time division multiple access (TDMA) technology and theoretically analyzes some methods that can reduce the TDMA delay. Traditional dynamic time slot allocation algorithms usually only consider the completion of conflict-free time slot allocation in distributed scenarios, but they do not clearly specify the order of time slot allocation. The order of time slots allocated to each node is ultimately consistent with the new data flow. The order of media dissemination is not the same. Aiming at the scheduling delay problem caused by the inconsistency of the new media low-latency propagation time slot allocation sequence and the data stream sequence, a protocol using the master time slot adaptive time slot exchange technology is proposed. The protocol designs the corresponding super frame structure and realizes the neighbor node discovery strategy and the time slot allocation based on the priority list. At the same time, the time slot switching technology is used to adjust the time slot sequence so that it tends to the data flow sequence. The exchange criterion based on the low-latency propagation data stream value of the new media is designed to solve the problem of optimizing the time slot of multiple data streams in the network. Through the simulation results and analysis, it can be seen that the architecture design proposed in this paper can fulfill the expected requirements of the wireless Mesh network and can achieve good low-latency performance for the highly dynamic network topology. It can also achieve good performance in terms of network throughput and data flow delivery rate, and it has adaptability to high dynamic topologies. By comparing with the traditional algorithm design, the design proposed in this paper has a large improvement in low latency and high submission rate. Therefore, it can be considered that the low-latency architecture design proposed in this article has better performance for new media’s low-latency propagation and highly dynamic network topology.

Styles APA, Harvard, Vancouver, ISO, etc.

Giampouranis, Dimitrios K., Mihalis Golias, Sotirios Theofanis et Maria Boile. « Berth Allocation at Passenger Terminals Using Auctions ». Journal of Marine Science and Engineering 10, n^o 8 (24 juillet 2022) : 1010. http://dx.doi.org/10.3390/jmse10081010.

Texte intégral

Résumé :

In this paper, we compare a multi-round, second-price, sealed-bid bundle auction and a single-item, sequential, second-price, sealed-bid auction for berth slot leasing for vessels (roll-on/roll-off passenger vessels and/or cruise ships) at a public marine terminal. The bundle auction mechanism is designed to maximize port operator profits by auctioning berth (time) slots in groups. The framework is tested using simulation by varying: the number of roll-on/roll-off passenger/cruise ship operating companies; the number of slots they bid for; and the mechanism design with regards to the winner determination, slot valuation, and max to min slot bid ratio among the bidders. The results indicate that neither auction type is a clear winner, and depending on the assumptions, a terminal operator should choose one over the other. The results from this study can be used by terminal operators, given their knowledge and/or assumptions on slot valuations and demand, to select a winner-determination policy and the minimum number of slots they allow players to bid for when designing the auction of their berth capacity to maximize their profits.

Styles APA, Harvard, Vancouver, ISO, etc.

Bai, Hongying, Xiaotong Zhang, Yuxin Liu et Yingdong Xie. « Resource scheduling based on routing tree and detection matrix for Internet of things ». International Journal of Distributed Sensor Networks 17, n^o 3 (mars 2021) : 155014772110038. http://dx.doi.org/10.1177/15501477211003830.

Texte intégral

Résumé :

Effective scheduling of limited communication resources is one of the critical methods for data transmission in the Internet of things. However, the time slot utilization rate of many existing resource scheduling methods of Internet of things is not high. This article proposes a new efficient resource scheduling based on routing tree and detection matrix for Internet of things. In heterogeneous Internet of things, according to the different working modes and functions, the nodes are divided into Internet of things devices, routing nodes, and base station. We use time slot multiplexing to improve the time slot utilization of continuous transmission in Internet of things. First, the time slot allocation table in a round is obtained by the time slot scheduling based on the routing tree. Then, the collision matrix and the transmission matrix are established based on the time slot allocation table in a round. Finally, the minimum time slot scheduling in continuous rounds is determined based on the routing tree and the detection matrix. The experimental results show that the resource scheduling based on routing tree and detection matrix effectively improves the utilization of time slots and improves the throughput of the Internet of things.

Styles APA, Harvard, Vancouver, ISO, etc.

S., Karthikeyan, Hari Seetha et Manimegalai R. « Efficient Dynamic Resource Allocation in Hadoop Multiclusters for Load- Balancing Problem ». Recent Advances in Computer Science and Communications 13, n^o 4 (19 octobre 2020) : 686–93. http://dx.doi.org/10.2174/2213275912666190430161947.

Texte intégral

Résumé :

Background: ‘Map-Reduce’ is the framework and its processing of data by rationalizing the distributed servers. also its running the various tasks in parallel way. The most important problem in map reduce environment is Resource Allocation in distributed environments and data locality to its corresponding slave nodes. If the applications are not scheduled properly then it leads to load unbalancing problems in the cloud environments. Objective: This Research suggests a new dynamic way of allocating the resources in hadoop multi cluster environment in order to effectively monitor the nodes for faster computation, load balancing and data locality issues. The dynamic slot allocation is explained theoretically in order to address the problems of pre configuration, speculative execution, delay in scheduling and pre slot allocation in hadoop environments. Experiment is done with Hadoop cluster which increases the efficiency of the nodes and solves the load balancing problem. Methods: The Current design of Map Reduce Hadoop systems are affected by underutilization of slots. The reason is the number of maps and reducer is allotted is smaller than the available number of maps and reducers. In Hadoop most of the times its noticed that dynamic slot allocation policy, the mapper or reducers are idle. So we can use those unused map tasks to overloaded reducer tasks in-order to increase the efficiency of MR jobs and vice versa. Results: The real time experiment was implemented with Multinode Hadoop cluster map reduce jobs of file size 1giga bytes to 5 giga bytes and various performance test has been taken. Conclusion: This paper focused on Hadoop map reduce resource allocation management techniques for multi cluster environments. It proposes a novel dynamic slot allocation policy to improve the performance of yarn scheduler and eliminates the load balancing problem. This work proves that dynamic slot allocation is outperforms more than yarn framework. In future it considered to concentrate on CPU bandwidth and processing time.

Styles APA, Harvard, Vancouver, ISO, etc.

Han, Xiaofeng, Yan Li et Guodong Liu. « Study on the Optimization and Performance of TDMA Allocation Algorithm in Ships’ Ad Hoc Networks ». Polish Maritime Research 25, s2 (1 août 2018) : 170–75. http://dx.doi.org/10.2478/pomr-2018-0089.

Texte intégral

Résumé :

Abstract This paper analyzes the requirements of the information transmission network of ship integrated condition monitoring system, and proposes a design scheme of ship condition monitoring system based on wireless ad hoc network. The wireless ad hoc network protocol was designed, its networking process was analyzed in detail, and the network transmission performance of the monitoring system was tested. The results proved the feasibility of the system. The above solution can be used for the transmission of ship state information that satisfies the requirements of wireless transmission, and has important theoretical and practical significance. The slot allocation algorithm has been receiving extensive attention as an important part of the TDMA system research. This paper analyzes the summarization and summarization of TDMA time slot assignment algorithms from several aspects such as slot synchronization, existing slot allocation algorithm, and slot assignment model, laying an important foundation for researchers to do further research. In the TDMA system, time is divided into non-overlapping time frames, and the time frames are divided into non-overlapping time slots. Each node in the network performs corresponding operations in each time slot.

Styles APA, Harvard, Vancouver, ISO, etc.

Rom, Raphael, et Moshe Sidi. « Message Delay Distribution in Generalized Time Division Multiple Access (TDMA) ». Probability in the Engineering and Informational Sciences 4, n^o 2 (avril 1990) : 187–202. http://dx.doi.org/10.1017/s0269964800001546.

Texte intégral

Résumé :

In the classical TDMA, which has been the subject of extensive research in the past, a single slot is allocated to each and every user within every frame. In many situations this leads to an inefficient utilization of the channel calling for a nonhomogeneous allocation of slots. This paper focuses on a generalized TDMA scheme in which users are allocated more than a single slot per frame, not necessarily contiguous. We derive the delay distribution and buffer occupancy for such a scheme as well as the expected values of these quantities.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Time slot allocation"

Månsson, Jonas. « Principles for Channel Allocation in GSM ». Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10697.

Texte intégral

Résumé :

In today's GSM system there is a complex resource situation when it comes to the scarce TDMA channels in the air interface, the time slots. There are both voice call services that use one or a half time slot and there are packet data users, that may share time slots with other packet data users, and they can use multiple channels at the same time. Allocating time to users is a crucial part in the system and it may affect the performance for the end user substantially.

In the future there may be more types of services than just voice and packet data and that these services may have specific demands on their channels, time slots. That means they would not be able to use just any of the available channels. The way to "give" services channels is what is called channel allocation. In this thesis four different services and three different principles for channel allocation is implemented in a Matlab simulator and simulated. The thesis goal is to determine which principle is best for which mix of services.

The principles that have been investigated are Flexible Algorithm that lets all services use all channels, Fix Dedication Algorithm where all channels are dedicated to a service and only can be used by that one and finally Soft Dedication Algorithm where all channels are dedicated to a service but may be used by other services when it is not needed by the preferred one.

The conclusion is, simplified, that the Soft Dedication Algorithm generates low blocking rates, high bandwidth and that it is a quite robust principle although the borrowing user may be preempted. It may not always be the best one but over all it is the one to prefer.

Detta examensarbete är utfört på uppdrag av och i samarbete med Ericsson och rör kanal- och resurshantering i GSM-systemet.

Ett ständigt problem vid trådlös och mobil kommunikation är den begränsade mängd frekvenser som finns tillgängliga i radiogränssnittet och hur pass nära två radioresursers frekvenser kan ligga varandra. I GSM används TDMA (Time Division Multiple Access) för att få plats med många användare på ett smalt frekvensband. TDMA innebär förenklat att tiden delas upp i åtta tidsluckor och att varje användare får tillgång till en av radioresurserna under en sådan tidslucka (kanal). Detta gäller både i upp- och nedlänk.

I nuläget finns två tjänster, paketdata och tal, som använder tidsluckorna på olika sätt. En talanvändare använder en eller en halv lucka själv medan paketdataanvändare kan dela på en eller flera luckor. Det finns alltså en mängd olika sätt att allokera, "dela ut", dessa luckor till ett givet antal användare. I nuläget har man en väl fungerande algoritm för detta men man tror att det i framtiden kommer att finnas fler tjänster med mer specifika krav på sina tidsluckor (kanaler) och att man då inte längre kan använda samma princip för kanalallokeringen.

I detta exjobb har tre nya, enkla och renodlade principer för kanalallokering undersökts för fyra fiktiva tjänster. Det tre principerna är Flexible Algorithm, där alla tjänster tillåts använda alla kanaler, Fix Dedication Algorithm, där alla kanaler är dedicerade till någon tjänst och endast kan användas av just denna tjänst; och slutligen Soft Dedication Algorithm som fungerar liknande den föregående men här kan tjänster "låna" kanaler av andra tjänster så längs som de är lediga. I Soft Dedication Algorithm kan en eventuell "låntagare" bli avbruten om en användare av rätt tjänst inte hittar en ledig kanal.

Utvärdering har skett genom att simulera systemet i en, delvis egengjord, Matlabsimulator.

Resultaten visar, förenklat, att Soft Dedication Algorithm är den bästa vad gäller låg blockering, kanalutnyttjande och även bandbredder. Den är även förhållandevis robust mot variationer i last.

Styles APA, Harvard, Vancouver, ISO, etc.

COROLLI, LUCA. « Deterministic and Stochastic Optimization For Heterogeneous Decision Phases In The Air Traffic Domain ». Doctoral thesis, Università degli Studi di Milano-Bicocca, 2014. http://hdl.handle.net/10281/50551.

Texte intégral

Résumé :

Scheduling is a complex activity that is needed in a large number of fields, which can involve heterogeneous factors and that may have different goals. In this thesis, scheduling problems that involve the air traffic field at different phases are faced. At each phase, the different characteristics of the problems are considered, devoting special attention to uncertainty. Given the heterogeneous characteristics and goals of the problems, different models and methods are proposed to solve each of them. The first analyzed phase is the strategic phase. It takes place around six months before the operation of flights, when they need to be assigned scheduled departure and arrival times at the airports where they operate. Future capacity realizations are very difficult to forecast at this phase, as capacity is influenced by weather conditions. A two-stage stochastic programming model with two alternative formulations is proposed to capture this uncertainty. Since the number of scenarios may be extreme, Sample Average Approximation is used to solve the model. The utilization of the proposed model allows to identify advantageous tradeoffs between schedule/request discrepancies, i.e., the distance between the allocated schedule and airline requests, and operational delays. This tradeoff can result in substantial reductions of the cost of delays for airlines. In the computational experiments, delays were reduced up to 45% on an instance representing a network of European airports. The second considered phase is the tactical phase, which takes place on the day of operation of flights. At this time, complete flight plans need to be defined, specifying the route and operation times of flights. This is done considering two different sources of uncertainty. First, uncertainty on capacity availability is taken into account, similarly to the strategic phase. However, the number of capacity realization scenarios is now small, as they can be defined using available weather forecasts. The problem of minimizing delay costs considering this source of uncertainty is the Stochastic Air Traffic Flow Management problem. A two-stage stochastic programming model with two alternative formulations is proposed to solve this problem. An ad-hoc heuristic that takes advantage of the good structure of the model is used to solve problem instances within short computation times. The analysis of the Value of the Stochastic Solution shows that the proposed stochastic model can significantly reduce delay costs when bad weather affects the whole network. Second, the implicit uncertainty on the departure time of flights is taken into account. This kind of uncertainty involves operations that may cause a delay on the scheduled departure time of a flight. The flexibility of the scheduled time of departure, as well as the other flight operations, is determined defining time windows within which flights are granted capacity resources to operate. The narrower a time window, the more critical a flight operation. The problem of minimizing delay cost and maximizing time windows is faced by the Air Traffic Flow Management Problem with Time Windows. The problem is formulated with two alternative deterministic models, one of which is able to provide time windows in 40" on average for instances involving over 6,000 flights. Less conservative criteria to reserve capacity within time windows can also be used. Despite not granting the possibility for a flight to execute its operations at every instant of a time window, the implementation of these alternative criteria is shown to be viable. In fact, less than 0.14% of flights were subject to capacity shortages in the analyzed cases. Finally, the operational phase takes place when operations are being executed. The goal at this phase is to manage the final departure times announced by flights - with uncertain information becoming deterministic - allowing them to depart at the announced time even if this time exceeds the assigned departure time window. This problem is named Real Time Flight Rescheduling with Time Windows. Resources are provided to flights that need them by reallocating previously reserved capacity with an algorithm that follows the Ration-By-Schedule mechanism. Both the practical usage of time windows and the impact of collaboration among airlines are studied. While airline collaboration limits time window flexibility up to some time before the scheduled departure of a flight, it can allow to reduce additional flight delays by over 14%. This thesis is a first work that involves determining flight schedules from the moment of their definition to the time of execution of flights. Providing cost reductions by considering the different factors that influence each decision phase can lead to a global improvement of the management of flight operations, whose delays are very expensive in practice for airlines.

Styles APA, Harvard, Vancouver, ISO, etc.

HUNG, HSU-KUAN, et 洪許寬. « Optimization of GPRS Time Slot Allocation ». Thesis, 2001. http://ndltd.ncl.edu.tw/handle/40842257186487983475.

Texte intégral

Résumé :

碩士
國立臺灣大學
資訊管理研究所
89
With the maturity of the wireless networks technology, the demands for the mobile communication become higher and higher. Besides voice communication demands, data transmission applications such as WWW, multimedia are becoming more and more important. The main system of mobile communication is GSM, which is mainly designed for voice and is not suitable for data transmission. In order to satisfy the increasing user requirements, in developing of GSM phase 2+, the ETSI has specified a general packet radio service (GPRS) that accommodates data connections with high bandwidth efficiency. Since GPRS is based on GSM and they use the same physical channels, the allocation of time slot is an academic issue. Different slot allocation policy will cause different revenue, throughput and QoS of the system. In the vendor's point of view, revenue maximization is the main consideration. Thus in this thesis, we want to find a policy to maximize the system revenue according to the users' traffic pattern. We propose two mathematical models to deal with the slot allocation problem in this thesis. The goal of our model is to find a slot allocation policy to maximize the system revenue under the capacity constraint. The main difference between two models is the time type. The first model is continuous-time, and the second model is discrete time. We apply Markovian decision process to solve our problem due to the problem size and the mathematical structure of our model. The computational results are good in our experiments. We can find a slot allocation policy to maximize the system revenue according to users' traffic pattern. Comparison to the policy that the vendors often used, the policy we found has great improvement in system revenue. Thus, our model could provide good decisions for system vendors and network planners.

Styles APA, Harvard, Vancouver, ISO, etc.

CHUANG, HUI-TING, et 莊惠婷. « Optimization of GPRS Time Slot Allocation Considering Call Blocking Probability Constraints ». Thesis, 2002. http://ndltd.ncl.edu.tw/handle/54202451602068361393.

Texte intégral

Résumé :

碩士
國立臺灣大學
資訊管理研究所
90
GPRS is a better solution to mobile data transfer before the coming of 3G network. By using packet-switched technique, one to eight time-slot channels can be dynamically assigned to GPRS users on demand. Because GSM and GPRS users share the same channels and resources, the admission control of different type of traffics is needed to optimize the data channel allocation. The methodology of dynamic slot allocation plays an important role on both maximizing the system revenue and satisfying users’ QoS requirements. We try to find out the best methodology to get the maximum system revenue considering the call blocking probability constraints. We propose two mathematical models to deal with the slot allocation problem in this thesis. The goal of our model is to find a slot allocation policy to maximize the system revenue considering the capacity and the call blocking probability constraints. The main difference between two models is the time type. The first model is discrete-time case, and the other is continuous-time case. Markovian decision process can be applied to solve the problem of maximizing system revenue without the call blocking probability constraints. In order to take the call blocking probability constraints into account, we propose three approaches: linear programming in Markovian decision process, Lagrangian relaxation with Markovian decision process, and the expansion of the Markovian decision process. The most significant and contributive part of this thesis is that we combine the Lagrangian relaxation and the Markovian decision process and use it to successfully solve the Markovian decision process with additional constraints. The computational results are good in our experiments. We can find a slot allocation policy to maximize the system revenue under the call blocking probability constraints. Compared to the policy that the vendors often used, the policy we found has great improvement in system revenue. Thus, our model could provide much better decisions for system vendors and network planners.

Styles APA, Harvard, Vancouver, ISO, etc.

Jeong, Wun-Cheol. « Dynamic time division duplex and time slot allocation strategy for multimedia traffic in wireless applications ». 2002. http://etda.libraries.psu.edu/theses/approved/WorldWideIndex/ETD-188/index.html.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chung, Sung-Hsi, et 鍾松錫. « Interference Analysis and Time Slot Allocation Scheme in the CDMA/TDD System ». Thesis, 2004. http://ndltd.ncl.edu.tw/handle/27140087919447145608.

Texte intégral

Résumé :

碩士
國立成功大學
電機工程學系碩博士班
92
The key advantage of CDMA/TDD system is to accommodate asymmetric traffic by allocating number of uplink and downlink channels. Because both uplink and downlink use the same frequency band in each cell, the different time slot allocation between each cell will causes severe multiusers' interference in the TDD system. If we combine cellular system with directional antenna technique, the directivity of directional antennas can provide an additional degree of freedom for allocating radio resource and improve the system capacity. 　　In this thesis, we provide exact analysis of interference (include the MS-MS, BS-BS and MS-BS interference) according to the different traffic patterns between adjacent cells. From the analytic results, we propose a proper time slot allocation scheme to avoid the multiusers' interference between time slots from neighboring cells and increase the utilization of the radio resource. Then the analytic results are verified by simulation.

Styles APA, Harvard, Vancouver, ISO, etc.

Lu, Po-Hsueh, et 呂柏學. « Time Slot allocation for Improving Energy-Efficiency in Multi-hop Layered WSN ». Thesis, 2011. http://ndltd.ncl.edu.tw/handle/25511881499248368048.

Texte intégral

Résumé :

碩士
國立中山大學
電機工程學系研究所
99
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.

Styles APA, Harvard, Vancouver, ISO, etc.

Tsai, Pei-chi, et 蔡沛圻. « A study on the allocation of the airport time slot for the domestic flight ». Thesis, 1997. http://ndltd.ncl.edu.tw/handle/10354108572479691145.

Texte intégral

Résumé :

碩士
國立交通大學
交通運輸研究所
85
Under the limitation of the airport capacity, except expanding the airport facilities we can also reduce the unfavorable effect of flight delay during peak hours by effective management of the time slot. Current domestic allocation rule is mainly according to the "absolute priorities" and it doesn''t consider the requirement and standpoints of the airport, airlines and passengers; therefore, this study compares the merits and defects of some prevailing allocation rules and takes into account the viewpoints of the three major members of air transportation system (airport, airlines and passengers). Basing on the stability of schedule, capacity of airport, rights of passengers, operational performances of airlines, rights of the newcome and existing airlines, we select seven reasonable criteria for the allocation of time slot. They are grandfather rights, demand of each route, seats of the airplane, load factor, safety records of flying , on-time performance, efficiency of using time slot, respectively.In order to satisfy the "justice" and "reasonableness", this study design a new mode for time slot allocation-"two-stage method". In the first stage, the newcomers of time slot will obtain time slots only when they have better operational performances; besides, they will gain better "time point" in the second stage. As for those who have grandfather rights but don''t have good operational performances will not get the better time points in the second stage and their grandfather rights will decrease by season. Those who have grandfather rights and perform well will keep their original grandfather rights; furthermore, they will increase more time slots. Such an allocation mechanism can push airlines to improve their operational performances and consequently promote the service quality of air transportation.

Styles APA, Harvard, Vancouver, ISO, etc.

Ho, Wen-Hsien, et 何文賢. « A Study of Time Slot Allocation Algorithm to Avoid the Interference in the CDMA/TDD System ». Thesis, 2002. http://ndltd.ncl.edu.tw/handle/06421097363463973213.

Texte intégral

Résumé :

碩士
國立成功大學
電機工程學系碩博士班
90
A Study of Time Slot Allocation Algorithm to Avoid the Interference in the CDMA/TDD System Wen-Hsien Ho* Szu-Lin Su** Department of Electrical Engineering National Cheng Kung University, Tainan, Taiwan,R.O.C Besides considering the priority of the messages, the most important factor that will affect the packet scheduling design of a time-division duplex (TDD) communication system is the inherent capability of unbalanced slot allocation between uplink and downlink channels. This unbalanced allocation function is the major difference on the radio resource management of the air interface between TDD and FDD (frequency-division duplex) systems. Hence, the TDD system will suffer from extra multiusers’ interference (e.g, interference of BS-BS and MS-MS) when compared to the FDD system because of the freedom of time-slot allocation. Such extra multiusers’ interference will become more important, if the TDD scheme is combined with CDMA technique, which has an interference-limited capacity. In this thesis, according to the different traffic patterns between adjacent cells, we analyze the outage probability caused by MS-MS interference and other interference such as BS-BS, MS-BS, BS-MS interference. We propose a proper dynamic channel assignment algorithm by time slot allocation to reduce the multiusers’ interference from adjacent cells. The DCA increase the utilization of the radio resource, and then the analytic results are verified by simulation. * The Author ** The Advisor

Styles APA, Harvard, Vancouver, ISO, etc.

Lin, Li-Yi, et 林岦毅. « A Near-Optimal Time Slot Allocation Algorithm for Wireless Communication Networks under Throughput and Delay Constraints for Multiple Classes of Traffic ». Thesis, 2007. http://ndltd.ncl.edu.tw/handle/49621848169299863093.

Texte intégral

Résumé :

碩士
國立臺灣大學
資訊管理學研究所
95
Wireless communication networks provide convenience, however, also challenges to multimedia services due to typically limited bandwidth and various QoS (Quality-of-Service) requirements. For a wireless communication network service provider/administrator, it is then essential to develop an effective resource allocation policy so as to fully satisfy possibly different QoS requirements by different classes of traffic, while in the meantime, for example, the overall long-term system revenue rate can be maximized. In this thesis, the problem of time slot allocation in wireless communication networks under throughput and delay constraints for multiple classes of traffic is considered. The basic approach to the algorithm development is a novel combination of MDP (Markovian Decision Process) and Lagrangean relaxation. The problem is first formulated as a standard linear-programming form of an MDP problem, however, with additional QoS constraints. Lagrangean relaxation is then applied to relax such QoS constraints. This Lagrangean relaxation problem, after proper regrouping of the terms involved in the objective function, becomes a standard MDP problem (with a new revenue matrix compared with the original problem) and can be solved by standard liner programming techniques or the policy enhancement algorithm. Another primal heuristic based upon the policy enhancement algorithm is also developed for comparison purposed. It is expected that efficient and effective algorithms be developed by the proposed approach.

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Time slot allocation"

Son, Seokho, et Kwang Mong Sim. « Relaxed Time Slot Negotiation for Grid Resource Allocation ». Dans Communications in Computer and Information Science, 25–32. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10549-4_4.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Casazza, Marco, Alberto Ceselli et Lucas Létocart. « Optimizing Time Slot Allocation in Single Operator Home Delivery Problems ». Dans Operations Research Proceedings, 91–97. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-28697-6_14.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Fu, Minglei, Yiluan Zhuang, Maolin He et Zichun Le. « Delay Aware Time Slot Allocation Algorithm in Light-Trail Network ». Dans Internet of Things, 41–48. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32427-7_6.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Louail, Lemia, et Violeta Felea. « Routing-Aware Time Slot Allocation Heuristics in Contention-Free Sensor Networks ». Dans Lecture Notes in Computer Science, 271–83. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33936-8_21.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bjelajac, Branko, et Axel Nöllchen. « Dynamic Transceiver, Carrier and Time-Slot Allocation Strategies for Mobile Satellite Systems ». Dans Mobile and Personal Satellite Communications 2, 270–85. London : Springer London, 1996. http://dx.doi.org/10.1007/978-1-4471-1516-8_21.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Deng, Liping, Hong Jiang, Jie Tian et He Xiao. « Energy-Efficient UAV-Based Communication with Trajectory, Power, and Time Slot Allocation Optimization ». Dans Lecture Notes in Electrical Engineering, 1176–84. Singapore : Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-8411-4_154.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Li, Siqi, Bingbing Zhang, Wenjing Kang, Bo Li, Ruofei Ma et Gongliang Liu. « The Design of Inter-satellite Link Topology Based on Time-Slot Allocation Technology ». Dans Machine Learning and Intelligent Communications, 594–603. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00557-3_59.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Puri, Tamanna, Rama Krishna Challa et Navneet Kaur Sehgal. « Energy-Efficient Delay-Aware Preemptive Variable-Length Time Slot Allocation Scheme for WBASN (eDPVT) ». Dans Proceedings of 2nd International Conference on Communication, Computing and Networking, 183–94. Singapore : Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1217-5_19.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Tizzei, Leonardo P., Marco A. S. Netto et Shu Tao. « Optimizing Multi-tenant Cloud Resource Pools via Allocation of Reusable Time Slots ». Dans Economics of Grids, Clouds, Systems, and Services, 3–17. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-43177-2_1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

« Time-Slot Allocation in Wireless TDMA ». Dans System Performance Evaluation, 219–30. CRC Press, 2000. http://dx.doi.org/10.1201/9781482274530-21.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Time slot allocation"

Kong, Hongwei, Fang Ruan et Chongxi Feng. « Performance analysis of dynamic time-slot allocation system ». Dans Asia-Pacific Optical and Wireless Communications Conference and Exhibit, sous la direction de Wanyi Gu, Jianhui Zhou et Jin-Yi Pan. SPIE, 2001. http://dx.doi.org/10.1117/12.445115.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Neung-Hyung Lee, Keun Chul Hwang, Saewoong Bahk et Kwang Bok Lee. « Optimal time slot allocation for multiuser wireless networks ». Dans 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733). IEEE, 2004. http://dx.doi.org/10.1109/wcnc.2004.1311439.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Azem, Sharif, Anam Tahir et Heinz Koeppl. « Dynamic Time Slot Allocation Algorithm for Quadcopter Swarms ». Dans 2022 IEEE 19th Annual Consumer Communications & Networking Conference (CCNC). IEEE, 2022. http://dx.doi.org/10.1109/ccnc49033.2022.9700712.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Marescaux, T., B. Bricke, P. Debacker, V. Nollet et H. Corporaal. « Dynamic time-slot allocation for QoS enabled networks on chip ». Dans 3rd Workshop on Embedded Systems for Real-Time Multimedia, 2005. IEEE, 2005. http://dx.doi.org/10.1109/estmed.2005.1518069.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Huang, Shao-cheng, Lin-hua Ma, Le Ru, Zhao Cai, Song Zhang et Xing Hu. « Traffic prediction-based dynamic time slot allocation TDMA protocol ». Dans 2015 IEEE International Conference on Computer and Communications (ICCC). IEEE, 2015. http://dx.doi.org/10.1109/compcomm.2015.7387581.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Frank Yeong-Sung Lin, Cheng-Ta Lee et Li-Yi Lin. « An efficient time slot allocation algorithm in wireless networks ». Dans 2010 IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS). IEEE, 2010. http://dx.doi.org/10.1109/wcins.2010.5542311.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Al-Anbagi, Irfan, Melike Erol-Kantarci et Hussein T. Mouftah. « Time slot allocation in WSNs for differentiated smart grid traffic ». Dans 2013 IEEE Electrical Power & Energy Conference (EPEC). IEEE, 2013. http://dx.doi.org/10.1109/epec.2013.6802958.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Shimada, Yuji, Takehiro Sato, Kazumasa Tokuhashi, Hidetoshi Takeshita, Satoru Okamoto et Naoaki Yamanaka. « Optimum Multicast Time Slot Allocation in Active Optical Access Network ». Dans OptoElectronics and Communications Conference and Photonics in Switching. Washington, D.C. : OSA, 2013. http://dx.doi.org/10.1364/oecc_ps.2013.thp2_3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Yang, Ming, et Peter H. J. Chong. « Time Slot Allocation Schemes for Multihop TDD-CDMA Cellular System ». Dans 2007 IEEE Wireless Communications and Networking Conference. IEEE, 2007. http://dx.doi.org/10.1109/wcnc.2007.573.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mahamat, Michael, Hicham Lakhlef, Ahmed Lounis et Youcef Imine. « Optimal Time Slot Allocation for Communicating Things Using Local Clocks ». Dans 2020 International Conference on Software, Telecommunications and Computer Networks (SoftCOM). IEEE, 2020. http://dx.doi.org/10.23919/softcom50211.2020.9238158.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!