Distributed Barrier Coverage with Relocatable Sensors View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2014

AUTHORS

Mohsen Eftekhari , Paola Flocchini , Lata Narayanan , Jaroslav Opatrny , Nicola Santoro

ABSTRACT

A wireless sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of a given barrier that intersects with its sensing range. Barrier coverage is achieved by a set of sensors if every point on the barrier is covered by some sensor in the set. Assuming n identical, anonymous, and relocatable sensors are placed initially at arbitrary positions on a line segment barrier, we are interested in the following question: under what circumstances can they independently make decisions and movements in order to reach final positions whereby they collectively cover the barrier? We assume each sensor repeatedly executes Look-Compute-Move cycles: it looks to find the positions of sensors in its visibility range, it computes its next position, and then moves to the calculated position. We consider only oblivious or memoryless sensors with sensing range r and visibility range 2r and assume that sensors can move at most distance r along the barrier in a move. Under these assumptions, it was shown recently that if the sensors are fully synchronized, then there exists an algorithm for barrier coverage even if sensors are unoriented, that is, they do not distinguish between left and right [7]. In this paper, we prove that orientation is critical to being able to solve the problem if we relax the assumption of tight synchronization. We show that if sensors are unoriented, then barrier coverage is unsolvable even in the semi-synchronous setting. In contrast, if sensors agree on a global orientation, then we give an algorithm for barrier coverage, even in the completely asynchronous setting. Finally, we extend the result of [4] and show that convergence to barrier coverage by unoriented sensors in the semi-synchronous model is possible with bounded visibility range 2r + ρ (for arbitrarily small ρ > 0) and bounded mobility range r. More... »

PAGES

235-249

