Skip to main content
Log in

TPGF: geographic routing in wireless multimedia sensor networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this paper, we propose an efficient Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm for WMSNs. TPGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs. It finds one shortest (near-shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near-shortest) node-disjoint routing paths. TPGF supports three features: (1) hole-bypassing, (2) the shortest path transmission, and (3) multipath transmission, at the same time. TPGF is a pure geographic greedy forwarding routing algorithm, which does not include the face routing, e.g., right/left hand rules, and does not use planarization algorithms, e.g., GG or RNG. This point allows more links to be available for TPGF to explore more routing paths, and enables TPGF to be different from many existing geographic routing algorithms. Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Gurses, E., & Akan, O. B. (2005). Multimedia communication in wireless sensor networks. Annals of Telecommunications, 60(7–8), 799–827.

    Google Scholar 

  2. Akyildiz, I. F., Melodia, T., & Chowdhury, K. R. (2007). A survey on wireless multimedia sensor networks. Computer Networks, 51(4), 921–960.

    Article  Google Scholar 

  3. Misra, S., Reisslein, M., & Xue, G. (2008). A survey of multimedia streaming in wireless sensor networks. IEEE Communications Surveys and Tutorials, 10(4), 18–39. doi:10.1109/SURV.2008.080404.

    Article  Google Scholar 

  4. He, Z., & Wu, D. (2006). Resource allocation and performance analysis of wireless video sensors. IEEE Transactions on Circuits and Systems for Video Technology, 16(5), 590–599.

    Article  Google Scholar 

  5. Karp, B., & Kung, H. T. (2000). GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of the annual international conference on mobile computing and networking (MobiCom 2000), Boston, USA, August.

  6. Kuhn, F., Wattenhofer, R., & Zollinger, A. (2003). Worst-case optimal and average-case efficient geometric ad-hoc routing. In Proceedings of the 4th ACM international symposium on mobile ad hoc networking and computing (MobiHoc 2003), Annapolis, MD, USA, June, 2003.

  7. Kuhn, F., Wattenhofer, R., Zhang, Y., & Zollinger, A. (2003). Geometric ad-hoc routing: of theory and practice. In Proceedings of the 22nd ACM international symposium on the principles of distributed computing (PODC 2003), Boston, Massachusetts, USA, July 13–16, 2003.

  8. Leong, B., Mitra, S., & Liskov, B. (2005). Path vector face routing: geographic routing with local face information. In Proceedings of the 13th IEEE international conference on network protocols (ICNP 2005), Boston, Massachusetts, USA, November 6–9, 2005.

  9. Gabriel, K., & Sokal, R. (1969). A new statistical approach to geographic variation analysis. Systematic Zoology, 18, 259–278.

    Article  Google Scholar 

  10. Toussaint, G. T. (1980). The relative neighborhood graph of a finite planar set. Pattern Recognition, 12, 261–268.

    Article  Google Scholar 

  11. Frey, H., & Stojmenovic, I. (2006). On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In Proceedings of the international conference on mobile computing and networking (MobiCom 2006), Los Angeles, USA, September, 2006.

  12. Seada, K., Helmy, A., & Govindan, R. (2007). Modeling and analyzing the correctness of geographic face routing under realistic conditions. Ad Hoc Networks, 855–871. doi:10.1016/j.adhoc.2007.02.008.

  13. Fang, Q., Gao, J., & Guibas, L. J. (2004). Locating and bypassing routing holes in sensor networks. In Proceedings of the 23rd conference of the IEEE communications society (INFOCOM 2004), Hong Kong, China, March, 2004.

  14. Jia, W., Wang, T., Wang, G., & Guo, M. (2007). Hole avoiding in advance routing in wireless sensor networks. In Proceedings of the IEEE wireless communication & networking conference (WCNC 2007), USA, March, 2007.

  15. Yu, F., Lee, E., Choi, Y., Park, S., Lee, D., Tian, Y., & Kim, S. (2007). A modeling for hole problem in wireless sensor networks. In Proceedings of the international wireless communications and mobile computing conference (IWCMC 2007), Honolulu, Hawaii, USA, August, 2007.

  16. Tsai, J., & Moors, T. (2006). A review of multipath routing protocols: from wireless ad hoc to mesh networks. In Proceedings of ACoRN early career researcher workshop on wireless multihop networking, Sydney, July 17–18, 2006.

  17. Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless networks. In K. Imielinski (Ed.), Mobile computing. Dordrecht: Kluwer Academic.

    Google Scholar 

  18. Perkins, C. (2003). Ad hoc on-demand distance vector (AODV) routing. RFC 3561.

  19. Zeng, K., Ren, K., & Lou, W. (2005). Geographic on-demand disjoint multipath routing in wireless ad hoc networks. In Proceedings of the military communications conference (MILCOM 2005), Atlantic city, USA, October 17–20, 2005.

  20. Li, S., & Wu, Z. (2005). Node-disjoint parallel multi-path routing in wireless sensor networks. In Proceedings of the second international conference on embedded software and systems (ICESS 2005), Xi’an, China, December 16–18, 2005.

  21. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms. Cambridge: MIT Press.

    Google Scholar 

  22. Hou, X., Tipper, D., & Kabara, J. (2004). Label-based multipath routing (LMR) in wireless sensor networks. In Proceedings of the international symposium on advanced radio technologies, Boulder, USA, March, 2004.

  23. Chang, S. Y., Chen, C., & Jiang, C. J. (2007). Minimum-Delay energy-efficient source to multisink routing in wireless sensor networks. In Proc. of the 13th international conference on parallel and distributed systems (ICPADS 2007) (pp. 1–8), Hsinchu, Taiwan, December, 2007.

  24. Shu, L. Wu, C., & Hauswirth, M. (2008). NetTopo: beyond simulator and visualizor for wireless sensor networks. Technical Report of Digital Enterprise Research Institute, July, 2008.

  25. NetTopo. http://lei.shu.deri.googlepages.com/nettopo.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lei Shu.

Additional information

The work presented in this paper was supported by the Lion project supported by Science Foundation Ireland under grant no. SFI/02/CE1/I131.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shu, L., Zhang, Y., Yang, L.T. et al. TPGF: geographic routing in wireless multimedia sensor networks. Telecommun Syst 44, 79–95 (2010). https://doi.org/10.1007/s11235-009-9227-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-009-9227-0

Navigation