In-Network Analytics for Ubiquitous Sensing View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2013

AUTHORS

Ittay Eyal , Idit Keidar , Stacy Patterson , Raphi Rom

ABSTRACT

We address the problem of in-network analytics for data that is generated by sensors at the edge of the network. Specifically, we consider the problem of summarizing a continuous physical phenomenon, such as temperature or pollution, over a geographic region like a road network. Samples are collected by sensors placed alongside roads as well as in cars driving along them. We divide the region into sectors and find a summary for each sector, so that their union is a continuous function that minimizes some global error function. We designate a node (either virtual or physical) that is responsible for estimating the function in each sector. Each node computes its estimate based on the samples taken in its sector and information from adjacent nodes.The algorithm works in networks with bounded, yet unknown, latencies. It accommodates the addition and removal of samples and the arrival and departure of nodes, and it converges to a globally optimal solution using only pairwise message exchanges between neighbors. The algorithm relies on a weakly-fair scheduler to implement these pairwise exchanges, and we present an implementation of such a scheduler. Our scheduler, which may be of independent interest, is locally quiescent, meaning that it only sends messages when required by the algorithm. It achieves quiescence on every link where the algorithm ceases to schedule pairwise exchanges; in particular, if the algorithm converges, it globally quiesces. More... »

PAGES

507-521

Book

TITLE

Distributed Computing

ISBN

978-3-642-41526-5
978-3-642-41527-2

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-41527-2_35

DOI

http://dx.doi.org/10.1007/978-3-642-41527-2_35

DIMENSIONS

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


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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0806", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information Systems", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Cornell, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Department of Computer Science, Cornell, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Eyal", 
        "givenName": "Ittay", 
        "id": "sg:person.015022230121.71", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015022230121.71"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, Technion, Israel", 
          "id": "http://www.grid.ac/institutes/grid.6451.6", 
          "name": [
            "Department of Electrical Engineering, Technion, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Keidar", 
        "givenName": "Idit", 
        "id": "sg:person.07674464077.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07674464077.03"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, Technion, Israel", 
          "id": "http://www.grid.ac/institutes/grid.6451.6", 
          "name": [
            "Department of Electrical Engineering, Technion, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Patterson", 
        "givenName": "Stacy", 
        "id": "sg:person.011004254263.25", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011004254263.25"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, Technion, Israel", 
          "id": "http://www.grid.ac/institutes/grid.6451.6", 
          "name": [
            "Department of Electrical Engineering, Technion, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rom", 
        "givenName": "Raphi", 
        "type": "Person"
      }
    ], 
    "datePublished": "2013", 
    "datePublishedReg": "2013-01-01", 
    "description": "We address the problem of in-network analytics for data that is generated by sensors at the edge of the network. Specifically, we consider the problem of summarizing a continuous physical phenomenon, such as temperature or pollution, over a geographic region like a road network. Samples are collected by sensors placed alongside roads as well as in cars driving along them. We divide the region into sectors and find a summary for each sector, so that their union is a continuous function that minimizes some global error function. We designate a node (either virtual or physical) that is responsible for estimating the function in each sector. Each node computes its estimate based on the samples taken in its sector and information from adjacent nodes.The algorithm works in networks with bounded, yet unknown, latencies. It accommodates the addition and removal of samples and the arrival and departure of nodes, and it converges to a globally optimal solution using only pairwise message exchanges between neighbors. The algorithm relies on a weakly-fair scheduler to implement these pairwise exchanges, and we present an implementation of such a scheduler. Our scheduler, which may be of independent interest, is locally quiescent, meaning that it only sends messages when required by the algorithm. It achieves quiescence on every link where the algorithm ceases to schedule pairwise exchanges; in particular, if the algorithm converges, it globally quiesces.", 
    "editor": [
      {
        "familyName": "Afek", 
        "givenName": "Yehuda", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-41527-2_35", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-41526-5", 
        "978-3-642-41527-2"
      ], 
      "name": "Distributed Computing", 
      "type": "Book"
    }, 
    "keywords": [
      "network analytics", 
      "global error function", 
      "departure of nodes", 
      "message exchange", 
      "ubiquitous sensing", 
      "fair scheduler", 
      "pairwise exchange", 
      "continuous physical phenomenon", 
      "adjacent nodes", 
      "algorithm", 
      "optimal solution", 
      "scheduler", 
      "algorithm converges", 
      "road network", 
      "analytics", 
      "network", 
      "error function", 
      "nodes", 
      "independent interest", 
      "sensors", 
      "implementation", 
      "messages", 
      "neighbors", 
      "latency", 
      "physical phenomena", 
      "information", 
      "sensing", 
      "car", 
      "converges", 
      "continuous functions", 
      "exchange", 
      "edge", 
      "road", 
      "solution", 
      "link", 
      "data", 
      "interest", 
      "function", 
      "arrival", 
      "sector", 
      "estimates", 
      "summary", 
      "addition", 
      "region", 
      "departure", 
      "geographic regions", 
      "removal of samples", 
      "Union", 
      "phenomenon", 
      "samples", 
      "pollution", 
      "removal", 
      "quiescence", 
      "problem", 
      "temperature", 
      "only pairwise message exchanges", 
      "pairwise message exchanges"
    ], 
    "name": "In-Network Analytics for Ubiquitous Sensing", 
    "pagination": "507-521", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1002516006"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-41527-2_35"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-41527-2_35", 
      "https://app.dimensions.ai/details/publication/pub.1002516006"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T18:49", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/chapter/chapter_179.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-41527-2_35"
  }
]
 

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-642-41527-2_35'

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-642-41527-2_35'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-41527-2_35'

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-642-41527-2_35'


 

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

