Implementation of Hybrid Ad-Hoc Routing Protocol

Abstract

The goal of this application is to implement a hybrid ad-hoc routing protocol, using the 802.11 wireless protocols. Our implementation enables communication between several wireless stations, on a dynamic network without using any infrastructure, i.e. using peer-to-peer mode, rather than Access Points. Two distant units can communicate even when there is no direct connection between them. We have implemented the Direct Sequence Distance Vector (DSDV) algorithm, which is a pro-active table driven algorithm in Wireless Network. The routing in each station is executed according to local routing table. The tables are continually maintained and updated. We developed the application in Java, which has inherent support for network operations. Thus, it is platform independent, and can run with various OS and wireless cards. In order to demonstrate the operation of the algorithm we wrote a Unicode Short Message Text (USMT) application that uses the routing protocol services as a sub-layer. The USMT application enables sending of text messages from any unit to any other unit in the network. It also graphically presents the local routing tables information.