Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/15058
Title: Evolutionary algorithms for time division multiple access broadcast scheduling problem in wireless multi hop networks
Researcher: Rekha D
Guide(s): Arivudainambi, D
Keywords: Algorithms, broadcast scheduling, wireless multi-hop network (WMN), Ad hoc network, mobile computing technologies
Upload Date: 15-Jan-2014
University: Anna University
Abstract: Wireless multi-hop network (WMN) plays an important role in the communication industry due to the advancement in wireless communication and mobile computing technologies. In wireless ad hoc network, single-hop and multi-hop networks do not rely on a pre-existing infrastructure such as routers in wired networks or access points in wireless networks. Ad hoc network is a self-organized multi-hop wireless network, which relies neither on fixed infrastructure nor on predetermined connectivity. First, in particular, only a few algorithms concentrate remarkably on reducing the length of TDMA frame and improving the number of transmissions. Secondly, very little attention has been paid to improving the performance of algorithms in terms of execution time even while dealing with MEB problem. This study is concerned with the idea of evolutionary computation to solve BSP and MEB. The present research work includes the following contributions: (1) To define an efficient broadcast TDMA schedule with minimum length TDMA frame and maximum channel utilization in reduced computation time using evolutionary algorithms and (2) To solve the minimum energy broadcast tree problem over wireless ad hoc networks in less computation time using memetic algorithm. The research work focuses on the use of algorithms such as genetic algorithm (GA), immune genetic algorithm (IGA), memetic algorithm (MA) and harmony search using memetic algorithm (HSMA) to solve broadcast scheduling for TDMA in WMN with reduced computation time. The research work delineates the issues that arise in the context of wireless multi-hop networks. The algorithms are evaluated through extensive simulations using MATLAB simulation tool. Finally, the results are compared with recently proposed algorithms. The simulation results on numerous problem instances confirm that the algorithms discussed in this thesis significantly outperforms several heuristic and evolutionary algorithms in terms of solution quality. newline newline newline
Pagination: xx, 151
URI: http://hdl.handle.net/10603/15058
Appears in Departments:Faculty of Science and Humanities

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File49.66 kBAdobe PDFView/Open
02_certificates.pdf391.94 kBAdobe PDFView/Open
03_abstract.pdf17.09 kBAdobe PDFView/Open
04_acknowledgement.pdf13.89 kBAdobe PDFView/Open
05_contents.pdf35.46 kBAdobe PDFView/Open
06_chapter 1.pdf71.09 kBAdobe PDFView/Open
07_chapter 2.pdf1.41 MBAdobe PDFView/Open
08_chapter 3.pdf928.33 kBAdobe PDFView/Open
09_chapter 4.pdf359.39 kBAdobe PDFView/Open
10_chapter 5.pdf409.84 kBAdobe PDFView/Open
11_chapter 6.pdf19.14 kBAdobe PDFView/Open
12_references.pdf27.62 kBAdobe PDFView/Open
13_publications.pdf14.03 kBAdobe PDFView/Open
14_vitae.pdf12.88 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.