@inproceedings {Simula.ND.345,
title = {Latency-Optimal Communication in Wireless Mesh Networks},
journal = {Proceedings of the 15th Asia-Pacific Conference on Communications (APCC 2009)},
year = {2009},
publisher = {IEEE},
type = {1},
abstract = {Wireless Mesh Networking (WMN) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study the minimum-latency communication primitive of gossiping (all-to-all communication) in known topology WMNs, i.e., where the schedule of transmissions is pre-computed in advance based on full knowledge about the size and the topology of the Wireless Mesh Network (WMN). Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. The problem of computing a minimum-latency gossiping schedule for a given WMN is NP-hard, hence it is only possible to get a polynomial approximation algorithm. In this paper, we show a deterministic approximation algorithm that can complete gossiping task in (D+\fracΔ{\l}og n}{\l}ogΔ}) time units in any WMN of size n, diameter D, and maximum degree Δ. This is an asymptotically optimal schedule in the sense that there exists a WMN topology, specifically a Δ-regular tree, in which the gossiping task cannot be accomplished in less than {\O}mega(D+\fracΔ{\l}og n}{\l}ogΔ}) units of time. Our algorithm also improves on currently best known gossiping schedule of length O(D+\fracΔ{\l}og n}{\l}ogΔ-{\l}og{\l}og n}}) in [Algorithmica 54(2):226-242, 2009].},
isbn = {978-1-4244-4784-8},
author = {Xin, Qin and Manne, Fredrik}
}