preview

Wiki2010 Unit 4

Satisfactory Essays

f each other and usually with nodes sending data at a constant rate. Different protocols are then evaluated based on the packet drop rate, average routing load, average end-to-end-delay, and other measures. The proposed solutions for routing protocols could be grouped in three categories: proactive (or table-driven), reactive (or on-demand), and hybrid protocols. Even the reactive protocols have become the main stream for MANET routing. In this chapter, we introduce some popular routing protocols in each of the three categories and for IPv6 networks [Lee2009][Wiki2010a][Wiki2010c]. 1.3 Applications for MANET Ad hoc networks are suited for use in situations where infrastructure is either not available or not trusted, such as a communication …show more content…

So that when a packet needs to be forwarded, a route is already known and can be used immediately. Once the routing tables are setup, then data (packets) transmissions will be as fast and easy as in the tradition wired networks. Unfortunately, it is a big overhead to maintain routing tables in the mobile ad hoc network environment. Therefore, the proactive routing protocols have the following common disadvantages: 1. Respective amount of data for maintaining routing information. 2. Slow reaction on restructuring network and failures of individual nodes. Proactive routing protocols became less popular after more and more reactive routing protocols were introduced. In this section, we introduce three popular proactive routing protocols – DSDV, WRP and OLSR. Besides the three popular protocols, there are many other proactive routing protocols for MNAET, such as CGSR, HSR, MMRP and so on [Wiki2010c][Sholander2002]. 2.1 Destination-Sequenced Distance Vector (DSDV) Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for ad hoc mobile networks based on the Bellman-Ford algorithm. It was developed by

Get Access