Log in

Relevant bibliographies by topics / Slot allocation / Journal articles

To see the other types of publications on this topic, follow the link: Slot allocation.

Journal articles on the topic 'Slot allocation'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Slot allocation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Jihong, Xiang Liu, Xiaohua Zhang, Junliang He, and Lihua Luo. "Optimal Bilateral Cooperative Slot Allocation for Two Liner Carriers under a Co-Chartering Agreement." Journal of Navigation 70, no. 5 (April 17, 2017): 1170–82. http://dx.doi.org/10.1017/s0373463317000200.

Full text

Abstract:

The container liner shipping industry has stepped into an era of international strategic alliances. Important to these liner alliances is the sharing and allocation of container slots between its member carriers. This paper optimises planning of container ship capacity sharing and co-allocation under a co-charting agreement. First, we explain the concept of this business agreement and its implications on maritime operations. Then, we identify key influencing factors that may affect the decisions of cooperative slot co-allocation. The slot co-allocation problem is modelled as an Integer Programming problem and solved using data from two routes between the United States and Asia. The model determines the optimal slot co-allocation strategies between shipping alliance carriers along allied shipping routes. Computational results indicate that the proposed method is effective in obtaining optimal, cooperative slot sharing strategies that can maximise the total system revenue.

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

5

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, no. 1 (March 18, 2021): 1230–35. http://dx.doi.org/10.17762/itii.v9i1.262.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

6

Grunewald, Erik. "Incentive-based Slot Allocation for Airports." Transportation Research Procedia 14 (2016): 3761–70. http://dx.doi.org/10.1016/j.trpro.2016.05.461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chen, Jihong, and Shmuel Yahalom. "Container Slot Co-Allocation Planning with Joint Fleet Agreement in a Round Voyage for Liner Shipping." Journal of Navigation 66, no. 4 (May 23, 2013): 589–603. http://dx.doi.org/10.1017/s0373463313000192.

Full text

Abstract:

In the liner shipping market carriers share container slots to offer better service and realize economies of scale. This paper studies slot co-allocation planning for a joint fleet in a round trip for a shipping alliance in the liner shipping industry. In particular, a conceptual model is developed based on joint fleet and slot co-allocation management. The factors affecting slot co-allocation planning are explored in detail. A large-scale integer programming model is formulated to guide carriers in an alliance in pursuing an optimal slot co-allocation strategy. In contrast to the existing research, this approach leads to a more accurate representation of the situation for cooperative services in the liner shipping market. Extensive numerical experiments based on a true Asia-Europe cooperative route of COSCO and HANJIN show that the proposed model can be efficiently solved by LINGO11.0 for the case study. The computational results suggest that the mechanism and model can be used to benefit carriers in making better decisions in shipping cooperation services.

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

9

Yao, Qi, Lu Xu, and 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 (February 12, 2021): 1–11. http://dx.doi.org/10.1155/2021/6622291.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

10

Ribeiro, Nuno Antunes, Alexandre Jacquillat, António Pais Antunes, and Amedeo Odoni. "Improving slot allocation at Level 3 airports." Transportation Research Part A: Policy and Practice 127 (September 2019): 32–54. http://dx.doi.org/10.1016/j.tra.2019.06.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Abeyratne, Ruwantissa I. R. "Management of airport congestion through slot allocation." Journal of Air Transport Management 6, no. 1 (January 2000): 29–41. http://dx.doi.org/10.1016/s0969-6997(99)00019-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Vasquez-Marquez, Alberto. "American Airlines Arrival Slot Allocation System (ASAS)." Interfaces 21, no. 1 (February 1991): 42–61. http://dx.doi.org/10.1287/inte.21.1.42.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Madas, Michael A., and Konstantinos G. Zografos. "Airport slot allocation: a time for change?" Transport Policy 17, no. 4 (August 2010): 274–85. http://dx.doi.org/10.1016/j.tranpol.2010.02.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Borndörfer, Ralf, Martin Grötschel, Sascha Lukac, Kay Mitusch, Thomas Schlechte, Sören Schultz, and Andreas Tanner. "An Auctioning Approach to Railway Slot Allocation." Competition and Regulation in Network Industries 1, no. 2 (June 2006): 163–96. http://dx.doi.org/10.1177/178359170600100204.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Liu, Lihua, Yaping Zhang, Lan Liu, and Zhiwei Xing. "Congestion Pricing for Aircraft Pushback Slot Allocation." PLOS ONE 12, no. 1 (January 23, 2017): e0170553. http://dx.doi.org/10.1371/journal.pone.0170553.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Picard, P. M., A. Tampieri, and Xi Wan. "Airport capacity and inefficiency in slot allocation." International Journal of Industrial Organization 62 (January 2019): 330–57. http://dx.doi.org/10.1016/j.ijindorg.2017.10.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Caves, Robert E. "Slot allocation: A Proposal for Europe's Airports." Journal of Air Transport Management 2, no. 1 (March 1995): 52–53. http://dx.doi.org/10.1016/0969-6997(95)90019-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Madas, Michael A., and Konstantinos G. Zografos. "Airport slot allocation: From instruments to strategies." Journal of Air Transport Management 12, no. 2 (March 2006): 53–62. http://dx.doi.org/10.1016/j.jairtraman.2005.08.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

