Professional Documents
Culture Documents
Protocol in MANETs
ABSTRACT:
Mobile Ad Hoc Networks (MANETs) use anonymous routing protocols that hide
node identities and/or routes from outside observers in order to provide anonymity
protection. However, existing anonymous routing protocols relying on either hop-
by-hop encryption or redundant traffic either generate high cost or cannot provide
full anonymity protection to data sources, destinations, and routes. The high cost
exacerbates the inherent resource constraint problem in MANETs especially in
multimedia wireless applications. To offer high anonymity protection at a low cost,
we propose an Anonymous Location-based Efficient Routing protocol (ALERT).
ALERT dynamically partitions the network field into zones and randomly chooses
nodes in zones as intermediate relay nodes, which form a non-traceable
anonymous route. In addition, it hides the data initiator/receiver among many
initiators/receivers to strengthen source and destination anonymity protection.
Thus, ALERT offers anonymity protection to sources, destinations, and routes. It
also has strategies to effectively counter intersection and timing attacks. We
theoretically analyze ALERT in terms of anonymity and efficiency. Experimental
results exhibit consistency with the theoretical analysis, and show that ALERT
achieves better route anonymity protection and lower cost compared to other
anonymous routing protocols. Also, ALERT achieves comparable routing
efficiency to the GPSR geographical routing protocol.
EXISTING SYSTEM:
PROPOSED SYSTEM:
In order to provide high anonymity protection (for sources, destination, and route)
with low cost, we propose an Anonymous Location-based and Efficient Routing
proTocol (ALERT). ALERT dynamically partitions a network field into zones and
randomly chooses nodes in zones as intermediate relay nodes, which form a
nontraceable anonymous route. Specifically, in each routing step, a data sender or
forwarder partitions the network field in order to separate itself and the destination
into two zones. It then randomly chooses a node in the other zone as the next relay
node and uses the GPSR algorithm to send the data to the relay node. In the last
step, the data is broadcasted to k nodes in the destination zone, providing k-
anonymity to the destination. In addition, ALERT has a strategy to hide the data
initiator among a number of initiators to strengthen the anonymity protection of the
source. ALERT is also resilient to intersection attacks and timing attacks. We
theoretically analyzed ALERT in terms of anonymity and efficiency. We also
conducted experiments to evaluate the performance of ALERT in comparison with
other anonymity and geographic routing protocols.
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
SOFTWARE REQUIREMENTS:-
Haiying Shen,Member, IEEE, and Lianyu Zhao, Student Member, IEEE “ALERT:
An Anonymous Location-Based Efficient Routing Protocol in MANETs”- IEEE
TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 6, JUNE 2013.