Comprehensive Survey Congestion Control Mechanisms in Wireless Sensor Networks:Comprehensive Survey

Wireless sensor network (WSN) occupies the top rank of the widely used networks for gathering different type of information from different averments. WSN has nodes with limited resources so congestion can cause a critical damage to such network where it limited resources can be exhausted. Many approaches has been proposed to deal with this problem. In this paper, different proposed algorithm for congestion detection, notification, mitigation and avoidance has been listed and discussed. These algorithms has been investigated by presenting its advantages and disadvantages. This paper provides a robust background for readers and researches for wireless sensor networks congestion control approaches. Keywords: WSN, Congestion Control, congestion mitigation, congestion detection, sink channel load, buffer load

Study on Different Topology Manipulation Algorithms in Wireless Sensor Network

Wireless sensor network (WSN) comprises of spatially distributed autonomous sensors to screen physical or environmental conditions and to agreeably go their information through the network to a principle area. One of the critical necessities of a WSN is the efficiency of vitality, which expands the life time of the network. At the same time there are some different variables like Load Balancing, congestion control, coverage, Energy Efficiency, mobility and so on. A few methods have been proposed via scientists to accomplish these objectives that can help in giving a decent topology control. In the piece, a few systems which are accessible by utilizing improvement and transformative strategies that give a multi target arrangement are examined. In this paper, we compare different algorithms' execution in view of a few parameters intended for every target and the outcomes are analyzed. DOI: 10.17762/ijritcc2321-8169.15029

Hierarchical routing protocols for wireless sensor network: a compressive survey

Wireless Sensor Networks (WSNs) are one of the key enabling technologies for the Internet of Things (IoT). WSNs play a major role in data communications in applications such as home, health care, environmental monitoring, smart grids, and transportation. WSNs are used in IoT applications and should be secured and energy efficient in order to provide highly reliable data communications. Because of the constraints of energy, memory and computational power of the WSN nodes, clustering algorithms are considered as energy efficient approaches for resource-constrained WSNs. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first present the most relevant previous work in routing protocols surveys then highlight our contribution. Next, we outline the background, robustness criteria, and constraints of WSNs. This is followed by a survey of different WSN routing techniques. Routing techniques are generally classified as flat, hierarchical, and location-based routing. This survey focuses on the deep analysis of WSN hierarchical routing protocols. We further classify hierarchical protocols based on their routing techniques. We carefully choose the most relevant state-of-the-art protocols in order to compare and highlight the advantages, disadvantage and performance issues of each routing technique. Finally, we conclude this survey by presenting a comprehensive survey of the recent improvements of Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocols and a comparison of the different versions presented in the literature

Enhanced reliable and energy efficient pressure based data forwarding schemes for underwater wireless sensor networks

Data collection in Underwater Wireless Sensor Networks (UWSN) requires highly optimized communication approach in order to achieve efficient data packet delivery. This approach consists of different communication layers of which routing protocol is an important consideration. Several issues including packet entrapment due to void region, selection of forwarding node with insufficient link quality and packet collision in congested forwarding area have emanated. Therefore, three different research problems were formulated to address the issue of reliability and energy efficiency in data forwarding in UWSN. First, void handling for packet entrapment in the void region, which generate delays and communication overhead. Second, non-optimal node selection that causes forwarding delays and non-reliable packet delivery. Third, collision due to congestion, which leads to packet drop and unreliable packet delivery. Thus, enhanced reliable and energy-efficient pressure-based data forwarding schemes for UWSN were developed, which are the Communication Void Avoidance (CVA) to estimate neighbour nodes availability outside a void region in order to avoid voids and reduce delay; a Multi-metric Evaluation mechanism for next forwarder Node Selection (MENS) for optimal packet delivery; and a Congestion Avoidance and MITigation (CAMIT) in data forwarding for congestion and collision reduction in order to achieve reliable data forwarding. Several experiments were performed through simulations to access the performance of the proposed mechanisms and the results of each scheme were compared with related previously published protocols. The obtained results depict that the proposed schemes outperformed the existing schemes and significantly improved overall performance. CVA improved Packet Delivery Ratio by 12.8% to 18.7% and reduced End-to-end delay by 7.3% to 12.5% on average. MENS improved communication Data Rate by 13.2% to 15.1% and Energy Consumption improved by 10.6% to 15.3% on average. Lastly, CAMIT reduced Packet Drop ratio by 10.2% to 13% on average. The findings demonstrate the improved efficiency has been achieved by the CVA, MENS and CAMIT in terms of optimal node selection and reliability in packet forwarding in UWSN