20

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

22

Ye, Yufeng, Xiangyin Zhang, Lanfeng Xie, and Kaiyu Qin. "A Dynamic TDMA Scheduling Strategy for MANETs Based on Service Priority." Sensors 20, no. 24 (December 16, 2020): 7218. http://dx.doi.org/10.3390/s20247218.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

23

Ye, ZhiJian, YanWei Li, JingTing Bai, and XinXin Zheng. "Performance Comparing and Analysis for Slot Allocation Model." Information 10, no. 6 (May 31, 2019): 188. http://dx.doi.org/10.3390/info10060188.

Full text

Abstract:

The purpose of this study is to ascertain whether implementation difficulty can be used in a slot allocation model as a new mechanism for slightly weakening grandfather rights; according to which, a linear integer programming model is designed to compare and analyze displacement, implementation difficulty and priority with different weights. Test results show that the implementation difficulty can be significantly reduced without causing excessive displacement and disruption of existing priorities, by weight setting while declared capacity is cleared. In addition to this, whether the movements are listed in order of descending priority or not have great impact on displacement and implementation difficulty within the slot allocation model. Capacity is surely a key factor affecting displacement and implementation difficulties. This study contributes to propose a new mechanism for slightly weakening grandfather right, which can help decision makers to upgrade slot allocation policies.

APA, Harvard, Vancouver, ISO, and other styles

24

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

Full text

Abstract:

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%.

APA, Harvard, Vancouver, ISO, and other styles

25

GAO, Qiang, Jun YAN, and Jingfu ZHU. "Airlines' Optimization Decision of Slot Allocation in CDM." Journal of Transportation Systems Engineering and Information Technology 11, no. 5 (October 2011): 94–98. http://dx.doi.org/10.1016/s1570-6672(10)60144-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Battista, Claudia, Andrea Fumi, Luigi Laura, and Massimiliano M. Schiraldi. "Multiproduct slot allocation heuristic to minimize storage space." International Journal of Retail & Distribution Management 42, no. 3 (March 4, 2014): 172–86. http://dx.doi.org/10.1108/ijrdm-03-2012-0024.

Full text

Abstract:

Purpose – Since developing efficient product-location strategies represents a critical issue in operations management, due to its impact on warehouses performance in terms of both service level and operation costs, this paper aims to focus on possible improvements in the allocation of SKUs, numerically evaluating how these can lead to a reduction of both overall required warehouse space and material handling times. Design/methodology/approach – The undertaken approach focused on translating the warehouse management problem into a vertex colouring problem, modelling it as a multi-criteria problem and solving it through a properly modified algorithm. Findings – The heuristic validation on a real industrial case demonstrated its high optimization potential, and its benchmarking simulations showed performances significantly close to the best conceivable case. Indeed, though using a dedicated storage policy, the gained optimization value turned to be definitively close to the lower bound calculated through a randomized storage policy, which, differently from the proposed solution, must be inevitably supported by a warehouse management system software. Originality/value – This work presents an original multiproduct slot allocation heuristic developed by taking cue from vertex colouring problems and its pragmatic evaluation on a real industrial case; a benchmark with the randomized storage policy is also presented in order to underline the heuristic effectiveness and to point out possible future research opportunities.

APA, Harvard, Vancouver, ISO, and other styles

28

Liao, W., and H. J. Ju. "Adaptive Slot Allocation in DOCSIS-Based CATV Networks." IEEE Transactions on Multimedia 6, no. 3 (June 2004): 479–88. http://dx.doi.org/10.1109/tmm.2004.827498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Pellegrini, P., L. Castelli, and R. Pesenti. "Metaheuristic algorithms for the simultaneous slot allocation problem." IET Intelligent Transport Systems 6, no. 4 (December 1, 2012): 453–62. http://dx.doi.org/10.1049/iet-its.2011.0179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

