D. Arivudainambi
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.
- Ahmad I, Al-Kazemi B, and Das A. S. An efficient algorithm to find broadcast schedule in ad hoc TDMA networks. Journal of Computer Systems, Networks, and Communications 2008; 12: 1--10. Google Scholar
Digital Library
- Goutam Chakraborty. Genetic Algorithm to solve optimum TDMA transmission schedule in broadcast packet radio networks. IEEE Transactions on Communications 2004; 52(5): 765--777.Google Scholar
- Ming Sun, Lin Zhao, Wei Cao, Yaoqun Xu, Xuefeng Dai, and Xiaoxu Wang. Novel Hysteretic Noisy Chaotic Neural Network for Broadcast Scheduling Problems in Packet Radio Networks. IEEE Transactions on Neural Networks 2010; 21(9). Google ScholarDigital Library
- P. Moscato. Memetic Algorithms: A Short Introduction New Ideas in Optimization. McGraw-Hill, 1999; 219--234. Google ScholarDigital Library
- C. Y. Ngo and V. O. K. Li. Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms. IEEE Transactions on Communications 2003; 51(9): 1439--1441.Google Scholar
- Y. Peng, B. H. Soong and L. Wang. Broadcast scheduling in packet radio networks using mixed tabu-greedy algorithm. Electronics Letters 2004; 40(6): 375--376.Google Scholar
- S. Salcedo-Sanz, C. Bousono-Calzon and A. R. Figueiras-Vidal. A mixed neural-genetic algorithm for the broadcast scheduling problem. IEEE Transactions on Wireless Communications 2003; 2: 277--283. Google ScholarDigital Library
- Syam Menon. A Sequential Approach for Optimal Broadcast Scheduling in Packet Radio Networks. IEEE Transactions on Communications 2009; 57(3): 764--770. Google ScholarDigital Library
- G. Wang and N. Ansari. Optimal broadcast scheduling in packet radio networks using mean field annealing. IEEE Journal on selected areas in Communications 1997; 15: 250--260. Google ScholarDigital Library
- X. Wu, B. S. Sharif, O. R. Hinton and C. C. Tsimenidis. Solving optimum TDMA broadcast scheduling in mobile ad hoc networks: a competent permutation genetic algorithm approach. IEE Proceedings: Communications 2005; 152(6): 780--788.Google Scholar
- Lipo Wang and Haixiang Shi. (2006). A gradual noisy chaotic neural network for solving the broadcast schedule problem in packet radio networks. IEEE transactions on neural networks, 17(4), 989--1000. Google ScholarDigital Library
Index Terms
- Broadcast scheduling problem for TDMA ad-hoc networks
Recommendations
A novel tree-based broadcast algorithm for wireless ad hoc networks
One designing challenge in the scheduling of broadcast in wireless ad hoc networks is to reduce broadcast redundancy and provide high reachability, simultaneously. In this paper, we propose a broadcasting algorithm in wireless ad hoc networks. The ...
QoS in Mobile Ad-Hoc Networks
A mobile ad hoc network (MANET) consists of mobile nodes communicating over wireless channels. Routing in MANETs is very challenging due to the random mobility of nodes and unreliability of wireless channels. Therefore most of the existing routing ...
Performance evaluation of routing protocols in vehicular ad-hoc networks
This paper presents a reactive location routing algorithm that uses cluster-based flooding for Vehicular Ad-hoc Networks (VANET). We compare both position-based and non-position-based routing strategies in typical urban and motorway traffic scenarios. A ...
Comments