Indian Journal of Science and Technology
Year: 2015, Volume: 8, Issue: 32, Pages: 1-5
R. Beula Jayakumari 1 and S.Vinoth Lakshmi2*
1 Department of Information Technology, Jerusalem College of Engineering, Chennai - 600100, Tamil Nadu, India; [email protected]
2 Department of Information Technology, Bharath University, Chennai - 600073, Tamil Nadu, India; [email protected]
The congestion problem in Wireless Sensor Networks (WSNS) is quite different from that in traditional networks. Most current congestion control algorithms try to alleviate the congestion by reducing the rate at which the source nodes inject packets into the network. Congestion occurs when too many source nodes are sending data for network to handle. It causes missing of data packets, increases energy efficiency and transmission delay. Transferring crucial data in critical situation is a challenging problem in WSNS. In sensor network two types of paths are constructed for data transmission, they are single path and multi path. Single path data transmission leads to more congestion as all data are send through a single path. Multi path data transmission reduces congestion by sending data based on the urgency. The proposed work dynamically schedules different type of data flow. To assign priority for each data packets it avoids the starvation problem by finding buffer occupancy of each intermediate node by finding the shortest path. Imperative data packets routed using congestion free path with minimum delay in WSNS increase the network throughput and efficiency.
Keywords: Buffer Occupancy, Congestion, Multi path, Priority, Routing
Subscribe now for latest articles and news.