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

OPTIMAL MULTICAST ROUTING IN MOBILE AD HOC NETWORK

  • Type:Project
  • Pages:45
  • 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 CONTENTS

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 SUBJECT MATTER 
3.1 METHODOLOGIES FOR FACT-FINDING 
3.2 DISCUSSIONS

CHAPTER FOUR
4.0 FUTURES, IMPLICATIONS AND CHALLENGES OF THE SUBJECT MATTER
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
REFERENCES

OPTIMAL MULTICAST ROUTING IN MOBILE AD HOC NETWORK

Share This

Details

Type Project
Department Computer Science
Project ID CPU1288
Price ₦3,000 ($20)
No of Pages 45 Pages
Format Microsoft Word

500
Leave a comment...

    Details

    Type Project
    Department Computer Science
    Project ID CPU1288
    Price ₦3,000 ($20)
    No of Pages 45 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 IP multicast is facing a slow take-off although it has been a hotly debated topic for more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment... Continue Reading
    ABSTRACT The Transmission Control Protocol (TCP) wad designed to provide reliable end-to-end delivery of data over unreliable networks. In practice most TCP deployments have been carefully designed in the context of wired networks. Ignoring the properties of wireless Ad hoc Network can lead to TCP implementations with poor performance. In order to... Continue Reading
    ABSTRACT Active networking is the emerging technology that will provide new network environment where lots of potential applications can be enhanced and developed. Current IP network is somehow good at simple packet forwarding, but it desperately needs some flexibility to support QoS and has to meets some restraint in certain environment. Active... 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 Interest in large-scale sensor networks for both civilian and military applications is burgeoning. The deployment of such networks will require new approaches in resource discovery, query processing and data routing. This paper presents a framework and some analytic results for query satisfaction and data routing in networks consisting of... Continue Reading
    ABSTRACT A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained... 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 Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting subnetwork, using which messages... Continue Reading
    Call Us
    Get this work
    whatsappWhatsApp Us