Articles de revues : « Time slot allocation »

1

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.

2

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.

3

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.

4

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.

5

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.

6

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.

7

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.

8

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.

9

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.

10

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.

11

Han, Shi-Yuan, et Chang-Yue Zhang. « ASMAC : An Adaptive Slot Access MAC Protocol in Distributed VANET ». Electronics 11, n^o 7 (5 avril 2022) : 1145. http://dx.doi.org/10.3390/electronics11071145.

Texte intégral

Résumé :

The media access control (MAC) protocol is responsible for channel resource sharing and conflict management in the communication process in VANET, which is of great significance for ensuring efficient and reliable communication. The existing MAC protocol with fixed time slot allocation cannot solve the problem of time slot resource exhaustion or waste when the traffic density is unbalanced. In this paper, we propose an adaptive time slot access MAC protocol in distributed VANET (ASMAC). ASMAC adapts the access time slot according to the driving direction of the vehicle and the traffic density ratio to improve the time slot access efficiency. In the ASMAC protocol, the frame is divided into several time slots based on TDMA, and the time slots in a frame are divided into two time slot sets according to the driving direction. The vehicle selects a time slot access corresponding to the time slot set. When the vehicle finds that there is no accessible time slot in the time slot set, it accesses the available time slot in the reverse time slot set to improve the efficiency of time slot access. In this paper, the analysis and simulation results of highway and four-way intersection scenarios are given and the validity of the ASMAC protocol is verified by comparing with the VeMAC and SAMD protocols.

Styles APA, Harvard, Vancouver, ISO, etc.

12

Yao, Qi, Lu Xu et Qin Zhang. « Container Slot Allocation for Time-Sensitive Cargo in Maritime Transportation : A One-Phase Model with consideration of Port Congestion ». Discrete Dynamics in Nature and Society 2021 (12 février 2021) : 1–11. http://dx.doi.org/10.1155/2021/6622291.

Texte intégral

Résumé :

This paper studies a container slot allocation problem with dynamic pricing for time-sensitive cargo considering port congestion. Time-sensitive cargo calls for express delivery as soon as possible, and hence a new pricing pattern is proposed considering port congestion. To solve the slot allocation with dynamic pricing issue, a one-phase allocation model which is from different points of view on slot allocation strategy is proposed to formulate this problem. Finally, numerical examples are carried out to test the applicability of the proposed model and solution algorithm.

Styles APA, Harvard, Vancouver, ISO, etc.

13

Liu, Li Hua, Ya Ping Zhang et Yu Wei. « A Pushback Slot Allocation Equilibrium Model Based on Game Theory ». Advanced Materials Research 807-809 (septembre 2013) : 2858–62. http://dx.doi.org/10.4028/www.scientific.net/amr.807-809.2858.

Texte intégral

Résumé :

This paper analyses the relationship between airport and airline, the time slot allocation system is portrayed as a market where the airline can be seen as consumer, airport can be seen as the trader and the goods is the occupied pushback slots of airport. In that case, the generalized nash equilibrium game is presented based on game theory. Taking the Minimize delay as a target, a decision models of airport was established. The pushback slot allocation equilibrium model based on game theory is finnally formed, and a framework for solving the equilibrium solution is proposed.

Styles APA, Harvard, Vancouver, ISO, etc.

14

Zhang, Pengju, Wenping Ge, Yongxing Zhang, Mengyao Gao et Gecheng Zhang. « Energy Efficiency and User Capacity Optimization of Cognitive MIMO Systems Via the SCMA-Based Nonorthogonal Time Slot Allocation ». Symmetry 12, n^o 7 (7 juillet 2020) : 1136. http://dx.doi.org/10.3390/sym12071136.

Texte intégral

Résumé :

This paper investigates the energy-efficient communications and user capacity in the cognitive multiple input multiple output (MIMO) symmetric system of underlay mode. The advantage of the improved energy efficiency provided by the orthogonal slot allocation for time division multiple access (TDMA) has a side effect of restricting the number of users accessing the system. To tackle the above problem, this paper proposes a nonorthogonal time resource allocation method with sparse code multiple access (SCMA), which allows one to convert the orthogonal slot units of TDMA into non-orthogonal shared slot units for multiple secondary users (SUs). The method of adding virtual users is adopted, wherein each SU is treated as multiple SUs who occupy a shared unit, to facilitate the packet access. Finally, the greedy algorithm is applied to optimize the time slot allocation of unoccupied shared slot units. The simulation results show that SCMA-based nonorthogonal slot allocation can reduce not only the energy consumption by nearly 40%, but also the average power interference from SUs to primary users by nearly 2 dB if their number is relatively high. Moreover, in the case of satisfying the rate requirement of the users, the system user capacity increased by more than 50%.

Styles APA, Harvard, Vancouver, ISO, etc.

15

Madas, Michael A., et Konstantinos G. Zografos. « Airport slot allocation : a time for change ? » Transport Policy 17, n^o 4 (août 2010) : 274–85. http://dx.doi.org/10.1016/j.tranpol.2010.02.002.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

16

