Get all the updates for this publication
Conferences
Broadcast scheduling problem for TDMA Ad-hoc networksPublished in
2011
Pages: 461 - 464
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. © 2010 ACM.
Topics: Broadcast radiation (69)%69% related to the paper, Fair-share scheduling (65)%65% related to the paper, Dynamic priority scheduling (64)%64% related to the paper, Round-robin scheduling (64)%64% related to the paper and Two-level scheduling (64)%64% related to the paper
View more info for "Broadcast scheduling problem for TDMA ad-hoc networks"
Content may be subject to copyright.
About the journal
| Journal | ACWR 2011 - Proceedings of the International Conference on Wireless Technologies for Humanitarian Relief |
|---|
Authors (1)
Rekha D- Improved memetic algorithm for energy efficient target coverage in wireless sensor networks
- Artificial Intelligence and Agriculture 5. 0
- IoT-Based Smart Office System Architecture Using Smartphones and Smart Wears with MQTT and Razberry
- Heuristic approach for broadcast scheduling, problem in wireless mesh networks
