Subscribe

Issue No.03 - March (2013 vol.12)

pp: 475-488

K. P. Naveen , Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India

A. Kumar , Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.279

ABSTRACT

Our work is motivated 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. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, 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, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al.

INDEX TERMS

wireless sensor networks, Markov processes, statistical distributions, telecommunication network routing, POMDP, relay selection, geographical forwarding, sleep-wake cycling, wireless sensor network, sporadic alarm packet, WSN, local forwarding algorithm, end-to-end delay, one-hop waiting delay, end-to-end total cost objective, probability distribution, partially observable Markov decision process, Relays, Delay, Wireless sensor networks, Mobile computing, Computational modeling, Probability, opportunistic forwarding, Relay selection, wireless sensor networks, sleep-wake cycling, geographical forwarding, asset selling problem, wireless networks with intermittent links

CITATION

K. P. Naveen, A. Kumar, "Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks",

*IEEE Transactions on Mobile Computing*, vol.12, no. 3, pp. 475-488, March 2013, doi:10.1109/TMC.2011.279REFERENCES

- [1] J. Kim, X. Lin, and N. Shroff, "Optimal Anycast Technique for Delay-Sensitive Energy-Constrained Asynchronous Sensor Networks,"
Proc. IEEE INFOCOM, pp. 612-620, Apr. 2009.- [2] Q. Cao, T. Abdelzaher, T. He, and J. Stankovic, "Towards Optimal Sleep Scheduling in Sensor Networks for Rare-Event Detection,"
Proc. Fourth Int'l Symp. Information Processing in Sensor Networks (IPSN '05), 2005.- [3] K. Premkumar, A. Kumar, and J. Kuri, "Distributed Detection and Localization of Events in Large Ad Hoc Wireless Sensor Networks,"
Proc. 47th Ann. Allerton Conf. Comm., Control, and Computing, pp. 178-185, Sept. 2009.- [4] K.P. Naveen and A. Kumar, "Tunable Locally-Optimal Geographical Forwarding in Wireless Sensor Networks with Sleep-Wake Cycling Nodes,"
Proc. IEEE INFOCOM, pp. 1-9, Mar. 2010.- [5] K. Akkaya and M. Younis, "A Survey on Routing Protocols for Wireless Sensor Networks,"
Ad Hoc Networks, vol. 3, no. 3, pp. 325-349, 2005.- [6] M. Mauve, J. Widmer, and H. Hartenstein, "A Survey on Position-Based Routing in Mobile Ad-Hoc Networks,"
IEEE Network, vol. 15, no. 6, pp. 30-39, Nov./Dec. 2001.- [7] J.H. Chang and L. Tassiulas, "Maximum Lifetime Routing in Wireless Sensor Networks,"
IEEE/ACM Trans. Networking, vol. 12, no. 4, pp. 609-619, Aug. 2004.- [8] J. Xu, B. Peric, and B. Vojcic, "Performance of Energy-Aware and Link-Adaptive Routing Metrics for Ultra Wideband Sensor Networks,"
Mobile Network Applications, vol. 11, no. 4, pp. 509-519, 2006.- [9] M. Zorzi and R.R. Rao, "Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance,"
IEEE Trans. Mobile Computing, vol. 2, no. 4, pp. 337-348, Oct.-Dec. 2003.- [10] S. Liu, K.W. Fan, and P. Sinha, "CMAC: An Energy Efficient MAC Layer Protocol Using Convergent Packet Forwarding for Wireless Sensor Networks,"
Proc. IEEE CS Conf. Fourth Ann. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '07), pp. 11-20, June 2007.- [11] V. Paruchuri, S. Basavaraju, A. Durresi, R. Kannan, and S.S. Iyengar, "Random Asynchronous Wakeup Protocol for Sensor Networks,"
Proc. Int'l Conf. Broadband Networks, pp. 710-717, 2004.- [12] P. Chaporkar and A. Proutiere, "Optimal Joint Probing and Transmission Strategy for Maximizing throughput in Wireless Systems,"
IEEE J. Selected Areas in Comm., vol. 26, no. 8, pp. 1546-1555, Oct. 2008.- [13] N.B. Chang and M. Liu, "Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access,"
Proc. ACM MobiCom, pp. 27-38, 2007.- [14] M. Sakaguchi, "Dynamic Programming of Some Sequential Sampling Design,"
J. Math. Analysis and Applications, vol. 2, no. 3, pp. 446-466, 1961.- [15] S. Karlin, "Stochastic Models and Optimal Policy for Selling an Asset,"
Studies in Applied Probability and Management Science, K.J. Arrow, S. Karlin, and H. Scarf, eds. Stanford Univ., 1962.- [16] B.K. Kang, "Optimal Stopping Problem with Double Reservation Value Property,"
European J. Operational Research, vol. 165, no. 3, pp. 765-785, 2005.- [17] I. David and O. Levi, "A New Algorithm for the Multi-Item Exponentially Discounted Optimal Selection Problem,"
European J. Operational Research, vol. 153, no. 3, pp. 782-789, 2004.- [18] M.S. Ee, "Asset-Selling Problem with an Uncertain Deadline, Quitting Offer, and Search Skipping Option,"
European J. Operational Research, vol. 198, no. 1, pp. 215-222, 2009.- [19] K.P. Naveen and A. Kumar, "Relay Selection with Partial Information in Wireless Sensor Networks," technical report, http://arxiv.org/abs1101.3835, 2011.
- [20] G.E. Monahan, "A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms,"
Management Sciences, vol. 28, no. 1, pp. 1-16, Jan. 1982.- [21] D.P. Bertsekas,
Dynamic Programming and Optimal Control, vol. I. Athena Scientific, 2005.- [22] W.S. Lovejoy, "A Survey of Algorithmic Methods for Partially Observed Markov Decision Processes,"
Annals Operations Research, vol. 28, nos. 1-4, pp. 47-66, 1991.- [23] R.D. Smallwood and E.J. Sondik, "The Optimal Control of Partially Observable Markov Processes over a Finite Horizon,"
Operations Research, vol. 21, no. 5, pp. 1071-1088, 1973.- [24] J.M. Porta, N. Vlassis, M.T.J. Spaan, and P. Poupart, "Point-Based Value Iteration for Continuous POMDPs,"
J. Machine Learning Research, vol. 7, pp. 2329-2367, 2006.- [25] S. Boyd and L. Vandenberghe,
Convex Optimization. Cambridge Univ., Mar. 2004.- [26] H.A. David and H.N. Nagaraja,
Order Statistics, Wiley Series in Probability and Statistics. Wiley-Interscience, Aug. 2003.- [27] D. Bertsekas and R. Gallager,
Data Networks. Prentice-Hall, 1992. |