• Anuradha Hande
• Dr. S.V.Sonekar

We seek to develop local forwarding algorithms that can be tuned so as to trade off the end-to-end delay. The proposed work is inspired by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. The reward metric used for the problem is depending on the end-to-end total cost objective. The forwarding node is uncertain about the reward metric values, number of relays and their wake-up times. When a relay reveals its reward value and the forwarding node’s problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, proposed work can be considered as a variant of the asset selling problem. We design our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy.

Wireless sensor network, Markov decision process, local forwarding

"Wireless sensor network sleep-wake cycling in relay selection for geographical forwarding", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.260-264, May-2019, Available :http://www.jetir.org/papers/JETIRCE06036.pdf

"Wireless sensor network sleep-wake cycling in relay selection for geographical forwarding", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp260-264, May-2019, Available at : http://www.jetir.org/papers/JETIRCE06036.pdf