priority based congestion avoidance hybrid scheme published in ieee

Chandigarh University

University Institute of Engineering

Department of CCE & CSE

“PRIORITY BASED CONGESTION AVOIDANCE HYBRID SCHEME FOR WIRELESS SENSOR

NETWORK”

JASLEEN KAUR




• Introduction• Literature survey• Problem Formulation• Objectives• Methodology• Work Done• References

CONTENTS

DEPARTMENT OF CSE




INTRODUCTION-WIRELESS SENSOR NETWORKS(WSNs)

• Dense wireless networks which consists of small, low cost sensors • Monitors the physical environment• Pass the data through the network to the Base Station for evaluation.• Base station is a kind of node which is away from the area of sensor

nodes• Energy of nodes keeps on dissipating • Sensor nodes have limited battery life• Sensors are connected to the waspmotes or mica motes in order to

make a sensor node.

DEPARTMENT OF CSE




• Pressure/ Weight sensor• Bend sensor• Hall effect sensor• Liquid Presence sensor• Luminosity sensor• Presence(PIR) sensor• Temperature sensor

TYPES OF SENSORS

DEPARTMENT OF CSE




• Monitoring of parking spaces available in the city [14]• Monitoring of vibrations and material conditions in buildings,

bridges, and historical monuments• Smartphone Detection• Intelligent and weather adaptive lightening in street lights.• Smart Roads• Forest Fire Detection• Snow level Monitoring• Detecting leakage and wastes of factories in rivers• Animal Tracking• Patients Surveillance

APPLICATIONS OF WIRELESS SENSOR NETWORKS

DEPARTMENT OF CSE




DEPLOYMENT OF NODES IN WSN

STATIC DEPLOYMENT DYNAMIC DEPLOYMENT

DEPLOYMENT OF NODES IN WSN

Figure1. Types of sensor nodes deployment in WSNs

DEPARTMENT OF CSE




CONGESTION IN WSNs• Congestion , in simple terms, means “ An excess of traffic” .• In terms of a network whether it is wired or wireless, congestion occurs

when the traffic load exceeds the available capacity.• Congestion happens mainly in the sensors-to-sink direction when

packets are transported in a many-to-one manner.• In wired networks can provision bandwidth. But difficult in

wireless.

• Radio is unpredictable.• Channel quality and radio interference can change and reduce the

bandwidth.• Adding new nodes to WSN introduces more interference, thus

congestion.

DEPARTMENT OF CSE

Why?




• Finally, sensor network’s traffic patterns can be derived from the physical processes that they can sense.

• Resulting in extremely bursty and event-driven traffic.• The results is CONGESTION COLLAPSE.

DEPARTMENT OF CSE




CONGESTION IN WSNs• Nowadays, with the ever-increasing use of environmental sensing and

smart grids, in the wireless sensor networks, especially in multi-hop networks, the quantity of data volume is rapidly increasing.

• To reach the main goal of creating the “smart environments”, in a narrow space, a large number of sensors are being used and transmission packets in the same time also increases.

• They have caused an increase traffic in WSN. • When there is a sudden surge of simultaneous data transmission,

problems arise. This type of surge causes traffic overload at a full buffer at the receiving node. This state is called traffic congestion.

• Deployment of sensor networks results in network congestion due to many concurrent transmission attempts made by several sensor nodes. [9].

DEPARTMENT OF CSE




• Congestion can result into– high dropping of packets and delay of packets– Low throughput– More energy consumption due to retransmissions

• Congestion can occur at node level or link level [2].

CONGESTION IN WSN continued..

Node level congestion Link level congestion Figure2. Types of congestion in WSNs

DEPARTMENT OF CSE

DIAGRAMATIC REPRESENTATION OF WSNs

DEPARTMENT OF CSE

Wireless sensor network

Target

Internet

User(Management Node)

Sensor node

Sink node

Figure3. A wireless sensor network




NAME OF PROTOCOL

YEAR DESCRIPTION

ARC (Adaptive Rate control)

2001 Mohamed A.K., ARC uses packet loss as collision or congestion indication at each hop to adjust transmission rate. If an intermediate nodes overhears that the packets it sent previously are successfully forwarded again by its parent node, it will increase its transmission rate. Otherwise it decreases its sourced rate.Disadvantage: Prioritized fairness has been envisaged with ARC. Course rate adjustment could result in packet loss.

ESRT (Event to sink reliable transport)

