ANT-colony based disjoint set assortment in wireless sensor networks

Wireless sensor network (WSN) consists of small sized devices containing different sensors to monitor physical, environmental and medical conditions during surveillance of fields, parking, borders and any targeted areas. Mostly WSN is deployed in harsh environments where battery can’t be changed or recharged easily, therefore, battery power should be used efficiently. Sensor nodes are randomly deployed in remote areas by using aero plane and as a result more than one sensor may be covering the same area. The main problem is that if these sensors become functional at the same time it results in the wastage of battery resources and reducing the network lifetime. This paper resolve this issue by identifying disjoint subsets of the sensors such that alternate nodes cover the whole target area at different ON–OFF intervals of time. We have proposed to adopt ant-colony optimization to find the disjoint subsets of deployed sensor nodes. We have explored the algorithms for sensor deployment, cover set initialization, field identification and allocation. Finally, the optimal disjoint set allocation mechanism is explored. We have simulated our work using NS 2.35 and results ensure the dominance of our scheme over preliminaries in terms of number of field identification, disjoint set allocation, processing time and energy consumption.