By Topic

Geographic routing in random duty-cycled wireless multimedia sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Kun Wang ; Software Sch., Dalian Univ. of Technol., Dalian, China ; Lei Wang ; Can Ma ; Lei Shu
more authors

This paper focuses on studying the performance of TPGF geographic routing algorithm with multi routing metric called McTPGF in random duty-cycled wireless multimedia sensor networks (WMSNs). The multi-metric contains the geographic distance and the time, which is called sleeping-delay in this paper, the forwarding node waits to forward packet to the neighbor node after it wakes up. We recognize the fact that in random duty-cycled WMSNs, geographic routing should not only consider the geographic distance of the neighbor node but also the sleeping-delay of the node at that moment. The significant difference between our work and the TPGF is that our work pays more attentions to the demand of finding a single routing path with low sleeping-delay at a certain time using TPGF while the traditional TPGF algorithm focuses on finding all node-disjoint paths in the given network topology. Simulations are conducted to evaluate that the McTPGF reduces the end-to-end delay with the cost of adding few hop counts compared with the traditional TPGF algorithm in random duty-cycled WMSNs.

Published in:

GLOBECOM Workshops (GC Wkshps), 2010 IEEE

Date of Conference:

6-10 Dec. 2010