| Document Date: 2005-05-19 08:04:24
Open Document File Size: 157,57 KBShare Result on Facebook
City Springer-Verlag / Las Vegas / / Company ACM Press / SIAM Journal / MDS LP. / / Country France / United States / / Currency pence / USD / / / Facility G. Building / / IndustryTerm classical networks / possible global coordinate systems / elegant algorithm / multihop wireless ad hoc networks / energy constraints / toy-network / Internet latencies / local solutions / coordinate systems / distributed positioning algorithm / energy make ad hoc networks / distributed algorithms / proximity search / wireless ad-hoc / classical systems / possible solutions / above algorithm / graph algorithms / good properties real wireless networks / wireless networks / classical distributed systems / deterministic distributed algorithm / wireless network graphs / clusters yields solutions / mobile ad-hoc networks / wireless multi-hop networks / possible coordinate systems / good algorithms / sensor networks / peer-topeer networks / location services / explicit and more general algorithm / feasible solution / integer solutions / given algorithm / wireless ad hoc networks / large-scale networks / wireless networking / real networks / distributed k-round algorithm / asynchronous systems / wireless nodes / local distributed approximation algorithms / deterministic algorithm / mobile ad hoc networks / local coordinate systems / fractional dominating set solution / computing / parallel algorithm / fractional solutions / described simple algorithm / distributed graph algorithms / nearest neighbor search / randomized distributed algorithm / decomposition algorithm / distributed coloring algorithm / devising fast distributed algorithms / / Organization MDS LP / RELATED WORK Unit / / Person Thomas Moscibroda Roger Wattenhofer / Therefore / vi / / Position General / becoming cluster leader / leader / cluster leader / / ProvinceOrState Nevada / New York / / PublishedMedium Journal of the ACM / SIAM Journal on Computing / Theory of Computing / / Technology above algorithm / three algorithms / randomized algorithm / peer-to-peer / randomized distributed algorithm / time algorithm / GPS / distributed positioning algorithm / extremely elegant algorithm / 5.1 Basic Algorithm / deterministic distributed algorithm / distributed k-round algorithm / graph algorithms / MIS algorithm / distributed algorithm / distributed graph algorithms / distributed coloring algorithm / flow control / Improved distributed algorithms / given algorithm / provably good algorithms / Mobile Computing / deterministic algorithm / time algorithms / local distributed approximation algorithms / DLP / decomposition algorithm / described algorithm / /
SocialTag |
On the Locality of Bounded Growth Fabian Kuhn Thomas Moscibroda Roger Wattenhofer