Heterogeneous Clustering Of Sensor Network

Abstract In this paper, we proposed a heterogeneous clustering of sensor network in which different types of sensors exist that report to different sinks. This heterogeneous clustering approach has its own security measures in which only registered devices in the IP-DNS can be part of the heterogeneous clustering network and can set up communication channel with the sink or with any other device. We have also proposed a dynamic hierarchical clustering scheme in which certain number of sensor nodes that locates in specific area will be grouped as cluster and nominate a cluster head of their own. We have proposed two cluster head selection criteria. The fist one is edge sensors in which sensors that are closer to other clusters will be selected as cluster head whereas the second select the cluster head that has the minimum average hop distance to other sensors. We have seen that the second selection criteria leads to shorter path as the cluster heads are in the middle of cluster and closer to other nodes. We have compared our proposed architecture with other well known on demand routing protocol named as AODV and we have seen that our approach perform way better in terms of delay. Our approach can allow the usage of proactive protocols at each routing level and still have limited size of routing table at each node. The only trade off is that our approach has slightly longer path length compared to AODV. Furthermore, we proposed a hierarchical routing scheme in which sensor networks at each routing level is grouped and exchange routing information among themselves avoiding flooding the network with control over head messages.