We study security issues in the Optimized Link State Routing (OLSR) protocol with Quality-of-Service (QoS). We propose the function k-robust-QANS, to construct a Quality Advertisement Neighbor Set (QANS). Given a node v, the one-hop nodes selected as part of its QANS generate routing information to advertise, when possible, a set with k+1 links to reach any two-hop neighbor. Several approaches have been proposed to construct a QANS. However, none of them guarantees that the best links are advertised. A mechanism is presented for QANS construction with guarantee that the best links are advertised with respect to a given routing metric. We present the unadvertised quality links problem when QoS is considered. We also address the slanderer attack, i.e., a misbehaving node that advertises incomplete routing information. Our goal is to find a tradeoff between security and amount of information disseminated. We conduct simulations that confirm our claims