A Destination-Initiated Mix Route Algorithm in MANET

Dr. Pooja Sharma, Dr. Smriti Babbar

Abstract


Traditionally, encryption has played an important role in network security. However, it is a misconcep­tion that to secure a network, one only needs to encrypt the traffic. Encryption protects communication partners from disclosure of their secret messages but cannot prevent traffic analysis and the leakage of information about who communicates with whom. In the presence of collaborating adversaries, it becomes very easier for them to reveal communication relations that can danger anonymity. However, reliably providing anonymity is crucial in many applications. In this paper,we explore the design of a MIX-net based anonymity system in mobile ad hoc net works. We focus on hiding the source-destination relationship with respect to each connection. We survey existing MIX route determination algorithms that do not account for dynamic network topology changes, which may result in high packet loss rate and large packet latency. We then introduce adaptive algorithms to overcome this problem. First one is Closest MIX Algorithm for End-to-End Connection and another one is Destination-Initiated MIX Route (DIMR) algorithm.


Keywords


Mobile ad-hoc network, Mix-based network, anonymity,

References


Y. Zhu, X. Fu, B. Graham, R. Bettati, and W. Zhao. On flow correlationattacks and countermeasures in mix networks. InProc. of the Workshop onPrivacy Enhancing Technologies (PET), pages 207–225, Toronto, Canada,May 2004.

M. J. Freedman and R. Morris. Tarzan: A peer-to-peer anonymizing networklayer. In Proc. of the 9th ACM Conference on Computer and CommunicationsSecurity (CCS), pages 193–206, Washington, DC, Nov. 2002.

D. Goldschlag, M. Reed, and P. Syverson. Onion routing for anonymous andprivate internet connections. Communications of the ACM, 42(2):39–41,1999.

M. Rennhard and B. Plattner. Introducing MorphMix: Peer-to-peer basedanonymous internet usage with collusion detection. In Proc. of the Workshopon Privacy in the Electronic Society (WPES), pages 91–102, Washington, DC,Nov. 2002.

M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web transactions.

ACM Transactions on Information and System Security, 1(1):66–92, June

P. F. Syverson, D. M. Goldschlag, and M. G. Reed. Anonymous connectionsand onion routing. In Proc. of the IEEE Symposium on Security and Privacy(SP), pages 44–54, Oakland, CA, Dec. 1997.

S. Basagni, K. Herrin, D. Bruschi, and E. Rosti. Secure pebblenets. In Proc. Ofthe 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc), pages 156–163, Long Beach, CA, Oct. 2001.

C. Gulcu and G. Tsudik. Mixing email with Babel. In Proc. of the IEEE

Symposium on Network and Distributed System Security (NDSS), pages 2–

, San Diego, CA, Feb. 1996.

A. Fasbender, D. Kesdogan, and O. Kubitz. Variable and scalable security:Protection of location information in mobile IP. In Proc. of the 46th IEEEConference on Vehicular Technology (VTC), pages 963– 967, Atlanta, GA,Apr. 1996.

U. Berkeley, LBL, USC/ISI, and Xerox-PARC. The ns Manual (formerly nsNotes and Documentation). 2003.

D. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless

networks. In T. Imielinski and H. Korth, editors, Mobile Computing, volume

, pages 153–181. Kluwer Academic Publishers, 1996.

J. Kong. Anonymous and Untraceable Communications in Mobile WirelessNetworks. Ph.D. dissertation, University of California at Los Angeles, 2004.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




 


All Rights Reserved © 2012 IJARCSEE


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.