This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol
November 2010 (vol. 9 no. 11)
pp. 1649-1661
ASCII Text
x 
 
Roberto Beraldi, Roberto Baldoni, Ravi Prakash, "A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol," IEEE Transactions on Mobile Computing, vol. 9, no. 11, pp. 1649-1661, November, 2010.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2010.131,
author = {Roberto Beraldi and Roberto Baldoni and Ravi Prakash},
title = {A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol},
journal ={IEEE Transactions on Mobile Computing},
volume = {9},
number = {11},
issn = {1536-1233},
year = {2010},
pages = {1649-1661},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2010.131},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol
IS - 11
SN - 1536-1233
SP1649
EP1661
EPD - 1649-1661
A1 - Roberto Beraldi,
A1 - Roberto Baldoni,
A1 - Ravi Prakash,
PY - 2010
KW - Wireless sensor network
KW - random walk
KW - delay-tolerant network
KW - duty cycle.
VL - 9
JA - IEEE Transactions on Mobile Computing
ER -
 
Roberto Beraldi, University La Sapienza, Rome, Italy
Roberto Baldoni, University La Sapienza, Rome, Italy
Ravi Prakash, University of Texas at Dallas, Richardson, TX
Low-latency data delivery is an important requirement for achieving effective monitoring through wireless sensor networks. When sensor nodes employ duty cycling, sending a message along the shortest path, however, does not necessarily result in minimum delay. In this paper, we first study the lowest latency path problem, i.e., the characteristics of a path with minimum delay that connects a source node to the sink under random duty cycling nodes. Then, we propose a forwarding protocol based on biased random walks, where nodes only use local information about neighbors and their next active period to make forwarding decisions. We refer to this as lukewarm potato forwarding. Our analytical model and simulation experiments show that it is possible to reduce path latency without significantly increasing the number of transmissions (energy efficiency) needed to deliver the message to the destination. In particular, although deviating from the shortest path requires additional transmissions, and hence, higher energy consumption, this increase is compensated by a lighter duty cycle. Our experiments show that, overall, we can save up to 15 percent of energy while obtaining the same data delivery delay as shortest path routing. Additionally, the proposed solution is tunable. By changing the value of just one threshold parameter, it can be tuned to operate anywhere in the continuum from hot potato/random walk forwarding protocol to a deterministic shortest path forwarding protocol.

[1] C. Avin and G. Ercal, "On the Cover Time of Random Geometric Graphs," Proc. Int'l Colloquium Automata, Languages and Programming (ICALP '05), 2005.
[2] C. Avin and C. Brito, "Efficient and Robust Query Processing in Dynamic Environment Using Random Walk Techniques," Proc. Third Int'l Symp. Information Processing in Sensor Networks, 2004.
[3] Z. Bar-Yossef, R. Friedman, and G. Kliot, "RaWMS—Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks," Proc. MobiHoc, 2006.
[4] R. Beraldi, R. Baldoni, and R. Prakash, "Lukewarm Potato Forwarding: A Biased Random Walk Routing Protocol for Wireless Sensor Networks," Proc. IEEE Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '09), 2009.
[5] R. Beraldi, L. Querzoni, and R. Baldoni, "A Hint-Based Probabilistic Protocol for Unicast Communications in MANETs," Elsevier J. Ad Hoc Networks, vol. 4, no. 5, pp. 547-566, 2006.
[6] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip and Mixing Times of Random Walks on Random Graphs," Proc. SIAM Workshop Analytic Algorithmics and Combinatorics (ANALCO), 2005.
[7] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "SPAN: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks," ACM Wireless Networks, vol. 8, pp. 481-494, Sept. 2002.
[8] S. Dolev, E. Schiller, and J. Welch, "Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks," Proc. 21st Symp. Principles of Distributed Computing (PODC), 2002.
[9] O. Dousse, P.P. Mannersalo, and P. Thiran, "Latency of Wireless Sensor Networks with Uncoordinated Power Saving Mechanisms," Proc. ACM MobiHoc, 2004.
[10] J.N. Al-Karaki and A.E. Kamal, "Routing Techniques in Wireless Sensor Networks: A Survey," IEEE Wireless Comm., vol. 11, no. 6, pp. 6-28, Dec. 2004.
[11] S. Kumar, T.H. Lai, and J. Balogh, "On k-Coverage in a Mostly Sleeping Sensor Network," Proc. ACM MobiCom, 2004.
[12] L. Lovazs, "Random Walks on Graphs: A Survey," Combinatorics, Paul Erdos in Eighty, vol. 2, J'anos Bolyai Math. Soc., 1993.
[13] V. Paruchuri, S. Basavaraju, A. Durresi, and R. Kannan, "Random Asynchronous Wakeup Protocol for Sensor Networks" Proc. Int'l Conf. Broadband Networks (BroadNets '04), pp. 710-717, Oct. 2004.
[14] M. Günes and O. Spaniol, "Ant-Routing-Algorithm for Mobile Multi-Hop Ad-Hoc Networks," Proc. IWAHN, 2002.
[15] Y. Xu, J. Heidemann, and D. Estrin, "Geography-Informed Energy Conservation for Ad-Hoc Routing," Proc. Seventh Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking, pp. 70-84, 2001.
[16] W. Ye, J. Heidemann, and D. Estrin, "An Energy-Efficient MAC Protocol for Wireless Sensor Networks," Proc. IEEE INFOCOM, vol. 3, pp. 1567-1576, June 2002.
[17] C. Schurgers, V. Tsiatsis, S. Ganeriwal, and M. Srivastava, "Optimizing Sensor Networks in the Energy-Latency-Density Design Space," IEEE Trans. Mobile Computing, vol. 1, no. 1, pp. 70-80, Jan.-Mar. 2002.
[18] S. Singh and C.S. Raghavendra, "PAMASPower Aware Multiaccess Protocol with Signalling for Ad Hoc Networks," ACM SIGCOMM Computer Comm. Rev., vol. 28, pp. 5-26, July 1998.
[19] B. Sundararaman, U. Buy, and A.D. Kshemkalyani, "Clock Synchronization for Wireless Sensor Networks: A Survey," Ad Hoc Networks, vol. 3, no. 3, pp. 281-323, May 2005.
[20] R. Zheng, C. Hou, and S. Lui, "Asynchronous Wakeup for Ad Hoc Networks," Proc. ACM MobiHoc, pp. 35-45, June 2003.
[21] J. Elson, L. Girod, and D. Estrin, "Fine-Grained Network Time Synchronization Using Reference Broadcasts," ACM SIGOPS Operating Systems Rev., vol. 36, pp. 147-163, 2002.

Index Terms:
Wireless sensor network, random walk, delay-tolerant network, duty cycle.
Citation:
Roberto Beraldi, Roberto Baldoni, Ravi Prakash, "A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol," IEEE Transactions on Mobile Computing, vol. 9, no. 11, pp. 1649-1661, Nov. 2010, doi:10.1109/TMC.2010.131
Usage of this product signifies your acceptance of the Terms of Use.