wireless channel / natural clock synchronization algorithm / basic protocols / real life applications / synchronous algorithms / synchronous algorithm / real time / message-passing algorithm / Wireless TDMA / clock synchronization algorithms / wireless networks / real systems / natural algorithms / layer protocol / sensor networks / hypercube networks / given synchronous algorithm / /
Organization
In Chapter / Lab. for Information and Decision Systems / University of Toronto / /
Person
Baruch Awerbuch / Federico Ferrari / Lewis Girod / David Peleg / David B. Johnson / Nancy Lynch / K. Mani Chandy / Saurabh Ganeriwal / Jeremy Elson / Pascal von Rickenbach / Roger Wattenhofer / Baruch Shieber / Shlomo Moran / Olga Saukh / Nicolas Burri / Jennifer Lundelius / Jeffrey D. Ullman / Rui Fan / Thomas Locher / Gyula Simon / Marco Zimmerling / Rotem Oshman / Ram Kumar / Lothar Thiele / Robert Gallager / Roland Flury / Leslie Lamport / Fabian Kuhn / Deborah Estrin / Mani B. Srivastava / Christoph Lenzen / Branislav Kusy / Amit Kumar Saha / Philipp Sommer / /
Position
guard / leader / cluster leader / /
Product
Archos TV+ Portable Video Player (PVP) / /
ProvinceOrState
California / Massachusetts / /
PublishedMedium
Journal of the ACM / IEEE Transactions on Computers / /
Technology
Flooding Time Synchronization Protocol / message-passing algorithm / natural clock synchronization algorithm / The algorithm / Operating Systems / clock synchronization algorithms / Timingsync Protocol / synchronous algorithm / GHS algorithm / Distributed Minimum Hop Algorithms / layer protocol / TDMA / simulation / given synchronous algorithm / /
102 complexity of the resulting asynchronous algorithm depends on the overhead introduced by the synchronizer. For a synchronizer S, let T (S) and M (S) be the time and message complexities of S for each generated clock