A Virtual Topology for Routing in Adhoc
Networks
ABSTRACT:
Routing in adhoc networks is often solved through classical algorithms such as AODV, OLSR,.Several recent works have evaluated such algorithms and have investigated self-organization for reducing the number of messages in a dense and a mobile deployment.
The main idea is to create and maintain locally a hierarchy that is well suitable for routing packets in an Adhoc network. The contribution of this work is mainly based on the construction of a virtual topology where cluster heads and gateways collaborate for searching the destination node. Hence, inter-cluster and intra-cluster routing are jointly used. The Netlogo platform has been investigated for constructing in an asynchronous manner a virtual topology. Results showed a significant reduction in the exchanging messages. By comparison to the existing methods, our contribution is also able to find the shortest path between a source and a destination.
EXISTING SYSTEM
To discover the internet topology discovery in the IP interface level there are three techniques are available. They are,
- Traceroute Techniques
- Source Routing Techniques
- Forward and Backward technique
PROPOSED SYSTEM
· From the above survey it is found that the redundancy of probing is more, communication overhead is more and the coverage area is less. To reduce the above parameters clustering technique is adopted.
· In the clustering technique first the network is grouped into clusters. More the number of clusters there will be more processing overhead. If there is less number of clusters the parallelism achieved will be less and the cluster formation time will be more. First cluster heads are picked by conducting random experiment according to processing efficiency, reliability, congestion rate and communication link.
· After cluster heads are chosen, then cluster members are formed by probing method. A time slot is given to each cluster head so that the cluster head will probe and the process continues until all the nodes are covered. The nodes which are visited by the cluster head within the speculated time will belong to the corresponding cluster.
· To avoid overlapping between cluster each and every node have to maintain the following information. The node id, cluster id of the node, next possible links and whether it is a boundary node or not. After the formation of clusters the source node cluster head probe to all other cluster heads to find in which cluster the destination node is. After receiving the message from source head, the cluster having the destination will respond to the source cluster. Other clusters simply discard the messages.
· Then possible paths between source and destination will be found by suitable algorithm. Then the message will be sent to the destination. If there is more traffic in that route another possible path will be followed to send the message.
HARDWARE SPECIFICATION
Processor Type : Pentium -IV
Speed : 2.4 GHZ
Ram : 128 MB RAM
Hard disk : 20 GB HD
SOFTWARE SPECIFICATION
Operating system : Windows - XP
Tools : OMNET ++
REFERENCE:
Hiba Hachichi, Samia Chelloug and Fatima Athmouni, “A Virtual Topology for Routing in Adhoc Networks”, IEEE 2011
