Dynamic Routing with Stegnography Module Design

Module design:

While we are going to consider the Dynamic Routing with Stegnography project development, initially we have a plan which we virtually design the structure in our minds. That structure will become the design part of Final Year MS project by making the proper analysis on the project. Design is plays the important role in project development, which can made the project development or implementation easier. In order to make the normalized structure of project, modules are considered. In my project I considered the entire project in three modules as follows:

  • Network module
  • Dynamic routing
  • Randomization process 

Network module:

In this module, mainly we consider about the structural positions of terminals and how they are connected. The terminals in the network have different configurations in terms of hardware and software specification. Initially communication strategy starts with the client request or terminal request, and then other end server or other terminal will respond with the appropriate response message. Then the communication process will established. In this module, I will make arrange of network terminals with the proper arrangement.

Dynamic routing:

This is module, achieving the routing strategy by using distance vector algorithm which is the essential and main part of my project. Distance vector algorithm will establish the route which is dynamically and securable manner. In this module, we rely on existing routing strategy which will achieve through the neighbor nodes by passing the information to each terminal. Here each and every terminal in the network will maintain the hop table which maintains the routing and terminals information of associated terminals. Here hop count specifies minimal cost for sending packet to the particular terminal end.

Randomization process:

In this module, I consider to reduce the eaves drops of packets and traffic. For that I design the module for randomize the routing process which can be achieved by registering the hop of previous node and transmit it to two neighbor nodes randomly. By using this technique, two consecutive packets will never go through one route, so attacker can difficult find the data sequence on network. Even it is also difficult to find the data packet sequence in the network.

This Paper is written & submitted by Chandu.

Related Projects

Leave a Reply

Your email address will not be published. Required fields are marked *