DocumentCode :
2050507
Title :
Heuristic Algorithm Based On Flooding Structure In Wireless Ad Hoc Networks
Author :
Lin-zhu, Wang ; Ya-qin, Fan ; Yang, Yang ; Min, Shan
Author_Institution :
Coll. of Commun. Eng., Jilin Univ., Changchun, China
Volume :
1
fYear :
2010
fDate :
14-15 Aug. 2010
Firstpage :
243
Lastpage :
246
Abstract :
In order to avoid routing overhead and reduce management fee for transmisson of routing information, we purposed two heuristic algorithms which are self-pruning algorithm and dominant pruning algorithm. This algorithm is more efficient than the aimless flooding in wireless networks, and redused unnecessary transmission of information and nodes switching by the movement between neighbourhoods. Result shows that the two kinds of flooding algorithms are obviously superior to the aimless flooding algorithm, particularly the performance of the dominant pruning could almost reach the limit.
Keywords :
ad hoc networks; heuristic programming; telecommunication congestion control; telecommunication network routing; dominant pruning algorithm; heuristic algorithm; nodes switching; routing overhead avoidance; self-pruning algorithm; transmission flooding structure; wireless ad hoc networks; Ad hoc networks; Algorithm design and analysis; Floods; Heuristic algorithms; Routing; Wireless networks; Ad hoc Networks; Flooding Structure; Heuristic Algorithm; self-pruning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Engineering (ICIE), 2010 WASE International Conference on
Conference_Location :
Beidaihe, Hebei
Print_ISBN :
978-1-4244-7506-3
Electronic_ISBN :
978-1-4244-7507-0
Type :
conf
DOI :
10.1109/ICIE.2010.64
Filename :
5571076
Link To Document :
بازگشت