Where have all the MPRs gone? On the optimal selection of Multi-Point Relays

Abstract

Optimized Link State Routing (OLSR) is a widespread routing protocol in wireless mesh networks: static, mobile, ad-hoc, and even sensor networks. The selection of Multi-Point Relays (MPRs) that form a signaling backbone is at the heart of the protocol and it is a crucial process to reduce the signaling overhead. Since the protocol proposal and specification, the original heuristic for MPRs selection has been largely studied showing it has good local properties; however, this does not give insight about the properties of the global set of MPRs. Here lays the contribution of this paper: First we define the problem of the minimization of the global MPR set (the union of all the MPR sets) as a centralized integer linear programming problem, which is NP-hard. We are able to solve it for networks of practical size, up to 150 nodes. Second, we define a bound that we call the "distributed optimum," which we show to be a lower bound for distributed MPR selection algorithms, still requiring considerable power to be computed. Finally, we setup an experimental performance evaluation methodology and we show that a heuristic that we recently proposed performs very close to the distributed optimum, and always outperforms the original heuristic.

Ring-based forwarder selection to improve packet delivery in ultra-dense networks

“…It also has to compute the optimal subset of 1-hop neighbours, which is an NP-complete problem, or use sub-optimal (but more efficient) heuristics. MPRs selection can still be used in denser mesh networks (up to 150 nodes) [9], but requires powerful hardware for mesh nodes and a sufficiently stable network.…”

Improved Proactive Routing Protocol Considering Node Density Using Game Theory in Dense Networks

“…The choice of MPR in OLSR affects routing performance. It is proved that the calculation of the minimum MPRs is an NP-complete problem thus to calculate the MPR set is very difficult, and some heuristic algorithm must be used to find the approximate optimal solution [17]. OLSR uses HELLO messages to find its one-hop neighbours and its two-hop information.…”

A Big Data and machine learning approach for network monitoring and security

“…For 1 week, every 5 minutes we dumped the network topology annotated with the ETX value per link. The whole dataset has been used for several publications and is available online. For this paper we use only one network, the “ninux” network of Rome, made of about 130 nodes.…”