This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Impact of Sensing Coverage on Greedy Geographic Routing Algorithms
April 2006 (vol. 17 no. 4)
pp. 348-360

Abstract—Greedy geographic routing is an attractive localized routing scheme for wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may fail due to routing voids on random network topologies. We study greedy geographic routing in an important class of wireless sensor networks (e.g., surveillance or object tracking systems) that provide sensing coverage over a geographic area. Our analysis and simulation results demonstrate that an existing geographic routing algorithm, greedy forwarding (GF), can successfully find short routing paths based on local states in sensing-covered networks. In particular, we derive theoretical upper bounds on the network dilation of sensing-covered networks under GF. We also propose a new greedy geographic routing algorithm called Bounded Voronoi Greedy Forwarding (BVGF) that achieves path dilation lower than 4.62 in sensing-covered networks as long as the communication range is at least twice the sensing range. Furthermore, we extend GF and BVGF to achieve provable performance bounds in terms of total number of transmissions and reliability in lossy networks.

[1] F. Aurenhammer, “Voronoi Diagrams— A Survey of a Fundamental Geometric Data Structure,” ACM Computing Surveys, vol. 23, no. 3, pp. 345-405, 1991.
[2] F. Baccelli, K. Tchoumatchenko, and S. Zuyev, “Markov Paths on the Poisson-Delaunay Graph with Applications to Routing in Mobile Networks,” Advances Applied Probability, vol. 32, 2000.
[3] P. Bose and P. Morin, “Online Routing in Triangulations,” ISAAC: Proc. 10th Int'l Symp. Algorithms and Computation, 1999.
[4] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001.
[5] K. Chakrabarty, S.S. Iyengar, H. Qi, and E. Cho, “Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks,” IEEE Trans. Computers, vol. 51, no. 12, pp. 1448-1453, Dec. 2002.
[6] L. Chew, “There Is a Planar Graph Almost as Good as the Complete Graph,” Proc. Second Ann. ACM Symp. Computional Geometry, pp. 169-177, 1986.
[7] T. Couqueur, V. Phipatanasuphorn, P. Ramanathan, and K.K. Saluja, “Sensor Deployment Strategy for Target Detection,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications, pp. 169-177, Sept. 2002.
[8] Crossbow, Mica, and Mica2 Wireless Measurement System Datasheets, 2003.
[9] D.P. Dobkin, S.J. Friedman, and K.J. Supowit, “Delaunay Graphs Are Almost as Good as Complete Graphs,” Discrete and Computational Geometry, 1990.
[10] M. Duarte and Y.-H. Hu, “Distance Based Decision Fusion in a Distributed Wireless Sensor Network,” Proc. Second Int'l Workshop Information Processing in Sensor Networks (IPSN 2003), Apr. 2003.
[11] D. Eppstein, “Spanning Trees and Spanners,” Technical Report ICS-TR-96-16, 1996.
[12] G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” Technical Report ISI Research Report ISU/RR-87-180, Inst. for Scientific Information, Mar. 1987.
[13] J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Geometric Spanner for Routing in Mobile Networks,” Proc. Second ACM Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '01), pp. 45-55, Oct. 2001.
[14] G.L. Goodman, “Detection and Classification for Unattended Ground Sensors,” Proc. Information Decision and Control '99, pp. 419-424, Feb. 1999.
[15] J.M. Keil and C.A. Gutwin, “Classes of Graphs Which Approximate the Complete Euclidean Graph,” Discrete Computational Geometry, no. 7, 1992.
[16] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. Sixth ACM Int'l Conf. Mobile Computing and Networking (MobiCom '00), pp. 243-254, 2000.
[17] E. Kranakis, H. Singh, and J. Urrutia, “Compass Routing on Geometric Networks,” Proc. 11th Canadian Conf. Computational Geometry, pp. 51-54, Aug. 1999.
[18] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing,” Proc. Fourth ACM Int'l Symp. Mobile Ad-Hoc Networking and Computing (MobiHoc), 2003.
[19] J. Kuruvila, A. Nayak, and I. Stojmenovic, “Hop Count Optimal Position Based Packet Routing Algorithms for Ad Hoc Wireless Networks with a Realistic Physical Layer,” Proc. First IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS), 2004.
[20] D. Li, K. Wong, Y.H. Hu, and A. Sayeed, “Detection, Classification and Tracking of Targets in Distributed Sensor Networks,” IEEE Signal Processing Magazine, vol. 19, no. 2, Mar. 2002.
[21] J. Li, J. Jannotti, D.S.J. D. Couto, D.R. Karger, and R. Morris, “A Scalable Location Service for Geographic Ad-Hoc Routing,” Proc. Sixth ACM Int'l Conf. Mobile Computing and Networking (MobiCom '00), pp. 120-130, Aug. 2000.
[22] X.-Y. Li, G. Calinescu, and P.-J. Wan, “Distributed Construction of a Planar Spanner and Routing for Ad Hoc Wireless Networks,” June 2002.
[23] M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad Hoc Networks,” 2001.
[24] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M.B. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” Proc. INFOCOM, pp. 1380-1387, 2001.
[25] R. Ramanathan and R. Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. INFOCOM, 2000.
[26] K. Seada, M. Zuniga, A. Helmy, and B. Krishnamachari, “Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks,” Proc. Second Int'l Conf. Embedded Networked Sensor Systems (SenSys '04), 2004.
[27] Sensoria, “SGate Datasheet,” 2003.
[28] SonicWall, “Long Range Wireless Card Datasheet,” 2003.
[29] I. Stojmenovic and X. Lin, “Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, pp. 1023-1032, Oct. 2001.
[30] H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals,” IEEE Trans. Comm., vol. 32, no. 3, pp. 246-257, 1984.
[31] D. Tian and N.D. Georganas, “A Coverage-Preserved Node Scheduling Scheme for Large Wireless Sensor Networks,” Proc. First Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), pp. 169-177, Sept. 2002.
[32] P. Varshney, Distributed Detection and Data Fusion. New York: Spinger-Verlag, 1996.
[33] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C.D. Gill, “Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks,” ACM Trans. Sensor Networks, vol. 1, no. 1, 2005.
[34] R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang, “Distributed Topology Control for Wireless Multihop Ad-Hoc Networks,” Proc. INFOCOM, pp. 1388-1397, 2001.
[35] A. Woo, T. Tong, and D. Culler, “Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks,” SenSys, 2003.
[36] G. Xing, C. Lu, R. Pless, and Q. Huang, “On Greedy Geographic Routing Algorithms in Sensing-Covered Networks,” Proc. Fifth ACM Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '04), May 2004.
[37] T. Yan, T. He, and J.A. Stankovic, “Differentiated Surveillance for Sensor Networks,” Proc. First Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), 2003.
[38] F. Ye, G. Zhong, S. Lu, and L. Zhang, “PEAS: A Robust Energy Conserving Protocol for Long-Lived Sensor Networks,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS '03), pp. 169-177, May 2003.
[39] H. Zhang and J.C. Hou, “Maintaining Coverage and Connectivity in Large Sensor Networks,” The Wireless Ad Hoc and Sensor Networks: An Int'l J., 2005.
[40] J. Zhao and R. Govindan, “Understanding Packet Delivery Performance in Dense Wireless Sensor Networks,” Sensys, Nov. 2003.
[41] M. Zuniga and B. Krishnamachari, “Analyzing the Transitional Region in Low Power Wireless Links,” Proc. First IEEE Int'l Conf. Sensor and Ad Hoc Comm. and Networks (SECON), Oct. 2004.

Index Terms:
Sensor networks, coverage, geographic routing, greedy routing, wireless communication.
Citation:
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng Huang, "Impact of Sensing Coverage on Greedy Geographic Routing Algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 4, pp. 348-360, April 2006, doi:10.1109/TPDS.2006.48
Usage of this product signifies your acceptance of the Terms of Use.