140 TRIPLES      23 PREDICATES      83 URIs      76 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-41527-2_35 schema:about anzsrc-for:08
2 anzsrc-for:0806
3 schema:author N3d29f80bef174665850cffbbe05102b3
4 schema:datePublished 2013
5 schema:datePublishedReg 2013-01-01
6 schema:description We address the problem of in-network analytics for data that is generated by sensors at the edge of the network. Specifically, we consider the problem of summarizing a continuous physical phenomenon, such as temperature or pollution, over a geographic region like a road network. Samples are collected by sensors placed alongside roads as well as in cars driving along them. We divide the region into sectors and find a summary for each sector, so that their union is a continuous function that minimizes some global error function. We designate a node (either virtual or physical) that is responsible for estimating the function in each sector. Each node computes its estimate based on the samples taken in its sector and information from adjacent nodes.The algorithm works in networks with bounded, yet unknown, latencies. It accommodates the addition and removal of samples and the arrival and departure of nodes, and it converges to a globally optimal solution using only pairwise message exchanges between neighbors. The algorithm relies on a weakly-fair scheduler to implement these pairwise exchanges, and we present an implementation of such a scheduler. Our scheduler, which may be of independent interest, is locally quiescent, meaning that it only sends messages when required by the algorithm. It achieves quiescence on every link where the algorithm ceases to schedule pairwise exchanges; in particular, if the algorithm converges, it globally quiesces.
7 schema:editor Nfc80507a8a8743cdab1f26638a8b8c4f
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N56675730ce084ffebddeec843c6ef846
12 schema:keywords Union
13 addition
14 adjacent nodes
15 algorithm
16 algorithm converges
17 analytics
18 arrival
19 car
20 continuous functions
21 continuous physical phenomenon
22 converges
23 data
24 departure
25 departure of nodes
26 edge
27 error function
28 estimates
29 exchange
30 fair scheduler
31 function
32 geographic regions
33 global error function
34 implementation
35 independent interest
36 information
37 interest
38 latency
39 link
40 message exchange
41 messages
42 neighbors
43 network
44 network analytics
45 nodes
46 only pairwise message exchanges
47 optimal solution
48 pairwise exchange
49 pairwise message exchanges
50 phenomenon
51 physical phenomena
52 pollution
53 problem
54 quiescence
55 region
56 removal
57 removal of samples
58 road
59 road network
60 samples
61 scheduler
62 sector
63 sensing
64 sensors
65 solution
66 summary
67 temperature
68 ubiquitous sensing
69 schema:name In-Network Analytics for Ubiquitous Sensing
70 schema:pagination 507-521
71 schema:productId N540a9ad345eb459985d402cf3d44fcd7
72 Nde9e3bf822da4958a14ed7cf2b9d1641
73 schema:publisher N9b2f94fa236549e694644aaecf2d8370
74 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002516006
75 https://doi.org/10.1007/978-3-642-41527-2_35
76 schema:sdDatePublished 2021-11-01T18:49
77 schema:sdLicense https://scigraph.springernature.com/explorer/license/
78 schema:sdPublisher Ne5852f96038e454da92d94d0b1c7ddbf
79 schema:url https://doi.org/10.1007/978-3-642-41527-2_35
80 sgo:license sg:explorer/license/
81 sgo:sdDataset chapters
82 rdf:type schema:Chapter
83 N0420dcd80d1843e881e3deb8951f61cd rdf:first sg:person.07674464077.03
84 rdf:rest N32423f15f3564812b65b08e580a8213c
85 N0efc9427cb55493890ec5ed6562ab12e schema:familyName Afek
86 schema:givenName Yehuda
87 rdf:type schema:Person
88 N2235cdf1ee66485b8260d972ea3446f9 schema:affiliation grid-institutes:grid.6451.6
89 schema:familyName Rom
90 schema:givenName Raphi
91 rdf:type schema:Person
92 N32423f15f3564812b65b08e580a8213c rdf:first sg:person.011004254263.25
93 rdf:rest N380f7c7089644e91aa9880025c9915d5
94 N380f7c7089644e91aa9880025c9915d5 rdf:first N2235cdf1ee66485b8260d972ea3446f9
95 rdf:rest rdf:nil
96 N3d29f80bef174665850cffbbe05102b3 rdf:first sg:person.015022230121.71
97 rdf:rest N0420dcd80d1843e881e3deb8951f61cd
98 N540a9ad345eb459985d402cf3d44fcd7 schema:name dimensions_id
99 schema:value pub.1002516006
100 rdf:type schema:PropertyValue
101 N56675730ce084ffebddeec843c6ef846 schema:isbn 978-3-642-41526-5
102 978-3-642-41527-2
103 schema:name Distributed Computing
104 rdf:type schema:Book
105 N9b2f94fa236549e694644aaecf2d8370 schema:name Springer Nature
106 rdf:type schema:Organisation
107 Nde9e3bf822da4958a14ed7cf2b9d1641 schema:name doi
108 schema:value 10.1007/978-3-642-41527-2_35
109 rdf:type schema:PropertyValue
110 Ne5852f96038e454da92d94d0b1c7ddbf schema:name Springer Nature - SN SciGraph project
111 rdf:type schema:Organization
112 Nfc80507a8a8743cdab1f26638a8b8c4f rdf:first N0efc9427cb55493890ec5ed6562ab12e
113 rdf:rest rdf:nil
114 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
115 schema:name Information and Computing Sciences
116 rdf:type schema:DefinedTerm
117 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
118 schema:name Information Systems
119 rdf:type schema:DefinedTerm
120 sg:person.011004254263.25 schema:affiliation grid-institutes:grid.6451.6
121 schema:familyName Patterson
122 schema:givenName Stacy
123 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011004254263.25
124 rdf:type schema:Person
125 sg:person.015022230121.71 schema:affiliation grid-institutes:None
126 schema:familyName Eyal
127 schema:givenName Ittay
128 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015022230121.71
129 rdf:type schema:Person
130 sg:person.07674464077.03 schema:affiliation grid-institutes:grid.6451.6
131 schema:familyName Keidar
132 schema:givenName Idit
133 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07674464077.03
134 rdf:type schema:Person
135 grid-institutes:None schema:alternateName Department of Computer Science, Cornell, USA
136 schema:name Department of Computer Science, Cornell, USA
137 rdf:type schema:Organization
138 grid-institutes:grid.6451.6 schema:alternateName Department of Electrical Engineering, Technion, Israel
139 schema:name Department of Electrical Engineering, Technion, Israel
140 rdf:type schema:Organization
 




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


...