CHATTERJEE, MAINAK, et SAJAL K. DAS. « PERFORMANCE EVALUATION OF A REQUEST-TDMA/CDMA PROTOCOL FOR WIRELESS NETWORKS ». Journal of Interconnection Networks 02, n^o 01 (mars 2001) : 49–67. http://dx.doi.org/10.1142/s0219265901000257.

Texte intégral

Résumé :

This paper proposes a new medium access control (MAC) protocol, called Request-TDMA/CDMA, for supporting multimedia traffic in wireless networks. In this hybrid protocol, CDMA (code division multiple access) is laid over TDMA (time division multiple access), where a time frame has two kinds of slots, namely data slots and control slots. The data slots are used to the user to transmit their data while the control slot holds the information for the next frame's slot allocation. Each data slot in a frame can be simultaneously used by multiple users with the help of uniquely assigned codes. Whenever a user needs to transmit a message, he first sends a request message to the central controller and enters the contention process. The controller takes into consideration the time of generation of a call, the bit rate requirement and the message length while reserving slots for the entire length of the message generated. The user then goes into the transmission phase if he is successful in the contention process, and continues to transmit his data till the entire message is sent. Three scheduling algorithms for the allocation of data slots are proposed and their performance are studied for four classes of traffic. We also analyze our protocol using a two-dimensional Markov chain model, and compute the state transition probabilities and derive the average waiting time for a given system load. By simulation experiments we show that our request-TDMA/CDMA protocol is able to effectively combine the orthogonality of both time and code division multiplexing. Further enhancements are also proposed to decrease the waiting time and increase the average channel utilization.

Styles APA, Harvard, Vancouver, ISO, etc.

17

Pushpan, Sangeetha, et Bhanumathi Velusamy. « Fuzzy-Based Dynamic Time Slot Allocation for Wireless Body Area Networks ». Sensors 19, n^o 9 (7 mai 2019) : 2112. http://dx.doi.org/10.3390/s19092112.

Texte intégral

Résumé :

With the advancement in networking, information and communication technologies, wireless body area networks (WBANs) are becoming more popular in the field of medical and non-medical applications. Real-time patient monitoring applications generate periodic data in a short time period. In the case of life-critical applications, the data may be bursty. Hence the system needs a reliable energy efficient communication technique which has a limited delay. In such cases the fixed time slot assignment in medium access control standards results in low system performance. This paper deals with a dynamic time slot allocation scheme in a fog-assisted network for a real-time remote patient monitoring system. Fog computing is an extended version of the cloud computing paradigm, which is suitable for reliable, delay-sensitive life-critical applications. In addition, to enhance the performance of the network, an energy-efficient minimum cost parent selection algorithm has been proposed for routing data packets. The dynamic time slot allocation uses fuzzy logic with input variables as energy ratio, buffer ratio, and packet arrival rate. Dynamic slot allocation eliminates the time slot wastage, excess delay in the network and attributes a high level of reliability to the network with maximum channel utilization. The efficacy of the proposed scheme is proved in terms of packet delivery ratio, average end to end delay, and average energy consumption when compared with the conventional IEEE 802.15.4 standard and the tele-medicine protocol.

Styles APA, Harvard, Vancouver, ISO, etc.

18

Ye, Yufeng, Xiangyin Zhang, Lanfeng Xie et Kaiyu Qin. « A Dynamic TDMA Scheduling Strategy for MANETs Based on Service Priority ». Sensors 20, n^o 24 (16 décembre 2020) : 7218. http://dx.doi.org/10.3390/s20247218.

Texte intégral

Résumé :

Physical resource allocation strategy is a key factor affecting the performance of a mobile ad hoc network (MANET), which serves as a network model widely used in the sensor and detection field. For various perceived service information, it is significant for the allocation strategy to adapt to the dynamic service requirements and prioritize resource access for the service information with high priority to guarantee its real-time performance. In this paper, a novel dynamic time division multiple access (TDMA) scheduling strategy is proposed for MANETs. Firstly, a service priority-based dynamic TDMA scheduling (SP-DS) algorithm is presented, which introduces the service priority as a reference factor for slot allocation and fully considers the transmission throughput and end-to-end delay performance. Moreover, for improving the slot use of the whole system, a modified distributed color constraint heuristic (MD-CCH) scheme is presented to optimize the frame structure. The SP-DS and MD-CCH algorithms are combined to form the novel strategy. Simulation results have demonstrated that the proposed strategy has better performance in the slot use, slot allocation efficiency, end-to-end delay and transmission throughput compared with the existing slot allocation algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

19

Wu, Chien-Yu, Hann-Jang Ho, Sing-Ling Lee et Liang Lung Chen. « Fairness Time-Slot Allocation and Scheduling with QoS Guarantees in Multihop WiMAX Mesh Networks ». Mathematical Problems in Engineering 2013 (2013) : 1–14. http://dx.doi.org/10.1155/2013/293962.

Texte intégral

Résumé :

