26-04-2011, 04:09 PM
Presented by
Kavya.k.
[attachment=12871]
ABSTRACT
We present an algorithm that utilizes multiple interfaces to provide maximum connectivity.
We can try to find the path to the destination utilizing different interfaces.
Each node maintains information regarding all the possible direct interfaces to its neighbors.
A cognitive controller that can switch among different technologies and is able to choose a best page link among different available links.
INTRODUCTION
The aim of our protocol is to provide a single platform that can integrate different technologies and provide maximum possible connectivity.
This algorithm that helps to communicate among nodes those are available at different communication mediums
We use Distance Vector Routing as each node only maintaining information of its neighbors.
we do not only maintain the best path to destination but we also maintain all the possible paths to destination so that we can switch to some other page link whenever required.
It provides loop free routes
It has capability to repair broken links by switching to different interfaces.
work completely on distance vector routing
Each node maintain four different tables i.e.
1)Neighbor table
2)Routing or topology table
3)Backup table
4)Request table.
There are six different type of packets i.e.
1)Beacons
2)RREQ
3)RREP
4)RUP
5)DATA
6)ACK Neighbor table :-maintains the information of the all the neighbors and gets updated on the beacons sent by its neighbors.
Request table :-contains the information for all the
nodes that has requested for particular destination.
Backup table :-contains all the possible paths to the destination and the best path is copied from the backup table to the routing table
Routing table :-is further used for routing the packets.
Beacons
Whenever a new node gets up and the connection is established, it first sends the beacons to all its active interfaces.
Beacons message is send by a node to advertise its properties to its neighboring nodes.
When a node joins the network it broadcasts beacon message on all of its interfaces then it sends RREQ for all the destinations from the routing
RREQ
Route request packet is generated by a node when it requires path to some destination.
For search of path RREQ packet is forwarded to all the neighbors.
If the node contains the path to destination in its routing table it replies with the RREP packet Else packet is flooded to all the active neighbors.
RREP
When a node receives a RREP it adds an entry to the destination in backup table and checks it in the routing table.
If the destination is not present in routing table, add an entry.
Also send RREP’s to all nodes that requested for
destination in the request table.
DATA and ACK
Data and acknowledgment packet contains the data or ack with the source and destination name.
When these packets arrive at some node it forwards it to the path available in the routing table.