Efficient Data Collection in IoT Networks using Trajectory Encoded with Geometric Shapes

The mobile edge computing (MEC) paradigm changes the role of edge devices from data producers and requesters to data consumers and processors. MEC mitigates the bandwidth limitation between the edge server and the remote cloud by directly processing the large amount of data locally generated by the network of the internet of things (IoT) at the edge. An efficient data-gathering scheme is crucial for providing quality of service (QoS) within MEC. To reduce redundant data transmission, this paper proposes a data collection scheme that only gathers the necessary data from IoT devices (like wireless sensors) along a trajectory. Instead of using and transmitting location information (which may leak the location anonymity), a virtual coordinate system called \u27distance vector of hops to anchors\u27 (DV-Hop) is used. The proposed trajectory encoding algorithm uses ellipse and hyperbola constraints to encode the position of interest (POI) and the trajectory route to the POI. Sensors make routing decisions only based on the geometric constraints and the DV-Hop information, both of which are stored in their memory. Also, the proposed scheme can work in heterogeneous networks (with different radio ranges) where each sensor can calculate the average one-hop distance within the POI dynamically. The proposed DV-Hop updating algorithm enables the users to collect data in an IoT network with mobile nodes. The experiments show that in heterogeneous IoT networks, the proposed data collection scheme outperforms two other state-of-the-art topology-based routing protocols, called ring routing, and nested ring. The results also show that the proposed scheme has better latency, reliability, coverage, energy usage, and provide location privacy compared to state-of-the-art schemes

Congestion and medium access control in 6LoWPAN WSN

In computer networks, congestion is a condition in which one or more egressinterfaces are offered more packets than are forwarded at any given instant [1]. In wireless sensor networks, congestion can cause a number of problems including packet loss, lower throughput and poor energy efficiency. These problems can potentially result in a reduced deployment lifetime and underperforming applications. Moreover, idle radio listening is a major source of energy consumption therefore low-power wireless devices must keep their radio transceivers off to maximise their battery lifetime. In order to minimise energy consumption and thus maximise the lifetime of wireless sensor networks, the research community has made significant efforts towards power saving medium access control protocols with Radio Duty Cycling. However, careful study of previous work reveals that radio duty cycle schemes are often neglected during the design and evaluation of congestion control algorithms. This thesis argues that the presence (or lack) of radio duty cycle can drastically influence the performance of congestion control mechanisms. To investigate if previous findings regarding congestion control are still applicable in IPv6 over low power wireless personal area and duty cycling networks; some of the most commonly used congestion detection algorithms are evaluated through simulations. The research aims to develop duty cycle aware congestion control schemes for IPv6 over low power wireless personal area networks. The proposed schemes must be able to maximise the networks goodput, while minimising packet loss, energy consumption and packet delay. Two congestion control schemes, namely DCCC6 (Duty Cycle-Aware Congestion Control for 6LoWPAN Networks) and CADC (Congestion Aware Duty Cycle MAC) are proposed to realise this claim. DCCC6 performs congestion detection based on a dynamic buffer. When congestion occurs, parent nodes will inform the nodes contributing to congestion and rates will be readjusted based on a new rate adaptation scheme aiming for local fairness. The child notification procedure is decided by DCCC6 and will be different when the network is duty cycling. When the network is duty cycling the child notification will be made through unicast frames. On the contrary broadcast frames will be used for congestion notification when the network is not duty cycling. Simulation and test-bed experiments have shown that DCCC6 achieved higher goodput and lower packet loss than previous works. Moreover, simulations show that DCCC6 maintained low energy consumption, with average delay times while it achieved a high degree of fairness. CADC, uses a new mechanism for duty cycle adaptation that reacts quickly to changing traffic loads and patterns. CADC is the first dynamic duty cycle pro- tocol implemented in Contiki Operating system (OS) as well as one of the first schemes designed based on the arbitrary traffic characteristics of IPv6 wireless sensor networks. Furthermore, CADC is designed as a stand alone medium access control scheme and thus it can easily be transfered to any wireless sensor network architecture. Additionally, CADC does not require any time synchronisation algorithms to operate at the nodes and does not use any additional packets for the exchange of information between the nodes (For example no overhead). In this research, 10000 simulation experiments and 700 test-bed experiments have been conducted for the evaluation of CADC. These experiments demonstrate that CADC can successfully adapt its cycle based on traffic patterns in every traffic scenario. Moreover, CADC consistently achieved the lowest energy consumption, very low packet delay times and packet loss, while its goodput performance was better than other dynamic duty cycle protocols and similar to the highest goodput observed among static duty cycle configurations

