Broadcast scheduling problem for TDMA ad-hoc networks

Authors:
D. Arivudainambi;D. Rekha
Affiliations:
Guindy Anna University Chennai;Guindy Anna University Chennai
Venue:
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
Year:
2011

Citing 7
Cited 0

Memetic algorithms: a short introduction

New ideas in optimization
An efficient algorithm to find broadcast schedule in ad hoc TDMA networks

Journal of Computer Systems, Networks, and Communications
A sequential approach for optimal broadcast scheduling in packet radio networks

IEEE Transactions on Communications
Novel hysteretic noisy chaotic neural network for broadcast scheduling problems in packet radio networks

IEEE Transactions on Neural Networks
A mixed neural-genetic algorithm for the broadcast scheduling problem

IEEE Transactions on Wireless Communications
Optimal broadcast scheduling in packet radio networks using mean field annealing

IEEE Journal on Selected Areas in Communications
A gradual noisy chaotic neural network for solving the broadcast scheduling problem in packet radio networks

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A domain specific memetic algorithm is proposed for solving the optimum time division multiple access broadcast scheduling problem in Ad-hoc networks. During disaster relief, broadcast scheduling problem in Ad-hoc network is deployed efficiently. The aim is to increase the total number of transmissions in optimized time slot with high channel utilization in a less computation time. The results were compared with other algorithms for broadcast scheduling problem.