A MANET is a self-configuring network of mobile routers (and associated hosts) connected by wireless links—the union of which forms an arbitrary topology. Distance Sequenced Distance Vector (DSDV) is a table driven routing protocol for MANETs based on the Belman-Ford Algorithm. Each node in the network maintains a routing table in which is listed every destination and the number of hops required to reach that destination. The Ad-hoc On-demand Distance Vector (AODV) routing algorithm is an algorithm for routing data across Wireless Mesh Networks. It is capable of both unicast and multicast routing. It is a reactive routing protocol, meaning that it establishes a route to a destination only on demand. The basic idea behind the implementation is that depending upon the range of the Bluetooth each of the Bluetooth will discover its neighbors, and will keep a track of all those discovered nodes, this track can be termed as routing table. Basing on this data base, communication between the nodes is made possible. Existing discovery, information exchange & table driven routing techniques are not efficient and our research aims to improve efficiency of these processes & provide an insight in real time implementation of MANET.