The WiMAX technology has been defined to provide high throughput over long distance communications and support the quality of service (QoS) control applied on different applications. This paper studies the fairness time-slot allocation and scheduling problem for enhancing throughput and guaranteeing QoS in multihop WiMAX mesh networks. For allocating time slots to multiple subscribe stations (SSs), fairness is a key concern. The notion of max-min fairness is applied as our metric to define the QoS-based max-min fair scheduling problem for maximizing the minimum satisfaction ratio of each SS. We formulate an integer linear programming (ILP) model to provide an optimal solution on small-scale networks. For large-scale networks, several heuristic algorithms are proposed for better running time and scalability. The performance of heuristic algorithms is compared with previous methods in the literatures. Experimental results show that the proposed algorithms are better in terms of QoS satisfaction ratio and throughput.

Styles APA, Harvard, Vancouver, ISO, etc.

20

Khan, Sangrez, Ahmad Naseem Alvi, Mohammad Zubair Khan, Muhammad Awais Javed, Omar H. Alhazmi et Safdar Hussain Bouk. « A novel superframe structure and optimal time slot allocation algorithm for IEEE 802.15.4–based Internet of things ». International Journal of Distributed Sensor Networks 16, n^o 12 (décembre 2020) : 155014772098464. http://dx.doi.org/10.1177/1550147720984645.

Texte intégral

Résumé :

IEEE 802.15.4 standard is specifically designed for a low-rate and low-processing Internet of things (IoT) applications and offers guaranteed time slots. A beacon-enabled IEEE 802.15.4 consists of a superframe structure that comprises of the contention access period and contention-free period. During contention-free period, nodes transfer their data using guaranteed time slots without any collision. The coordinator node receives data transmission requests in one cycle and allocates guaranteed time slots to the nodes in the next cycle. This allocation process may cause large delay that may not be acceptable for few applications. In this work, a novel superframe structure is proposed that significantly reduces guaranteed time slots allocation delay for the nodes with data requests. The proposed superframe structure comprises of two contention access periods and one contention-free period, where contention-free period precedes both contention access periods with reduced slot size. In addition, the knapsack algorithm is modified for better guaranteed time slots allocation by allowing more guaranteed time slots requesting nodes to send their data as compared to the IEEE 802.15.4 standard. The simulation and analytical results show that the proposed superframe structure reduces the network delay by up to 80%, increases contention-free period utilization up to 50%, and allocates guaranteed time slots up to 16 nodes in a single superframe duration.

Styles APA, Harvard, Vancouver, ISO, etc.

21

Derakhshan-Barjoei, Pouya, Gholamreza Dadashzadeh, Farbod Razzazi et S. Mohammad Razavizadeh. « Power and Time Slot Allocation in Cognitive Relay Networks Using Particle Swarm Optimization ». Scientific World Journal 2013 (2013) : 1–9. http://dx.doi.org/10.1155/2013/424162.

Texte intégral

Résumé :

The two main problems in cognitive radio networks are power and time slot allocation problems which require a precise analysis and guarantee the quality of service in both the primary and secondary users. In this paper, these two problems are considered and a method is proposed to solve the resulting optimization problem. Our proposed method provides an improved performance in solving the constrained nonlinear multiobject optimization for the power control and beamforming in order to reach the maximum capacity and proper adaption of time slots, and as a result a new scheme for joint power and time slot allocation in cognitive relay networks is proposed. We adopt space diversity access as the secondary users access scheme and divide the time between multiple secondary users according to their contribution to primary user’s transmission. Helping primary users provides more opportunities for secondary users to access the channel since the primary users can release the channel sooner. In contrast, primary network leases portion of channel access time to the secondary users for their transmission using particle swarm optimization (PSO). Numerical studies show good performance of the proposed scheme with a dynamic cost function in a nonstationary environment.

Styles APA, Harvard, Vancouver, ISO, etc.

22

Corolli, Luca, Guglielmo Lulli et Lewis Ntaimo. « The time slot allocation problem under uncertain capacity ». Transportation Research Part C : Emerging Technologies 46 (septembre 2014) : 16–29. http://dx.doi.org/10.1016/j.trc.2014.05.004.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Hać, Anna. « Network time slot allocation in an intelligent network ». International Journal of Network Management 8, n^o 1 (janvier 1998) : 57–63. http://dx.doi.org/10.1002/(sici)1099-1190(199801/02)8:1<57 ::aid-nem267>3.0.co;2-0.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

24

CAI, Hui-juan, et Wen-xian JIANG. « IEEE802.15.4 guaranteed time slot performance analysis and allocation optimization under multi-slot ». Journal of Computer Applications 32, n^o 12 (30 mai 2013) : 3499–504. http://dx.doi.org/10.3724/sp.j.1087.2012.03499.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

25

Parikesit, Danang, Safrilah et Yusa Permana. « AN ASSESSMENT OF DISINCENTIVE POLICY ON SLOT ALLOCATION SYSTEM IN INDONESIAN AIRPORTS ». Journal of Air Transport Studies 7, n^o 1 (1 janvier 2016) : 29–48. http://dx.doi.org/10.38008/jats.v7i1.51.

Texte intégral

Résumé :

