A Distributed Scheduling Algorithm for Underwater Acoustic Networks With Large Propagation Delays
Underwater acoustic (UWA) networks are a key form of communications for human exploration and activities in the oceanographic space of the earth. A fundamental issue of UWA communications is large propagation delays due to water medium, which has posed a grand challenge in UWA network protocol desig...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on communications 2017-03, Vol.65 (3), p.1131-1145 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1145 |
---|---|
container_issue | 3 |
container_start_page | 1131 |
container_title | IEEE transactions on communications |
container_volume | 65 |
creator | Huacheng Zeng Hou, Y. Thomas Yi Shi Wenjing Lou Kompella, Sastry Midkiff, Scott F. |
description | Underwater acoustic (UWA) networks are a key form of communications for human exploration and activities in the oceanographic space of the earth. A fundamental issue of UWA communications is large propagation delays due to water medium, which has posed a grand challenge in UWA network protocol design. Conventional wisdom of addressing this issue is to live with this disadvantage by inserting a guard interval to introduce immunity to propagation delays. Recent advances in interference alignment (IA) open up a new direction to address this issue and promise a great potential to improve network throughput by exploiting large propagation delays. In this paper, we investigate propagation delay-based IA (PD-IA) in multi-hop UWA networks. We first develop a set of simple constraints to characterize PD-IA feasible region at the physical layer. Based on the set of PD-IA constraints, we develop a distributed PD-IA scheduling algorithm to greedily maximize interference overlapping possibilities in a multi-hop UWA network. Simulation results show that the proposed PD-IA algorithm yields higher throughput than an idealized benchmark algorithm without propagation delays, indicating that large propagation delays are not adversarial but beneficial for network throughput performance. |
doi_str_mv | 10.1109/TCOMM.2017.2647940 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_7807335</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7807335</ieee_id><sourcerecordid>2174397710</sourcerecordid><originalsourceid>FETCH-LOGICAL-c339t-c670f57bccbd32d31c55e9fd705ab31c091a83d811fe43b363c503965b6ee7bb3</originalsourceid><addsrcrecordid>eNo9kF1LwzAUQIMoOKd_QF8CPnfeNE3TPo75CZsT3PCxpOlt19k1M0kZ-_d2bvh0uXDOvXAIuWUwYgzSh8VkPpuNQmByFMaRTCM4IwMmRBJAIuQ5GQCkEMRSJpfkyrk1AETA-YCoMX2snbd13nks6KdeYdE1dVvRcVMZW_vVhpbG0mVboN0pj5aOtemcrzV9R78z9tvRrx6jU2UrpB_WbFWlfG1a-oiN2rtrclGqxuHNaQ7J8vlpMXkNpvOXt8l4GmjOUx_oWEIpZK51XvCw4EwLgWlZSBAq7zdImUp4kTBWYsRzHnMtgKexyGNEmed8SO6Pd7fW_HTofLY2nW37l1nIZMRTKRn0VHiktDXOWSyzra03yu4zBtkhZfaXMjukzE4pe-nuKNWI-C_IBCTngv8C--pw3w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174397710</pqid></control><display><type>article</type><title>A Distributed Scheduling Algorithm for Underwater Acoustic Networks With Large Propagation Delays</title><source>IEEE Electronic Library (IEL)</source><creator>Huacheng Zeng ; Hou, Y. Thomas ; Yi Shi ; Wenjing Lou ; Kompella, Sastry ; Midkiff, Scott F.</creator><creatorcontrib>Huacheng Zeng ; Hou, Y. Thomas ; Yi Shi ; Wenjing Lou ; Kompella, Sastry ; Midkiff, Scott F.</creatorcontrib><description>Underwater acoustic (UWA) networks are a key form of communications for human exploration and activities in the oceanographic space of the earth. A fundamental issue of UWA communications is large propagation delays due to water medium, which has posed a grand challenge in UWA network protocol design. Conventional wisdom of addressing this issue is to live with this disadvantage by inserting a guard interval to introduce immunity to propagation delays. Recent advances in interference alignment (IA) open up a new direction to address this issue and promise a great potential to improve network throughput by exploiting large propagation delays. In this paper, we investigate propagation delay-based IA (PD-IA) in multi-hop UWA networks. We first develop a set of simple constraints to characterize PD-IA feasible region at the physical layer. Based on the set of PD-IA constraints, we develop a distributed PD-IA scheduling algorithm to greedily maximize interference overlapping possibilities in a multi-hop UWA network. Simulation results show that the proposed PD-IA algorithm yields higher throughput than an idealized benchmark algorithm without propagation delays, indicating that large propagation delays are not adversarial but beneficial for network throughput performance.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2017.2647940</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Acoustic propagation ; Algorithms ; Computer simulation ; distributed scheduling algorithm ; Immunity ; Interference ; interference alignment ; large propagation delays ; Networks ; Payloads ; Propagation ; Propagation delay ; Receivers ; Scheduling ; Servers ; Spread spectrum communication ; Throughput ; Transmitters ; Underwater acoustic networks ; Underwater acoustics</subject><ispartof>IEEE transactions on communications, 2017-03, Vol.65 (3), p.1131-1145</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c339t-c670f57bccbd32d31c55e9fd705ab31c091a83d811fe43b363c503965b6ee7bb3</citedby><cites>FETCH-LOGICAL-c339t-c670f57bccbd32d31c55e9fd705ab31c091a83d811fe43b363c503965b6ee7bb3</cites><orcidid>0000-0002-3272-5239</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7807335$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7807335$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Huacheng Zeng</creatorcontrib><creatorcontrib>Hou, Y. Thomas</creatorcontrib><creatorcontrib>Yi Shi</creatorcontrib><creatorcontrib>Wenjing Lou</creatorcontrib><creatorcontrib>Kompella, Sastry</creatorcontrib><creatorcontrib>Midkiff, Scott F.</creatorcontrib><title>A Distributed Scheduling Algorithm for Underwater Acoustic Networks With Large Propagation Delays</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>Underwater acoustic (UWA) networks are a key form of communications for human exploration and activities in the oceanographic space of the earth. A fundamental issue of UWA communications is large propagation delays due to water medium, which has posed a grand challenge in UWA network protocol design. Conventional wisdom of addressing this issue is to live with this disadvantage by inserting a guard interval to introduce immunity to propagation delays. Recent advances in interference alignment (IA) open up a new direction to address this issue and promise a great potential to improve network throughput by exploiting large propagation delays. In this paper, we investigate propagation delay-based IA (PD-IA) in multi-hop UWA networks. We first develop a set of simple constraints to characterize PD-IA feasible region at the physical layer. Based on the set of PD-IA constraints, we develop a distributed PD-IA scheduling algorithm to greedily maximize interference overlapping possibilities in a multi-hop UWA network. Simulation results show that the proposed PD-IA algorithm yields higher throughput than an idealized benchmark algorithm without propagation delays, indicating that large propagation delays are not adversarial but beneficial for network throughput performance.</description><subject>Acoustic propagation</subject><subject>Algorithms</subject><subject>Computer simulation</subject><subject>distributed scheduling algorithm</subject><subject>Immunity</subject><subject>Interference</subject><subject>interference alignment</subject><subject>large propagation delays</subject><subject>Networks</subject><subject>Payloads</subject><subject>Propagation</subject><subject>Propagation delay</subject><subject>Receivers</subject><subject>Scheduling</subject><subject>Servers</subject><subject>Spread spectrum communication</subject><subject>Throughput</subject><subject>Transmitters</subject><subject>Underwater acoustic networks</subject><subject>Underwater acoustics</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kF1LwzAUQIMoOKd_QF8CPnfeNE3TPo75CZsT3PCxpOlt19k1M0kZ-_d2bvh0uXDOvXAIuWUwYgzSh8VkPpuNQmByFMaRTCM4IwMmRBJAIuQ5GQCkEMRSJpfkyrk1AETA-YCoMX2snbd13nks6KdeYdE1dVvRcVMZW_vVhpbG0mVboN0pj5aOtemcrzV9R78z9tvRrx6jU2UrpB_WbFWlfG1a-oiN2rtrclGqxuHNaQ7J8vlpMXkNpvOXt8l4GmjOUx_oWEIpZK51XvCw4EwLgWlZSBAq7zdImUp4kTBWYsRzHnMtgKexyGNEmed8SO6Pd7fW_HTofLY2nW37l1nIZMRTKRn0VHiktDXOWSyzra03yu4zBtkhZfaXMjukzE4pe-nuKNWI-C_IBCTngv8C--pw3w</recordid><startdate>20170301</startdate><enddate>20170301</enddate><creator>Huacheng Zeng</creator><creator>Hou, Y. Thomas</creator><creator>Yi Shi</creator><creator>Wenjing Lou</creator><creator>Kompella, Sastry</creator><creator>Midkiff, Scott F.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-3272-5239</orcidid></search><sort><creationdate>20170301</creationdate><title>A Distributed Scheduling Algorithm for Underwater Acoustic Networks With Large Propagation Delays</title><author>Huacheng Zeng ; Hou, Y. Thomas ; Yi Shi ; Wenjing Lou ; Kompella, Sastry ; Midkiff, Scott F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c339t-c670f57bccbd32d31c55e9fd705ab31c091a83d811fe43b363c503965b6ee7bb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Acoustic propagation</topic><topic>Algorithms</topic><topic>Computer simulation</topic><topic>distributed scheduling algorithm</topic><topic>Immunity</topic><topic>Interference</topic><topic>interference alignment</topic><topic>large propagation delays</topic><topic>Networks</topic><topic>Payloads</topic><topic>Propagation</topic><topic>Propagation delay</topic><topic>Receivers</topic><topic>Scheduling</topic><topic>Servers</topic><topic>Spread spectrum communication</topic><topic>Throughput</topic><topic>Transmitters</topic><topic>Underwater acoustic networks</topic><topic>Underwater acoustics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huacheng Zeng</creatorcontrib><creatorcontrib>Hou, Y. Thomas</creatorcontrib><creatorcontrib>Yi Shi</creatorcontrib><creatorcontrib>Wenjing Lou</creatorcontrib><creatorcontrib>Kompella, Sastry</creatorcontrib><creatorcontrib>Midkiff, Scott F.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Huacheng Zeng</au><au>Hou, Y. Thomas</au><au>Yi Shi</au><au>Wenjing Lou</au><au>Kompella, Sastry</au><au>Midkiff, Scott F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Distributed Scheduling Algorithm for Underwater Acoustic Networks With Large Propagation Delays</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2017-03-01</date><risdate>2017</risdate><volume>65</volume><issue>3</issue><spage>1131</spage><epage>1145</epage><pages>1131-1145</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>Underwater acoustic (UWA) networks are a key form of communications for human exploration and activities in the oceanographic space of the earth. A fundamental issue of UWA communications is large propagation delays due to water medium, which has posed a grand challenge in UWA network protocol design. Conventional wisdom of addressing this issue is to live with this disadvantage by inserting a guard interval to introduce immunity to propagation delays. Recent advances in interference alignment (IA) open up a new direction to address this issue and promise a great potential to improve network throughput by exploiting large propagation delays. In this paper, we investigate propagation delay-based IA (PD-IA) in multi-hop UWA networks. We first develop a set of simple constraints to characterize PD-IA feasible region at the physical layer. Based on the set of PD-IA constraints, we develop a distributed PD-IA scheduling algorithm to greedily maximize interference overlapping possibilities in a multi-hop UWA network. Simulation results show that the proposed PD-IA algorithm yields higher throughput than an idealized benchmark algorithm without propagation delays, indicating that large propagation delays are not adversarial but beneficial for network throughput performance.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2017.2647940</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0002-3272-5239</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0090-6778 |
ispartof | IEEE transactions on communications, 2017-03, Vol.65 (3), p.1131-1145 |
issn | 0090-6778 1558-0857 |
language | eng |
recordid | cdi_ieee_primary_7807335 |
source | IEEE Electronic Library (IEL) |
subjects | Acoustic propagation Algorithms Computer simulation distributed scheduling algorithm Immunity Interference interference alignment large propagation delays Networks Payloads Propagation Propagation delay Receivers Scheduling Servers Spread spectrum communication Throughput Transmitters Underwater acoustic networks Underwater acoustics |
title | A Distributed Scheduling Algorithm for Underwater Acoustic Networks With Large Propagation Delays |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T06%3A13%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Distributed%20Scheduling%20Algorithm%20for%20Underwater%20Acoustic%20Networks%20With%20Large%20Propagation%20Delays&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Huacheng%20Zeng&rft.date=2017-03-01&rft.volume=65&rft.issue=3&rft.spage=1131&rft.epage=1145&rft.pages=1131-1145&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2017.2647940&rft_dat=%3Cproquest_RIE%3E2174397710%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2174397710&rft_id=info:pmid/&rft_ieee_id=7807335&rfr_iscdi=true |