Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
Wireless sensor network an upcoming technology has its own application in various domains. The role of identifying different types of signals in a single network is being predominantly performed by heterogeneous networks. The essential parameters required for the upliftment of wireless sensor networks are effective connectivity, coverage, scalability and energy efficiency. The aim of the study is to maximize the coverage and scalability with minimized number of nodes. For this minimization of nodes, branch and bound approach is being mainly applied. Since, the nodes are to be minimized, the position where the nodes have to be located plays a crucial role. This problem can be solved by various optimization techniques. For the sake of identification of location of nodes for maximum coverage, Ant Colony Optimization (ACO) algorithm can be used. The ACO algorithm has the maximum probability of identifying the solution for this problem when compared to other algorithm techniques. Thus, the efficient coverage and connectivity can be achieved with minimum number of nodes by means of the proposed method.
How to cite this article:
S. Rajan and S. Uma Maheswari. Optimization Algorithm for Efficient Coverage and Connectivity for Wireless Sensor Networks.
DOI: https://doi.org/10.36478/ajit.2016.2057.2063
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2016.2057.2063