Rs 810 only/-
9907385555 asingh039@gmail.com
MP NAGAR BHOPAL
Graph Spanning Based Clustering Here explanation of proposed work graph spanning based clustering was done. So reading this part make clear understanding of whole work in detail. In this work a approach was adopt for finding the best set of cluster center by using Graph Based Clustering where Minimum Spanning Tree approach was incorporate in this step.. Here whole work is depend on the dynamic condition of the available energy present in different nodes. In this work energy obtained from the nodes act as important feature for the cluster center selection.
Linear Routing Wireless sensor network need energy efficient algorithm which was depend on two module first was clustering of node while in second explanation of routing of nodes packet was done. So reading this chapter make clear understanding of whole work in detail. In this work a approach is adopt for finding the best set of cluster center by using SECM (Single Element Cluster Merging) with graph based clustering. Routing was done by developing linear route to the base station so chance of packet collision get reduced.
| IEEE Base Paper | |||
| Doc | Document File | ||
| Read me | Project Readme | ||
| Source Code | Complete Code Files |