Utilizing Mobile Nodes for Congestion Control in Wireless Sensor Networks

Congestion control and avoidance in Wireless Sensor Networks (WSNs) is a subject that has attracted a lot of research attention in the last decade. Besides rate and resource control, the utilization of mobile nodes has also been suggested as a way to control congestion. In this work, we present a Mobile Congestion Control (MobileCC) algorithm with two variations, to assist existing congestion control algorithms in facing congestion in WSNs. The first variation employs mobile nodes that create locally-significant alternative paths leading to the sink. The second variation employs mobile nodes that create completely individual (disjoint) paths to the sink. Simulation results show that both variations can significantly contribute to the alleviation of congestion in WSNs.Comment: 9 pages, 12 figures, 1 tabl

Software defined networking based resource management and quality of service support in wireless sensor network applications

To achieve greater performance in computing networks, a setup of critical computing aspects that ensures efficient network operation, needs to be implemented. One of these computing aspects is, Quality of Service (QoS). Its main functionality is to manage traffic queues by means of prioritizing sensitive network traffic. QoS capable networking allows efficient control of traffic especially for network critical data. However, to achieve this in Wireless Sensor Networks (WSN) is a serious challenge, since these technologies have a lot of computing limitations. It is even difficult to manage networking resources with ease in these types of technologies, due to their communication, processing and memory limitations. Even though this is the case with WSNs, they have been largely used in monitoring/detection systems, and by this proving their application importance. Realizing efficient network control requires intelligent methods of network management, especially for sensitive network data. Different network types implement diverse methods to control and administer network traffic as well as effectively manage network resources. As with WSNs, communication traffic and network resource control are mostly performed depending on independently employed mechanisms to deal with networking events occurring on different levels. It is therefore challenging to realize efficient network performance with guaranteed QoS in WSNs, given their computing limitations. Software defined networking (SDN) is advocated as a potential paradigm to improve and evolve WSNs in terms of capacity and application. A means to apply SDN strategies to these compute-limited WSNs, formulates software defined wireless sensor networks (SDWSN). In this work, a resource-aware OpenFlow-based Active Network Management (OF-ANM) QoS scheme that uses SDN strategies is proposed and implemented to apply QoS requirements for managing traffic congestion in WSNs. This scheme uses SDN programmability strategies to apply network QoS requirements and perform traffic load balancing to ensure congestion control in SDWSN. Our experimental results show that the developed scheme is able to provide congestion avoidance within the network. It also allows opportunities to implement flexible QoS requirements based on the system’s traffic state. Moreover, a QoS Path Selection and Resource-associating (Q-PSR) scheme for adaptive load balancing and intelligent resource control for optimal network performance is proposed and implemented. Our experimental results indicate better performance in terms of computation with load balancing and efficient resource alignment for different networking tasks when compared with other competing schemes.Thesis (PhD)--University of Pretoria, 2018.National Research FoundationUniversity of PretoriaElectrical, Electronic and Computer EngineeringPhDUnrestricte

Congestion control in wireless sensor and 6LoWPAN networks: toward the Internet of Things

The Internet of Things (IoT) is the next big challenge for the research community where the IPv6 over low power wireless personal area network (6LoWPAN) protocol stack is a key part of the IoT. Recently, the IETF ROLL and 6LoWPAN working groups have developed new IP based protocols for 6LoWPAN networks to alleviate the challenges of connecting low memory, limited processing capability, and constrained power supply sensor nodes to the Internet. In 6LoWPAN networks, heavy network traffic causes congestion which significantly degrades network performance and impacts on quality of service aspects such as throughput, latency, energy consumption, reliability, and packet delivery. In this paper, we overview the protocol stack of 6LoWPAN networks and summarize a set of its protocols and standards. Also, we review and compare a number of popular congestion control mechanisms in wireless sensor networks (WSNs) and classify them into traffic control, resource control, and hybrid algorithms based on the congestion control strategy used. We present a comparative review of all existing congestion control approaches in 6LoWPAN networks. This paper highlights and discusses the differences between congestion control mechanisms for WSNs and 6LoWPAN networks as well as explaining the suitability and validity of WSN congestion control schemes for 6LoWPAN networks. Finally, this paper gives some potential directions for designing a novel congestion control protocol, which supports the IoT application requirements, in future work

Control de congestión en redes inalámbricas de sensores