Indonesian airports have been experiencing significant air traffic growth and are unable to cope with the increasing air passenger demand. There is an urgent need for an effective slot allocation strategy to manage the demand for airport capacity. This paper conducts a case study to examine the possibility of managing slot time allocation to maximize runways capacity by analyzing disincentive strategy in balancing the usage of runways with Capacity Restraint and Demand Balanced approach. The research found that airlines willing to use slot time at the most demanded time interval should pay an additional 6.57% (CR approach) from total revenue gained by the government from slot sector and 6.55% (DB approach). The additional cost for less demanded slot time interval is only 0.09% (in both CR and DB approaches). Findings from this study should be considered as an initial step toward educating policy makers and airport authorities with the aims to creating better mechanism in Indonesia’s airspace market.

Styles APA, Harvard, Vancouver, ISO, etc.

26

Carreras-García, Danae, David Delgado-Gómez, Enrique Baca-García et Antonio Artés-Rodriguez. « A Probabilistic Patient Scheduling Model with Time Variable Slots ». Computational and Mathematical Methods in Medicine 2020 (1 septembre 2020) : 1–10. http://dx.doi.org/10.1155/2020/9727096.

Texte intégral

Résumé :

One of the current challenges faced by health centers is to reduce the number of patients who do not attend their appointments. The existence of these patients causes the underutilization of the center’s services, which reduces their income and extends patient’s access time. In order to reduce these negative effects, several appointment scheduling systems have been developed. With the recent availability of electronic health records, patient scheduling systems that incorporate the patient’s no-show prediction are being developed. However, the benefits of including a personalized individual variable time slot for each patient in those probabilistic systems have not been yet analyzed. In this article, we propose a scheduling system based on patients’ no-show probabilities with variable time slots and a dynamic priority allocation scheme. The system is based on the solution of a mixed-integer programming model that aims at maximizing the expected profits of the clinic, accounting for first and follow-up visits. We validate our findings by performing an extensive simulation study based on real data and specific scheduling requirements provided by a Spanish hospital. The results suggest potential benefits with the implementation of the proposed allocation system with variable slot times. In particular, the proposed model increases the annual cumulated profit in more than 50% while decreasing the waiting list and waiting times by 30% and 50%, respectively, with respect to the actual appointment scheduling system.

Styles APA, Harvard, Vancouver, ISO, etc.

27

Zhecheng, Zhu. « Analysis of Slot Allocation Strategies and their Impacts on Appointment Waiting Time in Context of Outpatient Clinics ». International Journal of Healthcare Delivery Reform Initiatives 3, n^o 3 (juillet 2011) : 29–41. http://dx.doi.org/10.4018/jhdri.2011070103.

Texte intégral

Résumé :

One prevailing problem in outpatient clinics with appointment systems in Singapore is that patients have to wait a long time for an available slot once they make requests. Such a long wait may negatively impact on the access to healthcare facilities, patient safety and satisfaction, etc. In recent years, such a problem is becoming worse due to the aging society and growing population. Besides the pressure of increasing demand, healthcare service providers in outpatient clinics are facing other challenges such as the complexity of patient request types, e.g., urgent or normal requests, requests for new or follow-up visit, etc. How to allocate the limited slots to meet the requirements of different requests is one of the performance measurements in outpatient clinics. In this paper, discrete event simulation is applied to study different slot allocation strategies and their impacts on waiting time. The dynamics between new visits and follow-up visits are analyzed as well.

Styles APA, Harvard, Vancouver, ISO, etc.

28

Lee, Jung Hoon, et Ji Hyun Kang. « Performance Analysis of a V2G Brokering Agent ». Applied Mechanics and Materials 686 (octobre 2014) : 634–38. http://dx.doi.org/10.4028/www.scientific.net/amm.686.634.

Texte intégral

Résumé :

This paper first presents a brokering architecture for a vehicle-to-grid electricity trades between electric vehicles and a microgrid, and then measures its performance, particularly focusing on the stay time, which significantly affects the scheduling flexibility. The brokering service matches demand and supply on battery-stored energy, traversing the search space to find an energy allocation for each time slot. The slot-by-slot schedule, generated from the two-way interaction protocol, coordinates the arrival time of each seller at the microgrid, achieving temporal and spatial power load shift. The performance measurement based on a prototype implementation analyzes the effect on the lacking and surplus energy, the demand meet ratio, and the effective consumption ratio. The experiment result shows that the brokering scheme can fully take advantage of enhanced flexibility in placing available energy on the time slots, reducing the lacking amount by up to 38.4 % as well as enhancing the consumption ratio by up to 27 % for the given parameter set.

Styles APA, Harvard, Vancouver, ISO, etc.

29

Ahamada, Youssouf, Salimata G. Diagne, Amadou Coulibaly, D'ethi'e Dione, N'dogotar Nlio et Youssou Gningue. « Modeling and Resolution of the Allocation Problem of the Time Slots in Dakar Airport ». Journal of Mathematics Research 9, n^o 3 (17 mai 2017) : 30. http://dx.doi.org/10.5539/jmr.v9n3p30.

Texte intégral

Résumé :

In this article, we proposed a programming linear model in integer numbers(PLIN) for the optimal allocation of the time slots in the international Leopold Sedar Senghor airport of Dakar (L.S.S). The slots are specific allocated periods which allow an aircraft to land or take off in a saturated airport. Their attribution depends on theconfiguration of the airport, more particularly on its capacity. We maximize the confirmed demand in each slot and take the number of aircrafts and the number of manageable passengers with an optimal quality service into account. We used the CPLEX software so that to test the effectiveness of the linear model. Firstly, in the proposed model linear in integer numbers, any unmet demand was isolated. Secondly, the rejected demands by introducing a model and an algorithm of resolution based on the dynamic programming.

