Title of Paper: Swarm-based Routing Algorithms for Sensor and
Satellite Networks
Principal Author: Dr. Payman Arabshahi
Abstract: Sensor networks, as well as satellite
constellations, face a number of challenges for reliable and robust
communications. Increasingly heterogeneous nodes, and a multitude of new emerging
Earth science applications put additional constraints on throughput and delay
requirements in such networks. These problems can be further aggravated by
energy and bandwidth constraints on the network nodes. Quality of service and
performance of such wireless networks, in the presence of such issues, are
greatly affected by network routing and bandwidth allocation. We propose a new
class of routing algorithms, based on principles of biological swarms, which
have the potential to address
these problems in an autonomous and intelligent fashion. Such swarm-based
algorithms adapt well to dynamic topologies, and have been shown to result in
the highest throughput and lowest delays in Internet-style networks, as
compared to the current
state-of-the-art. Swarm-based routing
algorithms boast a number of attractive
features, including autonomy, robustness and fault-tolerance. They rely on the
interaction of autonomous agents who communicate with each other through the environment
(a phenomenon known as stigmergy). Current swarm based routing algorithms focus
on wired circuit or packet switched networks; we will demonstrate new swarm
routing algorithms suitable for wireless sensor or satellite networks.
We also focus on another component of network control, namely, bandwidth allocation, for the case
of satellite to ground communication. Biologically inspired methodologies such
as genetic algorithms or particle swarm optimization will be used for
concurrent maximization of the data rate and minimization of transmitter power
usage for line-of-sight communication between an earth orbiting satellite and a
ground station, subject to constraints on the bit error rate (BER) at the
receiver.