A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks

In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs

Data and resource management in wireless networks via data compression, GPS-free dissemination, and learning

“This research proposes several innovative approaches to collect data efficiently from large scale WSNs. First, a Z-compression algorithm has been proposed which exploits the temporal locality of the multi-dimensional sensing data and adapts the Z-order encoding algorithm to map multi-dimensional data to a one-dimensional data stream. The extended version of Z-compression adapts itself to working in low power WSNs running under low power listening (LPL) mode, and comprehensively analyzes its performance compressing both real-world and synthetic datasets. Second, it proposed an efficient geospatial based data collection scheme for IoTs that reduces redundant rebroadcast of up to 95% by only collecting the data of interest. As most of the low-cost wireless sensors won’t be equipped with a GPS module, the virtual coordinates are used to estimate the locations. The proposed work utilizes the anchor-based virtual coordinate system and DV-Hop (Distance vector of hops to anchors) to estimate the relative location of nodes to anchors. Also, it uses circle and hyperbola constraints to encode the position of interest (POI) and any user-defined trajectory into a data request message which allows only the sensors in the POI and routing trajectory to collect and route. It also provides location anonymity by avoiding using and transmitting GPS location information. This has been extended also for heterogeneous WSNs and refined the encoding algorithm by replacing the circle constraints with the ellipse constraints. Last, it proposes a framework that predicts the trajectory of the moving object using a Sequence-to-Sequence learning (Seq2Seq) model and only wakes-up the sensors that fall within the predicted trajectory of the moving object with a specially designed control packet. It reduces the computation time of encoding geospatial trajectory by more than 90% and preserves the location anonymity for the local edge servers”--Abstract, page iv

Enhanced delay-aware and reliable routing protocol for wireless sensor network

Wireless Sensor Networks (WSN) are distributed low-rate data networks, consist of small sensing nodes equipped with memory, processors and short range wireless communication. The performance of WSN is always measured by the Quality of Service (QoS) parameters that are time delay, reliability and throughput. These networks are dynamic in nature and affect the QoS parameters, especially when real time data delivery is needed. Additionally, in achieving end-to-end delay and reliability, link failures are the major causes that have not been given much attention. So, there is a demanding need of an efficient routing protocol to be developed in order to minimize the delay and provide on time delivery of data in real time WSN applications. An efficient Delay-Aware Path Selection Algorithm (DAPSA) is proposed to minimize the access end-to-end delay based on hop count, link quality and residual energy metrics considering the on time packets delivery. Furthermore, an Intelligent Service Classifier Queuing Model (ISCQM) is proposed to distinguish the real time and non-real time traffic by applying service discriminating theory to ensure delivery of real time data with acceptable delay. Moreover, an Efficient Data Delivery and Recovery Scheme (EDDRS) is proposed to achieve improved packet delivery ratio and control link failures in transmission. This will then improve the overall throughput. Based on the above mentioned approaches, an Enhanced Delay-Aware and Reliable Routing Protocol (EDARRP) is developed. Simulation experiments have been performed using NS2 simulator and multiple scenarios are considered in order to examine the performance parameters. The results are compared with the state-of-the-art routing protocols Stateless Protocol for Real-Time Communication (SPEED) and Distributed Adaptive Cooperative Routing Protocol (DACR) and found that on average the proposed protocol has improved the performance in terms of end-to-end delay (30.10%), packet delivery ratio (9.26%) and throughput (5.42%). The proposed EDARRP protocol has improved the performance of WSN