Styles APA, Harvard, Vancouver, ISO, etc.

30

Matsumoto, Shigeru. « Daily Habits and Energy Consumption : Go to Bed Earlier for Environmental Protection ». European Journal of Sustainable Development 8, n^o 4 (1 octobre 2019) : 54. http://dx.doi.org/10.14207/ejsd.2019.v8n4p54.

Texte intégral

Résumé :

Energy consumption reduction in the residential sector is crucial for mitigating global warming. This has prompted researchers to investigate the determinants of household energy consumption from various aspects. However, previous studies have not examined the impact of time allocation on energy consumption, primarily because of the lack of surveys that simultaneously examine time allocation and energy consumption. We conducted an original survey of 547 Japanese households to examine whether time allocation affects their electricity consumption. We divided a 48-hour period into 192 time slots and asked the households to choose one of the 20 types of actions listed for each slot. We also collected information on the socioeconomic background and electricity consumption of the households. After controlling for various factors that affect household electricity consumption, we examined whether time allocation determines electricity consumption. The empirical result of our study revealed that while a married male’s bedtime does not affect electricity consumption, a married female’s bedtime does. This suggests that it is essential to understand the daily habits of consumers for proposing effective energy conservation measures.Keywords: Electricity Usage, Household, Time Allocation

Styles APA, Harvard, Vancouver, ISO, etc.

31

Sohn, Surgwon, et Jong-Jin Jung. « Channel and Time Slot Allocation for Dense RFID Networks ». Wireless Personal Communications 73, n^o 2 (16 août 2013) : 329–39. http://dx.doi.org/10.1007/s11277-013-1241-6.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Hu, Yifan, Mingang Liu et Yizhi Feng. « Resource Allocation for SWIPT Systems with Nonlinear Energy Harvesting Model ». Wireless Communications and Mobile Computing 2021 (6 avril 2021) : 1–9. http://dx.doi.org/10.1155/2021/5576356.

Texte intégral

Résumé :

In this paper, we study the resource allocation for simultaneous wireless information and power transfer (SWIPT) systems with the nonlinear energy harvesting (EH) model. A simple optimal resource allocation scheme based on the time slot switching is proposed to maximize the average achievable rate for the SWIPT systems. The optimal resource allocation is formulated as a nonconvex optimization problem, which is the combination of a series of nonconvex problems due to the binary feature of the time slot-switching ratio. The optimal problem is then solved by using the time-sharing strong duality theorem and Lagrange dual method. It is found that with the proposed optimal resource allocation scheme, the receiver should perform EH in the region of medium signal-to-noise ratio (SNR), whereas switching to information decoding (ID) is performed when the SNR is larger or smaller. The proposed resource allocation scheme is compared with the traditional time switching (TS) resource allocation scheme for the SWIPT systems with the nonlinear EH model. Numerical results show that the proposed resource allocation scheme significantly improves the system performance in energy efficiency.

Styles APA, Harvard, Vancouver, ISO, etc.

33

Chang, Yimei, Xiaoning Zhu et Ali Haghani. « The outbound container slot allocation based on the stowage plan in rail–water intermodal container terminals ». Measurement and Control 52, n^o 5-6 (17 avril 2019) : 509–25. http://dx.doi.org/10.1177/0020294019842599.

Texte intégral

Résumé :

In the past, most researchers focused on the storage space allocation problem or container block allocation problem in maritime container terminals, while few studied the container slot allocation problem in rail–water intermodal container terminals. Container slot allocation problem is proposed to reduce relocation operations of containers in railway container yards and improve the efficiency of rail–water intermodal container terminals. In this paper, a novel outbound container slot allocation model is introduced to reduce the rehandling operations, considering stowage plan, containers left from earlier planning periods and container departure time. A novel heuristic algorithm based on the rolling planning horizon approach is developed to solve the proposed problem effectively. Computational experiments are carried out to validate that the proposed model and algorithm are feasible and effective to enhance the storage effect. Meanwhile, some other experiments are conducted to verify that our approach is better than the regular allocation approach, which is a common method in marine and railway container terminals, and container weight is the most important influence factor when storing containers.

Styles APA, Harvard, Vancouver, ISO, etc.

34

Jia, Gu, Yu Wen Wang, Fan Ji Meng, Guo Hua Ye et Guo Lin Wang. « An Adaptive TDMA Slot Assignment Algorithm for Scalable Wireless Mesh Networks ». Applied Mechanics and Materials 392 (septembre 2013) : 872–75. http://dx.doi.org/10.4028/www.scientific.net/amm.392.872.

Texte intégral

Résumé :

The media access control (MAC) protocol based on fixed slot allocation has low throughput and high delay in high load wireless mesh network. In order to improve the performance of wireless mesh network, we propose a scalable adaptive time division multiple access (TDMA) slot allocation algorithm based on the existing fixed TDMA. The algorithm uses the network structure of clustering and builds a more optimized frame structure, cluster head dynamically allocates time slot according to the packet number of the cluster member sent and the priority level, at the same time taking into account the situation of nodes joining and leaving to improve the scalability of the network The simulation results on OPNET network simulation platform show that the algorithm is superior to fixed TDMA algorithm in both throughput and delay.

