By Topic

A Heuristic Optimization algorithm for Geographic Greedy Hole-Bypassing routing algorithms in WMSNs

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

4 Author(s)
Ruichun Tang ; Coll. of Inf. Sci. & Eng., Ocean Univ. of China, Qingdao, China ; Shuangle Guo ; Hongying Ji ; Cunqun Gong

The hole-bypassing problem in WMSNs(wireless multimedia sensor networks) is considered. Based on heuristic thinking, a Heuristic Optimization algorithm for Geographic Greedy Hole-Bypassing routing algorithms (HOGGHB) is proposed. Firstly, the critical nodes are explored in the route provided by an existing greedy routing algorithm. Secondly, the optimization gain ratios of the optimizable subroutes between every two critical nodes are computed, and then the optimizable subroutes with the large optimization gain ratios are selected to be optimized. Simulation results demonstrate the validity of HOGGHB algorithm.

Published in:

Broadband Network and Multimedia Technology (IC-BNMT), 2010 3rd IEEE International Conference on

Date of Conference:

26-28 Oct. 2010