Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
ACM Transactions on Computer Systems (TOCS)
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Secure ad hoc on-demand distance vector routing
ACM SIGMOBILE Mobile Computing and Communications Review
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Performance Comparison of Trust-Based Reactive Routing Protocols
IEEE Transactions on Mobile Computing
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Enabling cross layer design: adding the MadWifi extensions to Nsclick
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Voting-Based Clustering Algorithm with Subjective Trust and Stability in Mobile Ad Hoc Networks
EUC '08 Proceedings of the 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing - Volume 02
An analysis of the exponential decay principle in probabilistic trust models
Theoretical Computer Science
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Wireless Personal Communications: An International Journal
Routing security in wireless ad hoc networks
IEEE Communications Magazine
Future trust management framework for mobile ad hoc networks
IEEE Communications Magazine
Authenticated routing for ad hoc networks
IEEE Journal on Selected Areas in Communications
Information theoretic framework of trust modeling and evaluation for ad hoc networks
IEEE Journal on Selected Areas in Communications
On trust models and trust evaluation metrics for ad hoc networks
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Agent-based multicast opportunistic routing protocol for wireless networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
| Hi-index | 0.00 |
Recently, opportunistic routing has received much attention as a new design direction. It can exploit the wireless broadcast and more highly reliable opportunistic forwarding, so as to substantially increase the throughput of network. Due to dynamic topology, distributed collaboration, limited bandwidth and computing ability, the absence of enough physical protection in Ad hoc networks, opportunistic routing is vulnerable to attacks by malicious nodes. In order to alleviate the malicious behaviors, we incorporate the concept of trust to Ad hoc networks, build a simple trust model to evaluate neighbors' forwarding behavior and apply this model to opportunistic routing for Ad hoc networks. A new trusted opportunistic forwarding model is proposed by choosing the trusted and highest priority candidate forwarder, then a trusted minimum cost routing algorithm (MCOR) is formally formulated, the correctness and effectiveness of this algorithm from theoretical analysis are also approved. Finally, MCOR algorithm is verified by simulation using nsclick software and compared its performance with the classic protocols: ExOR, TAODV and Watchdog-DSR. The simulation results show that MCOR scheme can detect and mitigate node misbehaviors. Furthermore, MCOR scheme outperforms the other protocols in terms of: throughput, delay, Expected ETX, security-gains and cost of routing.