32

Vranas, Peter B. M. "Optimal Slot Allocation for European Air Traffic Flow Management." Air Traffic Control Quarterly 4, no. 4 (October 1996): 249–80. http://dx.doi.org/10.2514/atcq.4.4.249.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Huang, Tsung Chuan, and Chin Yi Yao. "A slot allocation strategy for clustered ad hoc networks." International Journal of Ad Hoc and Ubiquitous Computing 2, no. 1/2 (2007): 3. http://dx.doi.org/10.1504/ijahuc.2007.011599.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Castelli, Lorenzo, Paola Pellegrini, and Raffaele Pesenti. "Airport slot allocation in Europe: economic efficiency and fairness." International Journal of Revenue Management 6, no. 1/2 (2012): 28. http://dx.doi.org/10.1504/ijrm.2012.044514.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Sohn, Surgwon, and Jong-Jin Jung. "Channel and Time Slot Allocation for Dense RFID Networks." Wireless Personal Communications 73, no. 2 (August 16, 2013): 329–39. http://dx.doi.org/10.1007/s11277-013-1241-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Chun, Youngsub, and Boram Park. "A graph theoretic approach to the slot allocation problem." Social Choice and Welfare 48, no. 1 (June 13, 2016): 133–52. http://dx.doi.org/10.1007/s00355-016-0975-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Parikesit, Danang, Safrilah, and Yusa Permana. "AN ASSESSMENT OF DISINCENTIVE POLICY ON SLOT ALLOCATION SYSTEM IN INDONESIAN AIRPORTS." Journal of Air Transport Studies 7, no. 1 (January 1, 2016): 29–48. http://dx.doi.org/10.38008/jats.v7i1.51.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

38

Rom, Raphael, and Moshe Sidi. "Message Delay Distribution in Generalized Time Division Multiple Access (TDMA)." Probability in the Engineering and Informational Sciences 4, no. 2 (April 1990): 187–202. http://dx.doi.org/10.1017/s0269964800001546.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

39

Ivanov, Nikola, Fedja Netjasov, Radosav Jovanović, Stefano Starita, and Arne Strauss. "Air Traffic Flow Management slot allocation to minimize propagated delay and improve airport slot adherence." Transportation Research Part A: Policy and Practice 95 (January 2017): 183–97. http://dx.doi.org/10.1016/j.tra.2016.11.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

41

Wu, Chien-Yu, Hann-Jang Ho, Sing-Ling Lee, and 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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

42

Lutek, Michał. "Legal aspects of airport slot allocation: a challenge for the European Union." WUT Journal of Transportation Engineering 130 (September 1, 2020): 19–27. http://dx.doi.org/10.5604/01.3001.0014.4984.

Full text

Abstract:

With the increase in the number of operations performed at airports in European Union countries, the problem of allocation of airport slots is becoming more apparent. Legal regulations in this respect were adopted over two decades ago, which means that they are not suitable for the contemporary reality of commercial aviation, which has undergone a huge change during the indicated period. This article aims to analyze the current legal framework for the allocation of slots at the level of international law, with particular emphasis on the European Union law. The main reasons affecting the urgent need to amend the provisions in the presented scope will be discussed. These issues include, for example, the problem of slot trading between air carriers. Also, the impact of the EU response to COVID-19 epidemic on the air carrier’s situation in relation to slots will be outlined. Selected examples illustrating difficulties in applying EU rules will also be analyzed in detail. The summary will be followed by an indication of key de lege ferenda postulates in the discussed area.

APA, Harvard, Vancouver, ISO, and other styles

43

Pushpan, Sangeetha, and Bhanumathi Velusamy. "Fuzzy-Based Dynamic Time Slot Allocation for Wireless Body Area Networks." Sensors 19, no. 9 (May 7, 2019): 2112. http://dx.doi.org/10.3390/s19092112.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

44

Weng, Chenfan, Dingcheng Yang, Jun Wan, Lin Xiao, and Chuanqi Zhu. "Transmission Strategy Design and Resource Allocation in D2D Multicast Cooperative Communications with SWIPT." Wireless Communications and Mobile Computing 2018 (November 1, 2018): 1–10. http://dx.doi.org/10.1155/2018/6790978.

