Multi-hop Congestion Control Algorithm in Mobile Wireless Networks

This paper focuses on the congestion control problem on a multi-hop path in mobile wireless networks. Conventional congestion control algorithms do not consider highly mobile devices in a network where link status changes frequently. The assumption of link validity in proactive algorithms results in high network overhead. In this paper, a new on-demand method of congestion control in multi-hop communication within a wireless network is proposed. The basic idea is to monitor each node's backpressure and identify the flooded links. Then it provides means for optimization of the congested link and regulation of the data rate at the source of network congestion. The main results are an increase of the overall network throughput and the possibility of co-existence for nodes with different rates. This algorithm is particularly important in urban settings characterized by a high density of mobile devices.