Routing Void Problem of Greedy Forwarding Strategy in Wireless Sensor Networks

Ward A, Jones A, and Hopper A. A new location technique for the active office. IEEE Personal Communications, 1997, 4(5): 42-47.[2]Savvides A, Han Chih-Chieh, and Strivastava M B. Dynamic fine-grained localization in ad hoc networks of sensors. In Proceedings of the Seventh ACM Annual International Conference on Mobile Computing and Networking, ROME, Italy, 2001: 166-179.[3]Bulusu N, Heidemann J, and Estrin D. Gps-less low cost outdoor localization for very small devices. IEEE Personal Communications Magazine, 2000, 7(5): 28-34.[4]Priyantha N B, Chakraborty A, and Balakrishnan H. The cricket location-support system. In Proceedings of the ACM Sixth Annual International Conference on Mobile Computing and Networking, Boston, MA, 2000: 32-43.Karp B and Kung H T. GPSR: Greedy Perimeter Stateless Routing for wireless networks. In Proceedings of the Sixth ACM Annual International Conference on Computing and Networking, Boston, MA, 2000: 243-254.[5]Bose P, Morin P, and Stojmenovic I, et al.. Routing with guaranteed delivery in Ad hoc wireless networks. In Proceedings of Discrete Algorithms and Methods for Mobility, Seattle, 1999: 48-55.[6]Datta S, Stojmenovic I, and Wu J. Internal node and shortcut based routing with guaranteed delivery in wireless networks. In Proc. of IEEE International Conference on Distributed Computing and Systems Workshops, Phoenix, AR, 2001: 461-466.[7]Kuhn F, Wattenhofer R, and Zollinger A. Worst-case optimal and average-case efficient geometric Ad-Hoc routing. In Proceedings of the Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing, Annapolis, Maryland, 2003: 267-278.Kuhn F, Wattenhofer R, and Zhang Y, et al.. Geometric Ad hoc routing: of theory and practice. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, Boston, 2003: 63-72.[8]Toussaint G. The relative neighborhood graph of a finite planar set[J].Pattern Recognition.1980, 12(4):261-268[9]Gabriel K and Sokal R. A new statistical approach to geographic variation analysis[J].Systematic Zoology.1969, 18:259-278[10]Xing Guoliang, Lu Chenyang, and Pless R, et al.. On greedy geographic routing algorithms in sensing covered networks. In Proceedings of the Tenth ACM Annual International Conference on Mobile Computing and Networking, Tokyo, Japan, 2004: 31-42.[11]Bettstetter C, Hartenstein H, and Perez-Costa X. Stochastic properties of the random waypoint mobility model: epoch length, direction distribution, and cell change Rate. In Proceedings of the Fifth ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Atlanta, GA, 2002: 7-14.Mainwaring A, Polastre J, and Szewczyk R, et al.. Wireless sensor networks for habitat monitoring. In Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, GA, 2002: 88-97.[12]Szewczyk R, Mainwaring A, and Polastre J, et al.. An analysis of a large scale habitat monitoring application. In Proceedings. of the Third ACM Conference on Embedded Networked Sensor Systems, Baltimore, MD, 2004: 214-226.[13]Tolle G, Turner N, and Tu K, et al.. A macroscope in the redwoods. In Proc. of the Fourth ACM Conference on Embedded Networked Sensor Systems, San Diego, CA, 2005: 51-63.