Analytical modelling of congestion for 6LoWPAN networks

The IPv6 over Low-Power Wireless Personal Area Network (6LoWPAN) protocol stack is a key part of the Internet of Things (IoT) where the 6LoWPAN motes will account for the majority of the IoT ‘things’. In 6LoWPAN networks, heavy network traffic causes congestion which significantly affects the overall performance and the quality of service metrics. In this paper, a new 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 channel loss probability as well as the number of received packets at the final destination in the presence of congestion. Also, we calculate the actual wireless channel capacity of IEEE 802.15.4 with and without collisions based on Contiki OS implementation. The validation of the proposed model is performed with different scenarios through simulation by using Contiki OS and Cooja simulator. Simulation results show that the analytical modelling of congestion has an accurate agreement with simulation

Congestion Control for 6LoWPAN Networks: A Game Theoretic Framework

The Internet of Things (IoT) has been considered as an emerging research area where the 6LoWPAN (IPv6 over Low-Power Wireless Personal Area Network) protocol stack is considered as one of the most important protocol suite for the IoT. Recently, the Internet Engineering Task Force has developed a set of IPv6 based protocols to alleviate the challenges of connecting resource limited sensor nodes to the Internet. In 6LoWPAN networks, heavy network traffic causes congestion which significantly degrades network performance and effects the quality of service (QoS) aspects e.g. throughput, end-to-end delay and energy consumption. In this paper, we formulate the congestion problem as a non-cooperative game framework where the nodes (players) behave uncooperatively and demand high data rate in a selfish way. Then, the existence and uniqueness of Nash equilibrium is proved and the optimal game solution is computed by using Lagrange multipliers and KKT conditions. Based on this framework, we propose a novel and simple congestion control mechanism called game theory based congestion control framework (GTCCF) specially tailored for IEEE 802.15.4, 6LoWPAN networks. GTCCF is aware of node priorities and application priorities to support the IoT application requirements. The proposed framework has been tested and evaluated through two different scenarios by using Contiki OS and compared with comparative algorithms. Simulation results show that GTCCF improves performance in the presence of congestion by an overall average of 30.45%, 39.77%, 26.37%, 91.37% and 13.42% in terms of throughput, end-to-end delay, energy consumption, number of lost packets and weighted fairness index respectively as compared to DCCC6 algorithm

A Game Theoretic Optimization of RPL for Mobile Internet of Things Applications

The presence of mobile nodes in any wireless network can affect the performance of the network, leading to higher packet loss and increased energy consumption. However, many recent applications require the support of mobility and an efficient approach to handle mobile nodes is essential. In this paper, a game scenario is formulated where nodes compete for network resources in a selfish manner, to send their data packets to the sink node. Each node counts as a player in the noncooperative game. The optimal solution for the game is found using the unique Nash equilibrium (NE) where a node cannot improve its pay-off function while other players use their current strategy. The proposed solution aims to present a strategy to control different parameters of mobile nodes (or static nodes in a mobile environment) including transmission rate, timers and operation mode in order to optimize the performance of RPL under mobility in terms of packet delivery ratio (PDR), throughput, energy consumption and end-to-end-delay. The proposed solution monitors the mobility of nodes based on received signal strength indication (RSSI) readings, it also takes into account the priorities of different nodes and the current level of noise in order to select the preferred transmission rate. An optimized protocol called game-theory based mobile RPL (GTM-RPL) is implemented and tested in multiple scenarios with different network requirements for Internet of Things applications. Simulation results show that in the presence of mobility, GTM-RPL provides a flexible and adaptable solution that improves throughput whilst maintaining lower energy consumption showing more than 10% improvement compared to related work. For applications with high throughput requirements, GTM-RPL shows a significant advantage with more than 16% improvement in throughput and 20% improvement in energy consumption

Dynamic RPL for Multi-hop Routing in IoT Applications

The Routing Protocol for Low Power and Lossy Networks (RPL) has become the standard routing protocol for the Internet of Things (IoT). This paper investigates the use of RPL in dynamic networks and presents an enhanced RPL for different applications with dynamic mobility and diverse network requirements. This implementation of RPL is designed with a new dynamic Objective-Function (D-OF) to improve the Packet Delivery Ratio (PDR), end-to-end delay and energy consumption while maintaining low packet overhead and loop-avoidance. We propose a controlled reverse-trickle timer based on received signal strength identification (RSSI) readings to maintain high responsiveness with minimum overhead and consult the objective function when a movement or an inconsistency is detected to help nodes make an informed decision. Simulations are done using Cooja with random waypoint mobility scenario for healthcare applications considering multi-hop routing. The results show that the proposed dynamic RPL (D-RPL) adapts to the nodes mobility and has a higher PDR, slightly lower end-to-end delay and reasonable energy consumption compared to related existing protocols

Optimization Based Hybrid Congestion Alleviation for 6LoWPAN Networks

