NeighbourCast: A synchronisation algorithm for wireless ad hoc networks
Presented at the IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge, MA USA
This paper presents a synchronisation algorithm for wire less ad hoc networks called NeighbourCast. The major requirements we impose on the algorithm are a short convergence time, low battery consumption which is achieved by low collision and low channel contention, minimum net work overhead, and a distributed approach. We achieve these by restricting the synchronisation related communication of nodes to only their immediate neighbours. Finally, in order to validate the algorithm a set of simulation results are reported. The results match the maximum clock offset achieved by previous research. We show that this algorithm achieves lower battery consumption by showing that the order of packets sent and received per node is smaller for NeighbourCast than earlier research. We also demonstrate low channel contention and collision probabilities for the proposed algorithm.
|Network routing, multimedia transmission, distributed rendering|
|Software (theme 1), Information (theme 2)|
|Network Infrastructure Support for Convergent Interactive Media|
|IASTED International Conference on Parallel and Distributed Computing and Systems|
|Organisation||Distributed and Interactive Systems|
Vaishnavi, I, Bulterman, D.C.A, César Garcia, P.S, & Gao, B. (2007). NeighbourCast: A synchronisation algorithm for wireless ad hoc networks. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems (pp. 300–315). ACTA Press.