+234 813 0686 500
+234 809 3423 853
info@grossarchive.com

A NEAR-OPTIMAL MULTICAST SCHEME FOR MOBILE ADHOC NETWORK USING GENETIC ALGORITHM

  • Type:Project
  • Pages:47
  • Format:Microsoft Word
(Computer Science Project Topics & Materials)
ABSTRACT
Multicast routing is an effective way to communicate among multiple hosts in a network. It outperforms the basic broadcast strategy by sharing resources along general links, while sending information to a set of predefined multiple destinations concurrently. However, it is vulnerable to component failure in ad hoc network due to the lack of redundancy, multiple paths and multicast tree structure. Tree graph optimization problems (GOP) are usually difficult and time consuming NP-hard or NP-complete problems. Genetic algorithms (GA) have been proven to be an efficient technique for solving the GOP, in which well-designed chromosomes and appropriate operators are key factors that determine the performance of the GAs. Limited link, path constraints, and mobility of network hosts make the multicast routing protocol design particularly challenging in wireless ad hoc networks. Encoding trees is a critical scheme in GAs for solving these problems because each code should represent a tree. Prufer number is the most representative method of vertex encoding, which is a string of n-2 integers and can be transformed to an n-node tree. However, genetic algorithm based on Prufer encoding (GAP) does not preserve locality, while changing one element of its vector causes dramatically change in its corresponding tree topology.


TABLE OF CONTENT
TITLE PAGE                                   
CERTIFICATION                               
APPROVAL                               
DEDICATION                                   
ACKNOWLEDGEMENT                       
ABSTRACT                                   
TABLE OF CONTENT                               

CHAPTER ONE
1.0    INTRODUCTION                           
1.1    STATEMENT OF PROBLEM                       
1.2    PURPOSE OF STUDY                           
1.3    AIMS AND OBJECTIVES                        
1.4    SCOPE/DELIMITATIONS                       
1.5    LIMITATIONS/CONSTRAINTS                       
1.6    DEFINITION OF TERMS                       

CHAPTER TWO
2.0    LITERATURE REVIEW                           

CHAPTER THREE
3.0    METHODS FOR FACT FINDING AND DETAILED DISCUSSIONS OF THE SYSTEM
3.1     METHODOLOGIES FOR FACT-FINDING
3.2    DISCUSSIONS            

CHAPTER FOUR
4.0    FUTURES, IMPLICATIONS AND CHALLENGES OF THE SYSTEM
4.1    FUTURES
4.2    IMPLICATIONS
4.3    CHALLENGES

CHAPTER FIVE
5.0    RECOMMENDATIONS, SUMMARY AND CONCLUSION       
5.1    RECOMMENDATION                           
5.2    SUMMARY                               
5.3    CONCLUSION                               
5.4    REFERENCES                       

A NEAR-OPTIMAL MULTICAST SCHEME FOR MOBILE ADHOC NETWORK USING GENETIC ALGORITHM

Share This

Details

Type Project
Department Computer Science
Project ID CPU1323
Price ₦3,000 ($9)
No of Pages 47 Pages
Format Microsoft Word

500
Leave a comment...

    Details

    Type Project
    Department Computer Science
    Project ID CPU1323
    Price ₦3,000 ($9)
    No of Pages 47 Pages
    Format Microsoft Word

    Related Works

    ABSTRACT Multicast routing is an effective way to communicate among multiple hosts in a network. It outperforms the basic broadcast strategy by sharing resources along general links, while sending information to a set of predefined multiple destinations concurrently. However, it is vulnerable to component failure in ad hoc network due to the lack... Continue Reading
    ABSTRACT Multicast routing is an effective way to communicate among multiple hosts in a network. It outperforms the basic broadcast strategy by sharing resources along general links, while sending information to a set of predefined multiple destinations concurrently. However, it is vulnerable to component failure in ad hoc network due to the lack... Continue Reading
    ABSTRACT This project is about an application used by the travelling salesman, given a finite number of “cities” (I have choosen cities from 1 to a finite number) along with the distance of travel (distance between two cities is randomly choosen) between each pair of them the aim is to find the cheapest distance of visiting all the cities and... Continue Reading
    ABSTRACT To control the traffic during the data transmission with out any loss of packets using genetic algorithm. In this the packets are transferred by frames using mac layer. So Error correction can be easily done. Genetic algorithm based train simulation using concurrent engineering” control over a single wired lane network, the project... Continue Reading
    ABSTRACT Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that addresses simultaneously three aspects: security, scalability and adaptability to... Continue Reading
    The mathematical model of diesel engine and its speed regulation system are presented and computer simulation is conducted in Matlab software. Simulation results verify that the proposed method improves the control accuracy of speed of diesel engine. A fuzzy PID hybrid controller and a Genetic Algorithm PID of parameter self-adjusting is put... Continue Reading
    (A CASE STUDY OF AKA PAINT NIGERIA LIMITED) ABSTRACT This study is aimed at determining the optimal quantity of raw materials to be ordered for and when best to make the order. It also aimed in determing the completion time in the producer of paint. A case... Continue Reading
    SOURCE CODE INCLUDED ABSTRACT In the fundamental operation in computer science, Graph algorithm is a great tool used to solve problems related to graph theory and this algorithms have wide applications in solving routing problems. For the purpose of this project four algorithms from the many types of graph algorithms were selected which are... Continue Reading
    ABSTRACT The study examined sales promotion as a persuasive activity hence is the direct and indirect communication used by firms to influence present and... Continue Reading
    ABSTRACT A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic... Continue Reading