File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Conference Paper: Deterministic distributed data aggregation under the SINR model
  • Basic View
  • Metadata View
  • XML View
TitleDeterministic distributed data aggregation under the SINR model
 
AuthorsHobbs, N2
Wang, Y2
Hua, Q
Yu, D1
Lau, FCM1
 
KeywordsData aggregation
Physical carrier sensing
SINR interference model
 
Issue Date2012
 
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
 
CitationThe 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), Beijing, China, 16-21 May 2012. In Lecture Notes in Computer Science, 2012, v. 7287, p. 385-399 [How to Cite?]
DOI: http://dx.doi.org/10.1007/978-3-642-29952-0_38
 
AbstractGiven a set of nodes ν, where each node has some data value, the goal of data aggregation is to compute some aggregate function in the fewest timeslots possible. Aggregate functions compute the aggregated value from the data of all nodes; common examples include maximum or average. We assume the realistic physical (SINR) interference model and no knowledge of the network structure or the number of neighbors of any node; our model also uses physical carrier sensing. We present a distributed protocol to compute an aggregate function in O(D+Δlogn) timeslots, where D is the diameter of the network, Δ is the maximum number of neighbors within a given radius and n is the total number of nodes. Our protocol contributes an exponential improvement in running time compared to that in [18]. © 2012 Springer-Verlag.
 
DescriptionLNCS v. 7287 entitled: Theory and applications of models of computation : 9th annual conference, TAMC 2012 ... proceedings
 
ISBN978-364229951-3
 
ISSN0302-9743
2012 SCImago Journal Rankings: 0.332
 
DOIhttp://dx.doi.org/10.1007/978-3-642-29952-0_38
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorHobbs, N
 
dc.contributor.authorWang, Y
 
dc.contributor.authorHua, Q
 
dc.contributor.authorYu, D
 
dc.contributor.authorLau, FCM
 
dc.date.accessioned2012-06-26T06:32:48Z
 
dc.date.available2012-06-26T06:32:48Z
 
dc.date.issued2012
 
dc.description.abstractGiven a set of nodes ν, where each node has some data value, the goal of data aggregation is to compute some aggregate function in the fewest timeslots possible. Aggregate functions compute the aggregated value from the data of all nodes; common examples include maximum or average. We assume the realistic physical (SINR) interference model and no knowledge of the network structure or the number of neighbors of any node; our model also uses physical carrier sensing. We present a distributed protocol to compute an aggregate function in O(D+Δlogn) timeslots, where D is the diameter of the network, Δ is the maximum number of neighbors within a given radius and n is the total number of nodes. Our protocol contributes an exponential improvement in running time compared to that in [18]. © 2012 Springer-Verlag.
 
dc.descriptionLNCS v. 7287 entitled: Theory and applications of models of computation : 9th annual conference, TAMC 2012 ... proceedings
 
dc.identifier.citationThe 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), Beijing, China, 16-21 May 2012. In Lecture Notes in Computer Science, 2012, v. 7287, p. 385-399 [How to Cite?]
DOI: http://dx.doi.org/10.1007/978-3-642-29952-0_38
 
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-642-29952-0_38
 
dc.identifier.epage399
 
dc.identifier.hkuros211541
 
dc.identifier.isbn978-364229951-3
 
dc.identifier.issn0302-9743
2012 SCImago Journal Rankings: 0.332
 
dc.identifier.scopuseid_2-s2.0-84861013577
 
dc.identifier.spage385
 
dc.identifier.urihttp://hdl.handle.net/10722/152043
 
dc.identifier.volume7287
 
dc.languageeng
 
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
 
dc.publisher.placeGermany
 
dc.relation.ispartofLecture Notes in Computer Science
 
dc.relation.referencesReferences in Scopus
 
dc.rightsThe original publication is available at www.springerlink.com
 
dc.subjectData aggregation
 
dc.subjectPhysical carrier sensing
 
dc.subjectSINR interference model
 
dc.titleDeterministic distributed data aggregation under the SINR model
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Hobbs, N</contributor.author>
<contributor.author>Wang, Y</contributor.author>
<contributor.author>Hua, Q</contributor.author>
<contributor.author>Yu, D</contributor.author>
<contributor.author>Lau, FCM</contributor.author>
<date.accessioned>2012-06-26T06:32:48Z</date.accessioned>
<date.available>2012-06-26T06:32:48Z</date.available>
<date.issued>2012</date.issued>
<identifier.citation>The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), Beijing, China, 16-21 May 2012. In Lecture Notes in Computer Science, 2012, v. 7287, p. 385-399</identifier.citation>
<identifier.isbn>978-364229951-3</identifier.isbn>
<identifier.issn>0302-9743</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/152043</identifier.uri>
<description>LNCS v. 7287 entitled: Theory and applications of models of computation : 9th annual conference, TAMC 2012 ... proceedings</description>
<description.abstract>Given a set of nodes &#957;, where each node has some data value, the goal of data aggregation is to compute some aggregate function in the fewest timeslots possible. Aggregate functions compute the aggregated value from the data of all nodes; common examples include maximum or average. We assume the realistic physical (SINR) interference model and no knowledge of the network structure or the number of neighbors of any node; our model also uses physical carrier sensing. We present a distributed protocol to compute an aggregate function in O(D+&#916;logn) timeslots, where D is the diameter of the network, &#916; is the maximum number of neighbors within a given radius and n is the total number of nodes. Our protocol contributes an exponential improvement in running time compared to that in [18]. &#169; 2012 Springer-Verlag.</description.abstract>
<language>eng</language>
<publisher>Springer Verlag. The Journal&apos;s web site is located at http://springerlink.com/content/105633/</publisher>
<relation.ispartof>Lecture Notes in Computer Science</relation.ispartof>
<rights>The original publication is available at www.springerlink.com</rights>
<subject>Data aggregation</subject>
<subject>Physical carrier sensing</subject>
<subject>SINR interference model</subject>
<title>Deterministic distributed data aggregation under the SINR model</title>
<type>Conference_Paper</type>
<identifier.doi>10.1007/978-3-642-29952-0_38</identifier.doi>
<identifier.scopus>eid_2-s2.0-84861013577</identifier.scopus>
<identifier.hkuros>211541</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-84861013577&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.volume>7287</identifier.volume>
<identifier.spage>385</identifier.spage>
<identifier.epage>399</identifier.epage>
<publisher.place>Germany</publisher.place>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. Tsinghua University