![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Queuing Delay Analysis in Wireless Networks
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
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 177
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 2