Optimal fault-tolerant broadcasting in wireless mesh networks
Wireless mesh networks (WMNs) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. In this paper, we study the broadcasting (one-to-all communication) in WMNs with known topology, i.e. where for each primitive the schedule of transmissions is pre-computed based on full knowledge about the size and the topology of the network. We show that broadcasting can complete in D?+?O(log n) time units in the WMN with size n and diameter D. Moreover, we also propose an optimal O(D)-time deterministic energy efficient broadcasting scheduling, under which each node in the WMN is only allowed to transmit at most once. Furthermore, we explore the fault-tolerant broadcasting in the WMN. We show an O(n)-time deterministic broadcasting schedule with large number of link failures. This is an optimal schedule in the sense that there exists a network topology in which the broadcasting cannot complete in less than ?(n) units of time. Copyright  2009 John Wiley & Sons, Ltd.
fault-tolerance broadcasting wireless mesh networks