You are here

CONGESTION AVOIDANCE AND FAIRNESS IN WIRELESS SENSOR NETWORKS

Download pdf | Full Screen View

Date Issued:
2007
Abstract/Description:
Sensor network congestion avoidance and control primarily aims to reduce packet drops while maintaining fair bandwidth allocation to existing network flows. The design of a congestion control algorithm suited for all types of applications in sensor networks is a challenging task due to the application-specific nature of these networks. With numerous sensors transmitting data simultaneously to one or more base stations (also called sinks), sensor nodes located near the base station will most likely experience congestion and packet loss. In this thesis, we propose a novel distributed congestion avoidance algorithm which calculates the ratio of the number of downstream and upstream nodes. This ratio value (named Characteristic ratio) is used to take a routing decision and incorporate load balancing while also serving as a pointer to the congestion state of the network. Available queue sizes of the downstream nodes are used to detect incipient congestion. Queue characteristics of candidate downstream nodes are used collectively to implement both congestion avoidance and fairness by adjusting the node's forwarding rate and next hop destination. Such an approach helps to minimize packet drops, improve energy efficiency and load balancing. In cases of severe congestion, the source is signaled to reduce its sending rate and enable the network recovery process. This is essentially a transport layer algorithm and would work best with a multi-path routing protocol and almost any MAC layer standard. We present the design and implementation of the proposed protocol and compare it with the existing avoidance protocols like Global rate control and Lightweight buffering. Our simulation results show a higher packet delivery ratio with greater node buffer utilization for our protocol in comparison with the conventional mechanisms.
Title: CONGESTION AVOIDANCE AND FAIRNESS IN WIRELESS SENSOR NETWORKS.
14 views
8 downloads
Name(s): Ahmad, Mohammad, Author
Turgut, Damla, Committee Chair
University of Central Florida, Degree Grantor
Type of Resource: text
Date Issued: 2007
Publisher: University of Central Florida
Language(s): English
Abstract/Description: Sensor network congestion avoidance and control primarily aims to reduce packet drops while maintaining fair bandwidth allocation to existing network flows. The design of a congestion control algorithm suited for all types of applications in sensor networks is a challenging task due to the application-specific nature of these networks. With numerous sensors transmitting data simultaneously to one or more base stations (also called sinks), sensor nodes located near the base station will most likely experience congestion and packet loss. In this thesis, we propose a novel distributed congestion avoidance algorithm which calculates the ratio of the number of downstream and upstream nodes. This ratio value (named Characteristic ratio) is used to take a routing decision and incorporate load balancing while also serving as a pointer to the congestion state of the network. Available queue sizes of the downstream nodes are used to detect incipient congestion. Queue characteristics of candidate downstream nodes are used collectively to implement both congestion avoidance and fairness by adjusting the node's forwarding rate and next hop destination. Such an approach helps to minimize packet drops, improve energy efficiency and load balancing. In cases of severe congestion, the source is signaled to reduce its sending rate and enable the network recovery process. This is essentially a transport layer algorithm and would work best with a multi-path routing protocol and almost any MAC layer standard. We present the design and implementation of the proposed protocol and compare it with the existing avoidance protocols like Global rate control and Lightweight buffering. Our simulation results show a higher packet delivery ratio with greater node buffer utilization for our protocol in comparison with the conventional mechanisms.
Identifier: CFE0001755 (IID), ucf:47255 (fedora)
Note(s): 2007-08-01
M.S.Cp.E.
Engineering and Computer Science, School of Electrical Engineering and Computer Science
Masters
This record was generated from author submitted information.
Subject(s): congestion avoidance
control
fairness
sensor networks
Persistent Link to This Record: http://purl.flvc.org/ucf/fd/CFE0001755
Restrictions on Access: public
Host Institution: UCF

In Collections