scholarly journals On local approximation of minimum-latency broadcast scheduling in 3D MANETs

2011 ◽  
Author(s):  
Yilin Shen ◽  
Ying Xuan ◽  
My T. Thai
Keyword(s):  
Local Approximation ◽  
Broadcast Scheduling ◽  
Minimum Latency

BROADCAST SCHEDULING PROBLEM IN SINR MODEL

2014 ◽  
Vol 25 (03) ◽  
pp. 331-342 ◽  
Author(s):  
NHAT LAM ◽  
MIN KYUNG AN ◽  
DUNG T. HUYNH ◽  
TRAC NGUYEN
Keyword(s):  
Power Control ◽  
Power Level ◽  
Sensor Nodes ◽  
Scheduling Problem ◽  
Broadcast Scheduling ◽  
Power Assignment ◽  
Assignment Model ◽  
Minimum Latency ◽  
Sinr Model ◽  
Np Hardness

Our work is to study the Minimum Latency Broadcast Scheduling problem in the geometric SINR model with power control. With power control, sensor nodes have the ability to adjust transmitting power. While existing works studied the problem assuming a uniform power assignment or allowing unlimited power levels, we investigate the problem with a more realistic power assignment model where the maximum power level is bounded. To the best of our knowledge, no existing work formally proved the NP-hardness, though many researchers have been assuming that this fact holds true. In this paper, we provide a solid proof for this result.

Minimum Latency Broadcast Scheduling in Duty-Cycled Multihop Wireless Networks

2012 ◽  
Vol 23 (1) ◽  
pp. 110-117 ◽  
Author(s):  
Xianlong Jiao ◽  
Wei Lou ◽  
Junchao Ma ◽  
Jiannong Cao ◽  
Xiaodong Wang ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Multihop Wireless Networks ◽  
Broadcast Scheduling ◽  
Multihop Wireless ◽  
Minimum Latency

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