Optimal Delay Anonymity Tradeoff in Wireless Network
|International Journal of Computer Science and Engineering|
|© 2016 by SSRG - IJCSE Journal|
|Volume 3 Issue 3|
|Year of Publication : 2016|
|Authors : R.Manivannan, S.Arul Sathya, R.Satheesh Kumar|
How to Cite?
R.Manivannan, S.Arul Sathya, R.Satheesh Kumar, "Optimal Delay Anonymity Tradeoff in Wireless Network," SSRG International Journal of Computer Science and Engineering , vol. 3, no. 3, pp. 17-21, 2016. Crossref, https://doi.org/10.14445/23488387/IJCSE-V3I3P104
Giving secrecy to courses in a remote advertisement network system from inactive spies is considered. Utilizing Shannon's quibble as a data theoretic measure of secrecy, planning techniques are intended for remote hubs utilizing beneficiary coordinated flagging. The achievable rate area for multi-access transfers is portrayed under limitations on normal bundle idleness. The relationship between general system throughput and the course secrecy is acquired by drawing a association with the rate-twisting tradeoff in data hypothesis. A decentralized execution of the transferring system is proposed, what's more, the relating execution dissected.
Network Security, Delay Routing, Anonymity.
 J. Deng, R. Han, and S. Mishra, “Intrusion tolerance and antitrafficanalysis strategies for wireless sensor networks,” inIEEE InternationalConference on Dependable Systems and Networks (DSN), (Florence,Italy), pp. 594–603, June 2004.
 S. Jiang, N. H. Vaidya, and W. Zhao, “A mix route algorithm for mix-netin wireless mobile ad hoc networks,” in Proceedings of IEEE MobileSensor and Ad-hoc and Sensor Systems, pp. 406–415, October 2004.
 D. Chaum, “Untraceable electronic mail, return addresses and digitalpseudonyms,”Communications of the ACM, vol. 24, pp. 84– 88, February1981.
 D. Kesdogan, J. Egner, and R. Buschkes, “Stop-and-go MIXes providingprobabilistic security in an open system,” in Second InternationalWorkshop on Information Hiding (IH’98), Lecture Notes in ComputerScience, vol. 1525, (Portland, Oregon), pp. 83– 98, April 1998.
 A. Serjantov and G. Danezis, “Towards an information theoretic metricfor anonymity,” in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002)(R. Dingledine and P. Syverson, eds.), SpringerVerlag, LNCS 2482, April 2002.
 A. Serjantov, R. Dingledine, and P. Syverson, “From a trickle to aflood: Active attacks on several MIX types,” inProceedings of the FifthInternational Workshop on Information Hiding (IH’02), Lecture Notesin Computer Science, vol. 2578, (Noordwijkerhout, The Netherlands),pp. 36–52, October 2002.
 G. Danezis, R. Dingledine, and N. Mathewson, “Mixminion: designof a type iii anonymous remailer protocol,” in Proceedings of 2003Symposium on Security and Privacy, pp. 2–15, May 2003.
 Y. Zhu, X. Fu, B. Graham, R.Bettati, and W. Zhao, “On flow correlation attacks and countermeasures in mix networks,” in Proceedings ofPrivacy Enhancing Technologies workshop, May 26-28 2004.
 B.Radosavljevic and B. Hajek, “Hiding traffic flow in communicationnetworks,” inMilitary Communications Conference, 1992.
 R. E. Newman, I. S. Moskowitz, P. Syverson, and A. Serjantov, “Metricsfor traffic analysis prevention,” in Proceedings of Privacy EnhancingTechnologies Workshop (PET 2003), Springer-Verlag, LNCS 2760, April2003.
 C. E. Shannon, “Communication theory of secrecy systems,”Bell SystemTechnical Journal, 1949. A. Wyner, “The wiretap channel,”Bell Syst. Tech. J., vol. 54, pp. 1355–1387, 1975.
 I. Csisz´ ar and J. Korner, “Broadcast channels with confidential messages,”IEEE Trans. on Information Theory, vol. 24, pp. 339–348, May1978.
 P. Venkitasubramaniam, T. He, and L. Tong, “Anonymous Networkingamidst Eavesdroppers,” to appear IEEE Transactions on InformationTheory: Special Issue on Information-Thoeretic Security, 2008.
 T. Cover and J. Thomas, Elements of Information Theory. John Wiley& Sons, Inc., 1991