References to SciGraph publications

  • 2012. Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain in ALGORITHM THEORY – SWAT 2012
  • 2012. Coverage Control in SEARCH AND CLASSIFICATION USING MULTIPLE AUTONOMOUS VEHICLES
  • 2010-11-08. Computing by Mobile Robotic Sensors in THEORETICAL ASPECTS OF DISTRIBUTED COMPUTING IN SENSOR NETWORKS
  • 2010. On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment in AD-HOC, MOBILE AND WIRELESS NETWORKS
  • 2009. On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment in AD-HOC, MOBILE AND WIRELESS NETWORKS
  • Book

    TITLE

    Structural Information and Communication Complexity

    ISBN

    978-3-319-09619-3
    978-3-319-09620-9

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-319-09620-9_19

    DOI

    http://dx.doi.org/10.1007/978-3-319-09620-9_19

    DIMENSIONS

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


    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": {
              "alternateName": "Concordia University", 
              "id": "https://www.grid.ac/institutes/grid.410319.e", 
              "name": [
                "Dept. of Comp. Science and Soft. Eng., Concordia University, Montr\u00e9al, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Eftekhari", 
            "givenName": "Mohsen", 
            "id": "sg:person.016613403765.86", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016613403765.86"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Ottawa", 
              "id": "https://www.grid.ac/institutes/grid.28046.38", 
              "name": [
                "School of El. Eng. and Computer Science, University of Ottawa, Ottawa, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Flocchini", 
            "givenName": "Paola", 
            "id": "sg:person.011601470625.25", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011601470625.25"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Concordia University", 
              "id": "https://www.grid.ac/institutes/grid.410319.e", 
              "name": [
                "Dept. of Comp. Science and Soft. Eng., Concordia University, Montr\u00e9al, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Narayanan", 
            "givenName": "Lata", 
            "id": "sg:person.015512740475.38", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015512740475.38"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Concordia University", 
              "id": "https://www.grid.ac/institutes/grid.410319.e", 
              "name": [
                "Dept. of Comp. Science and Soft. Eng., Concordia University, Montr\u00e9al, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Opatrny", 
            "givenName": "Jaroslav", 
            "id": "sg:person.010551321746.61", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010551321746.61"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Carleton University", 
              "id": "https://www.grid.ac/institutes/grid.34428.39", 
              "name": [
                "School of Computer Science, Carleton University, Ottawa, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Santoro", 
            "givenName": "Nicola", 
            "id": "sg:person.010566557723.84", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010566557723.84"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-642-14785-2_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001918920", 
              "https://doi.org/10.1007/978-3-642-14785-2_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-14785-2_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001918920", 
              "https://doi.org/10.1007/978-3-642-14785-2_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2008.02.007", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005238146"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-04383-3_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005625205", 
              "https://doi.org/10.1007/978-3-642-04383-3_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1080829.1080859", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009834738"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1374618.1374673", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1015256781"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4471-2957-8_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022586508", 
              "https://doi.org/10.1007/978-1-4471-2957-8_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1287853.1287863", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023583808"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2008.03.006", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025185466"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2012.04.038", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028448234"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-31155-0_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032060156", 
              "https://doi.org/10.1007/978-3-642-31155-0_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-14849-1_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043209010", 
              "https://doi.org/10.1007/978-3-642-14849-1_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-14849-1_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043209010", 
              "https://doi.org/10.1007/978-3-642-14849-1_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2009.07.007", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044966098"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.comnet.2010.10.008", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045159103"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/2484239.2484258", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051200702"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.2200/s00440ed1v01y201208dct010", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1069288322"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/infcom.2009.5061914", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1093576329"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/i-span.2008.8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094837429"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2014", 
        "datePublishedReg": "2014-01-01", 
        "description": "A wireless sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of a given barrier that intersects with its sensing range. Barrier coverage is achieved by a set of sensors if every point on the barrier is covered by some sensor in the set. Assuming n identical, anonymous, and relocatable sensors are placed initially at arbitrary positions on a line segment barrier, we are interested in the following question: under what circumstances can they independently make decisions and movements in order to reach final positions whereby they collectively cover the barrier? We assume each sensor repeatedly executes Look-Compute-Move cycles: it looks to find the positions of sensors in its visibility range, it computes its next position, and then moves to the calculated position. We consider only oblivious or memoryless sensors with sensing range r and visibility range 2r and assume that sensors can move at most distance r along the barrier in a move. Under these assumptions, it was shown recently that if the sensors are fully synchronized, then there exists an algorithm for barrier coverage even if sensors are unoriented, that is, they do not distinguish between left and right [7]. In this paper, we prove that orientation is critical to being able to solve the problem if we relax the assumption of tight synchronization. We show that if sensors are unoriented, then barrier coverage is unsolvable even in the semi-synchronous setting. In contrast, if sensors agree on a global orientation, then we give an algorithm for barrier coverage, even in the completely asynchronous setting. Finally, we extend the result of [4] and show that convergence to barrier coverage by unoriented sensors in the semi-synchronous model is possible with bounded visibility range 2r\u2009+\u2009\u03c1 (for arbitrarily small \u03c1\u2009>\u20090) and bounded mobility range r.", 
        "editor": [
          {
            "familyName": "Halld\u00f3rsson", 
            "givenName": "Magn\u00fas M.", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-319-09620-9_19", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": {
          "isbn": [
            "978-3-319-09619-3", 
            "978-3-319-09620-9"
          ], 
          "name": "Structural Information and Communication Complexity", 
          "type": "Book"
        }, 
        "name": "Distributed Barrier Coverage with Relocatable Sensors", 
        "pagination": "235-249", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-319-09620-9_19"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "cff78d3dcea2e0f49e4bb700ae2c1ea577e3588a30bc47223075011b8ac471de"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1043659790"
            ]
          }
        ], 
        "publisher": {
          "location": "Cham", 
          "name": "Springer International Publishing", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-319-09620-9_19", 
          "https://app.dimensions.ai/details/publication/pub.1043659790"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-15T19:11", 
        "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/0000000001_0000000264/records_8684_00000270.jsonl", 
        "type": "Chapter", 
        "url": "http://link.springer.com/10.1007/978-3-319-09620-9_19"
      }
    ]
     

    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/978-3-319-09620-9_19'

    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/978-3-319-09620-9_19'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-09620-9_19'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-09620-9_19'


     

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

    155 TRIPLES      23 PREDICATES      44 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-319-09620-9_19 schema:about anzsrc-for:10
    2 anzsrc-for:1005
    3 schema:author Na701334fd6bc45d6849247a57fc4b9ba
    4 schema:citation sg:pub.10.1007/978-1-4471-2957-8_2
    5 sg:pub.10.1007/978-3-642-04383-3_15
    6 sg:pub.10.1007/978-3-642-14785-2_3
    7 sg:pub.10.1007/978-3-642-14849-1_21
    8 sg:pub.10.1007/978-3-642-31155-0_16
    9 https://doi.org/10.1016/j.comnet.2010.10.008
    10 https://doi.org/10.1016/j.tcs.2008.02.007
    11 https://doi.org/10.1016/j.tcs.2008.03.006
    12 https://doi.org/10.1016/j.tcs.2009.07.007
    13 https://doi.org/10.1016/j.tcs.2012.04.038
    14 https://doi.org/10.1109/i-span.2008.8
    15 https://doi.org/10.1109/infcom.2009.5061914
    16 https://doi.org/10.1145/1080829.1080859
    17 https://doi.org/10.1145/1287853.1287863
    18 https://doi.org/10.1145/1374618.1374673
    19 https://doi.org/10.1145/2484239.2484258
    20 https://doi.org/10.2200/s00440ed1v01y201208dct010
    21 schema:datePublished 2014
    22 schema:datePublishedReg 2014-01-01
    23 schema:description A wireless sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of a given barrier that intersects with its sensing range. Barrier coverage is achieved by a set of sensors if every point on the barrier is covered by some sensor in the set. Assuming n identical, anonymous, and relocatable sensors are placed initially at arbitrary positions on a line segment barrier, we are interested in the following question: under what circumstances can they independently make decisions and movements in order to reach final positions whereby they collectively cover the barrier? We assume each sensor repeatedly executes Look-Compute-Move cycles: it looks to find the positions of sensors in its visibility range, it computes its next position, and then moves to the calculated position. We consider only oblivious or memoryless sensors with sensing range r and visibility range 2r and assume that sensors can move at most distance r along the barrier in a move. Under these assumptions, it was shown recently that if the sensors are fully synchronized, then there exists an algorithm for barrier coverage even if sensors are unoriented, that is, they do not distinguish between left and right [7]. In this paper, we prove that orientation is critical to being able to solve the problem if we relax the assumption of tight synchronization. We show that if sensors are unoriented, then barrier coverage is unsolvable even in the semi-synchronous setting. In contrast, if sensors agree on a global orientation, then we give an algorithm for barrier coverage, even in the completely asynchronous setting. Finally, we extend the result of [4] and show that convergence to barrier coverage by unoriented sensors in the semi-synchronous model is possible with bounded visibility range 2r + ρ (for arbitrarily small ρ > 0) and bounded mobility range r.
    24 schema:editor N92a8b272e30540c281bee0f021dbb55c
    25 schema:genre chapter
    26 schema:inLanguage en
    27 schema:isAccessibleForFree false
    28 schema:isPartOf N74bad3563d064abb8c45bdc291c0de6c
    29 schema:name Distributed Barrier Coverage with Relocatable Sensors
    30 schema:pagination 235-249
    31 schema:productId N7465ac711a4145d68bef140b47a71385
    32 N76334923f5c54ec1b68717af39b860e6
    33 Neb466bd859e6494ab286b5370e7ca0cb
    34 schema:publisher Nbe3a6e78e0b7478faf928313af9fcff4
    35 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043659790
    36 https://doi.org/10.1007/978-3-319-09620-9_19
    37 schema:sdDatePublished 2019-04-15T19:11
    38 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    39 schema:sdPublisher N2fe54e219a9748b784ac4f14132dced2
    40 schema:url http://link.springer.com/10.1007/978-3-319-09620-9_19
    41 sgo:license sg:explorer/license/
    42 sgo:sdDataset chapters
    43 rdf:type schema:Chapter
    44 N016fc441ccde44c08be8059551d9bb8a schema:familyName Halldórsson
    45 schema:givenName Magnús M.
    46 rdf:type schema:Person
    47 N1e8272d459be497dbd2e0eec9906cccd rdf:first sg:person.010551321746.61
    48 rdf:rest Ne2017f6201f8463c832f7ba8b1b6c6b5
    49 N2fe54e219a9748b784ac4f14132dced2 schema:name Springer Nature - SN SciGraph project
    50 rdf:type schema:Organization
    51 N4a550efc4bd84b9cb245ff2734c3120e rdf:first sg:person.011601470625.25
    52 rdf:rest Nb90d32190dca407d9bb16009d36768fc
    53 N7465ac711a4145d68bef140b47a71385 schema:name doi
    54 schema:value 10.1007/978-3-319-09620-9_19
    55 rdf:type schema:PropertyValue
    56 N74bad3563d064abb8c45bdc291c0de6c schema:isbn 978-3-319-09619-3
    57 978-3-319-09620-9
    58 schema:name Structural Information and Communication Complexity
    59 rdf:type schema:Book
    60 N76334923f5c54ec1b68717af39b860e6 schema:name readcube_id
    61 schema:value cff78d3dcea2e0f49e4bb700ae2c1ea577e3588a30bc47223075011b8ac471de
    62 rdf:type schema:PropertyValue
    63 N92a8b272e30540c281bee0f021dbb55c rdf:first N016fc441ccde44c08be8059551d9bb8a
    64 rdf:rest rdf:nil
    65 Na701334fd6bc45d6849247a57fc4b9ba rdf:first sg:person.016613403765.86
    66 rdf:rest N4a550efc4bd84b9cb245ff2734c3120e
    67 Nb90d32190dca407d9bb16009d36768fc rdf:first sg:person.015512740475.38
    68 rdf:rest N1e8272d459be497dbd2e0eec9906cccd
    69 Nbe3a6e78e0b7478faf928313af9fcff4 schema:location Cham
    70 schema:name Springer International Publishing
    71 rdf:type schema:Organisation
    72 Ne2017f6201f8463c832f7ba8b1b6c6b5 rdf:first sg:person.010566557723.84
    73 rdf:rest rdf:nil
    74 Neb466bd859e6494ab286b5370e7ca0cb schema:name dimensions_id
    75 schema:value pub.1043659790
    76 rdf:type schema:PropertyValue
    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:person.010551321746.61 schema:affiliation https://www.grid.ac/institutes/grid.410319.e
    84 schema:familyName Opatrny
    85 schema:givenName Jaroslav
    86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010551321746.61
    87 rdf:type schema:Person
    88 sg:person.010566557723.84 schema:affiliation https://www.grid.ac/institutes/grid.34428.39
    89 schema:familyName Santoro
    90 schema:givenName Nicola
    91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010566557723.84
    92 rdf:type schema:Person
    93 sg:person.011601470625.25 schema:affiliation https://www.grid.ac/institutes/grid.28046.38
    94 schema:familyName Flocchini
    95 schema:givenName Paola
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011601470625.25
    97 rdf:type schema:Person
    98 sg:person.015512740475.38 schema:affiliation https://www.grid.ac/institutes/grid.410319.e
    99 schema:familyName Narayanan
    100 schema:givenName Lata
    101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015512740475.38
    102 rdf:type schema:Person
    103 sg:person.016613403765.86 schema:affiliation https://www.grid.ac/institutes/grid.410319.e
    104 schema:familyName Eftekhari
    105 schema:givenName Mohsen
    106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016613403765.86
    107 rdf:type schema:Person
    108 sg:pub.10.1007/978-1-4471-2957-8_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022586508
    109 https://doi.org/10.1007/978-1-4471-2957-8_2
    110 rdf:type schema:CreativeWork
    111 sg:pub.10.1007/978-3-642-04383-3_15 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005625205
    112 https://doi.org/10.1007/978-3-642-04383-3_15
    113 rdf:type schema:CreativeWork
    114 sg:pub.10.1007/978-3-642-14785-2_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001918920
    115 https://doi.org/10.1007/978-3-642-14785-2_3
    116 rdf:type schema:CreativeWork
    117 sg:pub.10.1007/978-3-642-14849-1_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043209010
    118 https://doi.org/10.1007/978-3-642-14849-1_21
    119 rdf:type schema:CreativeWork
    120 sg:pub.10.1007/978-3-642-31155-0_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032060156
    121 https://doi.org/10.1007/978-3-642-31155-0_16
    122 rdf:type schema:CreativeWork
    123 https://doi.org/10.1016/j.comnet.2010.10.008 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045159103
    124 rdf:type schema:CreativeWork
    125 https://doi.org/10.1016/j.tcs.2008.02.007 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005238146
    126 rdf:type schema:CreativeWork
    127 https://doi.org/10.1016/j.tcs.2008.03.006 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025185466
    128 rdf:type schema:CreativeWork
    129 https://doi.org/10.1016/j.tcs.2009.07.007 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044966098
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1016/j.tcs.2012.04.038 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028448234
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1109/i-span.2008.8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094837429
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1109/infcom.2009.5061914 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093576329
    136 rdf:type schema:CreativeWork
    137 https://doi.org/10.1145/1080829.1080859 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009834738
    138 rdf:type schema:CreativeWork
    139 https://doi.org/10.1145/1287853.1287863 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023583808
    140 rdf:type schema:CreativeWork
    141 https://doi.org/10.1145/1374618.1374673 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015256781
    142 rdf:type schema:CreativeWork
    143 https://doi.org/10.1145/2484239.2484258 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051200702
    144 rdf:type schema:CreativeWork
    145 https://doi.org/10.2200/s00440ed1v01y201208dct010 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069288322
    146 rdf:type schema:CreativeWork
    147 https://www.grid.ac/institutes/grid.28046.38 schema:alternateName University of Ottawa
    148 schema:name School of El. Eng. and Computer Science, University of Ottawa, Ottawa, Canada
    149 rdf:type schema:Organization
    150 https://www.grid.ac/institutes/grid.34428.39 schema:alternateName Carleton University
    151 schema:name School of Computer Science, Carleton University, Ottawa, Canada
    152 rdf:type schema:Organization
    153 https://www.grid.ac/institutes/grid.410319.e schema:alternateName Concordia University
    154 schema:name Dept. of Comp. Science and Soft. Eng., Concordia University, Montréal, Canada
    155 rdf:type schema:Organization
     




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


    ...