Main Reference PaperTrust based Cluster Computing in Ad hoc Network using Group Key Climbing and Chaining, International Journal of Computer Applications, July 2013.
  • Clustering in Mobile Ad Hoc Networks (MANETs) has many advantages as routing efficiency, transmission management, information collection compared to the traditional networks. The intra and inter cluster communication is facilitated by the use of two keys namelyLGK and G2K that aids in seamless interaction and transmission. The message from one cluster may reach the other clusters through efficient wrapping by the recipient cluster group keys that is delivered to the intended cluster where the packets are subjected to unwrapping.

+ Description
  • Clustering in Mobile Ad Hoc Networks (MANETs) has many advantages as routing efficiency, transmission management, information collection compared to the traditional networks. The intra and inter cluster communication is facilitated by the use of two keys namelyLGK and G2K that aids in seamless interaction and transmission. The message from one cluster may reach the other clusters through efficient wrapping by the recipient cluster group keys that is delivered to the intended cluster where the packets are subjected to unwrapping.

  • To manage the efficient data movement and increase the route lifetime

  • To improve routing at the network layer by reducing the size of the routing tables.

  • It decreases transmission overhead by updating the routing tables after topological changes occur

  • It saves energy and communication bandwidth in ad-hoc networks.

+ Aim & Objectives
  • To manage the efficient data movement and increase the route lifetime

  • To improve routing at the network layer by reducing the size of the routing tables.

  • It decreases transmission overhead by updating the routing tables after topological changes occur

  • It saves energy and communication bandwidth in ad-hoc networks.

  • An efficient Energy, Degree aware Clustering Algorithm which involves the important features such as degree, energy and transmission range. Using this algorithm a node with higher residual energy, higher degree is more likely elected as a cluster head. The members of each cluster communicate directly with their Cluster Heads (CHs) and each. Clustering algorithm elects the node having high connectivity, closer to destination and reduced power consumption node as a cluster head (CH).

+ Contribution
  • An efficient Energy, Degree aware Clustering Algorithm which involves the important features such as degree, energy and transmission range. Using this algorithm a node with higher residual energy, higher degree is more likely elected as a cluster head. The members of each cluster communicate directly with their Cluster Heads (CHs) and each. Clustering algorithm elects the node having high connectivity, closer to destination and reduced power consumption node as a cluster head (CH).

  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

+ Software Tools & Technologies
  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.