FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2032161112> ?p ?o ?g. }

• W2032161112 endingPage "2149" @default.
• W2032161112 startingPage "2137" @default.
• W2032161112 abstract "This paper describes and analyzes a hierarchical algorithm called Multiscale Gossip for solving the distributed average consensus problem in wireless sensor networks. The algorithm proceeds by recursively partitioning a given network. Initially, nodes at the finest scale gossip to compute local averages. Then, using multi-hop communication and geographic routing to communicate between nodes that are not directly connected, these local averages are progressively fused up the hierarchy until the global average is computed. We show that the proposed hierarchical scheme with <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>k</i> =Θ(loglog <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</i> ) levels of hierarchy is competitive with state-of-the-art randomized gossip algorithms in terms of message complexity, achieving ε-accuracy with high probability after <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O</i> ( <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</i> loglog <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</i> log[1/(ε)] ) single-hop messages. Key to our analysis is the way in which the network is recursively partitioned. We find that the above scaling law is achieved when subnetworks at scale <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>j</i> contain <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O</i> ( <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</i> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>(2/3)</sup> <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>j</i> ) nodes; then the message complexity at any individual scale is <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O</i> ( <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</i> log[1/ε]). Another important consequence of the hierarchical construction is that the longest distance over which messages are exchanged is <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>O</i> ( <i xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>n</i> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1/3</sup> ) hops (at the highest scale), and most messages (at lower scales) travel shorter distances. In networks that use link-level acknowledgements, this results in less congestion and resource usage by reducing message retransmissions. Simulations illustrate that the proposed scheme is more efficient than state-of-the-art randomized gossip algorithms based on averaging along paths." @default.
• W2032161112 created "2016-06-24" @default.
• W2032161112 creator A5014556542 @default.
• W2032161112 creator A5089819604 @default.
• W2032161112 date "2013-05-01" @default.
• W2032161112 modified "2023-09-27" @default.
• W2032161112 title "Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks" @default.
• W2032161112 cites W1547102391 @default.
• W2032161112 cites W1547358136 @default.
• W2032161112 cites W1605258304 @default.
• W2032161112 cites W1713321477 @default.
• W2032161112 cites W1918250237 @default.
• W2032161112 cites W2002649876 @default.
• W2032161112 cites W2017974631 @default.
• W2032161112 cites W2021505311 @default.
• W2032161112 cites W2026501865 @default.
• W2032161112 cites W2069016875 @default.
• W2032161112 cites W2091221928 @default.
• W2032161112 cites W2108598902 @default.
• W2032161112 cites W2110100895 @default.
• W2032161112 cites W2112611446 @default.
• W2032161112 cites W2115755118 @default.
• W2032161112 cites W2116066327 @default.
• W2032161112 cites W2117905067 @default.
• W2032161112 cites W2122624829 @default.
• W2032161112 cites W2123698134 @default.
• W2032161112 cites W2127850304 @default.
• W2032161112 cites W2152132532 @default.
• W2032161112 cites W2154834860 @default.
• W2032161112 cites W2155869384 @default.
• W2032161112 cites W2168630576 @default.
• W2032161112 cites W2249466852 @default.
• W2032161112 cites W3101392309 @default.
• W2032161112 cites W3211786016 @default.
• W2032161112 cites W630423399 @default.
• W2032161112 doi "https://doi.org/10.1109/tsp.2013.2239992" @default.
• W2032161112 hasPublicationYear "2013" @default.
• W2032161112 type Work @default.
• W2032161112 sameAs 2032161112 @default.
• W2032161112 citedByCount "6" @default.
• W2032161112 countsByYear W20321611122012 @default.
• W2032161112 countsByYear W20321611122013 @default.
• W2032161112 countsByYear W20321611122014 @default.
• W2032161112 countsByYear W20321611122020 @default.
• W2032161112 crossrefType "journal-article" @default.
• W2032161112 hasAuthorship W2032161112A5014556542 @default.
• W2032161112 hasAuthorship W2032161112A5089819604 @default.
• W2032161112 hasBestOaLocation W20321611122 @default.
• W2032161112 hasConcept C11413529 @default.
• W2032161112 hasConcept C154945302 @default.
• W2032161112 hasConcept C15744967 @default.
• W2032161112 hasConcept C162324750 @default.
• W2032161112 hasConcept C26517878 @default.
• W2032161112 hasConcept C31170391 @default.
• W2032161112 hasConcept C34447519 @default.
• W2032161112 hasConcept C38652104 @default.
• W2032161112 hasConcept C41008148 @default.
• W2032161112 hasConcept C62989814 @default.
• W2032161112 hasConcept C77805123 @default.
• W2032161112 hasConcept C80444323 @default.
• W2032161112 hasConceptScore W2032161112C11413529 @default.
• W2032161112 hasConceptScore W2032161112C154945302 @default.
• W2032161112 hasConceptScore W2032161112C15744967 @default.
• W2032161112 hasConceptScore W2032161112C162324750 @default.
• W2032161112 hasConceptScore W2032161112C26517878 @default.
• W2032161112 hasConceptScore W2032161112C31170391 @default.
• W2032161112 hasConceptScore W2032161112C34447519 @default.
• W2032161112 hasConceptScore W2032161112C38652104 @default.
• W2032161112 hasConceptScore W2032161112C41008148 @default.
• W2032161112 hasConceptScore W2032161112C62989814 @default.
• W2032161112 hasConceptScore W2032161112C77805123 @default.
• W2032161112 hasConceptScore W2032161112C80444323 @default.
• W2032161112 hasIssue "9" @default.
• W2032161112 hasLocation W20321611121 @default.
• W2032161112 hasLocation W20321611122 @default.
• W2032161112 hasLocation W20321611123 @default.
• W2032161112 hasOpenAccess W2032161112 @default.
• W2032161112 hasPrimaryLocation W20321611121 @default.
• W2032161112 hasRelatedWork W2034963017 @default.
• W2032161112 hasRelatedWork W2045093162 @default.
• W2032161112 hasRelatedWork W2314476621 @default.
• W2032161112 hasRelatedWork W2329452785 @default.
• W2032161112 hasRelatedWork W2356380379 @default.
• W2032161112 hasRelatedWork W2356557279 @default.
• W2032161112 hasRelatedWork W2361463911 @default.
• W2032161112 hasRelatedWork W2363925233 @default.
• W2032161112 hasRelatedWork W2367467503 @default.
• W2032161112 hasRelatedWork W2743680830 @default.
• W2032161112 hasVolume "61" @default.
• W2032161112 isParatext "false" @default.
• W2032161112 isRetracted "false" @default.
• W2032161112 magId "2032161112" @default.
• W2032161112 workType "article" @default.