Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Hole Modeling and Detour Scheme for Geographic Routing in Wireless Sensor Networks

  • Yu, Fucai (Department of Computer Engineering, Chungnam National University) ;
  • Park, Soo-Chang (Department of Computer Engineering, Chungnam National University) ;
  • Lee, Eui-Sin (Department of Computer Engineering, Chungnam National University) ;
  • Kim, Sang-Ha (Department of Computer Engineering, Chungnam National University)
  • Published : 2009.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

Geographic routing has been considered as an attractive approach in wireless sensor networks, since it routes data packets by using location information rather than global topology information. In geographic routing schemes, packets are usually sent along the boundary of a hole by face routing to detour the hole. As result, all data flows which need to detour the hole are concentrated on the boundary of the hole. This hole detour scheme results in much more energy consumption for nodes at the hole boundary, and the energy exhaustion of hole boundary nodes enlarges the holes. This is referred to as a hole diffusion problem. The perimeter mode may also lead to data collisions on the hole boundary nodes if multiple data flows need to bypass a hole simultaneously. In this paper, we propose a hole modeling and detour scheme for geographic routing in wire-less sensor networks. Our hole modeling and detour scheme can efficiently prevent hole diffusion, avoid the local minimum problem faced by geographic routing protocols, and reduce data collisions on the hole boundary nodes. Simulation results show that the proposed scheme is superior to the other protocols in terms of control overhead, average delivery delay and energy consumption.

Keywords

References

  1. B. Karp and H. Kung, 'GPSR: Greedy perimeter stateless routing for wireless networks,' in Proc. the 6th Annual Int'l Conf on Mobile Computing and Networking, 2000. pp. 243-254 https://doi.org/10.1145/345910.345953
  2. Q. Fang, J. Gao, and L. J. Guibas, 'Located and bypassing routing holes in sensor networks,' in Proc. IEEE INFOCOM, Mar. 2004, pp. 2458-2468
  3. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. 'Routing with guaranteed delivery in ad hoc wireless networks' in Proc. the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'99), 1999, pp. 48-55 https://doi.org/10.1145/313239.313282
  4. T. He, J. A. Stankovic, C. Lu, and T. F. Abdelzaher, 'A spatiotemporal commumcatlon protocol for wireless sensor networks,' IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 10, pp. 995-1006, Oct. 2005 https://doi.org/10.1109/TPDS.2005.116
  5. D. S. J. De Couto and R. Morris, 'Location proxies and intermediate node forwarding for practical geographic forwarding,' Tech. Rep. MIT-LCSTR- 824, MIT Laboratory for Computer Science, June 2001
  6. F. Yu et al. 'A modeling for hole problem in wireless sensor networks,' in Proc. the ACM international conference on Wireless communications and mobile computing, 2007, pp. 370-375 https://doi.org/10.1145/1280940.1281020
  7. F. Yu, S. Park, Y. Tian, M. Jin, and S.-H. Kim, 'Efficient hole detour scheme for geographic routing in wireless sensor networks,' in Proc. IEEE VTC-spring, 2008, pp. 153-157 https://doi.org/10.1109/VETECS.2008.44
  8. F. Yu, Y. Choi, S. Park, E. Lee, Y. Tian, M. Jin, and S.-H. Kim, 'Anchor node based virtual modeling of holes in wireless sensor networks,' in Proc IEEE ICC, May 2008, pp. 3120-3124 https://doi.org/10.1109/ICC.2008.587
  9. F. Yu, S. Park, E. Lee, M. Jih, and S.-H. Kim, "A solution for hole diffusion problem faced by geographic routing scheme," in Proc. Parallel and Distributed Computing and Networks, 2009
  10. J. Hightower and G. Borriello, "Location systems for ubiquitoU8 computing," IEEE Computer, vol. 34, no. 8, Aug. 2001 , pp. 57-66 https://doi.org/10.1109/2.940014
  11. A. Savvides, c.-c. Han, and M. B. Srivastava, "Dynamic fine-grained 10- calization in ad-hoc networks of sensors:" in Proc. MobiCom2001 , pp.166-179
  12. A. Savvidεs and M. B. Strivastava, "Distributed fine-grained localizationin ad-hoc networks," IEEE Trans. Mobile Comput., 2003
  13. A. Ward, A. Jones, and A. Hopper, "Anεw location technique for theactive office," IEEE Pen Commun., vol. 4, no. 5, pp. 42-47, Oct. 1997 https://doi.org/10.1109/98.626982
  14. J. Li, J. Jannotti, D. DeCouto, D. Karger, and R. Morris "A scalable location service for geographic ad-hoc routing," in Proc. the 6th Annual ACM/IEEE Int'l Conf on Mobile Computing and Networking, 2000, pp.120-130
  15. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, "A geographic hash table for data-centric storage," in Proc. the First ACM lnternational Workshop on Wireless Sensor Networks and Applications (WSNA) , 2002, pp. 78-87
  16. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, EIsevier North-Holland, 1976