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

Author

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

Author_Institution

Coll. of Inf. Sci. & Eng., Ocean Univ. of China, Qingdao, China

fYear

2010

fDate

26-28 Oct. 2010

Firstpage

540

Lastpage

545

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.

Keywords

multimedia communication; optimisation; telecommunication network routing; wireless sensor networks; critical nodes; geographic greedy hole-bypassing routing algorithms; heuristic optimization algorithm; optimization gain ratios; wireless multimedia sensor networks; Heuristic algorithms; Monitoring; Optimization; Routing; HOGGHB; WMSNs; hole-bypassing routing; routing optimization;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Beijing

Print_ISBN

978-1-4244-6769-3

Type

conf

DOI

10.1109/ICBNMT.2010.5705148

Filename

5705148