Chaotic ant colony algorithm to control congestion and enhance opportunistic routing in multimedia network

Abstract

The creation of wireless multimedia networks imposed wireless devices that can retrieve multimedia material such as video and audio streams, still photos, and scalar sensor data from the environment is made possible by the availability of low-cost devices. This approach considers the issues of routing packets across a multi-hop network consisting of several traffic sources and links when ensuring bounded delay. The exits of an obstacle create several geographic routing issues, for example, congestion and delay. This article, chaotic ant colony algorithm (CACA) to control congestion and enhance opportunistic routing (CAOR) in multimedia network, is proposed to solve these issues. This mechanism uses the CACA algorithm to detect the obstacle and transmit the data packets on the obstacle edges optimal nodes. Moreover, an opportunistic routing (OR) selects the best forwarder by the forward aware factor (FAF) from the forwarder list (FL). The FAF measures node energy, node received signal strength indication (RSSI), available bandwidth (AB), and packet transmission rate for choosing the best forwarder. Experimental outcomes demonstrate that established delay, energy utilization, and throughput performances are greater than the conventional mechanism.