International Journal of Advances in Science and Technology, Vol. 5, No.

1, 2012

Queue Based Congestion Control Protocol On Wireless Sensor Networks

1

Y.Narasimha Reddy, 2 K. Govardhan Reddy, 3 V. Rajasekhar

Asst.Professor, Dept.of CSE, SKTRMCE,Mahaboob Nagar(Dt.),A.P,India,

1 2 3

Asso.Professor & HOD in CSE, SKTRMCE,Mahaboob Nagar(Dt.),A.P,India,

Asst.Professor, Dept.of CSE, RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN,KURNOOL, A.P,India,

Abstract
New applications made possible by the rapid improvements and miniaturization in Hardware has motivated recent developments in Wireless Multimedia Sensor Networks (WMSNs). A multimedia applications produce high volumes of data which require high transmission rates, multimedia traffic is usually high speed. This may cause congestion in the sensor nodes, leading to impairments in the quality of service of multimedia applications. Thus, to meet the QoS requirements of multimedia applications, a reliable and fair transport protocol is mandatory. An important function of the transport layer in WMSNs is congestion control. In this paper, we present a new Queue based Congestion Control Protocol with Priority Support (QCCP-PS), using the queue length as an indication of congestion degree. The rate assignment to each traffic source is based on its priority index as well as its current congestion degree. The popularity of the Internet has heightened the need for more bandwidth throughout all tiers of the network. Home users need more bandwidth than the traditional 64Kb/s channel a telephone provider typically allows. Video, music, games, file sharing and browsing the web requires more and more bandwidth to avoid the World Wide Wait as it has come to be known by those with slower and often heavily congested connections. Internet Service Providers (ISPs) who provide the access to the average home customer have had to keep up as more and more users get connected to the information superhighway. Core backbone providers have had to ramp up their infrastructure to support the increasing demand from their customers below. Simulation results show that the proposed QCCP-PS protocol can detect congestion better than previous mechanisms. Furthermore it has a good achieved priority close to the ideal and near-zero packet loss probability, which make it an efficient congestion control protocol for multimedia traffic in WMSNs. As congestion wastes the scarce energy due to a large number of retransmissions and packet drops, the proposed QCCP-PS protocol can save energy at each node, given the reduced number of transmissions and packet losses.

1. Introduction
Wireless Multimedia Sensor Networks (WMSNs)] is a set of sensor nodes, whereby the nodes are equipped with multimedia devices such as cameras, And microphones. Thus a WMSN will have the capability to transmit multimedia data, such as still pictures, stream video, voice, animal sounds, and monitoring data. One important requirement of applications in WMSNs is low delay bounds. Furthermore, some applications of WMSNs need relative resilience to losses. In WMSNs there exist two different types of multimedia content, snapshot and streaming data. Snapshot-type multimedia data contain event triggered observations obtained in a short time period. Streaming multimedia content is generated over longer time periods and requires sustained information delivery. As described in [1], WMSNs can support different types of multimedia traffic classes. Similar to Wireless Sensor Networks WSNs), applications of WMSNs share different characteristics such as: resource constraints, unbalanced mixture traffic, data redundancy, network dynamics and energy balance. There are many different resource constraints in WMSNs involving energy, bandwidth, memory, buffer size and processing capability. Given the physically small nature of the sensors, and that multimedia applications typically produce huge volumes of data requiring high transmission rates and extensive processing, a fundamental concern in WMSNs is the issue of power consumption. Thus, developing protocols, algorithms and architectures to maximize the network lifetime while satisfying the quality of service requirements of the applications represents a critical problem. In most WSN and WMSN applications, traffic mainly lows from a large number of sensor nodes to a base station (sink) node. Therefore, to meet the quality of service requirements and to use the network resources in a fair and efficient manner, this characteristic of WMSNs becomes a concern, and must be considered. Furthermore, given the relatively high redundancy in the sensor data, techniques such as data compression, data fusion and aggregation becomes important in maintaining robustness, while decreasing the amount of data. Another important characteristic of WSNs and WMSNs is the dynamic changes in topology and the unreliable nature of wireless networks. This is primarily due to changes in node mobility and/or wireless channel failure. To meet quality of service requirements, these natural characteristics of this kind of networks must be considered in designing the required protocols. To support multimedia communication in WMSNs having a reliable transport mechanism is important. In

Special Issue

