Location-aided secure routing scheme in mobile ad hoc networks

Authors:
Do-hyeon Lee;Sun Choi;Ji-hyeon Choi;Jae-il Jung
Affiliations:
Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea;Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea;Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea;Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Year:
2007

Citing 8
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks

Wireless Networks
The quest for security in mobile ad hoc networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Mobile ad hoc networking and the IETF

ACM SIGMOBILE Mobile Computing and Communications Review
Trust based adaptive on demand ad hoc routing protocol

ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
An Efficient Location-Aided Routing Protocol for Mobile Ad Hoc Networks

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
A Secure Routing Protocol for Wireless Ad Hoc Networks

HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
A secure routing protocol SDSR for mobile ad hoc networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new routing scheme that uses geographical position information to minimize the number of intermediate nodes that make a routing path, and to guarantee reliability and security in route establishment process. To achieve this purpose, we first describes the projection-line, the shadow-line, and three types of route request (RREQ) packet to select the closest node to the destination. The safety table is then newly defined by adding a specific subfield to a routing cache to identify the misbehaving nodes. The suggested scheme decreases the number of hops to make up routing path in comparison with the existing one, and exclude malicious nodes from route establishment process.