ABSTRACT:

In this paper, we tend to are fascinated by minimizing the delay and maximizing the lifetime of event-driven wireless sensor networks, for that events occur infrequently. In such systems, most of the energy is consumed when the radios are on, looking ahead to an arrival to occur. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of those energy-constrained wireless sensor networks. However, sleep-wake scheduling might result in substantial delays as a result of a transmitting node wants to wait for its next-hop relay node to come to life. An attention-grabbing line of labor attempts to cut back these delays by developing .anycast.-primarily based packet forwarding schemes, where every node opportunistically forwards a packet to the _rst neighboring node that wakes up among multiple candidate nodes. In this paper, we _rst study how to optimize the any solid forwarding schemes for minimizing the expected packet-delivery delays from the sensor nodes to the sink. Based mostly on this result, we have a tendency to then provide a resolution to the joint management drawback of how to optimally control the system parameters of the sleep-wake scheduling protocol and the any solid packet-forwarding protocol to maximise the network lifetime, subject to a constraint on the expected finish to end packet-delivery delay. Our numerical results indicate that the proposed solution can outperform previous heuristic solutions within the literature, particularly underneath the sensible situations where there are obstructions, e.g., a lake or a mountain, within the coverage space of wireless sensor networks.