Page 74 of 86

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 5, No.1, 2012 traditional communication networks, transport layer is responsible for bridging the application and network layers using multiplexing and multiplexing. It is also charged with providing end-to-end reliable data delivery and with performing congestion control by regulating the amount of traffic injected into the network. WMSNs must support different applications which may require different levels of reliability as well as different congestion control approaches. In addition to the challenges for reliable data transport in WSN, there exist additional challenges due to the unique requirements of multimedia transport such as bounded delay and delay variation, minimum bandwidth demand, smooth traffic variation for multimedia streaming, and error control according to the specific requirements of the multimedia application. As argued in , the traditional TCP/UDP transport protocols cannot be directly implemented for WSN and WMSN. Therefore, it is important to develop a reliable transport protocol for WMSNs to ensure that the often differing QoS requirements of various applications can be met. Congestion control is another important issue that should be considered in transport protocols. Congestion is an essential problem in wireless sensor networks. It not only wastes the scarce energy due to a large number of retransmissions and packet drops, but also hampers the event detection reliability. Congestion in WSNs and WMSNs has a direct impact on energy efficiency and application QoS. Good and bad network performance is largely dependent on the effective implementation of network protocols. TCP, easily the most widely used protocol in the transport layer on the Internet (e.g. HTTP, TELNET, and SMTP), plays an integral role in determining overall network performance. Amazingly, TCP has changed very little since its initial design in the early 1980s. A few tweaks and knobs have been added, but for the most part, the protocol has withstood the test of time. However, there are still a number of performance problems on the Internet and fine tuning TCP software continues to be an area of work for a number of people. TCP sends the data packet back to back whether it can send multiple packets. This makes the TCP more sensitive to nearly full queues and for these full queues a drop-tail queue management is used, we use a wireless last hop network topology in which there are 3 wired nodes 2 wireless nodes and 1 base station node that spread over than 500 500 m2 . The defaults routing protocol is DSDV and the simulation runs over 500 seconds. We implement the Gilbert Elliot channel model in multicast network topology. In figure (1) we show the nodes connected by wired and wireless topology.

Fig.1 Wireless Last Hope Network Topology

The dotted line shows the wireless topology and other lines show the wired topology. The setting same as in our simulation. We evaluate the network performance. It dynamically adjust the sending rate according to the congestion occurred in the network, achieve good network throughput and reduce the packet loss probability. Two types of congestion could occur in sensor networks . The first type is node-level congestion that is caused by buffer overflow in the node and can result in packet loss, and increased queuing delay. Not only can packet loss degrade reliability and application QoS, but it can also waste the limited node energy and degrade link utilization. In each sensor node, when the packet arrival rate exceeds the packet-service rate, buffer overflow may occur. This is more likely to occur at sensor nodes close to the sink, as they usually carry more combined upstream traffic. The second type is link-level congestion that is related to the wireless channels which are shared by several nodes using protocols, such as CSMA/CD (carrier sense, multiple access with collision detection). In this case, collisions could occur when multiple active sensor nodes try to seize the channel at the same time. To avoid the negative aspects of congestion in WMSNs, congestion must be effectively controlled. Each congestion control solution consists of three important parts: congestion detection, congestion notification, and rate adjustment. In traditional TCP protocol, congestion is detected at the end nodes based on a timeout or redundant acknowledgments. In general, link-by-link congestion detection in sensor networks has better performance than traditional end-to-end congestion detection using time out or duplicate acknowledgment. Thus, in sensor networks, proactive methods are used, based on some form of congestion indicator. Different congestion indicators have been proposed, such as, queue length packet service time , or the ratio of packet service time to packet inter-arrival time at the intermediate nodes . After detecting congestion, to prevent the negative aspects of congestion in the networks, the transport protocol needs to propagate

Special Issue

Page 75 of 86

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 5, No.1, 2012 congestion information from the congested node to the upstream sensor nodes or the source nodes that contribute to congestion. This can be done explicitly by sending a special control message to the other sensors, or implicitly using piggybacking technique in data packets. When a node receives a congestion notification message, it should adjust its transmission rate using a rate control techniques such as Additive Increase Multiplicative Decrease (AIMD). The reminder of this paper is organized as follows. In section 2, we present a brief survey on the previous studies in congestion control in sensor networks. In section 3, we explain the proposed QCCP-PS (Queue based Congestion Control Protocol with Priority Support). Section 4 gives a numerical example. In section 5, using computer simulation, we evaluate the performance of the proposed congestion controller. Section 6 concludes the paper.