2003 Xong et al., sensors change their sending rate using the sinks feedback regarding the reliability level or congestion detection. Every node sets the CN congestion notification bit in the packets as soon as its buffer reaches its threshold. When sink receives a packet with CN bit set, it broadcasts a control signal notifying all source nodes to reduce their reporting frequency.

LITERATURE SURVEY

DEPARTMENT OF CSE




NAME OF PROTOCOL

YEAR DESCRIPTION

CODA 2003 Wan,C-Y et al. proposed Congestion detection and avoidance in sensor networks. It detects congestion based on buffer occupancy as well as wireless channel load. Drawback: This scheme does not consider the fairness issue. It also results in decreased reliability under conditions such as high data rate.

FUSION 2004 Mohamad et al., Congestion is detected in each node based on measurement of queue length. The node that detects congestion sets CN bit in the header of each outgoing packet. Once CN bit is set, neighboring nodes can over hear it and stop forwarding packets to the congested node.

DEPARTMENT OF CSE




NAME OF PROTOCOL

YEAR DESCRIPTION

PCCP 2007 Wang et al. proposed “upstream congestion control in WSNs”. It considers that sensor nodes may have different priorities and need different throughput. It periodically detects the congestion using the ratio between packet service time and packet interval arrival time at MAC Layer. It considers to work under both single path and multi-path routing scenario. Drawback: It also does not consider the fairness issue.

Priority-based rate control for service differentiation and congestion control

2009 Yaghmaee,M.H.,Adjeroh et al. says that this scheme uses packet inter-arrival time along with packet service time to measure a parameter defined as congestion degree and furthermore imposes hop-by-hop control based on the measured congestion degree as well as the node priority index.

DEPARTMENT OF CSE




NAME OF PROTOCOL

YEAR DESCRIPTION

CSNM 2014 Joy Iong-Zong, a cooperative strong node mechanism is presented and is named as Cooperative Strong Node Mechanism(CSNM), in which a threshold is set to determine whether node traffic is over or not. When the load exceeds, the privilege of corresponding sensor nodes is upgraded so that it can command its child nodes to change the transmission path to distribute the traffic effectively.

SUIT 2014 Cagatay Sonmez et al. In this paper, the authors proposed a new protocol called Sensor fuzzy-based image transmission (SUIT) which is a first and new progressive image transport protocol for efficient multimedia transmission over wireless multimedia sensor networks (WMSNs). SUIT uses the error resilience advantage of PJPEG (progressive JPEG) format.

DEPARTMENT OF CSE




NAME OF PROTOCOL

YEAR DESCRIPTION

Mobile Sink based congestion avoidance

2014 Authors had compared their scheme with the scenario where the sink is static. Thus, they have got the improved results for delay, packet loss and throughput. Still there are some limitations like more packet loss in the network.

Load balanced clustering algorithm

2003 It tries to balance the load among the cluster head nodes named as gateway nodes here. These gateway nodes initiate the clustering in the network by broadcasting a message to the nearby nodes. Every gateway node figure out the communication cost and exchange this information with other gateway nodes. Only some of the nodes are selected to be the part of clusters whose distance is less than the threshold defined distance value.

DEPARTMENT OF CSE




• Congestion in the network causes the packet loss, reduced throughput, reliability ,inter packet arrival time and packet service time, and increased energy consumption and end to end delay.

• In some applications like in in healthcare WSN applications, it is very important to control the congestion because increase in energy consumption and end-to-end delay for the packets that carry EKG signals may even results in the death of the patient.

• So, there is a need to develop an algorithm which detects and controls the incipient congestion occurring in a wireless sensor network.

Problem Formulation

DEPARTMENT OF CSE




• To simulate the proposed PCAH algorithm for avoiding the congestion in wireless sensor network.

• To analyze the results with existing techniques: CSNM and Congestion avoidance using Mobile sink, in terms of PDR, end-to-end delay, Packet loss and energy consumption.

Objectives

DEPARTMENT OF CSE




INFORMATION FLOW OF PROPOSED SCHEME (PCAH)

DEPARTMENT OF CSE

Figure4. Congestion Avoidance Algorithm




• Radio duty cycling helps in saving node energy and power. • The energy wasted in idle listening when node has no data to send

can be saved. • The cluster head nodes will stay in awake mode all the times

whereas the cluster member nodes can go to sleep mode when directed by the cluster head node.

