A code allocation protocol for maximizing throughput in CDMA based ad hoc networks

A code allocation protocol for maximizing throughput in CDMA based ad hoc networks

We consider here the problem of allocating variable length orthogonal codes in an ad hoc network based on CDMA. We consider a snapshot version of the problem at some instant. It had been proved earlier than even for a static set of communications and topology the problem is intractable. A greedy alg...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Srivastava, S., Tripathi, S., Sanghi, D., Chaturvedi, A.K.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Access protocols
Ad hoc networks
Bandwidth
Greedy algorithms
Intelligent networks
Interference
Multiaccess communication
Network topology
Throughput
Transmitters
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1390 vol.2
container_issue
container_start_page 1385
container_title
container_volume 2
creator Srivastava, S.
Tripathi, S.
Sanghi, D.
Chaturvedi, A.K.
description We consider here the problem of allocating variable length orthogonal codes in an ad hoc network based on CDMA. We consider a snapshot version of the problem at some instant. It had been proved earlier than even for a static set of communications and topology the problem is intractable. A greedy algorithm is stated to provide a bounded approximation to the throughput maximizing optimal allocation. We present a simple distributed code allocation protocol based on the greedy approximation. Simulation experiments show the enhanced throughput obtained by our protocol as compared to other code allocation schemes.
doi_str_mv 10.1109/WCNC.2003.1200576
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1200576</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1200576</ieee_id><sourcerecordid>1200576</sourcerecordid><originalsourceid>FETCH-LOGICAL-i218t-891089cc3670f44b25ec0b98a56c80c9bb7d07bd1b9760fd055f4facab548c873</originalsourceid><addsrcrecordid>eNotkMlOwzAURS0GibbwAYiNfyDhPSeOnWUUKCAVkBCIZeUpjSGJKycVw9cDopt7Fkc6i0vIOUKKCOXla_1QpwwgS_F3uSgOyAw5lwkrkB2SOQgJmRAAePQnGE8yjnhC5uP4BsCA5_mMPFXUBOuo6rpg1OTDQLcxTMGEjjYh0l59-t5_-2FDpzaG3abd7ibqB1pf3VdUq9FZqixtg6GDmz5CfB9PyXGjutGd7bkgL8vr5_o2WT3e3NXVKvEM5ZTIEkGWxmSFgCbPNePOgC6l4oWRYEqthQWhLepSFNBY4LzJG2WU5rk0UmQLcvHf9c659Tb6XsWv9f6L7Ac-j1D-</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A code allocation protocol for maximizing throughput in CDMA based ad hoc networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Srivastava, S. ; Tripathi, S. ; Sanghi, D. ; Chaturvedi, A.K.</creator><creatorcontrib>Srivastava, S. ; Tripathi, S. ; Sanghi, D. ; Chaturvedi, A.K.</creatorcontrib><description>We consider here the problem of allocating variable length orthogonal codes in an ad hoc network based on CDMA. We consider a snapshot version of the problem at some instant. It had been proved earlier than even for a static set of communications and topology the problem is intractable. A greedy algorithm is stated to provide a bounded approximation to the throughput maximizing optimal allocation. We present a simple distributed code allocation protocol based on the greedy approximation. Simulation experiments show the enhanced throughput obtained by our protocol as compared to other code allocation schemes.</description><identifier>ISSN: 1525-3511</identifier><identifier>ISBN: 0780377001</identifier><identifier>ISBN: 9780780377004</identifier><identifier>EISSN: 1558-2612</identifier><identifier>DOI: 10.1109/WCNC.2003.1200576</identifier><language>eng</language><publisher>IEEE</publisher><subject>Access protocols ; Ad hoc networks ; Bandwidth ; Greedy algorithms ; Intelligent networks ; Interference ; Multiaccess communication ; Network topology ; Throughput ; Transmitters</subject><ispartof>2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003, 2003, Vol.2, p.1385-1390 vol.2</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1200576$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1200576$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Srivastava, S.</creatorcontrib><creatorcontrib>Tripathi, S.</creatorcontrib><creatorcontrib>Sanghi, D.</creatorcontrib><creatorcontrib>Chaturvedi, A.K.</creatorcontrib><title>A code allocation protocol for maximizing throughput in CDMA based ad hoc networks</title><title>2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003</title><addtitle>WCNC</addtitle><description>We consider here the problem of allocating variable length orthogonal codes in an ad hoc network based on CDMA. We consider a snapshot version of the problem at some instant. It had been proved earlier than even for a static set of communications and topology the problem is intractable. A greedy algorithm is stated to provide a bounded approximation to the throughput maximizing optimal allocation. We present a simple distributed code allocation protocol based on the greedy approximation. Simulation experiments show the enhanced throughput obtained by our protocol as compared to other code allocation schemes.</description><subject>Access protocols</subject><subject>Ad hoc networks</subject><subject>Bandwidth</subject><subject>Greedy algorithms</subject><subject>Intelligent networks</subject><subject>Interference</subject><subject>Multiaccess communication</subject><subject>Network topology</subject><subject>Throughput</subject><subject>Transmitters</subject><issn>1525-3511</issn><issn>1558-2612</issn><isbn>0780377001</isbn><isbn>9780780377004</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkMlOwzAURS0GibbwAYiNfyDhPSeOnWUUKCAVkBCIZeUpjSGJKycVw9cDopt7Fkc6i0vIOUKKCOXla_1QpwwgS_F3uSgOyAw5lwkrkB2SOQgJmRAAePQnGE8yjnhC5uP4BsCA5_mMPFXUBOuo6rpg1OTDQLcxTMGEjjYh0l59-t5_-2FDpzaG3abd7ibqB1pf3VdUq9FZqixtg6GDmz5CfB9PyXGjutGd7bkgL8vr5_o2WT3e3NXVKvEM5ZTIEkGWxmSFgCbPNePOgC6l4oWRYEqthQWhLepSFNBY4LzJG2WU5rk0UmQLcvHf9c659Tb6XsWv9f6L7Ac-j1D-</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Srivastava, S.</creator><creator>Tripathi, S.</creator><creator>Sanghi, D.</creator><creator>Chaturvedi, A.K.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2003</creationdate><title>A code allocation protocol for maximizing throughput in CDMA based ad hoc networks</title><author>Srivastava, S. ; Tripathi, S. ; Sanghi, D. ; Chaturvedi, A.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i218t-891089cc3670f44b25ec0b98a56c80c9bb7d07bd1b9760fd055f4facab548c873</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Access protocols</topic><topic>Ad hoc networks</topic><topic>Bandwidth</topic><topic>Greedy algorithms</topic><topic>Intelligent networks</topic><topic>Interference</topic><topic>Multiaccess communication</topic><topic>Network topology</topic><topic>Throughput</topic><topic>Transmitters</topic><toplevel>online_resources</toplevel><creatorcontrib>Srivastava, S.</creatorcontrib><creatorcontrib>Tripathi, S.</creatorcontrib><creatorcontrib>Sanghi, D.</creatorcontrib><creatorcontrib>Chaturvedi, A.K.</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>Srivastava, S.</au><au>Tripathi, S.</au><au>Sanghi, D.</au><au>Chaturvedi, A.K.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A code allocation protocol for maximizing throughput in CDMA based ad hoc networks</atitle><btitle>2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003</btitle><stitle>WCNC</stitle><date>2003</date><risdate>2003</risdate><volume>2</volume><spage>1385</spage><epage>1390 vol.2</epage><pages>1385-1390 vol.2</pages><issn>1525-3511</issn><eissn>1558-2612</eissn><isbn>0780377001</isbn><isbn>9780780377004</isbn><abstract>We consider here the problem of allocating variable length orthogonal codes in an ad hoc network based on CDMA. We consider a snapshot version of the problem at some instant. It had been proved earlier than even for a static set of communications and topology the problem is intractable. A greedy algorithm is stated to provide a bounded approximation to the throughput maximizing optimal allocation. We present a simple distributed code allocation protocol based on the greedy approximation. Simulation experiments show the enhanced throughput obtained by our protocol as compared to other code allocation schemes.</abstract><pub>IEEE</pub><doi>10.1109/WCNC.2003.1200576</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1525-3511
ispartof 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003, 2003, Vol.2, p.1385-1390 vol.2
issn 1525-3511
1558-2612
language eng
recordid cdi_ieee_primary_1200576
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Access protocols
Ad hoc networks
Bandwidth
Greedy algorithms
Intelligent networks
Interference
Multiaccess communication
Network topology
Throughput
Transmitters
title A code allocation protocol for maximizing throughput in CDMA based ad hoc 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-12T08%3A42%3A31IST&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=A%20code%20allocation%20protocol%20for%20maximizing%20throughput%20in%20CDMA%20based%20ad%20hoc%20networks&rft.btitle=2003%20IEEE%20Wireless%20Communications%20and%20Networking,%202003.%20WCNC%202003&rft.au=Srivastava,%20S.&rft.date=2003&rft.volume=2&rft.spage=1385&rft.epage=1390%20vol.2&rft.pages=1385-1390%20vol.2&rft.issn=1525-3511&rft.eissn=1558-2612&rft.isbn=0780377001&rft.isbn_list=9780780377004&rft_id=info:doi/10.1109/WCNC.2003.1200576&rft_dat=%3Cieee_6IE%3E1200576%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=1200576&rfr_iscdi=true