and PG level projects,mini projects and many more here ...

Results of simulation

The software implementation of Uniform Cluster formation Algorithm for Ad hoc wireless sensor was successful as shown in the slide shots below. The first slide 7.6.1 shows how sensor nodes are randomly spread over an area. This is an exactly representation of how wireless sensor nodes are deployedin the field.

The next slide given in 7.6.2 shows self-elected cluster-heads (red nodes) about which clusters will be formed. The sensor nodes which fall within the communication radius (which is considered as similarity for the formation of cluster) will become their followers and are known as cluster member.

The third slide 7.6.3 shows how cluster is formed.

  • Plots showing randomly distributed nodes

    Plot showing random distributed of nodes with cluster heads


    Plot showing random distributed of nodes with cluster heads


    Plot showing clusters


    The clustering seen above are for low number of nodes and to get better feel of achieving hexagonal close packing we have simulated for 1000 nodes (see slide 7.6.4) and the result was excellent.

    Plot showing clusters for 1000 nodes

    The algorithm was simulated on various deployments with communication radius of 3 and node densities of 10, 20, 30, and 50. It was observed that results were much better when d is equal to 30 for 1000 nodes.The efficiency of coverage approaches that of Hexagonal close packing for deployment of 1000nodes at d = 30 with communication radius of 3, which indicates that the efficiency is close to 100%.