A Bi-Scheduler Algorithm for Frame Aggregation In IEEE 802.11N
IEEE 802.11n mainly aims to provide high throughput, reliability and good security over its other previous standards. The performance of 802.11n is very effective on the saturated traffic through the use of frame aggregation. But this frame aggregation will not effectively function in all scenarios....
Gespeichert in:
Veröffentlicht in: | International journal of wireless & mobile networks 2013-12, Vol.5 (6), p.91-99 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 99 |
---|---|
container_issue | 6 |
container_start_page | 91 |
container_title | International journal of wireless & mobile networks |
container_volume | 5 |
creator | Ramaswamy, Vanaja Sivarasu, Abinaya Sridharan, Bharghavi Venkatesh, Hamsalekha |
description | IEEE 802.11n mainly aims to provide high throughput, reliability and good security over its other previous standards. The performance of 802.11n is very effective on the saturated traffic through the use of frame aggregation. But this frame aggregation will not effectively function in all scenarios. The main objective of this article is to improve the throughput of the wireless LAN through effective frame aggregation using scheduler mechanism. The Bi-Scheduler algorithm proposed in this article aims to segregate frames based on their access categories. The outer scheduler separates delay sensitive applications from the incoming burst of multi-part data, and also decides whether to apply Aggregated - MAC Service Data Unit aggregation technique or to send the data without any aggregation. The inner scheduler schedules the remaining (delay-insensitive, background and best-effort) packets using Aggregated-MAC Protocol Data unit aggregation technique. |
doi_str_mv | 10.5121/ijwmn.2013.5607 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671489084</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1671489084</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1607-3cac5a2ce1d26ac36240e845a8643dc357b214fe5324a160bb375d7adaccaefa3</originalsourceid><addsrcrecordid>eNotkM1Lw0AUxBdRsNSeve7RS9L93u1FiCXVQtGDel5eNpt0JWnqbov435vawsDMYebx-CF0T0kuKaPz8PXT73JGKM-lIvoKTchCy4wbLq4vWSi9uEWzlEJFiDRUccYm6LHATyF7d1tfHzsfcdG1QwyHbY-bIeJVhN7jom2jb-EQhh1ejyrLEhvCckpf79BNA13ys4tP0eeq_Fi-ZJu35_Wy2GSOju9k3IGTwJynNVPguGKCeCMkGCV47bjUFaOi8ZIzAeOiqriWtYYanAPfAJ-ih_PdfRy-jz4dbB-S810HOz8ck6VKU2EWxIixOj9XXRxSir6x-xh6iL-WEnuCZf9h2RMse4LF_wDPt1sg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671489084</pqid></control><display><type>article</type><title>A Bi-Scheduler Algorithm for Frame Aggregation In IEEE 802.11N</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Ramaswamy, Vanaja ; Sivarasu, Abinaya ; Sridharan, Bharghavi ; Venkatesh, Hamsalekha</creator><creatorcontrib>Ramaswamy, Vanaja ; Sivarasu, Abinaya ; Sridharan, Bharghavi ; Venkatesh, Hamsalekha</creatorcontrib><description>IEEE 802.11n mainly aims to provide high throughput, reliability and good security over its other previous standards. The performance of 802.11n is very effective on the saturated traffic through the use of frame aggregation. But this frame aggregation will not effectively function in all scenarios. The main objective of this article is to improve the throughput of the wireless LAN through effective frame aggregation using scheduler mechanism. The Bi-Scheduler algorithm proposed in this article aims to segregate frames based on their access categories. The outer scheduler separates delay sensitive applications from the incoming burst of multi-part data, and also decides whether to apply Aggregated - MAC Service Data Unit aggregation technique or to send the data without any aggregation. The inner scheduler schedules the remaining (delay-insensitive, background and best-effort) packets using Aggregated-MAC Protocol Data unit aggregation technique.</description><identifier>ISSN: 0975-4679</identifier><identifier>EISSN: 0975-3834</identifier><identifier>DOI: 10.5121/ijwmn.2013.5607</identifier><language>eng</language><subject>Agglomeration ; Algorithms ; Bursting ; Categories ; Delay ; Frames ; Schedules</subject><ispartof>International journal of wireless & mobile networks, 2013-12, Vol.5 (6), p.91-99</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1607-3cac5a2ce1d26ac36240e845a8643dc357b214fe5324a160bb375d7adaccaefa3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Ramaswamy, Vanaja</creatorcontrib><creatorcontrib>Sivarasu, Abinaya</creatorcontrib><creatorcontrib>Sridharan, Bharghavi</creatorcontrib><creatorcontrib>Venkatesh, Hamsalekha</creatorcontrib><title>A Bi-Scheduler Algorithm for Frame Aggregation In IEEE 802.11N</title><title>International journal of wireless & mobile networks</title><description>IEEE 802.11n mainly aims to provide high throughput, reliability and good security over its other previous standards. The performance of 802.11n is very effective on the saturated traffic through the use of frame aggregation. But this frame aggregation will not effectively function in all scenarios. The main objective of this article is to improve the throughput of the wireless LAN through effective frame aggregation using scheduler mechanism. The Bi-Scheduler algorithm proposed in this article aims to segregate frames based on their access categories. The outer scheduler separates delay sensitive applications from the incoming burst of multi-part data, and also decides whether to apply Aggregated - MAC Service Data Unit aggregation technique or to send the data without any aggregation. The inner scheduler schedules the remaining (delay-insensitive, background and best-effort) packets using Aggregated-MAC Protocol Data unit aggregation technique.</description><subject>Agglomeration</subject><subject>Algorithms</subject><subject>Bursting</subject><subject>Categories</subject><subject>Delay</subject><subject>Frames</subject><subject>Schedules</subject><issn>0975-4679</issn><issn>0975-3834</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNotkM1Lw0AUxBdRsNSeve7RS9L93u1FiCXVQtGDel5eNpt0JWnqbov435vawsDMYebx-CF0T0kuKaPz8PXT73JGKM-lIvoKTchCy4wbLq4vWSi9uEWzlEJFiDRUccYm6LHATyF7d1tfHzsfcdG1QwyHbY-bIeJVhN7jom2jb-EQhh1ejyrLEhvCckpf79BNA13ys4tP0eeq_Fi-ZJu35_Wy2GSOju9k3IGTwJynNVPguGKCeCMkGCV47bjUFaOi8ZIzAeOiqriWtYYanAPfAJ-ih_PdfRy-jz4dbB-S810HOz8ck6VKU2EWxIixOj9XXRxSir6x-xh6iL-WEnuCZf9h2RMse4LF_wDPt1sg</recordid><startdate>20131231</startdate><enddate>20131231</enddate><creator>Ramaswamy, Vanaja</creator><creator>Sivarasu, Abinaya</creator><creator>Sridharan, Bharghavi</creator><creator>Venkatesh, Hamsalekha</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20131231</creationdate><title>A Bi-Scheduler Algorithm for Frame Aggregation In IEEE 802.11N</title><author>Ramaswamy, Vanaja ; Sivarasu, Abinaya ; Sridharan, Bharghavi ; Venkatesh, Hamsalekha</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1607-3cac5a2ce1d26ac36240e845a8643dc357b214fe5324a160bb375d7adaccaefa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Agglomeration</topic><topic>Algorithms</topic><topic>Bursting</topic><topic>Categories</topic><topic>Delay</topic><topic>Frames</topic><topic>Schedules</topic><toplevel>online_resources</toplevel><creatorcontrib>Ramaswamy, Vanaja</creatorcontrib><creatorcontrib>Sivarasu, Abinaya</creatorcontrib><creatorcontrib>Sridharan, Bharghavi</creatorcontrib><creatorcontrib>Venkatesh, Hamsalekha</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of wireless & mobile networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ramaswamy, Vanaja</au><au>Sivarasu, Abinaya</au><au>Sridharan, Bharghavi</au><au>Venkatesh, Hamsalekha</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Bi-Scheduler Algorithm for Frame Aggregation In IEEE 802.11N</atitle><jtitle>International journal of wireless & mobile networks</jtitle><date>2013-12-31</date><risdate>2013</risdate><volume>5</volume><issue>6</issue><spage>91</spage><epage>99</epage><pages>91-99</pages><issn>0975-4679</issn><eissn>0975-3834</eissn><abstract>IEEE 802.11n mainly aims to provide high throughput, reliability and good security over its other previous standards. The performance of 802.11n is very effective on the saturated traffic through the use of frame aggregation. But this frame aggregation will not effectively function in all scenarios. The main objective of this article is to improve the throughput of the wireless LAN through effective frame aggregation using scheduler mechanism. The Bi-Scheduler algorithm proposed in this article aims to segregate frames based on their access categories. The outer scheduler separates delay sensitive applications from the incoming burst of multi-part data, and also decides whether to apply Aggregated - MAC Service Data Unit aggregation technique or to send the data without any aggregation. The inner scheduler schedules the remaining (delay-insensitive, background and best-effort) packets using Aggregated-MAC Protocol Data unit aggregation technique.</abstract><doi>10.5121/ijwmn.2013.5607</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0975-4679 |
ispartof | International journal of wireless & mobile networks, 2013-12, Vol.5 (6), p.91-99 |
issn | 0975-4679 0975-3834 |
language | eng |
recordid | cdi_proquest_miscellaneous_1671489084 |
source | EZB-FREE-00999 freely available EZB journals |
subjects | Agglomeration Algorithms Bursting Categories Delay Frames Schedules |
title | A Bi-Scheduler Algorithm for Frame Aggregation In IEEE 802.11N |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T22%3A14%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Bi-Scheduler%20Algorithm%20for%20Frame%20Aggregation%20In%20IEEE%20802.11N&rft.jtitle=International%20journal%20of%20wireless%20&%20mobile%20networks&rft.au=Ramaswamy,%20Vanaja&rft.date=2013-12-31&rft.volume=5&rft.issue=6&rft.spage=91&rft.epage=99&rft.pages=91-99&rft.issn=0975-4679&rft.eissn=0975-3834&rft_id=info:doi/10.5121/ijwmn.2013.5607&rft_dat=%3Cproquest_cross%3E1671489084%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1671489084&rft_id=info:pmid/&rfr_iscdi=true |