# Utilizing Mobile Nodes for Congestion Control in Wireless Sensor Networks

## TL;DR

This paper introduces a Mobile Congestion Control (MobileCC) algorithm with two variations that utilize mobile nodes to create alternative or disjoint paths, effectively alleviating congestion in Wireless Sensor Networks.

## Contribution

The paper proposes a novel MobileCC algorithm with two variations that assist existing congestion control methods using mobile nodes to improve network performance.

## Key findings

- Both variations significantly reduce congestion.
- Mobile nodes create alternative and disjoint paths.
- Simulation results confirm effectiveness.

## Abstract

Congestion control and avoidance in Wireless Sensor Networks (WSNs) is a subject that has attracted a lot of research attention in the last decade. Besides rate and resource control, the utilization of mobile nodes has also been suggested as a way to control congestion. In this work, we present a Mobile Congestion Control (MobileCC) algorithm with two variations, to assist existing congestion control algorithms in facing congestion in WSNs. The first variation employs mobile nodes that create locally-significant alternative paths leading to the sink. The second variation employs mobile nodes that create completely individual (disjoint) paths to the sink. Simulation results show that both variations can significantly contribute to the alleviation of congestion in WSNs.