Proceedings of the 9th annual international conference on Mobile computing and networking
Cluster-based OLSR extensions to reduce control overhead in mobile ad hoc networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes
IEEE Transactions on Mobile Computing
A game-theoretic intrusion detection model for mobile ad hoc networks
Computer Communications
Autonomic trust reasoning enables misbehavior detection in OLSR
Proceedings of the 2008 ACM symposium on Applied computing
An Energy Efficient Routing Based on OLSR in Wireless Ad Hoc and Sensor Networks
AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
Security and Cooperation in Wireless Networks: Thwarting Malicious and Selfish Behavior in the Age of Ubiquitous Computing
CSR: Constrained Selfish Routing in Ad-Hoc Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
SC-OLSR: Secure Clustering-Based OLSR Model for Ad Hoc Networks
WIMOB '09 Proceedings of the 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Cognitive Radio Networking and Security: A Game-Theoretic View
Cognitive Radio Networking and Security: A Game-Theoretic View
HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks
IEEE Communications Magazine
Reputation-Based Cooperative Detection Model of Selfish Nodes in Cluster-Based QoS-OLSR Protocol
Wireless Personal Communications: An International Journal
A new dynamic hierarchical reputation evaluation scheme for hybrid wireless mesh networks
Computers and Electrical Engineering
| Hi-index | 0.24 |
We consider the problem of assuring the trustworthiness (i.e. reliability and robustness) and prolonging the lifetime of wireless ad hoc networks, using the OLSR routing protocol, in the presence of selfish nodes. Assuring the trustworthiness of these networks can be achieved by selecting the most trusted paths, while prolonging the lifetime can be achieved by (1) reducing the number of relay nodes (MPR) propagating the topology control (TC) messages and (2) considering the residual energy levels of these relay nodes in the selection process. In this paper, we propose a novel clustering algorithm and a relay node selection algorithm based on the residual energy level and connectivity index of the nodes. This hybrid model is referred to as H-OLSR. The OLSR messages are adapted to handle the cluster heads election and the MPR nodes selection algorithms. These algorithms are designed to cope with selfish nodes that are getting benefits from others without cooperating with them. Hence, we propose an incentive compatible mechanism that motivates nodes to behave truthfully during the selection and election processes. Incentive retributions increase the reputation of the nodes. Since network services are granted according to nodes' accumulated reputation, the nodes should cooperate. Finally, based on nodes' reputation, the most trusted forwarding paths are determined. This reputation-based hybrid model is referred to as RH-OLSR. Simulation results show that the novel H-OLSR model based on energy and connectivity can efficiently prolong the network lifetime, while the RH-OLSR model improves the trustworthiness of the network through the selection of the most trusted paths based on nodes' reputations. These are the two different processes used to define the reputation-based clustering OLSR (RBC-OLSR) routing protocol.