Analysis of Qos Aware Cloud Based Routing for Improved Security

  • Rahul M Pethe Priyadarshini Institute of Engineering and Technology, Nagpur
  • G. M. Asutkar Priyadarshini Institute of Engineering and Technology
  • S. M. Asutkar Gondia, Maharashtra, India
Keywords: Anonymity, Qos, Cloud, Security, K-Copy, Aggregation

Abstract

The recent advances and the convergence of micro electro-mechanical systems technology, integrated circuit technologies, microprocessor hardware and Nano-technology, wireless communications, Ad-hoc networking routing protocols, distributed signal processing, and embedded systems have made the concept of Wireless Sensor Networks (WSNs). Sensor network nodes are limited with respect to energy supply, restricted computational capacity and communication bandwidth. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Even though sensor networks are primarily designed for monitoring and reporting events, since they are application dependent, a single routing protocol cannot be efficient for sensor networks across all applications. In this paper, we analyze the design issues of sensor networks and present a classification and comparison of routing protocols. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks. A reliable transmission of packet data information, with low latency and high energy-efficiency, is truly essential for wireless sensor networks, employed in delay sensitive industrial control applications. The proper selection of the routing protocol to achieve maximum efficiency is a challenging task, since latency, reliability and energy consumption are inter-related with each other. It is observed that, Quality of Service (QoS) of the network can improve by minimizing delay in packet delivery, and life time of the network, can be extend by using suitable energy efficient routing protocol.

Downloads

Download data is not yet available.

Author Biographies

Rahul M Pethe, Priyadarshini Institute of Engineering and Technology, Nagpur

Assistant Professor, Priyadarshini Institute of Engineering and Technology, Nsgpur, Maharashtra, India

G. M. Asutkar, Priyadarshini Institute of Engineering and Technology

Vice-Principal, Priyadarshini Institute of Engineering and Technology, Nagpur, Maharashtra, India

S. M. Asutkar, Gondia, Maharashtra, India

Associate Professor, MIET, Gondia, Maharashtra, India

References

A. Pfitzmann and M. Waidner, "Systems without client discernibleness - structure choices," in Advances in Cryptology - EUROCRYPT '85 (F. Pichler, ed.), vol. 219 of Lecture Notes in Computer Science, pp. 245– 253, Springer Berlin Heidelberg, 1986.

B. Levine, M. Reiter, C. Wang, and M. Wright, "Timing assaults in low-dormancy blend frameworks," in Financial Cryptography (A. Juels, ed.), vol. 3110 of Lecture Notes in Computer Science, pp. 251– 265, Springer Berlin Heidelberg, 2004.

J. Kleinberg, "The little world wonder: An algorithmic viewpoint," in Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, STOC '00, pp. 163– 170, ACM, 2000.

P. Mittal, F. Olumofin, C. Troncoso, N. Borisov, and I. Goldberg, "PIR-Tor: Scalable unknown correspondence utilizing private data recovery," in Proceedings of the twentieth USENIX Conference on Security, SEC '11, (Berkeley, CA, USA), pp. 31– 31, USENIX Association, 2011.