2. Related works
Different congestion control techniques have been proposed for wireless sensor networks. The congestion control mechanisms all have the same basic objective: they all try to detect congestion, notify the other nodes of the congestion status, and reduce the congestion and/or its impact using rate adjustment algorithms. In [8], CODA, an energy efficient congestion control scheme for sensor networks was proposed. CODA (Congestion Detection and Avoidance) comprises three mechanisms: (i) receiver-based congestion detection; (ii) open-loop hop-by-hop backpressure; and (iii) closed-loop multi-source regulation. CODA detects congestion based on queue length as well as wireless channel load at intermediate nodes. Furthermore it uses explicit congestion notification approach and also an AIMD rate adjustment technique. Congestion Control and Fairness (CCF) was proposed in as a distributed and scalable algorithm that eliminates congestion within a sensor network and ensures the fair delivery of packets to a sink node. CCF exists in the transport layer and is designed to work with any MAC protocol in the datalink layer. In the CCF algorithm, each node measures the average rate at which packets can be sent from the node, divide the rate r among the number of children nodes, adjust the rate if queues are overflowing or about to overflow and propagate the rate downstream. CCF uses packet service time to deduce the available service rate. Congestion information is implicitly reported. It controls congestion in a hop-by-hop manner and each node uses exact rate adjustment based on its available service rate and child node number. It can be shown that CCF guarantees simple fairness. As shown in CCF has two major problems. The rate adjustment in CCF relies only on packet service time which could lead to low utilization when some sensor nodes do not have enough traffic or there is a significant packet error rate. Furthermore, it cannot effectively allocate the remaining capacity and as it uses work-conservation scheduling algorithm, it has a low throughput in the case that some nodes do not have any packet to send. In an Adaptive Rate Control (ARC) mechanism was proposed which is most effective in achieving the goal of fairness, while being energy efficient for both low and high duty cycle of network traffic. The ARC does not have any congestion detection or notification mechanisms. Each intermediate node increases its se if it overhears successful packet forwarding by its parent node. Otherwise, the intermediate node multiplies its sending rate by a factor. Priority based Congestion Control Protocol (PCCP) was proposed in. PPCP is an upstream congestion control protocol for WSNs which measures the congestion degree as the ratio of packet inter arrival time to the packet service time. Based on the introduced congestion degree and node priority index, PCCP utilizes a cross-layer optimization and imposes a hop-by-hop approach to control congestion. It has also been shown that PCCP achieves efficient congestion control and flexible weigh path and multi-path routing. In , a reliable transport protocol suitable for reliable data applications called PSFQ (Pump Slowly, Fetch Quickly) has been proposed. It takes a different approach and supports a simple, robust and scalable transport that is customizable to meet the needs of different reliable data applications. We mention that PSFQ is only a reliability guarantee protocol and not for congestion control. The combination of CODA and PSFQ may achieve both congestion control and reliability. In different protocols for congestion control and upstream and downstream reliability in transport protocol were proposed.

3. Proposed congestion control protocol

In this section we describe our proposed congestion control protocol for wireless multimedia sensor networks. The proposed protocol is called QCCP-PS (Queue based Congestion Control Protocol with Priority Support). Our approach is motivated by the apparent limitations of existing popular schemes, such as the PCCP. The simulation results confirm that the PCCP performs very poorly in providing relative priority in the case of random service time. Based on line 6 and 9 of PCCP algorithm given in , it can be seen that in the case of low congestion, the PCCP will increase the scheduling rate and source rate of all traffic sources without paying any attention to their priority index. In the case of high congestion, PCCP will decrease the sending rate of all traffic sources based on their priority index. The proposed QCCP-PS protocol solves this problem by a proper adjustment of the rate at each node. In the QCCP-PS, the sending rate of each traffic source is increased or decreased depending on its congestion condition and its priority index. Figure 1, shows the architecture of QCCP-PS. Similar to the other congestion control protocols, QCCP-PS consists of three parts namely, Congestion Detection Unit (CDU), Congestion Notification Unit (CNU), and Rate Adjustment Unit (RAU). The CDU is responsible for detecting any congestion in advance. The CDU uses the queue length as the congestion indicator. The output of CDU is a congestion index, which is a number between 0 and 1. CDU uses a similar

Special Issue

