Performance analysis of Zigbee WDSN using clustering protocol and STR algorithm

In recent years, wireless networking plays a prominent role because of its easy installation and flexibility. Among the various wireless domains, Zigbee based Wireless Dynamic Sensor Networks (WDSN) pose a good support to the dynamics that arise when the nodes are induced with mobility. In the Zigbee based Wireless Dynamic Sensor Network (WDSN), major consideration is on utilizing the energy efficiently among the mobile nodes. Various techniques are used to attain energy efficiency in Zigbee WDSN. Among them, clustering the nodes is one of the best methods, since they aim at reducing the energy dissipation and increasing the life span of the network. Hence, in this paper, the performance of Zigbee WDSN using clustering scheme is done by considering the nodes with mobility and compared with performance of Zigbee WDSN using non clustering technique. The proposed work is summarized as follows: the network is deployed as clusters and the remaining energy of the node is determined by utilizing clustering protocol. In each cluster, the clustering protocol opts for the node with the maximum remaining energy as the head of that cluster. Then STR algorithm is utilized to route the sensed data from the member nodes to the cluster head.

>
System Architecture

Project Overview : The proposed work aims at enhancing the performance of existing work by introducing the clustering technique. Among the various protocols proposed for WSNs, hierarchical protocols outperform other protocols since they augment the network lifetime, reduce the energy dissipated by the sensor nodes and cut down the number of communication messages among the sensor nodes.
System Requirements
Hardware Requirement
Main processor : Pentium IV processor 1.13 GHz
Hard disk capacity : 40GB
Cache memory : 512 MB
Monitor : LG Digital Color Monitor
Keyboard : Samsung
Mouse : Logitech
Software Requirement
Operating system : Fedora 8 (linux)
Scripting language : Network Simulator 2.33
Protocol developed : C++
Scripting : Tool Command Language

Sample Code
for(ii=0;ii<10;ii++) {
if(NR < 51 && ($1==ii)) {
a1[ii++]=$1
a1[i1++]=$1
a11[ii++]=$2
sum1=sum1+$2
}
}
avgsum1=sum1/10
for (xx=0;xx<10;xx++){
if (NR < 51 && ($1==xx)){
if (avgsum1>a11[xx]){
b1[j1++] = $1
print $1 "\t" $2 > "clusterhead1.tr"
print "$ns at 14.0 \"$n"$1 "\t" "label Sn \"" > "cmsimu"1".tr"
}
else {
print $1 "\t" $2 > "clusterhead10.tr"
print "$ns at 14.0 \"$n"$1 "\t" "label Rn \"" > "cmsimu"1".tr"
}
}
}
This code helps us to find th total energy of the cluster and average energy of the cluster, using this energy we are finding clusterhead(which node is havig high energy) and clustermember(remaining nodes except clusterhead)