Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 36, Pages: 1-5
Sapinder Kaur* , Anupam Mittal and Ruchi Aggarwal
Department of Computer Science and Engineering, Chandigarh University, Gharuan - 140413, Punjab, India; [email protected]
*Author for correspondence
Department of Computer Science and Engineering
Paper is regarding the use of coverage algorithms on the static and dynamic node to resolve the problem of Coverage. Objectives: Main objective of this research is to minimize energy consumption. Its objective is to provide full connectivity and coverage with dynamic nodes in industrial WSN. Methods: Initially, deploy a number of nodes in an industrial area with the usage of MATLAB environment. Then apply two algorithms Communication Weighted Greedy Cover andOverlapped Target and Connected Coverage algorithms. Communication weighted greedy cover algorithm is used to separate movement of nodes. OTTC algorithm is used to reduce overlapped target problem. Findings: In Industrial Wireless Sensor Networkthe problem of Network coverage occursdue to large area coverage and heterogeneity of the network. CWCG and OTTC algorithms consume more energy while covering all the nodes. A solution is needed to develop an energy efficient network coverage algorithm which provides full coverage and connectivity. This research paper shows coverage with dynamic nodes in industrial area. Dynamic nodes reduce coverage and overlapped target problem.
Keywords: Connected Target Coverage, Energy Efficient CTC Algorithms, Industrial Wireless Sensor Networks
Subscribe now for latest articles and news.