ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

Naveen, KP and Kumar, Anurag (2015) Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks. In: ACM TRANSACTIONS ON SENSOR NETWORKS, 11 (3).

[img] PDF
ACM_Tra_on_Sen_net_11-3_52_2015.pdf - Published Version
Restricted to Registered users only

Download (694kB) | Request a copy
Official URL: http://dx.doi.org/ 10.1145/2757280


In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we 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 to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the ASSOC COMPUTING MACHINERY, 2 PENN PLAZA, STE 701, NEW YORK, NY 10121-0701 USA
Keywords: Theory; Algorithms; Performance; Wireless sensor networks; sleep-wake cycling; geographical forwarding; Markov decision processes; stochastic ordering; asset selling problem
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 19 Jul 2015 09:40
Last Modified: 19 Jul 2015 09:40
URI: http://eprints.iisc.ac.in/id/eprint/51886

Actions (login required)

View Item View Item