Maximum Throughput Under Admission Control With Unknown Queue-Length in Wireless Sensor Networks

Zhang, Xiaolu; Li, Demin; Zhang, Yihong

doi:10.1109/jsen.2020.2997984

Cited by 6 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But the queue size of a node plays an important role in overcoming congestion. Queue size is considered in [34], [35], [36] to control congestion and inturn improve QoS. Rezaee et.…”

Section: Related Workmentioning

confidence: 99%

Adaptive Queue Management and Traffic Class Priority Based Fairness Rate Control in Wireless Sensor Networks

Swain

Nanda

2021

IEEE Access

View full text Add to dashboard Cite

Congestion control in Wireless Sensor Networks (WSNs) is one of the key areas of research and different algorithms have been proposed using either of the notions of fair rate allocation, traffic class priority, and queue management. Use of the any one of the above is not adequate to address the challenges. Hence, in this paper, we have proposed a novel congestion control algorithm using the combined notions of fair allocation of bandwidth, prioritizing traffic classes, and Adaptive Queue Management (ADQM). The proposed Weighted Priority based Fair Queue Gradient Rate Control (WPFQGRC) scheme achieves the fair distribution of spare bandwidth by considering the traffic class priority, average queue size, and the connected loads of a node. Average queue size at every node is adapted based on the proposed notion of the gradient of the differential of Global Priority (GP) with respect to the differential of queue size. The output rate of a given node is computed based on the GP of the node and the average queue size. The spare bandwidth of a node is fairly distributed by taking into account the connected load of the given node. The proposed algorithm is developed to suit to a general topology of WSN, however for the sake of illustration, we have considered a tree topology network that deals with both Real-Time (RT) and Non-Real Time (NRT) traffic classes. The proposed algorithm is implemented in NS3 platform in Linux environment and the performance of the algorithm is evaluated in terms of throughput, packet loss, and packet delay. Besides the effect of traffic class patterns, effects of node mobility and the average queue size on throughput have also been studied. The performance of the proposed algorithm is found to be superior to that of Yaghmaee et al.

show abstract

“…But the queue size of a node plays an important role in overcoming congestion. Queue size is considered in [34], [35], [36] to control congestion and inturn improve QoS. Rezaee et.…”

Section: Related Workmentioning

confidence: 99%

Adaptive Queue Management and Traffic Class Priority Based Fairness Rate Control in Wireless Sensor Networks

Swain

Nanda

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Phung-Duc et al [22] carried out a study on delay performance considering a multi-server queue system using Markov chain. Zhang et al [23] used Markov decision process to analyze the decision policy on energy consumption of the nodes by switching the nodes' status. The proposed model is applicable for all the events that arrive at the sensor input.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Power Management Model for a Wireless Sensor Node

Kallimani¹,

Iyer²

2021

Proc. eng. technol. innov.

View full text Add to dashboard Cite

Dynamic power management (DPM) is an efficient technique to design low-power and energy-efficient nodes for wireless sensor networks. This article demonstrates the stochastic behaviour of an input event arrival which is modelled with first-in first-out (FIFO) queue and a single server. An event-driven sensor node is developed based on semi-Markov model. The article investigates the factors affecting the performance of the individual sensor node with detailed analysis considering power consumption and lifetime to be the performance metrics under study. The results demonstrate the impact of the change in event arrival and the probability of change detection on the performance of the node. It is observed that (i) the number of generated events increases with the change in the average value of the distribution which affects the service time in turn resulting in a variation of the server utilization, and that (ii) the increase in the detection probability increases the power consumption decreasing the lifetime of the node.

show abstract

Performance analysis of a stochastic wireless sensor node based on Markovian queuing theory

Kallimani

Iyer

Pandya

2023

Journal of Cyber Security Technology

View full text Add to dashboard Cite

Maximum Throughput Under Admission Control With Unknown Queue-Length in Wireless Sensor Networks

Cited by 6 publications

References 24 publications

Adaptive Queue Management and Traffic Class Priority Based Fairness Rate Control in Wireless Sensor Networks

Adaptive Queue Management and Traffic Class Priority Based Fairness Rate Control in Wireless Sensor Networks

Dynamic Power Management Model for a Wireless Sensor Node

Performance analysis of a stochastic wireless sensor node based on Markovian queuing theory

Contact Info

Product

Resources

About