Practical Congestion Control Scheme with hop-by-hop Control in Wireless Sensor Networks

  • K. Rangaswamy, C. Rajabhushanam
Keywords: NDN (named data networking), EDGE a greedy algorithm, PCON, congestion, packet queuing time


In named data networking the data is transmitted in the form of data packets from source node to destination node through multiple paths. During this transmission the congestion will occur at each node. This should be controlled for efficient data transmission. The existing congestion control algorithms available will not work efficiently in the NDN (Named data networking) architecture. In the existing we used EDGE a greedy algorithm for transmitting the data packets from the source node to destination server. This algorithm selects the shortest path for transmitting these data packets. Even though we are selecting the shortest path for transmission we are getting packet drop and packet delay as high values. This algorithm does not calculate the data packet size and also packet queuing time. To overcome the above mentioned problems and to maintain the packet delay and packet drop as low as possible we are proposing this PCON algorithm. This PCON (practical congestion control) scheme which detects the congestion by measuring the packet queuing time then marks some data packets explicitly. Then the selected downstream router will effectively send the data packets to alternate paths. On calculating the packet queuing time we can quickly transmit the data from source node to destination with low packet drop. The final simulation results shows that our proposed PCON algorithm get very less packet drop and packet delay than compared to the traditional congestion controlling algorithms.