The role of queueing theory in the design and analysis of wireless sensor networks: An insight

Lall, Shruti; Alfa, Attahiru Sule; Maharaj, B. T.

doi:10.1109/indin.2016.7819347

Cited by 10 publications

(8 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each Type-i data is sent or forwarded to the next hop node by MAC Layer and communication link. This sending process is similar to the queen theory system [24], [25]. Assuming that the Type-i data traffic is a Poission flow with the rate r i .…”

Section: A Game Theory Modelmentioning

confidence: 96%

Game Theory Based Congestion Control for Routing in Wireless Sensor Networks

2021

View full text Add to dashboard Cite

The Congestion in wireless sensor networks can lead to the loss and retransmissions of packets, and excessive energy consumption. Since network congestion can deteriorate the throughput, the quality of service (QoS) in data transmission, and network lifetime, congestion control is a critical problem. In this paper, the data transmission process is firstly presented based on the data type. The cooperation game theory is used to model the transfer behavior of different type data. Further, a cooperation game based congestion control (CGCC) is proposed. The different type data cooperates with each other to use link capacity. And then Ant colony Routing algorithm combined with CGCC (ARCGCC) is designed. According to the congestion degree and QoS requirement of each type data, the routing path is built in the routing algorithm. When congestion is detected, the congestion information is exchange. In the light of the data traffic and priority, the nodes adjust the sending rate to the next hop node to mitigate the congestion. Experimental results show that our mechanism and algorithm have better performance than some other mechanism and algorithms in terms of the throughput, reliability, delay, and energy consumption.INDEX TERMS Wireless senor networks, congestion control, game theory, routing algorithm, QoS.

show abstract

Section: A Game Theory Modelmentioning

confidence: 96%

Game Theory Based Congestion Control for Routing in Wireless Sensor Networks

2021

View full text Add to dashboard Cite

show abstract

“…However, those works are only applicable for single-hop networks. However, it has been shown that the multi-queuing strategy plays a major role in affecting the Quality-of-Service (QoS) requirements of wireless sensor networks with multiple traffic types [ 20 ]. The work in [ 21 ] introduced EARS, an emergency packet scheduling scheme for IoT in smart cities.…”

Section: Problem Statement and Related Workmentioning

confidence: 99%

Congestion Control and Traffic Differentiation for Heterogeneous 6TiSCH Networks in IIoT

Farag

Österberg

Gidlund

2020

Sensors

View full text Add to dashboard Cite

The Routing Protocol for Low power and lossy networks (RPL) has been introduced as the de-facto routing protocol for the Industrial Internet of Things (IIoT). In heavy load scenarios, particular parent nodes are likely prone to congestion, which in turn degrades the network performance, in terms of packet delivery and delay. Moreover, there is no explicit strategy in RPL to prioritize the transmission of different traffic types in heterogeneous 6TiSCH networks, each according to its criticality. In this paper, we address the aforementioned issues by introducing a congestion control and service differentiation strategies to support heterogeneous 6TiSCH networks in IIoT applications. First, we introduce a congestion control mechanism to achieve load balancing under heavy traffic scenarios. The congestion is detected through monitoring and sharing the status of the queue backlog among neighbor nodes. We define a new routing metric that considers the queue occupancy when selecting the new parent node in congestion situations. In addition, we design a multi-queue model to provide prioritized data transmission for critical data over the non-critical ones. Each traffic type is placed in a separate queue and scheduled for transmission based on the assigned queue priority, where critical data are always transmitted first. The performance of the proposed work is evaluated through extensive simulations and compared with existing work to demonstrate its effectiveness. The results show that our proposal achieves improved packet delivery and low queue losses under heavy load scenarios, as well as improved delay performance of critical traffic.

show abstract

“…Long range dependence traffic [10] is handled using the Pareto process. In this model, queuing ability [25] [29] depends on the level of aggregation within the burst process.…”

Section: Introductionmentioning

confidence: 99%

An Enhanced Packet Transmission Framework for Handling Real Time Burst Traffic in Wireless Sensor Networks

Ganesan

Muthuswamy

2022

Preprint

View full text Add to dashboard Cite

Congestion control for real time traffic is an important network measure to be handled in case of repeated event triggers, continuous packet re-transmissions, node interference, node deaths and node failures in Wireless Sensor Networks (WSNs). Network modelling for transmission of packets from source node to sink using probabilistic M/Pareto and Poisson processes have been examined in the past. The existing methodologies are deficit in designing a queuing framework considering other network parameters such as energy consumption and delay for alleviating congestion and thereby efficiently routing packets to sink by reducing packet drops. To overcome this fall back, a Minimum Weight Estimation for Mitigating Congestion during Real Time Burst Traffic (MWCBT) framework is proposed. This gives a precautionary solution against heavy traffic occupancy among the interim and sink-neighbouring nodes in WSNs is proposed. Routing of packets using a congestion-free path is required to increase the node lifespan. An optimal M/Pareto stochastic traffic generator is used in combination with traffic factors such as energy and delay to predict amount of traffic across nodes. A simpler congestion prediction mechanism is performed to control the occurrence of heavy-tailed traffic distributions. A torrent weight value for incoming traffic is generated at each node periodically that directs routing of data packets to sink. The devised MWCBT framework supervises real-time traffic congestion and is found to be more optimal than the existing approaches for network traffic modelling. The proposed approach achieves greater packet delivery ratio and less node congestion compared to the existing network modelling techniques.

show abstract

The role of queueing theory in the design and analysis of wireless sensor networks: An insight

Cited by 10 publications

References 33 publications

Game Theory Based Congestion Control for Routing in Wireless Sensor Networks

Game Theory Based Congestion Control for Routing in Wireless Sensor Networks

Congestion Control and Traffic Differentiation for Heterogeneous 6TiSCH Networks in IIoT

An Enhanced Packet Transmission Framework for Handling Real Time Burst Traffic in Wireless Sensor Networks

Contact Info

Product

Resources

About