The IPv6 over Low-Power Wireless Personal Area Network (6LoWPAN) protocol stack is a key part of the Internet of Things (IoT) where the 6LoWPAN motes will account for the majority of the IoT ‘things’. In 6LoWPAN networks, heavy network traffic causes congestion which significantly effects the network performance and the quality of service (QoS) metrics. Generally, two main strategies are used to control and alleviate congestion in 6LoWPAN networks: resource control and traffic control. All the existing work of congestion control in 6LoWPAN networks use one of these. In this paper, we propose a novel congestion control algorithm called optimization based hybrid congestion alleviation (OHCA) which combines both strategies into a hybrid solution. OHCA utilizes the positive aspects of each strategy and efficiently uses the network resources. The proposed algorithm uses a multi-attribute optimization methodology called grey relational analysis for resource control by combining three routing metrics (buffer occupancy, expected transmission count and queuing delay) and forwarding packets through non-congested parents. Also, OHCA uses optimization theory and Network Utility Maximization (NUM) framework to achieve traffic control when the non-congested parent is not available where the optimal nodes’ sending rate are computed by using Lagrange multipliers and KKT conditions. The proposed algorithm is aware of node priorities and application priorities to support the IoT application requirements where the applications’ sending rate allocation is modelled as a constrained optimization problem. OHCA has been tested and evaluated through simulation by using Contiki OS and compared with comparative algorithms. Simulation results show that OHCA improves performance in the presence of congestion by an overall average of 28.36%, 28.02%, 48.07%, 31.97% and 90.35% in terms of throughput, weighted fairness index, end-to-end delay, energy consumption and buffer dropped packets as compared to DCCC6 and QU-RPL

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

Hybrid game approach‐based channel congestion control for the Internet of Vehicles

Communications between the Internet of Vehicles in smart cities helps increase the awareness and safety among drivers. However, the channel congestion problem is considered as a key challenge for the communication networks due to continuing collection and exchange of traffic information in dense environments. The channel congestion problem degrades the efficiency and reliability of the ad hoc network. Therefore, the adaptation of the data rate and power control is considered as one of the effective solutions to mitigate channel congestion. This paper develops a new hybrid game transmission rate and power channel congestion control approach on the Internet of Vehicle networks where the nodes play as greedy opponents demanding high information rates with the maximum power level. Furthermore, the existence of a Nash equilibrium, which is the optimal information rate and power transmission for every vehicle, is established. Simulation results demonstrate that the proposed approach enhances the network performance by an overall percentage of 42.27%, 43.94% and 47.66% regarding of channel busy time, messages loss and data collision as compared to others. This increases the awareness and performance of the vehicular communication network

RPL-Based Routing Protocols in IoT Applications: A Review

In the last few years, the Internet of Things (IoT) has proved to be an interesting and promising paradigm that aims to contribute to countless applications by connecting more physical 'things' to the Internet. Although it emerged as a major enabler for many next-generation applications, it also introduced new challenges to already saturated networks. The IoT is already coming to life especially in healthcare and smart environment applications adding a large number of low-powered sensors and actuators to improve lifestyle and introduce new services to the community. The Internet Engineering Task Force (IETF) developed RPL as the routing protocol for low-power and lossy networks (LLNs) and standardized it in RFC6550 in 2012. RPL quickly gained interest, and many research papers were introduced to evaluate and improve its performance in different applications. In this paper, we present a discussion of the main aspects of RPL and the advantages and disadvantages of using it in different IoT applications. We also review the available research related to RPL in a systematic manner based on the enhancement area and the service type. In addition to that, we compare related RPL-based protocols in terms of energy efficiency, reliability, flexibility, robustness, and security. Finally, we present our conclusions and discuss the possible future directions of RPL and its applicability in the Internet of the future

Centralized simulated annealing for alleviating vehicular congestion in smart cities

Vehicular traffic congestion is a serious problem arising in many cities around the world, due to the increasing number of vehicles utilizing roads of a limited capacity. Often the congestion has a considerable influence on the travel time, travel distance, fuel consumption and air pollution. This paper proposes a novel dynamic centralized simulated annealing based approach for finding optimal vehicle routes using a VIKOR type of cost function. Five attributes: the average travel speed of the traffic, vehicles density, roads width, road traffic signals and the roads' length are utilized by the proposed approach to find the optimal paths. The average travel speed and vehicles density values can be obtained from the sensors deployed in smart cities and communicated to vehicles and roadside communication units via vehicular ad hoc networks. The performance of the proposed algorithm is compared with four other algorithms, over two test scenarios: Birmingham and Turin city centres. These show the proposed method improves traffic efficiency in the presence of congestion by an overall average of 24.05%, 48.88% and 36.89% in terms of travel time, fuel consumption and CO2 emission, respectively, for a test scenario from Birmingham city in the UK. Additionally, similar performance patterns are achieved for the a test with data from Turin, Italy

Coalition game for emergency vehicles re-routing in smart cities

Traffic jam is considered as a difficult problem to deal with in many cities around the world due to the continuously increasing number of vehicles compared to the available infrastructure. Traffic congestion significantly influences drivers travel journey, fuel consumption and air pollution. However, the most important factor has affected the delay of emergency vehicles, such as ambulances and police cars, leading to increased road deaths and significant financial losses. To reduce this problem, we propose an advanced traffic control allows rapid emergency services response in smart cities. This can be achieved through a traffic management system capable of implementing path planning in road network monitoring and driving the emergency vehicle in the best possible way to reach the hazard zone. The performance of the proposed algorithm is compared with two other algorithms over Birmingham city centre test scenarios. Simulation results show that the proposed approach improves traffic efficiency of emergency vehicles by an overall average of 21.78%, 29.32%, 32.79% and 46.77% in terms of travel time, fuel consumption, CO2emission and average speed, respectively