DocumentCode
3312621
Title
A Routing Method of Ad Hoc Networks Based on A-star Algorithm
Author
Dong, Zhanqi ; Li, Mingxia
Author_Institution
Dept. of Comput. Sci. & Technol., Nanyang Inst. of Technol., Nanyang
Volume
2
fYear
2009
fDate
25-26 April 2009
Firstpage
623
Lastpage
626
Abstract
The paper proposes a geographic routing based on A-star algorithm. The routing applies A-star algorithm after being reformed in ad hoc networks, which can not only resolves the problem of what to do at local minimum node where greedy forwarding fails, but also can avoid the complexity to construct and manage the routing planar graph in the planar graph routing. Simulations show that the proposed routing performs well in routing protocol message cost and packet delivery success rate.
Keywords
ad hoc networks; packet switching; routing protocols; A-star algorithm; ad hoc networks; geographic routing; greedy forwarding; packet delivery; routing protocol; Ad hoc networks; Computer networks; Computer science; Computer security; Costs; Heuristic algorithms; Mobile ad hoc networks; Paper technology; Routing protocols; Wireless communication; A-star algorithm; ad hoc networks; routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Networks Security, Wireless Communications and Trusted Computing, 2009. NSWCTC '09. International Conference on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-1-4244-4223-2
Type
conf
DOI
10.1109/NSWCTC.2009.21
Filename
4908546
Link To Document