Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Queuing Delay Analysis in Wireless Networks


Affiliations
1 Karpagam College of Engineering, Coimbatore, India
2 RVS College of Engineering and Technology, Coimbatore, India
     

   Subscribe/Renew Journal


The wireless networks provides Best Effort of Service. Traffic analysis is processed as quickly as possible, but there is no guarantee of timelines or actual delivery due to delay. The medium access layer (MAC) is needed to schedule the links carefully so that packets can be transmitted with minimal collisions. Many scheduling policies have been studied at the MAC layer with the objective of maximizing throughput and reducing delay. These schemes are often called throughput optimal scheduling schemes. We will analyze the delay performance in multi-hop wireless networks. In the MAC layer the delay estimation is at the lower and upper bounds of the queue using queuing analysis. This paper focuses only a comparison of queuing delay analysis in wireless networks using various well known queuing techniques and also extend to identify the low complexity distributed scheduling algorithm for multi-hop wireless networks.

Keywords

Low Complexity and Distributed Algorithms, Queuing Analysis, Multi-Hop Wireless Networks, Lower and Upper Bounds, Maximal Matching, Queuing Delay.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 204

PDF Views: 2




  • Queuing Delay Analysis in Wireless Networks

Abstract Views: 204  |  PDF Views: 2

Authors

K. Malarvizhi
Karpagam College of Engineering, Coimbatore, India
L. S. Jayashree
RVS College of Engineering and Technology, Coimbatore, India

Abstract


The wireless networks provides Best Effort of Service. Traffic analysis is processed as quickly as possible, but there is no guarantee of timelines or actual delivery due to delay. The medium access layer (MAC) is needed to schedule the links carefully so that packets can be transmitted with minimal collisions. Many scheduling policies have been studied at the MAC layer with the objective of maximizing throughput and reducing delay. These schemes are often called throughput optimal scheduling schemes. We will analyze the delay performance in multi-hop wireless networks. In the MAC layer the delay estimation is at the lower and upper bounds of the queue using queuing analysis. This paper focuses only a comparison of queuing delay analysis in wireless networks using various well known queuing techniques and also extend to identify the low complexity distributed scheduling algorithm for multi-hop wireless networks.

Keywords


Low Complexity and Distributed Algorithms, Queuing Analysis, Multi-Hop Wireless Networks, Lower and Upper Bounds, Maximal Matching, Queuing Delay.