Revisiting multipoint relay selection in the optimized link state routing protocol

Abstract

The objective of the multipoint relay (MPR) technique is to reduce the number of redundant retransmissions, while ensuring reliable delivery of broadcast messages in wireless networks. To do this, it is necessary to select a small set of re-transmitter nodes, called multipoint relays. Selecting multipoint relays is a fundamental operation in the optimized link-state routing (OLSR) protocol. Research on MPR selection commonly focuses on heuristics. We propose to model MPR selection as a mixed-integer program. Solving this model optimally provides the means to accurately analyse and compare MPR selection heuristics. We also propose a new method for exploring the graph model of the network in order to satisfy the required constraints optimally. We call this exploration method reversible marking. We then combine this reversible marking mechanism with the simple greedy heuristic to create a new OLSR-compliant MPR selection heuristic. Testing has shown that our heuristic offers a good compromise between the need to minimise the number of MPR and the need to insure good coverage.Keywords: optimized link state routing protocol; OLSR; multipoint relay selection; reversible marking.Reference to this paper should be made as follows: Gantsou, D., Sondi, P. and Hanafi, S. (2009) 'Revisiting multipoint relay selection in the optimized link state routing protocol', Int.

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

“…Trust-based MPR choices have been analysed [28] to enhance the security of the system. In [29] the authors propose an heuristic that better takes into consideration the willingness of nodes to be chosen as MPRs. The same work also formalizes the problem of local MPR selection as a mixed-integer problem which can be solved with enough computation power to compare the proposed heuristics with the optimal result.…”

OLSR and approximate distance routing: Loops, black holes, and path stretch

“…The set of MPRs, and MPRs of MPRs, and so on, forms a connected dominating set, which OLSR uses for efficient topology control (TC) message dissemination. There has been extensive effort focused on efficiently computing the small MPR sets (e.g., [11], [12], [13], [14], [15]) 1 . Next, in an effort to reduce the amount of topology information in a message, OLSR only advertises links between a router and its MPRs.…”

An Enhanced MPR-Based Solution for Flooding of Broadcast Messages in OLSR Wireless ad hoc Networks

“…Most solutions to this problem are in the form of heuristics. Representative ones deal with MPR-based flooding techniques [2,4,15,16], as well as reducing the number of collisions or maximizing the bandwidth [7,17]. With respect to link stability, the authors in [18] studied the link lifetime using various mobility models.…”

“…The compilation of MPR lists then builds a database of nodes that are used in the routing process to compute the shortest paths to all possible destinations in the network. Compared to classical link-state algorithms, MPR-based OLSR algorithms have been proved to significantly reduce the number of message re-transmissions and control traffic [1,2,4,7,16,18,19,[22][23][24], to name a few.…”