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

Ruichun Tang Ruichun Tang,Shuangle Guo Shuangle Guo,Cunqun Gong Cunqun Gong,Hongying Ji Hongying Ji

doi:10.1109/icbnmt.2010.5705148

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

Ruichun Tang Ruichun Tang, Shuangle Guo Shuangle Guo + Show 2 more

https://doi.org/10.1109/icbnmt.2010.5705148

Copy DOI

Publication Date: Oct 1, 2010

Citations: 7

Affiliation: Ocean University of China, Hengshui University

#Wireless Multimedia Sensor Networks #Greedy Routing Algorithms + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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.

Full Text