| Wireless Sensor Networks (WSNs), consisting a large number of wireless sensor nodes, have been widely adopted for various applications. The WSN routing protocols differ from other wireless routing protocols due to limited power source and unmanned operation. In this thesis, we propose an efficient congestion control scheme in a WSN that allocate wireless bandwidth to neighboring sensor nodes using the sizes of the subtrees in the network. When a WSN is configured, every node calculates the number of descendent nodes. Once congestion is detected, a node divides its wireless bandwidth and assigned to each subtree. Next, we propose a clustering algorithm to prolong the network lifetime and reduce congestion as well.;Simulation results with Ns-2 show that the proposed bandwidth-allocating congestion control and clustering mechanism are effective a WSN without any mechanism, in terms of latency, throughput, and drop ratio. |
