A Novel Algorithm for Controlling the Congestion in WSN’s using Improved ACO Algorithm
| February-2016 | Published Online: 27 February 2016 PDF | ||
| Author(s) | ||
| Itfaq Ahmad Mir 1; S. Angchuk 2; Shabir Ahmad Mir 3 | ||
|
1Agricultural Research Information System (ARIS), Sher-e-Kashmir University of Agricultural Sciences & Technology- Kashmir 2KVK Leh, SKUAST 3KVK Kulgam, SKUAST |
||
| Abstract | ||
In order to transport data from a source node to a sink node, sometimes referred to as a base station, Wireless Sensor Networks (WSNs) are made up of several small sensor nodes that communicate with one another. The date is routed from one node to another until it reaches the target node via the intermediate sensor nodes, which also serve as routers. Numerous obstacles, such as energy consumption, resource limitations, security, mobility, node placement, location, congestion, etc., arise while routing data in sensor networks. This paper focuses on congestion control problems, we have developed a novel algorithm to control the congestion by routing the traffic through multiple paths using modified ANT Colony Optimization algorithm. Basically, congestion occurs when the intermediate node is not able to accommodate the data in its queue and when it is not able to accommodate the data, packets start dropping which thereby decreases throughput, packet delivery fraction, network‘s energy and increases end to end delay. So in order to make an efficient network, it is mandatory to apply a suitable congestion control algorithm for better processing of network operation. |
||
| Keywords | ||
| WSN’s, Congestion, Throughput Analysis, Packet Loss Rate (PLR), Average (End to End Delay). | ||
|
Statistics
Article View: 22
|
||

