The main intention of this paper is focus on mechanism for reducing congestion in the network by free resources to set accurate rates and priority data needs. If two nodes send their packets in the shortest path to the parent node in a crowded place, a source node must prioritize the data and uses data that have lower priorities of a suitable detour nodes consisting of low or non- active consciously. The proposed algorithm is applied to the nodes near the base station (which convey more traffic) after the congestion detection mechanism detected the congestion. Obtained results from simulation test done by NS-2 simulator demonstrate the innovation and validity of proposed method with better performance in comparison with CCF, PCCP and DCCP protocols.

Rapid technological advances and innovations in the area of autonomous systems push the researchers towards autonomous networked systems with emphasis on Wireless Multimedia Sensor Networks (WMSNs). In WMSN event-driven applications, it is critical to report the detected events in the area, resulting in sudden bursts of traffic due to occurrence of spatially-correlated or multiple events, causing loss of data. Also, nodes have very limited power due to hardware constraints. Packet losses and retransmissions resulting from congestion, cost precious energy and shorten the lifetime of sensor nodes. Till now, in WMSNs, Congestion control techniques are based on detection of congestion and recovery, but they cannot eliminate or prevent the occurrence of congestion. Collision is a symptom of congestion in the wireless channel and can result in a time-variant channel capacity. The method in the proposed algorithm is that the routing algorithms do not precalculate the routes and the next step is chosen dynamically. Decisions are made based on the congestion degree on neighbor nodes; each node sees its own queue backlog and neighbor's queue backlog and chooses its own degree and route based on the queue backlogs obtained from its neighbors. If there is two or more data with the same condition in the backpressure routing, we use service differentiation to prioritize packets. The results obtained from simulation test done by NS-2 simulator indicate that the proposed model is more innovative and presents better performance in compare with CCF and PCCP protocols.