Latency-Efficient Communication in Wireless Mesh Networks under Consideration of Large Interference Range

Abstract

Wireless Mesh Networking is an emerging communication paradigm to enable resilient, cost‐efficient and reliable services for the future‐generation wireless networks. We study here the minimum‐latency communication primitive of gossiping (all‐to‐all communication) in multi‐hop ad‐hoc Wireless Mesh Networks (WMNs). 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. Minimum‐latency gossiping problem is well known to be NP‐hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. In this paper, we propose a new latency‐efficient approximation scheme that can accomplish gossiping task in polynomial time units in any ad‐hoc WMN under consideration of Large Interference Range (LIR), e.g., the interference range is much larger than the transmission range. To the best of our knowledge, it is first time to investigate such a scenario in ad‐hoc WMNs under LIR, our algorithm allows the labels (e.g., identifiers) of the mesh nodes to be polynomially large in terms of the size of the WMN, which is the first time that the scenario of large labels has been considered in ad‐hoc WMNs under LIR. Furthermore, our gossiping scheme can be considered as a framework which can be easily implied to the scenario under consideration of mobility‐related issues since we assume that the mesh nodes have no knowledge on the network topology even for its neighboring mesh nodes.