An Optimization Framework for Demand-based Fair Stream Allocation in MIMO Ad Hoc Networks View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2009-08

AUTHORS

Suraj K. Jaiswal, Aura Ganz, Ramgopal Mettu

ABSTRACT

In this paper, we investigate the problem of scheduling flows for fair stream allocation (or, stream scheduling) in ad hoc networks in which the transmitter and receiver use multiple antennas called Multiple Input Multiple Output (MIMO) technology. Our main contributions include: i) the concept of stream allocation to flows based on their traffic demands or class, ii) stream allocation to flows in the network utilizing single user or multiuser MIMO communication, iii) achieving the proportional fairness of the stream allocation in the minimum possible schedule length, and iv) performance comparison of the stream scheduling in the network for single user and multiuser communication and the tradeoff involved therein. We first formulate demand-based fair stream allocation as an integer linear programming (ILP) problem whose solution is a schedule that is guaranteed to be contention-free. We then solve this ILP in conjunction with binary search to find a minimum length contention-free schedule that achieves the fairness goals. We show that an implementation of our algorithm for a number of sample topologies in fact yields minimum length schedules that achieve the fairness goals. We then give performance comparison results that show the benefit of multiuser MIMO links over single user links at higher traffic workloads in the network. Finally, we also give a greedy heuristic for stream scheduling and compare its performance with the ILP-based algorithm in terms of the fairness goals achieved in a given schedule length. More... »

PAGES

451-469

