Mobility

Wireless Sensor Networks: A Study on Congestion Routing Algorithms

Download Now Free registration required

Executive Summary

Data's generated in Wireless Sensor Networks may not all alike, some data's are more important than other data's and they may have different delivery requirements. If congestion occurs in the Wireless Network, some or more important data's may be dropped. But in the authors' project they handle this problem by addressing differentiated delivery requirements. They propose a class of algorithms that enforce differentiated routing based on the congested areas of a network and data priority. The basic protocol, called Congestion-Aware Routing (CAR), discovers the congested zone of the network that exists between high-priority data sources and the data sink and, using simple forwarding rules, dedicates this portion of the network to forwarding primarily high-priority traffic.

  • Format: PDF
  • Size: 678.3 KB