Page 76 of 86

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 5, No.1, 2012 congestion indicator strategy used in the RED active queue management algorithm. For this purpose, two different fixed thresholds the max and the min are defined. When the queue length ( q ) is less than the min , congestion index is very low and thehted fairness for both single source node could increase its rate. On the other hand, when queue length is greater than th max , congestion index is high and the traffic source should decrease its rate to avoid any packet loss. In the case that queue length is between the max and the min the congestion index is related to queue length linearly. In each predefined time interval T, each parent node calculates the sending rate of all its child traffic sources as well as its local traffic source. As each sensor node may have different priorities since sensor nodes might be installed with different kinds of sensors in an environment, the upstream node also considers the priority of each of its child nodes in calculating the rate of the child nodes. Based on the current congestion index and the source traffic priority, the RAU calculates the new rate of each child traffic sources as well as its local traffic source. The new rate is sent to the CNU unit which is responsible for notifying all the child nodes of the new rate. To decrease energy consumption, CNU uses an implicit congestion notification by adding the new rate of each child node to the sending data of each sensor node. When a node receives a congestion notification message from its upstream node, the node is expected to adjust its traffic rate accordingly.

Fig. 2 Sensor Node

In the proposed QCCP-PS protocol, in each sensor node we use a separate queue to store input packets from each child node. The sent traffic from each child node is buffered in a separate queue. Furthermore, as each sensor node may have some local source traffic to be sent to the sink node, an additional queue is also considered for local traffic of the sensor node. So, if an intermediate node i has i N child nodes, t shows the network model used in each sensor Node. All queues are implemented as First-In First-Out (FIFO) queues.

4. Congestion Control Algorithms for Evaluations

Congestion is characterized by delay and loss of packets in delivery. In TCP, congestion is said to have occurred when the sender receives three duplicate acknowledgments (dupacks) or when a timeout (packet loss) occurs, resulting in wastage of resources. Congestion Control and Congestion Avoidance are two known solutions which address the above problem. In congestion control [2], system controls the network parameters after realizing congestion (reactive); whereas, in congestion avoidance, system controls the network parameters before congestion (proactive). After the invention of TCP, there is numerous congestion control algorithms discovered for different purposes. Each of them has unique characteristics [4]. In [5][6] the simulation result shows the TCP BIC giving good throughput for long distance wireless networks, but the TCP Vegas giving better result in the overall performance.

1) Binary Increase Congestion Control (BIC)

BIC-TCP (Binary Increase Control-TCP) incorporated binary search increase in the protocol. Binary search increase provides reliable feedback on any network congestion and lost packets, allowing BIC-TCP to aggressively increase its transmission speed toward the maximum allowed by the high speed network. Binary Increase congestion Control for TCP v2.0 is called as CUBIC and it is a default TCP algorithm in Linux.

2) TCP VEGAS
Until the mid 1990s, all TCPs set timeouts and measured round-trip delays were based upon only the last transmitted packet in the transmit buffer. In TCP Vegas, timeouts were set and round-trip delays were measured for every packet in the transmit buffer. In addition, TCP Vegas uses additive increases in the congestion window.

Special Issue

Page 77 of 86

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 5, No.1, 2012

3) SCALABLE TCP
Scalable TCP (STCP) involves a simple sender-side alteration to the standard TCP congestion window update algorithm. It robustly improves performance in high-speed, wide-area networks using traditional TCP receivers. Scalable TCP updates its congestion window using fixed increase and decrease parameters. The Scalable TCP window update algorithm, as defined in [7], is divided into two phases. Slow-start phase: in which the congestion window is increased by one packet for each acknowledgment received: W = W + 1 Ack; Congestion avoidance phase: If congestion has not been detected in at least one round trip time, the window responds to each acknowledgment received with the update W=W+ , Where (0, 1) is a constant parameter. In the event of congestion, the congestion window is multiplicatively decreased as follows: W= W, Where (0, 1) is also constant. Typical values of these parameters are = 0.01 and = 0.875. Further details on the Scalable TCP algorithm are available in [9].

5. The simulation
In this paper, these algorithms has been successfully implemented and evaluated using NS-2 simulator on a computer with Intel Core 2 Duo CPU (T6400 processor @ 2.00 GHz) 2 GB of RAM. A random wireless mobile ad hoc network topology was used for these experiments.

Fig.3 MANET Scenario

6. Conclusion
In this paper, we developed a congestion control protocol named QCCP-PS. QCCP-PS uses a queue based congestion indicator and can adjust the sources traffic rate based on current congestion in the upstream nodes and the priority of each traffic source. We used the buffer occupancy as a congestion indicator, and considered varying priorities for each sensor node. The proposed Congestion protocol can adjust the source rate based on the current congestion status in its parent node. The performance of proposed protocol was evaluated using computer simulation. The results show that QCCP-PS can achieve low packet loss probability.

