Simple Ant Routing Algorithm

被引:0
作者
Correia, Fernando [1 ]
Vazao, Teresa [2 ]
机构
[1] Univ Tecn Lisboa, Inst Super Tecn, Lisbon, Portugal
[2] Inesc ID & Inst Super Tecnico, Lisbon, Portugal
来源
2008 THE INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING | 2008年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. This paper presents a MANET routing protocol, inspired in insect societies' biological models, the Simple Ant Routing Algorithm (SARA), which provides a simple and efficient routing solution. SARA uses a controlled neighbour broadcast route discovery procedure, aimed at reducing the routing overhead of existing solutions. In this controlled neighbour broadcast strategy, every node collects routing information received from its neighbours and updates its own routing information accordingly, but only one of them is responsible for forwarding this information. The selection of the node which will be responsible for this task is made. Simulation results have shown that, besides reducing the overhead incurred by the routing protocol, SARA also provides a solution to detect early congestion link situations and tries to re-route the traffic through alternative routes (if available).
引用
收藏
页码:464 / +
页数:3
相关论文
共 16 条
[1]  
Beijar N., 2002, ZONE ROUTING PROTOCO
[2]  
BELDINGROYER CEP, 2003, AD HOC ON DEMAND DIS
[3]  
BISWAS RMS, 2003, 2 WORKSH HOT TOP NET
[4]  
BONNET C, 2002, HARP HYBRID AD HOC R
[5]  
BOUAZIZI MG, 2003, 2 MED WORKSH AD HOC
[6]  
Broch J., 1998, MobiCom'98. Proceedings of Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, P85, DOI 10.1145/288235.288256
[7]  
Clausen T., 2003, Open Link State Routing Daemon (OLSR)
[8]  
Di Caro G, 2004, LECT NOTES COMPUT SC, V3242, P461
[9]   THE CHALLENGES OF MOBILE COMPUTING [J].
FORMAN, GH ;
ZAHORJAN, J .
COMPUTER, 1994, 27 (04) :38-47
[10]  
He Guoyou., 2002, DESTINATION SEQUENCE