Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
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
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Wormhole Attacks Detection in Wireless Ad Hoc Networks: A Statistical Analysis Approach
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18
Local Detection of Selfish Routing Behavior in Ad Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Hi-index | 0.00 |
Locally multipath adaptive routing (LMAR) protocol, classified as a new reactive distance vector routing protocol for MANETs is proposed in this paper. LMAR can find an ad-hoc path without selfish nodes and wormholes using a random search algorithm in polynomial-time. Also when the primary path fails, it discovers an alternative safe path if network graph remains connected after eliminating selfish/malicious nodes. The main feature of LMAR to seek safe route free of selfish and malicious nodes in polynomial time is its searching algorithm and flooding stage that its generated traffic is equiloaded compared to single-path routing protocols but its ability to bypass the attacks is much better than the other multi-path routing protocols. LMAR concept is introduced to provide the security feature known as availability and a simulator has been developed to analyze its behavior. Efficiency of the route discovery stage is analyzed and compared with the previous algorithms.