Styles APA, Harvard, Vancouver, ISO, etc.

35

Wang, Tao, Chao Ma, Yanzan Sun, Shunqing Zhang et Yating Wu. « Energy Efficiency Maximized Resource Allocation for Opportunistic Relay-Aided OFDMA Downlink with Subcarrier Pairing ». Wireless Communications and Mobile Computing 2018 (29 mai 2018) : 1–10. http://dx.doi.org/10.1155/2018/9046847.

Texte intégral

Résumé :

This paper studies the energy efficiency (EE) maximization for an orthogonal frequency division multiple access (OFDMA) downlink network aided by a relay station (RS) with subcarrier pairing. A highly flexible transmission protocol is considered, where each transmission is executed in two time slots. Every subcarrier in each slot can either be used in direct mode or be paired with a subcarrier in another slot to operate in relay mode. The resource allocation (RA) in such a network is highly complicated, because it has to determine the operation mode of subcarriers, the assignment of subcarriers to users, and the power allocation of the base station and RS. We first propose a mathematical description of the RA strategy. Then, a RA algorithm is derived to find the globally optimum RA to maximize the EE. Finally, we present extensive numerical results to show the impact of minimum required rate of the network, the user number, and the relay position on the maximum EE of the network.

Styles APA, Harvard, Vancouver, ISO, etc.

36

Bo, Zeng, Yabo Dong, Jie He et Lu Dongming. « An Energy-Efficient One-Shot Scheduling Algorithm for Wireless Sensor Networks ». Journal of Sensors 2021 (22 novembre 2021) : 1–15. http://dx.doi.org/10.1155/2021/9999403.

Texte intégral

Résumé :

In low-load wireless sensor networks, the power consumption of the node consists mainly of two parts: data transmission and node state switching. The lower node workload causes low energy consumption on data transmission, and the state switching energy of the node cannot be ignored. This paper proposes a one-shot time division multiple access (TMDA) scheduling with unlimited channels (SUC) on the assumption that the number of available channels is unlimited. SUC combines the receiver-based consecutive slot allocation with channel allocation, which minimises the number of node state switching and optimizes energy efficiency. Theoretical analysis demonstrates that the number of channels required by SUC does not exceed log 2 N + 1 , where N indicates the number of nodes. Seeing that the number of available wireless channels is limited in practice, the paper proposes the scheduling with limited channels (SLC) and uses a Lookahead Search mechanism to solve slot conflict. For the scalability of the algorithm, a distributed implementation based on the token change is proposed. The algorithm uses the depth-first-search (DFS) to pass the token to all nodes and terminates slot and channel assignment. The simulation results show our algorithm can reduce the energy consumption by minimizing the number of state switching and shorten the data aggregation time by reusing slots among nodes.

Styles APA, Harvard, Vancouver, ISO, etc.

37

Jana, Ayanabha. « Modified CSMA/CD protocol using a time slot allocation device ». International Journal of Scientific and Research Publications (IJSRP) 9, n^o 11 (24 novembre 2019) : p9596. http://dx.doi.org/10.29322/ijsrp.9.11.2019.p9596.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

38

Wha Sook Jeon et Dong Geun Jeong. « Comparison of time slot allocation strategies for CDMA/TDD systems ». IEEE Journal on Selected Areas in Communications 18, n^o 7 (juillet 2000) : 1271–78. http://dx.doi.org/10.1109/49.857927.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

39

Mondal, Sakib A. « Resource allocation problem under single resource assignment ». RAIRO - Operations Research 52, n^o 2 (avril 2018) : 371–82. http://dx.doi.org/10.1051/ro/2017035.

Texte intégral

Résumé :

We consider a NP-hard resource allocation problem of allocating a set of resources to meet demands over a time period at the minimum cost. Each resource has a start time, finish time, availability and cost. The objective of the problem is to assign resources to meet the demands so that the overall cost is minimum. It is necessary that only one resource contributes to the demand of a slot. This constraint will be referred to as single resource assignment (SRA) constraint. We would refer to the problem as the S_RA problem. So far, only 16-approximation to this problem is known. In this paper, we propose an algorithm with approximation ratio of 12.

Styles APA, Harvard, Vancouver, ISO, etc.

40

Park, Jaesung, et Yujin Lim. « Online Service-Time Allocation Strategy for Balancing Energy Consumption and Queuing Delay of a MEC Server ». Applied Sciences 12, n^o 9 (29 avril 2022) : 4539. http://dx.doi.org/10.3390/app12094539.

Texte intégral

Résumé :

