DocumentCode :
2335431
Title :
WLC02-3: On Ant Routing Algorithms in Ad-hoc Networks
Author :
Rosati, Laura ; Berioli, Matteo ; Reali, Gianluca
Author_Institution :
German Aerosp. Center, Inst. of Commun. & Navig., Oberpfaffenhofen
fYear :
2006
fDate :
Nov. 27 2006-Dec. 1 2006
Firstpage :
1
Lastpage :
5
Abstract :
This paper shows a novel approach for routing datagrams in ad-hoc networks, called distributed ant routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating food and storing food. The algorithm aims at minimizing complexity in the nodes and this is achieved at the expenses of the optimality of the derived solution. The work also describes an analytical approach to the problem: The validity of the heuristic approach, ant routing, is supported by mathematical proofs and the same methods helps in the selection of the algorithm parameters. Simulation results are presented at the end to confirm the mathematical calculations.
Keywords :
ad hoc networks; mobile radio; telecommunication network routing; ad-hoc networks; distributed ant routing; heuristic approach; routing datagrams; Ad hoc networks; Aerospace engineering; Algorithm design and analysis; Biological system modeling; Communication networks; Data engineering; Mobile ad hoc networks; Navigation; Routing; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE
Conference_Location :
San Francisco, CA
ISSN :
1930-529X
Print_ISBN :
1-4244-0356-1
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2006.623
Filename :
4151253
Link To Document :
بازگشت