Multi-hop Congestion Control Algorithm in Mobile Wireless Networks

Multi-hop Congestion Control Algorithm in Mobile Wireless Networks

This paper focuses on the congestion control problem on a multi-hop path in mobile wireless networks. Conventional congestion control algorithms do not consider highly mobile devices in a network where link status changes frequently. The assumption of link validity in proactive algorithms results in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sahraei, S., Grigoras, D.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
backpressure
Communication system control
Computer science
congestion
Distributed computing
Educational institutions
Feedback
Mobile ad hoc networks
Mobile computing
Monitoring
Spread spectrum communication
Throughput
Wireless networks
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 28
container_issue
container_start_page 21
container_title
container_volume
creator Sahraei, S.
Grigoras, D.
description This paper focuses on the congestion control problem on a multi-hop path in mobile wireless networks. Conventional congestion control algorithms do not consider highly mobile devices in a network where link status changes frequently. The assumption of link validity in proactive algorithms results in high network overhead. In this paper, a new on-demand method of congestion control in multi-hop communication within a wireless network is proposed. The basic idea is to monitor each node's backpressure and identify the flooded links. Then it provides means for optimization of the congested link and regulation of the data rate at the source of network congestion. The main results are an increase of the overall network throughput and the possibility of co-existence for nodes with different rates. This algorithm is particularly important in urban settings characterized by a high density of mobile devices.
doi_str_mv 10.1109/ISPDC.2009.30
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5284374</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5284374</ieee_id><sourcerecordid>5284374</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-3e146138e5f7ee60617c1b28dc9ad52ec226c23065048fc789d918d3724988483</originalsourceid><addsrcrecordid>eNotjM1OAjEURpsoiYAsXbnpCwze_rdLHEVJQE3UuCTDzB2oDlPS1hjfXol-m3MWJx8hFwymjIG7Wjw_3ZRTDuCmAk7ICIx2SmgL9pQMuTCuUELxARkdEwfCWHNGJim9w--0dlLDkFyvPrvsi1040DL0W0zZh_6oOYaOzrptiD7v9tT3dBU2vkP65iN2mBJ9wPwV4kc6J4O26hJO_jkmr_Pbl_K-WD7eLcrZsvDMqFwIZFIzYVG1BlGDZqZmG26b2lWN4lhzrmsuQCuQtq2NdY1jthGGS2ettGJMLv9-PSKuD9Hvq_i9VtxKYaT4AeVwSq4</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Multi-hop Congestion Control Algorithm in Mobile Wireless Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Sahraei, S. ; Grigoras, D.</creator><creatorcontrib>Sahraei, S. ; Grigoras, D.</creatorcontrib><description>This paper focuses on the congestion control problem on a multi-hop path in mobile wireless networks. Conventional congestion control algorithms do not consider highly mobile devices in a network where link status changes frequently. The assumption of link validity in proactive algorithms results in high network overhead. In this paper, a new on-demand method of congestion control in multi-hop communication within a wireless network is proposed. The basic idea is to monitor each node's backpressure and identify the flooded links. Then it provides means for optimization of the congested link and regulation of the data rate at the source of network congestion. The main results are an increase of the overall network throughput and the possibility of co-existence for nodes with different rates. This algorithm is particularly important in urban settings characterized by a high density of mobile devices.</description><identifier>ISSN: 2379-5352</identifier><identifier>ISBN: 0769536808</identifier><identifier>ISBN: 9780769536804</identifier><identifier>DOI: 10.1109/ISPDC.2009.30</identifier><identifier>LCCN: 2009903787</identifier><language>eng</language><publisher>IEEE</publisher><subject>backpressure ; Communication system control ; Computer science ; congestion ; Distributed computing ; Educational institutions ; Feedback ; Mobile ad hoc networks ; Mobile computing ; Monitoring ; Spread spectrum communication ; Throughput ; Wireless networks</subject><ispartof>2009 Eighth International Symposium on Parallel and Distributed Computing, 2009, p.21-28</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/5284374$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5284374$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sahraei, S.</creatorcontrib><creatorcontrib>Grigoras, D.</creatorcontrib><title>Multi-hop Congestion Control Algorithm in Mobile Wireless Networks</title><title>2009 Eighth International Symposium on Parallel and Distributed Computing</title><addtitle>ISPDC</addtitle><description>This paper focuses on the congestion control problem on a multi-hop path in mobile wireless networks. Conventional congestion control algorithms do not consider highly mobile devices in a network where link status changes frequently. The assumption of link validity in proactive algorithms results in high network overhead. In this paper, a new on-demand method of congestion control in multi-hop communication within a wireless network is proposed. The basic idea is to monitor each node's backpressure and identify the flooded links. Then it provides means for optimization of the congested link and regulation of the data rate at the source of network congestion. The main results are an increase of the overall network throughput and the possibility of co-existence for nodes with different rates. This algorithm is particularly important in urban settings characterized by a high density of mobile devices.</description><subject>backpressure</subject><subject>Communication system control</subject><subject>Computer science</subject><subject>congestion</subject><subject>Distributed computing</subject><subject>Educational institutions</subject><subject>Feedback</subject><subject>Mobile ad hoc networks</subject><subject>Mobile computing</subject><subject>Monitoring</subject><subject>Spread spectrum communication</subject><subject>Throughput</subject><subject>Wireless networks</subject><issn>2379-5352</issn><isbn>0769536808</isbn><isbn>9780769536804</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjM1OAjEURpsoiYAsXbnpCwze_rdLHEVJQE3UuCTDzB2oDlPS1hjfXol-m3MWJx8hFwymjIG7Wjw_3ZRTDuCmAk7ICIx2SmgL9pQMuTCuUELxARkdEwfCWHNGJim9w--0dlLDkFyvPrvsi1040DL0W0zZh_6oOYaOzrptiD7v9tT3dBU2vkP65iN2mBJ9wPwV4kc6J4O26hJO_jkmr_Pbl_K-WD7eLcrZsvDMqFwIZFIzYVG1BlGDZqZmG26b2lWN4lhzrmsuQCuQtq2NdY1jthGGS2ettGJMLv9-PSKuD9Hvq_i9VtxKYaT4AeVwSq4</recordid><startdate>200906</startdate><enddate>200906</enddate><creator>Sahraei, S.</creator><creator>Grigoras, D.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200906</creationdate><title>Multi-hop Congestion Control Algorithm in Mobile Wireless Networks</title><author>Sahraei, S. ; Grigoras, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-3e146138e5f7ee60617c1b28dc9ad52ec226c23065048fc789d918d3724988483</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>backpressure</topic><topic>Communication system control</topic><topic>Computer science</topic><topic>congestion</topic><topic>Distributed computing</topic><topic>Educational institutions</topic><topic>Feedback</topic><topic>Mobile ad hoc networks</topic><topic>Mobile computing</topic><topic>Monitoring</topic><topic>Spread spectrum communication</topic><topic>Throughput</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Sahraei, S.</creatorcontrib><creatorcontrib>Grigoras, D.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sahraei, S.</au><au>Grigoras, D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Multi-hop Congestion Control Algorithm in Mobile Wireless Networks</atitle><btitle>2009 Eighth International Symposium on Parallel and Distributed Computing</btitle><stitle>ISPDC</stitle><date>2009-06</date><risdate>2009</risdate><spage>21</spage><epage>28</epage><pages>21-28</pages><issn>2379-5352</issn><isbn>0769536808</isbn><isbn>9780769536804</isbn><abstract>This paper focuses on the congestion control problem on a multi-hop path in mobile wireless networks. Conventional congestion control algorithms do not consider highly mobile devices in a network where link status changes frequently. The assumption of link validity in proactive algorithms results in high network overhead. In this paper, a new on-demand method of congestion control in multi-hop communication within a wireless network is proposed. The basic idea is to monitor each node's backpressure and identify the flooded links. Then it provides means for optimization of the congested link and regulation of the data rate at the source of network congestion. The main results are an increase of the overall network throughput and the possibility of co-existence for nodes with different rates. This algorithm is particularly important in urban settings characterized by a high density of mobile devices.</abstract><pub>IEEE</pub><doi>10.1109/ISPDC.2009.30</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2379-5352
ispartof 2009 Eighth International Symposium on Parallel and Distributed Computing, 2009, p.21-28
issn 2379-5352
language eng
recordid cdi_ieee_primary_5284374
source IEEE Electronic Library (IEL) Conference Proceedings
subjects backpressure
Communication system control
Computer science
congestion
Distributed computing
Educational institutions
Feedback
Mobile ad hoc networks
Mobile computing
Monitoring
Spread spectrum communication
Throughput
Wireless networks
title Multi-hop Congestion Control Algorithm in Mobile Wireless Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T12%3A36%3A15IST&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=Multi-hop%20Congestion%20Control%20Algorithm%20in%20Mobile%20Wireless%20Networks&rft.btitle=2009%20Eighth%20International%20Symposium%20on%20Parallel%20and%20Distributed%20Computing&rft.au=Sahraei,%20S.&rft.date=2009-06&rft.spage=21&rft.epage=28&rft.pages=21-28&rft.issn=2379-5352&rft.isbn=0769536808&rft.isbn_list=9780769536804&rft_id=info:doi/10.1109/ISPDC.2009.30&rft_dat=%3Cieee_6IE%3E5284374%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5284374&rfr_iscdi=true