7. References
[1] I. F. Akyildiz, T. Melodia, K. R. Chowdhury, A survey on wireless multimedia sensor networks, Computer Networks 51, 921960, 2007,. [2] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey, Computer Networks 38 (4), 393422, 2002. [3] C-G Wang, K. Sohraby, A survey of transport protocols for wireless sensor networks,in IEEE Network Magazine, 34-40, May/June 2006. [4] C.-T. Ee and R. Bajcsy, Congestion control and fairness for many-to one routing in sensor networks, in Proc. ACM Sensys, Nov. 2004.

Special Issue

Page 78 of 86

ISSN 2229 5216

International Journal of Advances in Science and Technology, Vol. 5, No.1, 2012 [5]Y. G. Iyer, S. Gandham, and S. Venkatesan, STCP: A generic transport layer protocol for wireless sensor networks, Proc. IEEE ICCCN 2005, San Diego, CA, Oct. 1719, 2005. [6] B. Hull, K. Jamieson, and H. Balakrishnan, Mitigating congestion in wireless sensor networks, Proc. ACM Sensys 04, Baltimore, MD, Nov. 35, 2004 [7] C. Wang, Member, K. Sohraby, M. Daneshmand, Y. Hu, Upstream congestion control in wireless sensor networks through cross-layer optimization, IEEE Journal On Selected Areas In Communications, 25(4), 2007, 786-795. [8] C.-Y. Wan, S. B. Eisenman, and A. T. Campbell, CODA: Congestion detection and avoidance in sensor networks, Proc. ACM Sensys 03, Los Angeles, CA, Nov. 57, 2003. [9] A. Woo and D. C. Culler, A transmission control scheme for media access in sensor networks, Proc. ACM Mobicom 01, Rome, Italy, July 1621, 2004. [10] C.-Y. Wan and A. T. Campbell, PSFQ: A reliable transport protocol for wireless sensor networks, Proc. ACM WSNA 02, Atlanta, GA, Sept. 28, 2002. [11] C.-Y. Wan et al., Siphon: Overload traffic management using multi-radio virtual sinks in sensor networks, Proc. ACM SenSys 05, San Diego, CA, Nov. 24,2005. [12] P. Levis et al., Trickle: A self-regulating algorithm for code propagation and maintenance in wireless sensor networks, Proc. 1st Symp. Networked Sys. Design and Implementation, San Francisco, CA, Mar. 2931. [13] F. Stann and J. Heidemann, RMST: Reliable data Transport in sensor networks, Proc. IEEE SNPA 03, Anchorage, AK, May 11, 2003.

Author Profiles:
1].Y.Narasimha Reddy working as a Asst.Professor in Sri Kottam Tulasi reddy memorial college of engineering in the department of CSE. Head of Cisco Local Academy. Certified professional Of CCNA and CCAI(Cisco certified academic instructor) by CISCO.Areas of Interest Wireless Adhoc networks,Java.Present research work is on "Congestion control in Wireless adhoc networks" under the guideness of P.V.S Srinivas,Professor,Geetangali Engineering college,HYD.

2]. K. Govardhan Reddy, Associate Professor, received B.Tech degree in Computer Science & Engineering, and M.Tech degree in Computer Science & Engineering stream, both from Jawaharlal Nehru Technological University, Hyderabad. He attended many National and International Conferences held in all over India. He published more than five papers both in national and international wide. He is a life time member of ISTE and a member of Computer Society of India. He had total 11 years of teaching experience. Presently he is working as an Associate Professor & Head of Computer Science & Engineering department in Sri Kottam Tulasi Reddy Memorial College of Engineering, Affiliated to JNTU, Hyderabad. He is currently a research scholar in computer Science and Engineering at Jawaharlal Nehru Technological University, Hyderabad. His interests are Computer Networks, Wireless Communication, Mobile Ad Hoc Networks & Cloud Computing. His current research focus is on Adaptive Congestion Control Routing in MANETs. [email protected]. 3]. V. RAJASEKHAR,Asst.Professor, received M.Tech in computer science & engineering from JNTU,Hyderbad. He had total 4 years of experience. Presently he is working as Asst.Professor in RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN::KURNOOL. His interests are Computer Networks, Wireless Communication, and Mobile Ad Hoc Networks. [email protected]

Special Issue

Page 79 of 86

ISSN 2229 5216