Download now Free registration required
Designing an efficient and robust routing algorithm for Mobile Ad-hoc NETwork (MANET) is a challenging job compared to that of a wired and immobile network as because of some intrinsic characteristics of the MANET like highly dynamic nature of network topology due to mobility of nodes, asymmetric links, limited bandwidth, limited battery power, and alike. The statistics shows that the most of the routing algorithms, developed so far, for MANET, are conceptually based on the traditional distance vector routing algorithm which, in turn, is based on Distributed Asynchronous Bellman Ford's shortest path algorithm, however, with some minor to significant modifications as needed for the ad hoc and mobile nature of the MANET.
- Format: PDF
- Size: 538.92 KB