• The energy of the cluster member node in sleep mode will be reduced by unit 1 i.e. En = En – 1 where En is the energy of node n.

• The energy of rest of the nodes in awake mode will decrease by unit Ω which is directly proportional to the time when the node is up to transmit the data.

Reason to use RDC

DEPARTMENT OF CSE




• The nature of the wireless medium is unstable due to the– channel fading, – interference between the nodes and from other wireless standards

like nodes with 802.11 mac layer protocol faces interference with nodes with 802.15.4 protocol.

– Also, the wireless link faces connectivity and coverage problems due to node mobility.

• Hence, it results in network degradation. • To attain the better performance under various circumstances, the

wireless nodes needs to adjust their transmission rates dynamically.

Reason to use Rate adaptation approach

DEPARTMENT OF CSE




• Each node in a network has different task to do. • There are very few chances that the nodes will be performing the

same task. So if the nodes are performing the same task, then each node must have different priority.

• So, it’s important to distinguish the task of node according to its priority.

• For example, a node measuring the heart rate of heart patient has higher priority than a node measuring the blood rate of diabetic patient. Node priority could be set initially by the base station.

Reason for giving nodes ‘a priority’

DEPARTMENT OF CSE




Flow Chart

Figure5. PCAH Algorithm

DEPARTMENT OF CSE




PCAH Algorithm

DEPARTMENT OF CSE




Tools used

SKILLS REQUIRED IN SOFTWARE

SOFTWARE DESIGNATION

Front End NAM

Back End NS2.35

Operating System Ubuntu 12.04

DEPARTMENT OF CSE




Cluster Head Selection Phase

Figure 6 Cluster Head Selection

DEPARTMENT OF CSE




Getting Updated Energy of each Sensor Node

Figure 7 Accessing Updated energy of nodes

DEPARTMENT OF CSE




Data Transmission Phase

Figure 8. Multi-node transmission to cluster head (CH)

DEPARTMENT OF CSE




Figure 9. Congestion going to occur at CH

DEPARTMENT OF CSE




Figure 10. CH9 multicasts notification message to its members

DEPARTMENT OF CSE




Accessing Queue Length of Sensor Nodes

Figure 11 Accessing Queue of nodes

DEPARTMENT OF CSE




Figure 12. Low priority nodes goes to sleep mode

DEPARTMENT OF CSE




Figure 13. High priority nodes sending data at low rate

DEPARTMENT OF CSE




Figure 14. Low priority nodes wake up after some time interval

DEPARTMENT OF CSE




Figure 15. Congestion mitigated in the network

DEPARTMENT OF CSE




Figure 16. CH sends aggregated data to base station node

DEPARTMENT OF CSE




Comparison Results-Packet Delivery Ratio

Figure 17. Average PDR ratio of network using PCAH is 96%Packets generated by CBR=12570 , Packets received = 11961

DEPARTMENT OF CSE




• Use following command to get the number of packets sent and received by the traffic source. grep "^s.*\AGT.*\ cbr.*" out1.tr | wc -l

grep "^r.*\AGT.*\ cbr.*" out1.tr | wc -l

PDR Calculation




Packet Loss

Figure 18. No packet loss for PCAH

DEPARTMENT OF CSE




End-to-end Delay

Figure 19. Minimum average delay of 0.01009 seconds (10.09ms) for PCAH , 0.02067 sec (20.67 ms) for CSNM and 0.38444 sec for Mobile sinks

DEPARTMENT OF CSE




Residual Energy

Figure 20. Minimum residual energy of nodes using PCAH is 79.9967 Joules

DEPARTMENT OF CSE




Remaining Energy of Nodes 1-10

Figure 21. Minimum energy of nodes 1-10




Remaining Energy of Nodes 11-20

Figure 21. Minimum energy of nodes 11-20

DEPARTMENT OF CSE




Remaining Energy of nodes 21-40

Figure 22(a) Energy of nodes 21-30 Figure 22(b) Energy of nodes 31-40

DEPARTMENT OF CSE




Remaining Energy of nodes 41-50

Figure 23 Remaining Energy of nodes 41-50

DEPARTMENT OF CSE




1. Zhang, Hongwei, Anish Arora, Young-ri Choi, and Mohamed G. Gouda. "Reliable bursty convergecast in wireless sensor networks." Computer Communications 30, no. 13 (2007), pp. 2560-2576.

