The Community for Technology Leaders
2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2009)
Marrakech, Morocco
Oct. 12, 2009 to Oct. 14, 2009
ISBN: 978-0-7695-3841-9
pp: 239-245
ABSTRACT
We consider the problem of prolonging the lifetime of ad hoc networks, using the OLSR routing protocol, in the presence of selfish nodes. This can be achieved by (1) reducing the number of relay nodes propagating the topology control messages and (2) considering the residual energy levels of these relay nodes. These objectives can be reached by deploying the clustering concept to OLSR. In this paper, we propose a novel clustering algorithm and a relay node selection algorithm based on the residual energy and connectivity index of the nodes. This hybrid model is known as SC-OLSR. The algorithms are designed to cope with selfish nodes. A mechanism design method has been used to develop an incentive compatible mechanism that motivates nodes to behave normally during the protocol process. Incentives increase the reputation of the nodes which receive network services according to their accumulated reputation. Simulation results show that the novel SC-OLSR model based on energy and connectivity can efficiently prolong the network lifetime.
INDEX TERMS
Ad hoc networks, OLSR, clustering, cluster head election and mechanism design
CITATION

A. Chriqi, H. Otrok and J. Robert, "SC-OLSR: Secure Clustering-Based OLSR Model for Ad Hoc Networks," 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications(WIMOB), Marrakech, Morocco, 2009, pp. 239-245.
doi:10.1109/WiMob.2009.48
97 ms
(Ver 3.3 (11022016))