MEC servers (MESs) support multiple queues to accommodate the delay requirements of tasks offloaded from end devices or transferred from other MESs. The service time assigned to each queue trades off the queue backlog and energy consumption. Because multiple queues share the computational resources of a MES, optimally scheduling the service time among them is important, reducing the energy consumption of a MES and ensuring the delay requirement of each queue. To achieve a balance between these metrics, we propose an online service-time allocation method that minimizes the average energy consumption and satisfies the average queue backlog constraint. We employ the Lyapunov optimization framework to transform the time-averaged optimization problem into a per-time-slot optimization problem and devise an online service-time allocation method whose time complexity is linear to the number of queues. This method determines the service time for each queue at the beginning of each time slot using the observed queue length and expected workload. We adopt a long short-term memory (LSTM) deep learning model to predict the workload that will be imposed on each queue during a time slot. Using simulation studies, we verify that the proposed method strikes a better balance between energy consumption and queuing delay than conventional methods.

Styles APA, Harvard, Vancouver, ISO, etc.

41

Shi, Ke, Lin Zhang, Zhiying Qi, Kang Tong et Hongsheng Chen. « Transmission Scheduling of Periodic Real-Time Traffic in IEEE 802.15.4e TSCH-Based Industrial Mesh Networks ». Wireless Communications and Mobile Computing 2019 (22 septembre 2019) : 1–12. http://dx.doi.org/10.1155/2019/4639789.

Texte intégral

Résumé :

Time-slotted channel hopping (TSCH) is a part of an emerging IEEE 802.15.4e standard to enable deterministic low-power mesh networking, which offers high reliability and low latency for wireless industrial applications. Nonetheless, the standard only provides a framework, but it does not mandate a specific scheduling mechanism for time and frequency slot allocation. This paper focuses on a centralized scheme to schedule multiple concurrent periodic real-time flows in TSCH networks with mesh topology. In our scheme, each flow is assigned a dynamic priority based on its deadline and the hops remaining to reach the destination. A maximum matching algorithm is utilized to find conflict-free links, which provides more chances to transfer high-priority flows at each time slot. Frequency allocation is implemented by graph coloring to make finally selected links interference free. Simulation results show that our algorithm clearly outperforms the existing algorithms on the deadline satisfaction ratio with a similar radio duty cycle.

Styles APA, Harvard, Vancouver, ISO, etc.

42

Junker, Ulrich. « Air traffic flow management with heuristic repair ». Knowledge Engineering Review 27, n^o 3 (26 juillet 2012) : 333–42. http://dx.doi.org/10.1017/s0269888912000240.

Texte intégral

Résumé :

AbstractThe European air traffic flow management problem poses particular challenges on optimization technology as it requires detailed modelling and rapid online optimization capabilities. Constraint programming proved successful in addressing these challenges for departure time slot allocation by offering fine-grained modelling of resource constraints and fast allocation through heuristic-repair strategies.

Styles APA, Harvard, Vancouver, ISO, etc.

43

Tung, Tran Van, To Truong An et Byung Moo Lee. « Joint Resource and Trajectory Optimization for Energy Efficiency Maximization in UAV-Based Networks ». Mathematics 10, n^o 20 (17 octobre 2022) : 3840. http://dx.doi.org/10.3390/math10203840.

Texte intégral

Résumé :

The explosive growth of unmanned aerial vehicles (UAVs)-based networks has accelerated in recent years. One of the crucial tasks of a UAV-based network is managing and allocating resources, including time, power, fly trajectory, and energy resources. We investigate a UAV-based network that gathers information from smart devices, sensor devices, and IoT devices (IDs) with respect to energy efficiency (EE) maximization. The EE of users served by the UAV over the time slots of a cycle is maximized through three categories: UAV trajectory optimization, power allocation, and time slot assignment. However, these are non-convex problems that are very difficult to solve. To solve the problem efficiently, we divide it step by step and convert the non-convex optimization problem into an equivalent convex optimization problem, optimizing each equivalent problem over each variable while other variables are fixed. Firstly, we perform a UAV trajectory optimization with a different number of ground users. Secondly, the Dinkelbach method is used to construct a non-convex fractional power allocation problem. In addition, we develop an algorithm to distribute time slots to all users, which continually raises the EE value. Eventually, a scheme is provided to sequentially update the method to each equivalent problem. The numerical results provide evidence that by solving the proposed sum-rate maximization problem, the performance of ground users has significantly improved with the support of the UAV-based network.

Styles APA, Harvard, Vancouver, ISO, etc.

44

Al-Absi, Ahmed Abdulhakim, Mohammed Abdulhakim Al-Absi, Mangal Sain et Hoon Jae Lee. « Channel Allocation for Connected Vehicles in Internet of Things Services ». Sensors 21, n^o 11 (24 mai 2021) : 3646. http://dx.doi.org/10.3390/s21113646.

Texte intégral

Résumé :

Based on the existing Internet of Vehicles communication protocol and multi-channel allocation strategy, this paper studies the key issues with vehicle communication. First, the traffic volume is relatively large which depends on the environment (city, highway, and rural). When many vehicles need to communicate, the communication is prone to collision. Secondly, because the traditional multi-channel allocation method divides the time into control time slots and transmission time slots when there are few vehicles, it will cause waste of channels, also when there are more vehicles, the channels will not be enough for more vehicles. However, to maximize the system throughput, the existing model Enhanced Non-Cooperative Cognitive division Multiple Access (ENCCMA) performs amazingly well by connected the Cognitive Radio with Frequency Division Multiple Access (FDMA) and Time Division Multiple Access (TDMA) for a multi-channel vehicular network.However, this model induces Medium Access Control (MAC) overhead and does not consider the performance evaluation in various environmental conditions.Therefore, this paper proposes a Distributed Medium Channel Allocation (DMCA) strategy, by dividing the control time slot into an appointmentand a safety period in the shared channel network. SIMITS simulator was used for experiment evaluation in terms of throughput, collision, and successful packet transmission. However, the outcome shows that our method significantly improved the channel utilizationand reduced the occurrence of communication overhead.

