Short and robust communication paths in dynamic wireless networks

Authors:
Yoann Pigné;Frédéric Guinand
Affiliations:
SnT, University of Luxembourg, Luxembourg;LITIS, University of Le Havre, France
Venue:
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Year:
2010

Citing 7
Cited 0

Ant-based load balancing in telecommunications networks

Adaptive Behavior
Location-aided routing (LAR) in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On ant routing algorithms in ad hoc networks with critical connectivity

Ad Hoc Networks
HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network

Ad Hoc Networks
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. We propose two centralized algorithms that help analyse the problem from a dynamic graph point of view. These algorithms give lower bounds for our proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.