OLSR and MPR: Mutual Dependences and Performances

Since the initial draft, the Optimized Link State Routing (OLSR) protocol has been associated with the Multipoint Relay (MPR) protocol to reduce the flooding of OLSR topological messages. Many papers have been written on solutions to improve OLSR by replacing MPR by another topology control protocol, or by modifying MPR heuristic. But few of them have dealt with the particular interactions between MPR and OLSR. In this chapter, we argue that OLSR optimality is bound to the deep cooperation between MPR and OLSR. We also illustrate how OLSR suffers from convergence problems, and finally suggest that solving these convergence issues will open new paths to improve OLSR.

[1]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[2]  Philippe Jacquet,et al.  Flooding Techniques in Mobile Ad Hoc Networks , 2003 .

[3]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[5]  Philippe Jacquet.  Performance of Connected Dominating Set in OLSR protocol , 2003 .

[6]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[7]  Christian Bonnet,et al.  DDR-distributed dynamic routing algorithm for mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[8]  Christian Bonnet,et al.  DDR: distributed dynamic routing algorithm for mobile ad hoc networks , 2000, MobiHoc.

[9]  StojmenovicIvan,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002 .

[10]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[11]  Julio Solano-González,et al.  Finding minimum transmission radii for preserving connectivity and constructing minimal spanning trees in ad hoc and sensor networks , 2005, J. Parallel Distributed Comput..

[12]  Nathalie Mitton,et al.  An analysis of the Multi-Point Relays selection in OLSR , 2005 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Philippe Jacquet,et al.  Computing Connected Dominated Sets with Multipoint Relays , 2005, Ad Hoc Sens. Wirel. Networks.

[15]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[16]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[17]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[18]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[19]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1979, TOPL.

[20]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.