L
Laurent Viennot
Researcher at University of Paris
Publications - 130
Citations - 7043
Laurent Viennot is an academic researcher from University of Paris. The author has contributed to research in topics: Optimized Link State Routing Protocol & Flooding (computer networking). The author has an hindex of 26, co-authored 116 publications receiving 6852 citations. Previous affiliations of Laurent Viennot include SAGEM & French Institute for Research in Computer Science and Automation.
Papers
More filters
Optimized Link State Routing Protocol
TL;DR: Urethane prepolymer compositions are made from 1- isocyanato-3-isocyanatomethyl-3,5,5-trimethyl cyclohexane and polyols at a total NCO to OH ratio of at least 1.2:1, and the prepolymers are reacted with cycloaliphatic polyamines to give urea-urethanes.
Proceedings ArticleDOI
Optimized link state routing protocol for ad hoc networks
TL;DR: OLSR is an optimization over a pure link state protocol as it compacts the size of information sent in the messages, and furthermore, reduces the number of retransmissions to flood these messages in an entire network.
Proceedings ArticleDOI
Multipoint relaying for flooding broadcast messages in mobile wireless networks
TL;DR: The mechanism of multipoint relays (MPRs) to efficiently flood broadcast messages in mobile wireless networks is discussed and a heuristic to select these MPRs in a mobile wireless environment is proposed, and it is proved that the computation of a multipoint relay set with minimal size is NP-complete.
Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks
TL;DR: The principle and the functioning of multipoint relays are discussed, and a heuristic to select these MPRs in a mobile wireless environment is proposed, and it is proved that the computation of a multipoint relay set with minimal size is NP-complete.
Journal ArticleDOI
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
TL;DR: A O(n+mlogn) algorithm for transitive orientation of a comparability graph, and simple linear algorithms to recognize interval graphs, convex graphs, Y-semichordal graphs and matrices that have the consecutive ones property are given.