1. Progress Report Wireless Routing By Edward Mulimba

2. Project Goal To simulate and evaluate performance of an ad-hoc network with the following features: To simulate and evaluate performance of an ad-hoc network with the following features: Wireless nodes can store (act as cache) info retrieved from a server such as a web server Wireless nodes can store (act as cache) info retrieved from a server such as a web server Network has a routing protocol that takes into account information cached in neighboring nodes Network has a routing protocol that takes into account information cached in neighboring nodes

3. Overall pictorial view Web Server Base Station Wireless Nodes

4. Categorization of Routing Protocols Centralized or distributed Centralized or distributed Adaptive or Static protocols Adaptive or Static protocols Reactive or proactive or hybrid Reactive or proactive or hybrid

5. Traditional Routing Methods Distance Vector: Distance Vector: Router maintains table of distance between itself and other destinations Router maintains table of distance between itself and other destinations Periodic broadcast to neighbors to keep table up to date Periodic broadcast to neighbors to keep table up to date Link State Link State Node maintains routing table of complete network topology Node maintains routing table of complete network topology

6. Traditional Routing Methods Source Routing: Source Routing: Packet carry all necessary routing information. Packet carry all necessary routing information. Above is inappropriate for mobile technologies

7. Properties and features in Ad-hoc networks No centralization No centralization Power efficient Power efficient Expect unidirectional links Expect unidirectional links There could be sleep periods (node is inactive) There could be sleep periods (node is inactive) More reactive More reactive Secure Secure

8. Some Implemented Protocols DSDV – Destination Seq. Distance Vector DSDV – Destination Seq. Distance Vector DSR – Dynamic Source Routing DSR – Dynamic Source Routing WRP – Wireless Routing Protocol WRP – Wireless Routing Protocol HSR - Hierarchical State Routing HSR - Hierarchical State Routing Clusterhead routing Clusterhead routing

9. Clusterhead Similar features to project idea Similar features to project idea One node is designated as the cluster head using a clustering algorithm One node is designated as the cluster head using a clustering algorithm The clusterhead becomes main transmitter to all other nodes in the cluster The clusterhead becomes main transmitter to all other nodes in the cluster

10. Performance Measurements Average network delay Average network delay Throughput: successfully transmitted data per second. Throughput: successfully transmitted data per second. Successful packet delivery Successful packet delivery

11. Comments on Caching Have been studies in caching in mobile environments e.g. Fong, et al implemented a distributed caching protocol to utilize scarce the wireless communication bandwidth Have been studies in caching in mobile environments e.g. Fong, et al implemented a distributed caching protocol to utilize scarce the wireless communication bandwidth Main issues in caching are maintaining data integrity and securing information Main issues in caching are maintaining data integrity and securing information

12. Objectives To see if simulation results of this routing technique offers marked improvement over other traditional networking schemes To see if simulation results of this routing technique offers marked improvement over other traditional networking schemes

13. Questions or Comments