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

  • Type: Project
  • Department: Computer Science
  • Project ID: CPU1323
  • Access Fee: ₦5,000 ($14)
  • Pages: 47 Pages
  • Format: Microsoft Word
  • Views: 852
  • Report This work

For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853
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
For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853

Share This
  • Type: Project
  • Department: Computer Science
  • Project ID: CPU1323
  • Access Fee: ₦5,000 ($14)
  • Pages: 47 Pages
  • Format: Microsoft Word
  • Views: 852
Payment Instruction
Bank payment for Nigerians, Make a payment of ₦ 5,000 to

Bank GTBANK
gtbank
Account Name Obiaks Business Venture
Account Number 0211074565

Bitcoin: Make a payment of 0.0005 to

Bitcoin(Btc)

btc wallet
Copy to clipboard Copy text

500
Leave a comment...

    Details

    Type Project
    Department Computer Science
    Project ID CPU1323
    Fee ₦5,000 ($14)
    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 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 A Mobile Ad-hoc Data Network (MADNET) is a self-configuring, infrastructure-less network of mobile devices (nodes) where nodes communicate with each other using multi-hop wireless links. Node failures and arbitrary movement of nodes at higher node velocity break the routes and lead to the frequent operation of rebuilding routes that... 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 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 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 Vehicle routing involves searching for efficient routes for vehicles along transportation networks in an attempt to reduce travel time, route length, service cost. For vehicle drivers, the idea of getting to their destination in the shortest time possible is very appealing especially by taking the shortest path to their destination but... Continue Reading
    Call Us
    Get this work
    whatsappWhatsApp Us