This week's book giveaway is in the Android forum. We're giving away four copies of Head First Android and have Dawn & David Griffiths on-line! See this thread for details.

Hi everyone! I do have a problem regarding time synchronization. The problem is given n clocks c1, c2, ..., cn, with respective time readings t1, t2, ..., tn, the theoretical solution to the time synchronization problem is when the n clocks provide only one exact time t0 at any given time. However, due to the variabilities inherrent to the n clocks, we can accept a practical solution of an average time t0 with a variance σ. The variance could be set to the desired resolution, e.g., 1ms. Given the above scenario, the Berkeley algorithm provides a way to compute for the average time t0 using the different time readings t1, t2, ..., tn. That is simply, t0 = (t1 + t2 + ...+ tn) × n-1. Given the situation how can i discover the node in the network and assign assume one node that it is the server where all the time will be sync to the other client node. Hope you can help me. Thanks a lot.