Conference Paper: Deterministic distributed data aggregation under the SINR model

File Download Links for fulltext
(May Require Subscription)
Supplementary

  • Basic View
  • Metadata View
  • XML View
TitleDeterministic distributed data aggregation under the SINR model
AuthorsHobbs, N2
Wang, Y2
Hua, QS2
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/
CitationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2012, v. 7287 LNCS, 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.
ISSN0302-9743
2011 SCImago Journal Rankings: 0.034
DOIhttp://dx.doi.org/10.1007/978-3-642-29952-0_38
ReferencesReferences in Scopus
DC Field
Value
dc.contributor.authorHobbs, N
dc.contributor.authorWang, Y
dc.contributor.authorHua, QS
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.description.natureLink_to_subscribed_fulltext
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2012, v. 7287 LNCS, 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.issn0302-9743
2011 SCImago Journal Rankings: 0.034
dc.identifier.scopuseid_2-s2.0-84861013577
dc.identifier.spage385
dc.identifier.urihttp://hdl.handle.net/10722/152043
dc.identifier.volume7287 LNCS
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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.relation.referencesReferences in Scopus
dc.subjectData Aggregation
dc.subjectPhysical Carrier Sensing
dc.subjectSinr Interference Model
dc.titleDeterministic distributed data aggregation under the SINR model
dc.typeConference_Paper
Author Affiliations
  1. The University of Hong Kong
  2. Tsinghua University