Full text

Abstract:

This paper proposes a new transmission strategy for device-to-device (D2D) multicast cooperative communication systems based on Simultaneous Wireless Information and Power Transfer (SWIPT) technology. The transmission block is divided into two slots. In the first slot, the source user transmits the information and energy to the help user by SWIPT. In the second slot, the help user uses the cellular spectrum and forwards the information to multiple receivers by using harvested energy. In this paper, we aim to maximize the total system rate, and to tackle the problem, we propose a two-step scheme: In the first step, the resource allocation problem is solved by linear programming. In the second step, the power-splitting coefficient value is obtained by taking the benefit of help user into account. Numerical results show that the proposed strategy not only effectively improves the overall throughput and spectrum efficiency but also motivates the cooperation.

APA, Harvard, Vancouver, ISO, and other styles

45

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

46

CHATTERJEE, MAINAK, and SAJAL K. DAS. "PERFORMANCE EVALUATION OF A REQUEST-TDMA/CDMA PROTOCOL FOR WIRELESS NETWORKS." Journal of Interconnection Networks 02, no. 01 (March 2001): 49–67. http://dx.doi.org/10.1142/s0219265901000257.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

47

Fu, Yelin, Lianlian Song, Kin Keung Lai, and Liang Liang. "Slot allocation with minimum quantity commitment in container liner revenue management." International Journal of Logistics Management 27, no. 3 (November 14, 2016): 650–67. http://dx.doi.org/10.1108/ijlm-06-2013-0075.

Full text

Abstract:

Purpose The purpose of this paper is to propose robust optimization models addressing the container slot allocation problem with minimum quantity commitment (MQC) under uncertain demand, which is faced by international companies export to USA. Design/methodology/approach A novel robust optimization approach handling linear programming (LP) with right-hand-side uncertainty is developed by incorporating new parameters: uncertainty level, infeasibility tolerance and reliability level. Two types of uncertainty, namely, bounded uncertainty and symmetric uncertainty are considered, respectively. Findings The present work finds that the expected revenue increases as the uncertainty level and the MQC decrease, as well as the infeasibility tolerance and the reliability level increase, no matter which type of uncertainty is considered. Research limitations/implications Typically, the capacity constraints in a container shipping model should include two major restrictions: (1) number of slots and (2) total weight of loaded and empty containers. However, this study only addresses the first restriction for simplicity. It is recommended that future research explore the optimal solutions with additional restriction (2). Originality/value This paper fills a theoretical and practical gap for the problem of slot allocation with MQC in container liner revenue management. Deterministic and tractable mixed integer LP is formulated to derive robust solutions which immunes to demand uncertainty. Illustrative examples are presented to test the proposed models. The present work provides practical and solid advice and examples which demonstrates the application of the proposed robust optimization approach for logistics managers.

APA, Harvard, Vancouver, ISO, and other styles

48

Khan, Sangrez, Ahmad Naseem Alvi, Mohammad Zubair Khan, Muhammad Awais Javed, Omar H. Alhazmi, and 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, no. 12 (December 2020): 155014772098464. http://dx.doi.org/10.1177/1550147720984645.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

49

Dymond, Simon, Kate McCann, Joanne Griffiths, Amanda Cox, and Victoria Crocker. "Emergent response allocation and outcome ratings in slot machine gambling." Psychology of Addictive Behaviors 26, no. 1 (March 2012): 99–111. http://dx.doi.org/10.1037/a0023630.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Yang, Shangwen, Jingting Zhang, Ping Chen, and Yongjie Yan. "Multiobjective Optimization Model for Collaborative En-Route and Slot Allocation." Mathematical Problems in Engineering 2018 (2018): 1–7. http://dx.doi.org/10.1155/2018/5686281.

Full text

Abstract:

To allocate the en-routes and slots resource to the flights with collaborative decision-making, a multiobjective 0-1 integer programming model was proposed. According to different demands from air traffic control departments, airlines, and passengers, efficiency, equity, and effectiveness principles of collaborative decision-making were considered. With the aim to minimize the total flight delay costs, the total number of turning points, and average delay time of passengers, the effectiveness constraints were achieved. The algorithm was designed to solve the model on the basis of the objective method, and Lingo11 and MatlabR2007b were applied in numerical tests. To test how well the model works in real world, a numerical test was performed based on the simulated data of a civil en-route. Test results show that, compared with the traditional strategy of first come first served, the model gains better effect. The superiority of the model was verified.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!