Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Self-organized network-layer security in mobile ad hoc networks
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Proceedings of the 9th annual international conference on Mobile computing and networking
Ant-Based Adaptive Trust Evidence Distribution in MANET
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Establishing trust in pure ad-hoc networks
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Trust evaluation in ad-hoc networks
Proceedings of the 3rd ACM workshop on Wireless security
Cooperation enforcement schemes for MANETs: a survey: Research Articles
Wireless Communications & Mobile Computing - Wireless Network Security
Towards designing a trusted routing solution in mobile ad hoc networks
Mobile Networks and Applications
LARS: a locally aware reputation system for mobile ad hoc networks
Proceedings of the 44th annual Southeast regional conference
Achieving cooperation in multihop wireless networks of selfish nodes
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Trust and Recommendations in Mobile Ad hoc Networks
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
RLM: A General Model for Trust Representation and Aggregation
IEEE Transactions on Services Computing
| Hi-index | 0.00 |
In mobile ad hoc network (MANET) nodes have a tendency to drop others' packet to conserve its own energy. If most of the nodes in a network start to behave in this way, either a portion of the network would be isolated or total network functionality would be hampered. This behavior is known as selfishness. Therefore, selfishness mitigation and enforcing cooperation between nodes is very important to increase the availability of nodes and overall throughput and to achieve the robustness of the network. Both credit and reputation based mechanisms are used to attract nodes to forward others' packets. In light of this, we propose a game theoretic routing model, Secure Trusted Auction oriented Clustering based Routing Protocol (STACRP), to provide trusted framework for MANET. Two auction mechanisms procurement and Dutch are used to determine the forwarding cost-per-hop for intermediate nodes. Our model is lightweight in terms of computational and communication requirements, yet powerful in terms of flexibility in managing trust between nodes of heterogeneous deployments. It manages trust locally with minimal overhead in terms of extra messages. STACRP organizes the network into 1-hop disjoint clusters and elects the most qualified and trustworthy nodes as Clusterhead. The trust is quantified with carefully chosen parameters having deep impact on network functionality. The trust model is analyzed using Markov chain and is proven as continuous time Markov chain. The security analysis of the model is analyzed to guarantee that the proposed approach achieves a secure reliable routing solution for MANETs. The proposed model have been evaluated with a set of simulations that show STACRP detects selfish nodes and enforces cooperation between nodes and achieves better throughput and packet delivery ratio with lees routing overhead compare to AODV.