SAWR: Scheduling algorithm for wireless sensor networks with rendezvous nodes

摘要

A large class of Wireless Sensor Networks applications involved in monitoring environmental parameters in isolated urban areas covered with sensor nodes. Mobile sinks are mounted upon isolated urban areas with fixed trajectories to monitor environmental parameters. These MS provides ideal infrastructure for retrieving sensory data from isolated WSNfields. The existing approach uses the multi-hop technique for transfer of data from SNs lies within MS's range and network traffic can be balanced among sensor nodes. When sensor nodes run out of energy, the resulting loss of network connectivity and decreasing network life time. In this paper, an ant colony optimization (ACO) scheduling algorithm is exploredfor maximizing the network life, it can be done in three phases. In phase one, finds the initial active sensor nodes with fully coverage constraints. In second phase, it uses successor sensor set, for activating the sensor nodes for reaching constraint. In third phase, sensory data will be forwarded to MS through rendezvous nodes.