La congestión en Redes Inalámbricas de Sensores puede ocasionar comportamientos no deseados como baja eficiencia energética, altos retardos en la comunicación, uso ineficiente de recursos, alta probabilidad de degradación de servicio, alto riesgo de pérdida de paquetes, etc. Con las proyecciones de crecimiento de trafico en Internet y la adopción de IoT es necesario investigar y desarrollar métodos de control de congestión que detecten, notifiquen y mitiguen la congestión en una WSN. Se el presente, se considera un método distribuido de múltiples capas llamado MLDC (Multi-Layer and Distributed Congestion Control). Este considera las capas a) Acceso prioritario al canal, b) Administración del buffer, c) Algoritmo de enrutamiento y una aplicación basada en MLDC. Se realiza una novedosa evaluación comparativa de diferentes métodos de control de congestión en tres diferentes topologías de red. MLDC trabaja apropiadamente en todas las topologías evaluadas mejorando el comportamiento de la red.Congestion in Wireless Sensor Networks (WSN) may cause non-desirables behaviors like low energy efficiency, high delay in the communication, inefficient use of network resources, high probability of service degradation, high risk of packet loss, etc. With the projections of increasing Internet traffic in next years and the adoption of the IoT in people's daily lives, it is necessary to investigate and develop congestion control methods that detect, notify and mitigate congestion in a WSN. To meet this challenge, a method that considers a distributed and multi-layer congestion control called MLDC (Multi-Layer and Distributed Congestion Control) is proposed. It considers the layers a) Priority access to the channel, b) Buffer management, c) Routing algorithm to avoid and mitigate congestion and d) MLDC-based application. A novel comparative evaluation of different Congestion control methods in three network topologies is carried out. MLDC works properly in all the topologies evaluated, improving the behavior of the network and reaching and optimizing the proposed congestion control metrics.Magíster en Ingeniería ElectrónicaMaestrí

Efficient Node Placement for Congestion Control in Wireless Sensor Networks

Geology & the lithospher

Chapter Efficient Node Placement for Congestion Control in Wireless Sensor Networks

Geology & the lithospher

An efficient reconfigurable geographic routing congestion control algorithm for wireless sensor networks

In recent times, huge data is transferred from source to destination through multi path in wireless sensor networks (WSNs). Due to this more congestion occurs in the communication path. Hence, original data will be lost and delay problems arise at receiver end. The above-mentioned drawbacks can be overcome by the proposed efficient reconfigurable geographic routing congestion control (RgRCC) algorithm for wireless sensor networks. the proposed algorithm efficiently finds the node’s congestion status with the help queue length’s threshold level along with its change rate. Apart from this, the proposed algorithm re-routes the communication path to avoid congestion and enhances the strength of scalability of data communication in WSNs. The proposed algorithm frequently updates the distance between the nodes and by-pass routing holes, common for geographical routing. when the nodes are at the edge of the hole, it will create congestion between the nodes in WSNs. Apart from this, more nodes sink due to congestion. it can be reduced with the help of the proposed RgRCC algorithm. As per the simulation analysis, the proposed work indicates improved performance in comparison to conventional algorithm. By effectively identifying the data congestion in WSNs with high scalability rate as compared to conventional method

Congestion Control for 6LoWPAN Wireless Sensor Networks: Toward the Internet of Things

The Internet of Things (IoT) is the next big challenge for the research community. The IPv6 over low power wireless personal area network (6LoWPAN) protocol stack is considered a key part of the IoT. Due to power, bandwidth, memory and processing resources limitation, heavy network traffic in 6LoWPAN networks causes congestion which significantly degrades network performance and impacts on the quality of service (QoS) aspects. This thesis addresses the congestion control issue in 6LoWPAN networks. In addition, the related literature is examined to define the set of current issues and to define the set of objectives based upon this. An analytical model of congestion for 6LoWPAN networks is proposed using Markov chain and queuing theory. The derived model calculates the buffer loss probability and the number of received packets at the final destination in the presence of congestion. Simulation results show that the analytical modelling of congestion has a good agreement with simulation. Next, the impact of congestion on 6LoWPAN networks is explored through simulations and real experiments where an extensive analysis is carried out with different scenarios and parameters. Analysis results show that when congestion occurs, the majority of packets are lost due to buffer overflow as compared to channel loss. Therefore, it is important to consider buffer occupancy in protocol design to improve network performance. Based on the analysis conclusion, a new IPv6 Routing Protocol for Low-Power and Lossy Network (RPL) routing metric called Buffer Occupancy is proposed that reduces the number of lost packets due to buffer overflow when congestion occurs. Also, a new RPL objective function called Congestion-Aware Objective Function (CA-OF) is presented. The proposed objective function works efficiently and improves the network performance by selecting less congested paths. However, sometimes the non-congested paths are not available and adapting the sending rates of source nodes is important to mitigate the congestion. Accordingly, the congestion problem is formulated as a non-cooperative game framework where the nodes (players) behave uncooperatively and demand high data rate in a selfish way. Based on this framework, a novel and simple congestion control mechanism called Game Theory based Congestion Control Framework (GTCCF) is proposed to adapt the sending rates of nodes and therefore, congestion can be solved. The existence and uniqueness of Nash equilibrium in the designed game is proved and the optimal game solution is computed by using Lagrange multipliers and Karush-Kuhn-Tucker (KKT) conditions. GTCCF is aware of node priorities and application priorities to support the IoT application requirements. On the other hand, combining and utilizing the resource control strategy (i.e. finding non-congested paths) and the traffic control strategy (i.e. adapting sending rate of nodes) into a hybrid scheme is important to efficiently utilize the network resources. Based on this, a novel congestion control algorithm called Optimization based Hybrid Congestion Alleviation (OHCA) is proposed. The proposed algorithm combines traffic control and resource control strategies into a hybrid solution by using the Network Utility Maximization (NUM) framework and a multi-attribute optimization methodology respectively. Also, the proposed algorithm is aware of node priorities and application priorities to support the IoT application requirements

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