Indian Institute of Science
In a large Wireless Sensor Network (WSN) with sleep-wake cycling nodes, the authors are interested in the local decision problem faced by a node that has "Custody" of a packet and has to choose one among a set of next-hop relay nodes. Each of the relays is associated with a "Reward" that summarizes the cost/benefit of forwarding the packet through that relay. They seek a locally optimal solution to this problem, the idea being that such a solution, if adopted by every node, could provide a reasonable local heuristic for the end-to-end forwarding problem. Towards this end, they propose a local forwarding problem where the relays wake-up at random times, at which instants they reveal the probability distributions of their rewards.