Abstract

Wireless Sensor Networks (WSN) are limited by the battery lifetime of the sensor nodes to gateways able to send useful packets to the Sink. The sink mobility along a constrained path can improve the distributed energy efficiency in wireless sensor networks. To remain event discovery delay at a near to the ground value, in application that require instance data snapshots, it is for all time desirable to decrease the duration of a data collection process. Conversely, for applications that require unremitting monitoring, the number of DCPs concluded in a given period of point in time is important for reconstruct a correct data trend. In this manuscript, a delay-aware set of connections structure is planned for WSNs with following DCPs. Therefore, energy efficiency and data packets are the primary parameters which have to be considered while designing clustering and routing algorithms for WSN. In this paper, we proposed a particle bee forming algorithm (PBF) is to enhance the data collection efficiency and reduce the energy utilization and also we proposed a technique distributed fault detection (DFD) algorithm in a true time simulator based on clustering model where the cluster head or the sink node detects the failure nodes. Distributed algorithm to minimize the communication overhead of the network, but the performance is always providing good as all data are available with the central process while detecting the fault

Paper Details