Social-Aware Routing for Wireless Mesh Networks

In wireless mesh networks (WMN), most routing algorithms apply broadcasting at some stage of the path discovery process. They thereby consume large chunks of the network throughput. Intelligent rebroadcast algorithms aim to reduce this overhead by calculating the usefulness of a rebroadcast and the likelihood of collisions. Unfortunately, this introduces latency and breaks the rebroadcast chain, resulting in reduced reachability. In this paper we present our Social-aware Routing Protocol with Parallel Collision Guidance Broadcasting for WMN (SCG). It reduces rebroadcasting without a loss in reachability and without a significant increase in latency. Our claims are validated through simulations comparing our algorithm with existing protocols.