Wireless sensor applications are susceptible to energy constraints. Most of the energy is consumed in communication between wireless nodes. Clustering and data aggregation are the two widely used strategies for reducing energy usage and increasing the lifetime of wireless sensor networks. In target tracking applications, large amount of redundant data is produced regularly. Hence, deployment of effective data aggregation schemes is vital to eliminate data redundancy. This work aims to conduct a comparative study of various research approaches that employ clustering techniques for efficiently aggregating data in target tracking applications as selection of an appropriate clustering algorithm may reflect positive results in the data aggregation process. In this paper, we have highlighted the gains of the existing schemes for node clustering based data aggregation along with a detailed discussion on their advantages and issues that may degrade the performance. Also, the boundary issues in each type of clustering technique have been analyzed. Simulation results reveal that the efficacy and validity of these clustering-based data aggregation algorithms are limited to specific sensing situations only, while failing to exhibit adaptive behavior in various other environmental conditions.
The aims of this thesis are to study the topological space; we introduce a new kind of perfect mappings, namely j-perfect mappings and j-ω-perfect mappings. Furthermore, we devoted to study the relationship between j-perfect mappings and j-ω-perfect mappings. Finally, certain theorems and characterization concerning these concepts are studied. On the other hand, we studied weakly/ strongly forms of ω-perfect mappings, namely -ω-perfect mappings, weakly -ω-perfect mappings and strongly-ω-perfect mappings; also, we investigate their fundamental properties. We devoted to study the relationship between weakly -ω-perfect mappings and strongly -ω-perfect mappings. As well as, some new generalizations of some definitions wh
... Show More