2. Yang, Shuang-Hua. “Chapter2: Principle of Wireless Sensor Networks” in Wireless Sensor Networks: Principles, Design and Applications, Springer, Edition-1, Series of Signals and Communication Technology, ISSN: 1860-4862, pp. 7-47, 2014.

3. Pablo Garcia Ansola, Andres Garcia, Javier De Las Morenas, Javier Garcia Escribano, Franciso Javier Otamendi. “ZigID: Improving visibility in industrial environments by combining WSN and RFID” in Journal of Zhejiang University SCIENCE A (Applied physics and engineering), Volume 12, Issue 11, pp. 849-859, Nov 03, 2011.

4. G.Escribano et al., J Zhejiang Univ-Sci C. “Human condition monitoring in hazardous locations using pervasive RFID sensor tags and energy-efficient wireless networks” in Journal of Zhejiang University-SCIENCE C (Computers & Electronics) ,Volume 13, Issue 9, pp. 674-678.

References

DEPARTMENT OF CSE




5. Joseph Kabara and Maria Calle. “MAC Protocols Used by Wireless Sensor Networks and a General Method of Performance Evaluation” in International Journal of Distributed Sensor Networks, Volume 2012 (2012), Article ID 834784, 11 pages, Sep 16, 2011.

6. Ahmad Abed Alhameed and Gurvinder Singh Baicher. “MAC Layer Overview for Wireless Sensor Networks” in 2012 International Conference on Computer Networks and Communication Systems (CNCS 2012) IPCSIT, Volume 35(2012), IACSIT Press, Singapore, pp.16-19, 2012.

7. Joy Iong-Zong Chen, Chu-Hsing Lin. “Wireless Sensor networks: Throughput Evaluation of a Novel Scheme to Mitigate the Congestion over WSNs” in Wireless Pers Commun (2014) 75, pp. 1863-1877 Springer Science + Business Media New York 2013, 16 October 2013.

8. Kafi, Mohamed Amine, Djamel Djenouri, Jalel Ben-Othman, and Nesrine Badache. "Congestion control protocols in wireless sensor networks: A survey." Communications Surveys & Tutorials, IEEE 16, no. 3 (2014), pp. 1369-1390.

References continued..

DEPARTMENT OF CSE




9. Dashkova, Ekaterina, and Andrei Gurtov. "Survey on congestion control mechanisms for wireless sensor networks." In Internet of Things, Smart Spaces, and Next Generation Networking, pp. 75-85. Springer Berlin Heidelberg, 2012.

10. Saima Zafar. “A survey of transport layer protocols for wireless sensor networks” in International journal of Computer applications (0975-8887) Volume33 No.1, November 2011.

11. Michopoulos, Vasilis, Lin Guan, George Oikonomou, and Iain Phillips. "A comparative study of congestion control algorithms in IPv6 wireless sensor networks." In Distributed Computing in Sensor Systems and Workshops (DCOSS), 2011 International Conference on, pp. 1-6. IEEE, 2011.

12. Sonmez, Cagatay, Ozlem Durmaz Incel, Sinan Isik, Mehmet Yunus Donmez, and Cem Ersoy. "Fuzzy-based congestion control for wireless multimedia sensor networks." EURASIP Journal on Wireless Communications and Networking 2014, no. 1 (2014), pp. 1-17.

References Continued..

DEPARTMENT OF CSE




13. Sankarasubramaniam, Yogesh, Ozgur B. Akan, and Ian F. Akyildiz. "ESRT: event-to-sink reliable transport in wireless sensor networks." In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pp. 177-188. ACM, 2003.

14. Wan, Chieh-Yih, Shane B. Eisenman, and Andrew T. Campbell. “CODA: Congestion detection and avoidance in sensor networks” in proceedings of 1st international conference on Embedded Networked sensor systems, pp. 266-279, 2003.

15. Yaghmaee, Mohammad Hossein, and Donald A. Adjeroh. "Priority-based rate control for service differentiation and congestion control in wireless multimedia sensor networks." Computer Networks 53, no. 11 (2009), pp. 1798-1811.

16. Wang, Chonggang, Bo Li, Kazem Sohraby, Mahmoud Daneshmand, and Yueming Hu. "Upstream congestion control in wireless sensor networks through cross-layer optimization." Selected Areas in Communications, IEEE Journal on 25, no. 4 (2007),pp. 786-795.

References Continued..

DEPARTMENT OF CSE




Thank You !

DEPARTMENT OF CSE

priority based congestion avoidance hybrid scheme published in ieee

Education