References to SciGraph publications

  • 2004-12. A Hybrid Approach to Spatial Multiplexing in Multiuser MIMO Downlinks in EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s11036-009-0161-x

    DOI

    http://dx.doi.org/10.1007/s11036-009-0161-x

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1009821866


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1005", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Communications Technologies", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Technology", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "name": [
                "Wireless Engineering, Ericsson, 95134, San Jose, CA, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Jaiswal", 
            "givenName": "Suraj K.", 
            "id": "sg:person.015256345015.78", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015256345015.78"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Massachusetts Amherst", 
              "id": "https://www.grid.ac/institutes/grid.266683.f", 
              "name": [
                "Electrical and Computer Engineering Department, University of Massachusetts, 01003, Amherst, MA, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Ganz", 
            "givenName": "Aura", 
            "id": "sg:person.0714601440.49", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0714601440.49"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Massachusetts Amherst", 
              "id": "https://www.grid.ac/institutes/grid.266683.f", 
              "name": [
                "Electrical and Computer Engineering Department, University of Massachusetts, 01003, Amherst, MA, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Mettu", 
            "givenName": "Ramgopal", 
            "id": "sg:person.01363625423.31", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01363625423.31"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1145/1143549.1143637", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1035836948"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1049/el:19990058", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1056787816"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/18.761255", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061100951"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/18.825799", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061101255"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/49.730453", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061177980"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/99.714603", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061251980"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/jproc.2003.821915", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061296219"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/jsac.2003.809458", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061316382"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/mcom.2004.1341262", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061393892"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/mcom.2006.1705977", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061394400"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tit.2003.810646", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061649797"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tmc.2004.42", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061689858"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tsp.2006.887147", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061800350"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/0205013", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062841299"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1155/s1687147204406100", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1063208107", 
              "https://doi.org/10.1155/s1687147204406100"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.2140/pjm.1965.15.835", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1069063555"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/glocom.1999.831716", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1093304077"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icc.2006.255649", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094047025"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/twc.2003.814337", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094201459"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/infcom.2004.1354676", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094258604"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/isit.2006.261814", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094507906"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icassp.2007.366513", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094632718"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/acssc.1998.751635", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094891221"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icnp.2005.35", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095111518"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/wcnc.2003.1200372", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095248333"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/vetecs.2005.1543780", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095366417"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/pimrc.2007.4394517", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095462443"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2009-08", 
        "datePublishedReg": "2009-08-01", 
        "description": "In this paper, we investigate the problem of scheduling flows for fair stream allocation (or, stream scheduling) in ad hoc networks in which the transmitter and receiver use multiple antennas called Multiple Input Multiple Output (MIMO) technology. Our main contributions include: i) the concept of stream allocation to flows based on their traffic demands or class, ii) stream allocation to flows in the network utilizing single user or multiuser MIMO communication, iii) achieving the proportional fairness of the stream allocation in the minimum possible schedule length, and iv) performance comparison of the stream scheduling in the network for single user and multiuser communication and the tradeoff involved therein. We first formulate demand-based fair stream allocation as an integer linear programming (ILP) problem whose solution is a schedule that is guaranteed to be contention-free. We then solve this ILP in conjunction with binary search to find a minimum length contention-free schedule that achieves the fairness goals. We show that an implementation of our algorithm for a number of sample topologies in fact yields minimum length schedules that achieve the fairness goals. We then give performance comparison results that show the benefit of multiuser MIMO links over single user links at higher traffic workloads in the network. Finally, we also give a greedy heuristic for stream scheduling and compare its performance with the ILP-based algorithm in terms of the fairness goals achieved in a given schedule length.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s11036-009-0161-x", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isFundedItemOf": [
          {
            "id": "sg:grant.3039803", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.3052333", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.3032406", 
            "type": "MonetaryGrant"
          }
        ], 
        "isPartOf": [
          {
            "id": "sg:journal.1136741", 
            "issn": [
              "1383-469X", 
              "1572-8153"
            ], 
            "name": "Mobile Networks and Applications", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "4", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "14"
          }
        ], 
        "name": "An Optimization Framework for Demand-based Fair Stream Allocation in MIMO Ad Hoc Networks", 
        "pagination": "451-469", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "2ecaa514b8dce9a131c74b4da298778d9bc04314d8150afb828bccf9c920e8d1"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s11036-009-0161-x"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1009821866"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s11036-009-0161-x", 
          "https://app.dimensions.ai/details/publication/pub.1009821866"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T09:12", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000338_0000000338/records_47985_00000000.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007%2Fs11036-009-0161-x"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s11036-009-0161-x'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s11036-009-0161-x'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s11036-009-0161-x'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s11036-009-0161-x'


     

    This table displays all metadata directly associated to this object as RDF triples.

    165 TRIPLES      21 PREDICATES      54 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s11036-009-0161-x schema:about anzsrc-for:10
    2 anzsrc-for:1005
    3 schema:author N4be6d05f0ff64d6d832bb8048e70789a
    4 schema:citation sg:pub.10.1155/s1687147204406100
    5 https://doi.org/10.1049/el:19990058
    6 https://doi.org/10.1109/18.761255
    7 https://doi.org/10.1109/18.825799
    8 https://doi.org/10.1109/49.730453
    9 https://doi.org/10.1109/99.714603
    10 https://doi.org/10.1109/acssc.1998.751635
    11 https://doi.org/10.1109/glocom.1999.831716
    12 https://doi.org/10.1109/icassp.2007.366513
    13 https://doi.org/10.1109/icc.2006.255649
    14 https://doi.org/10.1109/icnp.2005.35
    15 https://doi.org/10.1109/infcom.2004.1354676
    16 https://doi.org/10.1109/isit.2006.261814
    17 https://doi.org/10.1109/jproc.2003.821915
    18 https://doi.org/10.1109/jsac.2003.809458
    19 https://doi.org/10.1109/mcom.2004.1341262
    20 https://doi.org/10.1109/mcom.2006.1705977
    21 https://doi.org/10.1109/pimrc.2007.4394517
    22 https://doi.org/10.1109/tit.2003.810646
    23 https://doi.org/10.1109/tmc.2004.42
    24 https://doi.org/10.1109/tsp.2006.887147
    25 https://doi.org/10.1109/twc.2003.814337
    26 https://doi.org/10.1109/vetecs.2005.1543780
    27 https://doi.org/10.1109/wcnc.2003.1200372
    28 https://doi.org/10.1137/0205013
    29 https://doi.org/10.1145/1143549.1143637
    30 https://doi.org/10.2140/pjm.1965.15.835
    31 schema:datePublished 2009-08
    32 schema:datePublishedReg 2009-08-01
    33 schema:description In this paper, we investigate the problem of scheduling flows for fair stream allocation (or, stream scheduling) in ad hoc networks in which the transmitter and receiver use multiple antennas called Multiple Input Multiple Output (MIMO) technology. Our main contributions include: i) the concept of stream allocation to flows based on their traffic demands or class, ii) stream allocation to flows in the network utilizing single user or multiuser MIMO communication, iii) achieving the proportional fairness of the stream allocation in the minimum possible schedule length, and iv) performance comparison of the stream scheduling in the network for single user and multiuser communication and the tradeoff involved therein. We first formulate demand-based fair stream allocation as an integer linear programming (ILP) problem whose solution is a schedule that is guaranteed to be contention-free. We then solve this ILP in conjunction with binary search to find a minimum length contention-free schedule that achieves the fairness goals. We show that an implementation of our algorithm for a number of sample topologies in fact yields minimum length schedules that achieve the fairness goals. We then give performance comparison results that show the benefit of multiuser MIMO links over single user links at higher traffic workloads in the network. Finally, we also give a greedy heuristic for stream scheduling and compare its performance with the ILP-based algorithm in terms of the fairness goals achieved in a given schedule length.
    34 schema:genre research_article
    35 schema:inLanguage en
    36 schema:isAccessibleForFree false
    37 schema:isPartOf N2f735e0285c649b897cd36ee0760da5c
    38 N65a157dbf3c84adca150fd6080d73ba1
    39 sg:journal.1136741
    40 schema:name An Optimization Framework for Demand-based Fair Stream Allocation in MIMO Ad Hoc Networks
    41 schema:pagination 451-469
    42 schema:productId N04720c0d55b4480fae08d53bc24359f4
    43 N59d3c3befae24c8488b4bd3a07ddde99
    44 N6da918cd4f244a50b0556a5d360c5096
    45 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009821866
    46 https://doi.org/10.1007/s11036-009-0161-x
    47 schema:sdDatePublished 2019-04-11T09:12
    48 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    49 schema:sdPublisher N428b7877feb34a85932da88933d03754
    50 schema:url http://link.springer.com/10.1007%2Fs11036-009-0161-x
    51 sgo:license sg:explorer/license/
    52 sgo:sdDataset articles
    53 rdf:type schema:ScholarlyArticle
    54 N04720c0d55b4480fae08d53bc24359f4 schema:name doi
    55 schema:value 10.1007/s11036-009-0161-x
    56 rdf:type schema:PropertyValue
    57 N225239fc5ece49cdb8e109d493df0177 rdf:first sg:person.01363625423.31
    58 rdf:rest rdf:nil
    59 N2f735e0285c649b897cd36ee0760da5c schema:volumeNumber 14
    60 rdf:type schema:PublicationVolume
    61 N428b7877feb34a85932da88933d03754 schema:name Springer Nature - SN SciGraph project
    62 rdf:type schema:Organization
    63 N4be6d05f0ff64d6d832bb8048e70789a rdf:first sg:person.015256345015.78
    64 rdf:rest N63a8a4fe03bc4e029e557346effe98f6
    65 N59d3c3befae24c8488b4bd3a07ddde99 schema:name dimensions_id
    66 schema:value pub.1009821866
    67 rdf:type schema:PropertyValue
    68 N63a8a4fe03bc4e029e557346effe98f6 rdf:first sg:person.0714601440.49
    69 rdf:rest N225239fc5ece49cdb8e109d493df0177
    70 N65a157dbf3c84adca150fd6080d73ba1 schema:issueNumber 4
    71 rdf:type schema:PublicationIssue
    72 N6da918cd4f244a50b0556a5d360c5096 schema:name readcube_id
    73 schema:value 2ecaa514b8dce9a131c74b4da298778d9bc04314d8150afb828bccf9c920e8d1
    74 rdf:type schema:PropertyValue
    75 N917d63b81a624d45989d3e3c98f70e54 schema:name Wireless Engineering, Ericsson, 95134, San Jose, CA, USA
    76 rdf:type schema:Organization
    77 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
    78 schema:name Technology
    79 rdf:type schema:DefinedTerm
    80 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
    81 schema:name Communications Technologies
    82 rdf:type schema:DefinedTerm
    83 sg:grant.3032406 http://pending.schema.org/fundedItem sg:pub.10.1007/s11036-009-0161-x
    84 rdf:type schema:MonetaryGrant
    85 sg:grant.3039803 http://pending.schema.org/fundedItem sg:pub.10.1007/s11036-009-0161-x
    86 rdf:type schema:MonetaryGrant
    87 sg:grant.3052333 http://pending.schema.org/fundedItem sg:pub.10.1007/s11036-009-0161-x
    88 rdf:type schema:MonetaryGrant
    89 sg:journal.1136741 schema:issn 1383-469X
    90 1572-8153
    91 schema:name Mobile Networks and Applications
    92 rdf:type schema:Periodical
    93 sg:person.01363625423.31 schema:affiliation https://www.grid.ac/institutes/grid.266683.f
    94 schema:familyName Mettu
    95 schema:givenName Ramgopal
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01363625423.31
    97 rdf:type schema:Person
    98 sg:person.015256345015.78 schema:affiliation N917d63b81a624d45989d3e3c98f70e54
    99 schema:familyName Jaiswal
    100 schema:givenName Suraj K.
    101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015256345015.78
    102 rdf:type schema:Person
    103 sg:person.0714601440.49 schema:affiliation https://www.grid.ac/institutes/grid.266683.f
    104 schema:familyName Ganz
    105 schema:givenName Aura
    106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0714601440.49
    107 rdf:type schema:Person
    108 sg:pub.10.1155/s1687147204406100 schema:sameAs https://app.dimensions.ai/details/publication/pub.1063208107
    109 https://doi.org/10.1155/s1687147204406100
    110 rdf:type schema:CreativeWork
    111 https://doi.org/10.1049/el:19990058 schema:sameAs https://app.dimensions.ai/details/publication/pub.1056787816
    112 rdf:type schema:CreativeWork
    113 https://doi.org/10.1109/18.761255 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061100951
    114 rdf:type schema:CreativeWork
    115 https://doi.org/10.1109/18.825799 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061101255
    116 rdf:type schema:CreativeWork
    117 https://doi.org/10.1109/49.730453 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061177980
    118 rdf:type schema:CreativeWork
    119 https://doi.org/10.1109/99.714603 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061251980
    120 rdf:type schema:CreativeWork
    121 https://doi.org/10.1109/acssc.1998.751635 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094891221
    122 rdf:type schema:CreativeWork
    123 https://doi.org/10.1109/glocom.1999.831716 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093304077
    124 rdf:type schema:CreativeWork
    125 https://doi.org/10.1109/icassp.2007.366513 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094632718
    126 rdf:type schema:CreativeWork
    127 https://doi.org/10.1109/icc.2006.255649 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094047025
    128 rdf:type schema:CreativeWork
    129 https://doi.org/10.1109/icnp.2005.35 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095111518
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1109/infcom.2004.1354676 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094258604
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1109/isit.2006.261814 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094507906
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1109/jproc.2003.821915 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061296219
    136 rdf:type schema:CreativeWork
    137 https://doi.org/10.1109/jsac.2003.809458 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061316382
    138 rdf:type schema:CreativeWork
    139 https://doi.org/10.1109/mcom.2004.1341262 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061393892
    140 rdf:type schema:CreativeWork
    141 https://doi.org/10.1109/mcom.2006.1705977 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061394400
    142 rdf:type schema:CreativeWork
    143 https://doi.org/10.1109/pimrc.2007.4394517 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095462443
    144 rdf:type schema:CreativeWork
    145 https://doi.org/10.1109/tit.2003.810646 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061649797
    146 rdf:type schema:CreativeWork
    147 https://doi.org/10.1109/tmc.2004.42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061689858
    148 rdf:type schema:CreativeWork
    149 https://doi.org/10.1109/tsp.2006.887147 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061800350
    150 rdf:type schema:CreativeWork
    151 https://doi.org/10.1109/twc.2003.814337 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094201459
    152 rdf:type schema:CreativeWork
    153 https://doi.org/10.1109/vetecs.2005.1543780 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095366417
    154 rdf:type schema:CreativeWork
    155 https://doi.org/10.1109/wcnc.2003.1200372 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095248333
    156 rdf:type schema:CreativeWork
    157 https://doi.org/10.1137/0205013 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062841299
    158 rdf:type schema:CreativeWork
    159 https://doi.org/10.1145/1143549.1143637 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035836948
    160 rdf:type schema:CreativeWork
    161 https://doi.org/10.2140/pjm.1965.15.835 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069063555
    162 rdf:type schema:CreativeWork
    163 https://www.grid.ac/institutes/grid.266683.f schema:alternateName University of Massachusetts Amherst
    164 schema:name Electrical and Computer Engineering Department, University of Massachusetts, 01003, Amherst, MA, USA
    165 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...