Centralized Multiple Random Access Protocol with Contention Window Adjustment

In this paper, we propose a new multiple access protocol for the ubiquitous network and analyze its performance in the nonsaturated condition. Based on the concept of equilibrium analysis, we analyze its throughput and the contention window size that maximizes its throughput by constructing a Markov...

Full description

Saved in:
Bibliographic Details
Main Authors: Teruhi, S., Nuno, F., Watanabe, K.
Format: Conference Proceeding
Language:English
Subjects:
Access protocols
Feedback
Laboratories
Multiaccess communication
Performance analysis
Size control
Technological innovation
Telecommunication traffic
Throughput
Traffic control
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 1632
container_issue
container_start_page 1628
container_title
container_volume
creator Teruhi, S.
Nuno, F.
Watanabe, K.
description In this paper, we propose a new multiple access protocol for the ubiquitous network and analyze its performance in the nonsaturated condition. Based on the concept of equilibrium analysis, we analyze its throughput and the contention window size that maximizes its throughput by constructing a Markov model of terminal state. From this work we introduce an index that uniquely decides throughput regardless of the number of terminals or the offered traffic and propose a contention window adjustment algorithm based on the index. Computer simulations that compare the proposed protocol to conventional protocols clarify that the former has superior throughput.
doi_str_mv 10.1109/VETECF.2007.345
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4349994</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4349994</ieee_id><sourcerecordid>4349994</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-c14dee4d34da6b13a97e4c37aee8a9c48582425419b056ab4eca43f25f33481f3</originalsourceid><addsrcrecordid>eNotjEtLAzEURoMPsNauXbjJH5ia5N5MJssytFVoUaTqsmQydzBlHmUmpeivd0BXHxzO-Ri7l2IupbCPH8vdMl_NlRBmDqgv2ERpYxKFqb5kM2syiQpRqBTUFZuMhUhAQHbDbofhIISQMlUTts2pjb2rww-VfHuqYzjWxN9cW3YNX3hPw8Bf-y52vqv5OcQvnndtHJvQtfwzjNqZL8rDaYjNCO_YdeXqgWb_O2Xvq-Uuf0o2L-vnfLFJgjQ6Jl5iSYQlYOnSQoKzhtCDcUSZsx4znSlUGqUthE5dgeQdQqV0BYCZrGDKHv5-AxHtj31oXP-9R0BrLcIvislQdg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Centralized Multiple Random Access Protocol with Contention Window Adjustment</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Teruhi, S. ; Nuno, F. ; Watanabe, K.</creator><creatorcontrib>Teruhi, S. ; Nuno, F. ; Watanabe, K.</creatorcontrib><description>In this paper, we propose a new multiple access protocol for the ubiquitous network and analyze its performance in the nonsaturated condition. Based on the concept of equilibrium analysis, we analyze its throughput and the contention window size that maximizes its throughput by constructing a Markov model of terminal state. From this work we introduce an index that uniquely decides throughput regardless of the number of terminals or the offered traffic and propose a contention window adjustment algorithm based on the index. Computer simulations that compare the proposed protocol to conventional protocols clarify that the former has superior throughput.</description><identifier>ISSN: 1090-3038</identifier><identifier>ISBN: 9781424402632</identifier><identifier>ISBN: 1424402638</identifier><identifier>EISSN: 2577-2465</identifier><identifier>DOI: 10.1109/VETECF.2007.345</identifier><language>eng</language><publisher>IEEE</publisher><subject>Access protocols ; Feedback ; Laboratories ; Multiaccess communication ; Performance analysis ; Size control ; Technological innovation ; Telecommunication traffic ; Throughput ; Traffic control</subject><ispartof>2007 IEEE 66th Vehicular Technology Conference, 2007, p.1628-1632</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4349994$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4349994$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Teruhi, S.</creatorcontrib><creatorcontrib>Nuno, F.</creatorcontrib><creatorcontrib>Watanabe, K.</creatorcontrib><title>Centralized Multiple Random Access Protocol with Contention Window Adjustment</title><title>2007 IEEE 66th Vehicular Technology Conference</title><addtitle>VETECF</addtitle><description>In this paper, we propose a new multiple access protocol for the ubiquitous network and analyze its performance in the nonsaturated condition. Based on the concept of equilibrium analysis, we analyze its throughput and the contention window size that maximizes its throughput by constructing a Markov model of terminal state. From this work we introduce an index that uniquely decides throughput regardless of the number of terminals or the offered traffic and propose a contention window adjustment algorithm based on the index. Computer simulations that compare the proposed protocol to conventional protocols clarify that the former has superior throughput.</description><subject>Access protocols</subject><subject>Feedback</subject><subject>Laboratories</subject><subject>Multiaccess communication</subject><subject>Performance analysis</subject><subject>Size control</subject><subject>Technological innovation</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>Traffic control</subject><issn>1090-3038</issn><issn>2577-2465</issn><isbn>9781424402632</isbn><isbn>1424402638</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjEtLAzEURoMPsNauXbjJH5ia5N5MJssytFVoUaTqsmQydzBlHmUmpeivd0BXHxzO-Ri7l2IupbCPH8vdMl_NlRBmDqgv2ERpYxKFqb5kM2syiQpRqBTUFZuMhUhAQHbDbofhIISQMlUTts2pjb2rww-VfHuqYzjWxN9cW3YNX3hPw8Bf-y52vqv5OcQvnndtHJvQtfwzjNqZL8rDaYjNCO_YdeXqgWb_O2Xvq-Uuf0o2L-vnfLFJgjQ6Jl5iSYQlYOnSQoKzhtCDcUSZsx4znSlUGqUthE5dgeQdQqV0BYCZrGDKHv5-AxHtj31oXP-9R0BrLcIvislQdg</recordid><startdate>200709</startdate><enddate>200709</enddate><creator>Teruhi, S.</creator><creator>Nuno, F.</creator><creator>Watanabe, K.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200709</creationdate><title>Centralized Multiple Random Access Protocol with Contention Window Adjustment</title><author>Teruhi, S. ; Nuno, F. ; Watanabe, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-c14dee4d34da6b13a97e4c37aee8a9c48582425419b056ab4eca43f25f33481f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Access protocols</topic><topic>Feedback</topic><topic>Laboratories</topic><topic>Multiaccess communication</topic><topic>Performance analysis</topic><topic>Size control</topic><topic>Technological innovation</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Teruhi, S.</creatorcontrib><creatorcontrib>Nuno, F.</creatorcontrib><creatorcontrib>Watanabe, K.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Teruhi, S.</au><au>Nuno, F.</au><au>Watanabe, K.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Centralized Multiple Random Access Protocol with Contention Window Adjustment</atitle><btitle>2007 IEEE 66th Vehicular Technology Conference</btitle><stitle>VETECF</stitle><date>2007-09</date><risdate>2007</risdate><spage>1628</spage><epage>1632</epage><pages>1628-1632</pages><issn>1090-3038</issn><eissn>2577-2465</eissn><isbn>9781424402632</isbn><isbn>1424402638</isbn><abstract>In this paper, we propose a new multiple access protocol for the ubiquitous network and analyze its performance in the nonsaturated condition. Based on the concept of equilibrium analysis, we analyze its throughput and the contention window size that maximizes its throughput by constructing a Markov model of terminal state. From this work we introduce an index that uniquely decides throughput regardless of the number of terminals or the offered traffic and propose a contention window adjustment algorithm based on the index. Computer simulations that compare the proposed protocol to conventional protocols clarify that the former has superior throughput.</abstract><pub>IEEE</pub><doi>10.1109/VETECF.2007.345</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1090-3038
ispartof 2007 IEEE 66th Vehicular Technology Conference, 2007, p.1628-1632
issn 1090-3038
2577-2465
language eng
recordid cdi_ieee_primary_4349994
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Access protocols
Feedback
Laboratories
Multiaccess communication
Performance analysis
Size control
Technological innovation
Telecommunication traffic
Throughput
Traffic control
title Centralized Multiple Random Access Protocol with Contention Window Adjustment
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T12%3A57%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Centralized%20Multiple%20Random%20Access%20Protocol%20with%20Contention%20Window%20Adjustment&rft.btitle=2007%20IEEE%2066th%20Vehicular%20Technology%20Conference&rft.au=Teruhi,%20S.&rft.date=2007-09&rft.spage=1628&rft.epage=1632&rft.pages=1628-1632&rft.issn=1090-3038&rft.eissn=2577-2465&rft.isbn=9781424402632&rft.isbn_list=1424402638&rft_id=info:doi/10.1109/VETECF.2007.345&rft_dat=%3Cieee_6IE%3E4349994%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-c14dee4d34da6b13a97e4c37aee8a9c48582425419b056ab4eca43f25f33481f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4349994&rfr_iscdi=true