Topology Update Based on Compressed Sensing in WMNs

Abstract

Routing protocols in wireless mesh networks considering its special topology has been an open field for years. Routing methods which are used now could be classified to two groups. Some methods based on common wireless routing protocols with some changes in metrics and other methods based on opportunistic routing methods. In this paper we use the compressed sensing idea to suggest a new topology update protocol for backbone nodes in WMNs. Stable nodes with low probability of failure beside its capability of processing could support a compressed sensing problem for detection of failed links in predefined topology. In our proposed routing method, link states of backbone nodes should be randomly sampled. Then this sampled link states would be coded. All backbone nodes of WMN would be advertised about these codes by some a few nodes which broadcast these codes. So we would have a compressed sense of link states in all nodes. Our proposed verification based reconstruction method could be used in nodes to detection of failed links. Simulation results show that about 60% overhead decrease of routing protocol would be reached by this method with up to 95% probability of correct detection of failed links.