EFFECTIVE COVERAGE AND CONNECTIVITY CONSERVATION WITH LOAD BALANCING FOR WSN

Abstract

Wireless sensor networks provide maximum coverage area in a network as much as possible, as the basic objective. Such as, identifying the location of interruptions in combat zone and tracking of an object, with reliable services. Organization of sensor nodes to construct maximum subgroups with energy limit, ability to monitor every required discrete points and activation in alternate manner is the best possible method for quality assurance. Behind the objective accomplishing the maximum subgroups, in the aim of obtaining the maximum connectivity arises the question on assurance of connectivity among nodes. To assure full coverage with base station connectivity in each sensing node, this paper proposes a new algorithm as Maximum Connected Load Balancing Cover Tree (MCLCT) with dynamically formation of routing cover tress with load-balancing. This kind of problem can be known as maximum cover tree problem, proved as nondeterministic polynomial-complete. There are two techniques in proposed MCLCT, first one is conservation of coverage by using recursive heuristic coverage optimization, and second is strat egy for identification of route using probabilistic load balance. The proposed MCLCT provides the solution by sharing the load among the nodes while sensing and transmitting, hence this makes energy consumption balanced between the nodes. Collection of simulation results depicts that, the proposed method accomplishes the objectives in terms of conservation of connectivity and energy efficiency.