G. Danezis, "Measurable exposure assaults," in Security and Privacy in the Age of Uncertainty, IFIP TC11 eighteenth International Conference on Information Security (SEC '03), May 26-28, 2003, Athens, Greece, pp. 421– 426, 2003.

S. Goel, M. Robson, M. Polte, and E. Sirer, "Herbivore: A versatile and proficient convention for unknown correspondence," tech. rep., Cornell University, 2003.

D. I. Wolinsky, H. Corrigan-Gibbs, B. Portage, and A. Johnson, "Adaptable unknown gathering correspondence in the anytrust show," in European Workshop on System Security (EuroSec), vol. 4, 2012.

S. Roos, B. Schiller, S. Programmer, and T. Strufe, "Estimating freenet in the wild: Censorship-flexibility under perception," in Privacy Enhancing Technologies - fourteenth International Symposium, PETS 2014, Amsterdam, The Netherlands, July 16-18, 2014. Procedures, pp. 263– 282, 2014.

C. Tang and I. Goldberg, "An improved calculation for Tor circuit booking," in Proceedings of the seventeenth ACM Conference on Computer and Communications Security, CCS '10, (New York, NY, USA), pp. 329– 339, ACM, 2010.

S. Dolev and R. Ostrobsky, "Xor-trees for effective unknown multicast and gathering," ACM Trans. Inf. Syst. Secur., vol. 3, pp. 63– 84, May 2000.

R. Dingledine and P. Syverson, "Solid MIX course organizes through notoriety," in Financial Cryptography (M. Burst, ed.), vol. 2357 of Lecture Notes in Computer Science, pp. 253– 268, Springer Berlin Heidelberg, 2002.

J. Bos and B. nook Boer, "Location of disrupters in the dc convention," in Advances in Cryptology - EUROCRYPT '89 (J.- J. Quisquater and J. Vandewalle, eds.), vol. 434 of Lecture Notes in Computer Science, pp. 320– 327, Springer Berlin Heidelberg, 1990.

M. Waidner, "Unlimited sender and beneficiary untraceability disregarding dynamic assaults," in Advances in Cryptology - EUROCRYPT '89 (J.- J. Quisquater and J. Vandewalle, eds.), vol. 434 of Lecture Notes in Computer Science, pp. 302– 319, Springer Berlin Heidelberg, 1990.

D. I. Wolinsky, H. Corrigan-Gibbs, B. Portage, and A. Johnson, "Dispute in numbers: Making solid obscurity scale," in Proceedings of the tenth USENIX Conference on Operating Systems Design and Implementation, OSDI '12, pp. 179– 192, USENIX Association, 2012.

M. AlSabah, K. S. Bauer, T. Elahi, and I. Goldberg, "The way less voyaged: Overcoming Tor's bottlenecks with traffic part," in Privacy Enhancing Technologies - thirteenth International Symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013. Procedures, pp. 143– 163, 2013.

M. Waidner and B. Pfitzmann, "The eating cryptographers in the disco: Unconditional sender and beneficiary untraceability with computationally secure usefulness," in Advances in Cryptology - EUROCRYPT '89 (J.- J. Quisquater and J. Vandewalle, eds.), vol. 434 of Lecture Notes in Computer Science, pp. 690– 690, Springer Berlin Heidelberg, 1990.

P. Golle and A. Juels, "Eating cryptographers returned to," in Advances in Cryptology - EUROCRYPT '04 (C. Cachin and J. Camenisch, eds.), vol. 3027 of Lecture Notes in Computer Science, pp. 456– 473, Springer Berlin Heidelberg, 2004.

O. Berthold, H. Federrath, and M. K ¨ohntopp, "Venture namelessness and imperceptibility in the web," in Proceedings of the Tenth Conference on Computers, Freedom and Privacy: Challenging the Assumptions, CFP '00, (New York, NY, USA), pp. 57– 65, ACM, 2000.

P. Wang, I. Osipkov, N. Container, and Y. Kim, "Myrmic: Provably secure and effective DHT steering," tech. rep., DTC, 2006.

O. Berthold, H. Federrath, and S. K ¨opsell, "Web MIXes: A framework for unknown and imperceptible web access," in Designing Privacy Enhancing Technologies, International Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA, July 25-26, 2000, pp. 115– 129, 2000.

R. Dingledine, M. Freedman, D. Hopwood, and D. Molnar, "Areputation framework to build MIX-Net dependability," in Information Hiding (I. Moskowitz, ed.), vol. 2137 of Lecture Notes in Computer Science, pp. 126– 141, Springer Berlin Heidelberg, 2001.

K. Bauer, D. McCoy, D. Grunwald, T. Kohno, and D. More debilitated, "Low-asset steering assaults against Tor," in Proceedings of the 2007 ACM Workshop on Privacy in Electronic Society, WPES '07, (New York, NY, USA), pp. 11– 20, ACM, 2007.

M. K. Reiter and A. D. Rubin, "Groups: Anonymity for web exchanges," ACM Trans. Inf. Syst. Secur., vol. 1, pp. 66– 92, November 1998.

Published
2019-12-17
How to Cite
Pethe, R. M., Asutkar, G. M., & Asutkar, S. M. (2019). Analysis of Qos Aware Cloud Based Routing for Improved Security. Computer Reviews Journal, 5, 117-125. Retrieved from https://purkh.com/index.php/tocomp/article/view/471
Section
Research Articles