Offline and online broadcast scheduling algorithms for file broadcast in mobile WiMAX

2012 ◽  
Author(s):  
Hamid Karimi ◽  
Saleh Yousefi ◽  
Maghsud Solimanpur ◽  
Raman Khenanisho
Keyword(s):  
Scheduling Algorithms ◽  
Mobile Wimax ◽  
Broadcast Scheduling

scholarly journals An Effective Approach to Contention Based Bandwidth Request Mechanism in WiMAX Networks

2012 ◽  
Vol 3 (1) ◽  
pp. 106-112
Author(s):  
Sonia Panchal ◽  
Satinder Pal
Keyword(s):  
Quality Of Service ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Research Area ◽  
Mobile Wimax ◽  
Service Provisioning ◽  
Bandwidth Request ◽  
Wimax Networks ◽  
Contention Period

In this paper the IEEE 802.16 standard based Mobile WiMAX (Worldwide Interoperability for Microwave Access) system is investigated for the purpose of Quality of Service provisioning. As a potential solution, scheduling algorithms have been taken into major concern. Within the pool of scheduling algorithms and for the purpose Contention based bandwidth request resolution, the Modified Contention Based BW Resolution algorithm (MCB-BWR-Scheme) is proposed. Supported by the fact that the standard does not emphasize a specific scheduling algorithm for contention period based services, therefore, the choice of the scheduling algorithm for the WiMAX systems is very important. There are several scheduling algorithms for WiMAX in the literature, however, studies show that an efficient, fair and robust scheduling algorithm for WiMAX systems is still an open research area and hence a well thought out algorithm will be of great contribution to the area under investigation. Results from the OPNET Modeler simulation program show that the adjusted algorithm works well with delay and throughput constraints. It is also in consistent with the quality of service demands of the video and voice traffic.

Optimal broadcast scheduling method for VANETs: An adaptive discrete firefly approach

2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho
Keyword(s):  
Intelligent Transportation System ◽  
Search Algorithm ◽  
Mac Protocol ◽  
High Mobility ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Traffic Density ◽  
Scheduling Problem ◽  
Broadcast Scheduling

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.

Sign in / Sign up

Export Citation Format

Share Document