Journal
TELECOMMUNICATION SYSTEMS
Volume 44, Issue 1-2, Pages 79-95Publisher
SPRINGER
DOI: 10.1007/s11235-009-9227-0
Keywords
Multimedia sensor networks; Geographic routing; Multipath transmission; Realistic conditions
Categories
Funding
- Science Foundation Ireland [SFI/08/CE/I1380]
- US NSF [CNS-0721666]
- University of North Carolina at Charlotte
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available