Least-latency routing over time-dependent wireless sensor networks

IEEE Transactions on Computers

Volumn 62, Issue 5, 2013, Pages 969-983

  Lai, Shouwen ^a   Ravindran, Binoy ^b  

^a QUALCOMM INC   (United States)

^b Virginia Polytechnic Institute and State University   (United States)

Author keywords

least latency; routing; routing maintenance; shortest path; Time dependent; wireless sensor networks

Indexed keywords

LEAST LATENCY; MEMORY REQUIREMENTS; NETWORK CONFIGURATION; ROUTING; SHORTEST PATH; SUBOPTIMAL IMPLEMENTATIONS; TIME DEPENDENT; TIME-DEPENDENT SHORTEST PATHS;

ALGORITHMS; COMPLEX NETWORKS; COSTS; GRAPH THEORY; MAINTENANCE; SENSOR NODES; WIRELESS SENSOR NETWORKS;

PROBLEM SOLVING;

EID: 84875865253     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2012.36     Document Type: Article

References (41)

1. S. Lai and B. Ravindran, "On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks," Proc. IEEE INFOCOM, 2010.
2. C. Schurgers and M.B. Srivastava, "Energy Efficient Routing in Wireless Sensor Networks," Proc. Military Comm. Conf. (MILCOM '01), vol. 1, pp. 357-361, 2001. (Pubitemid 34279024)
3. A. Woo, T. Tong, and D. Culler, "Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks," Proc. First Int'l Conf. Embedded Networked Sensor Systems (Sensys), pp. 14-27, 2003. (Pubitemid 40682331)
4. C.M. Vigorito, D. Ganesan, and A.G. Barto, "Adaptive Control of Duty Cycling in Energy-Harvesting Wireless Sensor Networks," Proc. IEEE Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON), pp. 21-30, June 2007.
5. J. Polastre, J. Hill, and D. Culler, "Versatile Low Power Media Access for Wireless Sensor Networks," Proc. Int'l Conf. Embedded Networked Sensor Systems (Sensys '04), pp. 95-107, 2004. (Pubitemid 41563352)
6. M. Buettner, G.V. Yee, E. Anderson, and R. Han, "X-mac: A Short Preamble MAC Protocol for Duty-Cycled Wireless Sensor Networks," Proc. ACM Fourth Int'l Conf. Embedded Networked Sensor Systems (Sensys), pp. 307-320, 2006. (Pubitemid 47168695)
7. J. Raja, B. Pierre, and V. Cristina, "Adaptive Low Power Listening for Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 6, no. 8, pp. 988-1004, Aug. 2007.
8. Y. Gu and T. He, "Data Forwarding in Extremely Low Duty-Cycle Sensor Networks with Unreliable Communication Links," Proc. Sixth ACM Conf. Embedded Network Sensor Systems (Sensys), pp. 32-38, 2007.
9. K.L. Cooke and E. Halsey, "The Shortest Route Through a Network with Time-Dependent Internodal Transit Times," J. Math. Analysis Application, vol. 14, pp. 493-498, 1966.
10. A. Orda and R. Rom, "Distributed Shortest-Path Protocols for Time-Dependent Networks," Distributed Computing, vol. 10, no. 1, pp. 49-62, 1996. (Pubitemid 126494254)
11. I. Chabini, "Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time," Transportation Research Records, vol. 1645, pp. 170-175, 1998. (Pubitemid 128550908)
12. B. Ding, J.X. Yu, and L. Qin, "Finding Time-Dependent Shortest Paths over Large Graphs," Proc. 11th Int'l Conf. Extending Database Technology (EDBT '08), pp. 205-216, 2008. (Pubitemid 351661703)
13. H. Chon, D. Agrawa, and A. Abbadi, "Fates: Finding a Time Dependent Shortest Path," Mobile Data Management, vol. 2574, pp. 165-180, 2003.
14. A. Orda and R. Rom, "Minimum Weight Paths in Time-Dependent Networks," Networks, vol. 21, pp. 295-319, 1991.
15. C. Serafino, D. Gabriele, F. Daniele, and N. Umberto, "A Fully Dynamic Algorithm for Distributed Shortest Paths," Theoretical Computer Science, vol. 297, nos. 1-3, pp. 83-102, 2003.
16. G. D'Angelo, S. Cicerone, G.D. Stefano, and D. Frigioni, "Partially Dynamic Concurrent Update of Distributed Shortest Paths," Proc. Int'l Conf. Computing: Theory and Applications, pp. 32-38, 2007. (Pubitemid 47133584)
17. H. Wang, X. Zhang, F. Abdesselam, and A. Khokhar, "DPS-MAC: An Asynchronous MAC Protocol for Wireless Sensor Networks," Proc. 14th Int'l Conf. High Performance Computing, vol. 7, pp. 393-404, June 2007.
18. L. Su, C. Liu, H. Song, and G. Cao, "Routing in Intermittently Connected Sensor Networks," Proc. IEEE Int'l Conf. Network Protocols, pp. 278-287, 2008.
19. Y. Gu and T. He, "Bounding Communication Delay in Energy Harvesting Sensor Networks," Proc. IEEE 30th Int'l Conf. Distributed Computing Systems, pp. 837-847, 2010.
20. Y. Gu, T. He, M. Lin, and J. Xu, "Spatiotemporal Delay Control for Low-Duty-Cycle Sensor Networks," Proc. IEEE 30th Real-Time Systems Symp. (RTSS), pp. 127-137, 2009.
21. X. Yang and N.H. Vaidya, "A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and Endto-End Delay," Proc. IEEE 10th Real-Time and Embedded Technology and Applications Symp., 2004.
22. G. Lu, N. Sadagopan, B. Krishnamachari, and A. Goel, "Delay Efficient Sleep Scheduling in Wireless Sensor Networks," Proc. IEEE INFOCOM, pp. 2470-2481, 2005. (Pubitemid 41382362)
23. K.V.S. Ramarao and S. Venkatesan, "On Finding and Updating Shortest Paths Distributively," J. Algorithms, vol. 13, no. 2, pp. 235-257, 1992.
24. S. Haldar, "An "All Pairs Shortest Paths" Distributed Algorithm Using 2n2 Messages," J. Algorithms, vol. 24, no. 1, pp. 20-36, 1997. (Pubitemid 127453992)
25. G.F. Italiano, "Distributed Algorithms for Updating Shortest Paths (Extended Abstract)," Proc. Fifth Int'l Workshop Distributed Algorithms (WDAG), pp. 200-211, 1992.
26. B. Awerbuch, I. Cidon, and S. Kutten, "Communication-Optimal Maintenance of Replicated Information," Proc. 31st Ann. Symp. Foundations of Computer Science (SFCS), pp. 492-502, 1990. (Pubitemid 21663251)
27. B. Awerbuch, "Complexity of Network Synchronization," J. ACM, vol. 32, no. 4, pp. 804-823, 1985.
28. S. Lai, B. Zhang, B. Ravindran, and H. Cho, "CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks," Proc. Int'l Conf. Principles of Distributed Systems (OPODIS). pp. 295-310, 2008.
29. R. Bellman, "On a Routing Problem," Quarterly of Applied Math., vol. 16, no. 1, pp. 87-90, 1958.
30. P. Sommer and R. Wattenhofer, "Gradient Clock Synchronization in Wireless Sensor Networks," Proc. ACM Int'l Conf. Information Processing in Sensor Networks (IPSN), pp. 37-48, 2009.
31. K.M. Chandy and J. Misra, "Distributed Computation on Graphs: Shortest Path Algorithms," Comm. ACM, vol. 25, no. 11, pp. 833-837, 1982. (Pubitemid 13476216)
32. A. Segall, "Distributed Network Protocols," IEEE Trans. Information Theory, vol. 29, no. 1, pp. 23-35, Jan. 1983.
33. J.J. Garcia-Lunes-Aceves, "Loop-Free Routing Using Diffusing Computations," IEEE/ACM Trans. Networking, no. 1, pp. 130-141, Feb. 1993. (Pubitemid 23684683)
34. Y. Sun, O. Gurewitz, and D.B. Johnson, "RI-MAC: A Receiver-Initiated Asynchronous Duty Cycle MAC Protocol for Dynamic Traffic Loads in Wireless Sensor Networks," Proc. ACM Conf. Embedded Network Sensor Systems (Sensys), pp. 1-14, 2008.
35. W.S. Luk and T.T. Huang, "Two New Quorum Based Algorithms for Distributed Mutual Exclusion," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp. 100-106, 1997.
36. W. Ye, J. Heidemann, and D. Estrin, "Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks," IEEE/ACM Trans. Networking, vol. 12, no. 3, pp. 493-506, June 2004.
37. T.V. Dam and K. Langendoen, "An Adaptive Energy-Efficient Mac Protocol for Wireless Sensor Networks," The First ACM Conf. Embedded Networked Sensor Systems (Sensys), 2003.
38. S. Mallat, A Wavelet Tour of Signal Processing: The Sparse Way, third ed. Academic Press, 2008.
39. OMNET++, http://www.omnetpp.org/, 2012.
40. M. Zuniga and B. Krishnamachari, "Analyzing the Transitional Region in Low Power Wireless Links," Proc. IEEE Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON), pp. 517-526, 2004. (Pubitemid 40789315)
41. C.E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," ACM SIGCOMM Computer Comm. Rev., vol. 24, no. 4, pp. 234-244, 1994.