On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately estimate timeouts because topology changes are unpredictable. In this paper, we propose proactively disseminating the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters, thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link-MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is key to the adaptation of on-demand routing protocols to mobility
TABLE OF CONTENTS
TITLE PAGE
CERTIFICATION
DEDICATION
ACKNOWLEDGEMENT
ORGANIZATION OF WORK
ABSTRACT
TABLE OF CONTENT
CHAPTER ONE
1.0INTRODUCTION
1.1STATEMENT OF THE PROBLEM
1.2PURPOSE OF THE STUDY
1.3AIM AND OBJECTIVES
1.4SCOPE OF STUDY
1.5CONSTRAINTS
1.6ASSUMPTION
1.7DEFINITION OF TERMS
CHAPTER TWO
2.0LITERATURE REVIEW
CHAPTER THREE
3.0DESCRIPTION AND ANALYSIS OF THE EXISTING SYSTEM
3.1FACT FINDING METHODS USED
3.11REFERENCES TO WRITTEN DOCUMENT
3.1.2BROWSING OF INTERNET
3.2INPUT, PROCESS, OUTPUT ANALYSIS
3.2.1INPUT, ANALYSIS
3.2.2INPUT FORMAT
3.2.3PROCESS, ANALYSIS
3.2.4OUTPUT, ANALYSIS
3.2.5INPUT FORMAT
3.3PROBLEM OF THE EXISTING SYSTEM
3.4OBJECTIVE OF THE EXISTING SYSTEM
3.5JUSTIFICATION OF THE NEW EXISTING SYSTEM
CHAPTER FOUR
4.0THE DESIGN OF THE NEW SYSTEM
4.1OUTPUT SPECIFICATION AND DESIGN
4.2INPUT SPECIFICATION AND DESIGN
4.3FILE DESIGN
4.4FILE STRUCTURE
4.5PROCEDURE CHART
4.6SYSTEM FLOWCHART
4.7SYSTEM REQUIREMENT
4.71HARDWARE REQUIREMENT
4.72SOFT WARE REQUIREMENT
5.0IMPLEMENTATION
5.1PROGRAM DESIGN
5.2PSEUDO CODE
5.3PROGRAM FLOWCHART
6.0DOCUMENTATION
6.1CHOICE OF LANGUAGE
6.2LANGUAGE INTRODUCTION
6.3CHANGE OVER METHOD
7.0CHAPTER FIVE
8.0CONCLUSION
7.1RECOMMENDATION
BIBLIOGRAPHY
DESIGN AND SIMULATION OF CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL
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
ABSTRACT We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the independent reference model with generalized Zipf’s law request probabilities. The randomization was recently proposed for Web caching as a mechanism that discriminates between different document sizes. In particular, a requested document... Continue Reading
ABSTRACT We consider several distributed collaborative key agreement and authentication protocols for dynamic peer groups. There are several important characteristics which make this problem different from traditional secure group communication. They are: 1) distributed nature in which there is no centralized key server; 2) collaborative nature in... 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 Electronic circuit simulation uses mathematical models to replicate the behavior of an actual electronic device or circuit. Simulation software allows for modeling of circuit operation and is an invaluable analysis tool. Due to its highly accurate modeling capability, many Colleges and Universities use this type of software for the... Continue Reading
DESIGN AND IMPLEMENTATION OF A COMPUTERIZED DATABASE UPDATING SYSTEM FOR A TRANSACTION –DRIVE/OPERATION A CASE STUDY OF NIGERIAN STOCK EXCHANGE (NSE) LAGOS ABSTRACT Information is the driving force in a transaction driven operation decision, with rapid advancement in information technology the resulting increase in complexity of Nigerian Stock... Continue Reading
DESIGN AND IMPLEMENTATION OF A COMPUTERIZED DATABASE UPDATING SYSTEM FOR A TRANSACTION –DRIVE/OPERATION A CASE STUDY OF NIGERIAN STOCK EXCHANGE (NSE) LAGOS ABSTRACT Information is the driving force in a transaction driven operation decision, with rapid advancement in information technology the resulting increase in complexity of Nigerian Stock... Continue Reading
ABSTRACT Information is the driving force in a transaction driven operation decision, with rapid advancement in information technology the resulting increase in complexity of Nigerian Stock Exchange (NSE). The quality and variety of information needed for a transaction driven operation is increasing forth. We are now in computer age where our... Continue Reading
Background of the Study Probably no other advancement since the telephone has changed the way humanity works quite as much as the computer. Today powerful computer not larger than a brief -case is on deck around the world they remember information, calculate vital business transaction create forms, draw diagrams and perform a gigabyte of other... Continue Reading