Styles APA, Harvard, Vancouver, ISO, etc.

45

Mo, Jinrong, Shengbo Hu, Tingting Yan, Xiaowei Song et Yanfeng Shi. « Transmit Power Allocation with Connectivity Probability for Multi-QoS in Cluster Flight Spacecraft Network ». Wireless Communications and Mobile Computing 2020 (17 février 2020) : 1–11. http://dx.doi.org/10.1155/2020/8676835.

Texte intégral

Résumé :

In this paper, we investigate the transmit power allocation problem to minimize the average packet error rate at the access point in the cluster flight spacecraft network, which adopts the CSMA/CA channel access mechanism. First, the node mobility, nodal distance distribution, and probabilistic adjacency matrix were formulated for cluster flight spacecraft network based on twin-satellite mode. Then, the optimization-theoretic model described the optimized transmit power allocation strategy and its implementation algorithm was proposed. And the problem of minimizing the packet error rate of the cluster flight spacecraft network system can be converted into maximizing the expectation of the binary probabilistic adjacency matrix, i.e., maximizing the sum of the nondiagonal elements in the probabilistic adjacency matrix. Due to discreteness of nodal distance distribution, Monte Carlo method was applied to solve the transmit power allocation problem. Yet importantly, the influence of node transmit power on the QoS performance of cluster flight spacecraft network was simulated and analyzed under the assumption of finite overall network transmit power and low traffic load. Finally, the results show that the pocket error rate increases with the provided traffic load, but the pocket error rate hardly changes with the same traffic load in different sequential time slots of any orbital hyperperiod or in the same time slot of different orbital hyperperiods, and by maximizing the sum of the nondiagonal elements in the probabilistic adjacency matrix, the pocket error rate minimum is achieved for a given total network transmit power at any time slot for cluster flight spacecraft network.

Styles APA, Harvard, Vancouver, ISO, etc.

46

Dong Geun Jeong et Wha Sook Jeon. « Time slot allocation in CDMA/TDD systems for mobile multimedia services ». IEEE Communications Letters 4, n^o 2 (février 2000) : 59–61. http://dx.doi.org/10.1109/4234.824756.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

47

Karaenke, Paul, Martin Bichler, Soeren Merting et Stefan Minner. « Non-monetary coordination mechanisms for time slot allocation in warehouse delivery ». European Journal of Operational Research 286, n^o 3 (novembre 2020) : 897–907. http://dx.doi.org/10.1016/j.ejor.2020.03.068.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

48

Zhang, Q., Z. Feng, C. He et P. Zhang. « Dynamic time slot allocation for cooperative relay in cognitive radio networks ». Electronics Letters 46, n^o 13 (2010) : 953. http://dx.doi.org/10.1049/el.2010.1053.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

49

Ching-Chih Han, Chao-Ju Hou et K. G. Shin. « On slot allocation for time-constrained messages in dual-bus networks ». IEEE Transactions on Computers 46, n^o 7 (juillet 1997) : 756–67. http://dx.doi.org/10.1109/12.599896.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

50

Urmonov, Odilbek, et HyungWon Kim. « Highly Reliable MAC Protocol Based on Associative Acknowledgement for Vehicular Network ». Electronics 10, n^o 4 (4 février 2021) : 382. http://dx.doi.org/10.3390/electronics10040382.

Texte intégral

Résumé :

IEEE 1609/802.11p standard obligates each vehicle to broadcast a periodic basic safety message (BSM). The BSM message comprises a positional and kinematic information of a transmitting vehicle. It also contains emergency information that is to be delivered to all the target receivers. In broadcast communication, however, existing carrier sense multiple access (CSMA) medium access control (MAC) protocol cannot guarantee a high reliability as it suffers from two chronic problems, namely, access collision and hidden terminal interference. To resolve these problems of CSMA MAC, we propose a novel enhancement algorithm called a neighbor association-based MAC (NA-MAC) protocol. NA-MAC utilizes a time division multiple access (TDMA) to distribute channel resource into short time-intervals called slots. Each slot is further divided into three parts to conduct channel sensing, slot acquisition, and data transmission. To avoid a duplicate slot allocation among multiple vehicles, NA-MAC introduces a three-way handshake process during slot acquisition. Our simulation results revealed that NA-MAC improved packet reception ratio (PRR) by 19% and successful transmission by 30% over the reference protocols. In addition, NA-MAC reduced the packet collisions by a factor of 4. Using the real on-board units (OBUs), we conducted an experiment where our protocol outperformed in terms of PRR and average transmission interval by 82% and 49%, respectively.

Styles APA, Harvard, Vancouver, ISO, etc.

Articles de revues sur le sujet « Time slot allocation »

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