Mobile Ad hoc Networks with Security Using Pre-Existing Routing for Green Internet

Authors

  • S. Sailakshmi  Student, Department of CSE, Siddhartha College , Puttur, India
  • B. Chandhramouli  Assistant Professor, Department of CSE ,Siddhartha College Puttur, India

Keywords:

Hop-By-Hop Green Routing, Throughput, Protocols

Abstract

The use of communication security protocols originally developed for wire line and WiFi networks can also place a heavy burden on the limited network resources of a MANET. To address these issues, a novel secure framework (SUPERMAN) is proposed. SUPERMAN presents a novel security framework for MANETs, SUPERMAN. Simulation results comparing SUPERMAN with IPsec, SAODV, and SOLSR are provided to demonstrate the proposed frameworks suitability for wireless communication security. In this paper we study energy conservation in the Internet. We observe that different traffic volumes on a link can result in different energy consumption; this is mainly due to such technologies as trunking (IEEE 802.1AX), adaptive link rates, etc. We design a green Internet routing scheme, where the routing can lead traffic in a way that is green. We differ from previous studies where they switch network components, such as line cards and routers, into sleep mode. We do not prune the Internet topology. We first develop a power model, and validate it using real commercial routers. Instead of developing a centralized optimization algorithm, which requires additional protocols such as MPLS to materialize in the Internet, we choose a hop-by-hop approach. It is thus much easier to integrate our scheme into the current Internet. We progressively develop three algorithms, which are loop-free, substantially reduce energy consumption, and jointly consider green and QoS requirements such as path stretch. We further analyze the power saving ratio, the routing dynamics, and the relationship between hop-by-hop green routing and QoS requirements. We comprehensively evaluate our algorithms through simulations on synthetic, measured, and real topologies, with synthetic and real traffic traces

References

  1. M A. Marsan, L. Chiaraviglio, D. Ciullo, and M. Meo, “Optimal energy savings in cellular access networks,” in Proc. IEEE Int. Conf. Commun. Workshops, 2009, pp. 1–5.
  2. A. P. Bianzino, C. Chaudet, D. Rossi, and J. Rougier, “A survey of green networking research,” IEEE Commun. Surveys Tuts., vol. 14, no. 1, pp. 3– 20, Feb. 2012.
  3. C Gunaratne, K. J. Christensen, B. Nordman, and S. Suen, “Reducing the energy consumption of Ethernet with adaptive link rate (ALR),” IEEE Trans. Comput., vol. 57, no. 4, pp. 448–461, Apr. 2008.
  4. P. Patel-Predd, “Update: Energy-efficient Ethernet,” IEEE Spectr., vol. 45, no. 5, pp. 13–13, May 2008.
  5. M. Gupta and S. Singh, “Greening of the Internet,” in Proc. SIGCOMM, 2003, pp. 19–26.
  6. N Bansal, T. Kimbrel, and K. Pruhs, “Speed scaling to manage energy and temperature,” J. ACM, vol. 54, no. 1, pp. 1–39, Mar. 2007.
  7. H Chan, W. Chan, T. W. Lam, L. Lee, K. Mak, and P. W. H. Wong, “Energy efficient online deadline scheduling,” in Proc. 18th Annu. ACMSIAM Symp. Discr. Algorithms, New Orleans, LA, USA, Jan. 7–9, 2007, pp. 795–804.
  8. M. Garrett, “Powering down,” Commun. ACM, vol. 51, no. 9, pp. 42–46, 2008.
  9. F. F. Yao, A. J. Demers, and S. Shenker, “A scheduling model for reduced CPU energy,” in Proc. 36th Annu. Symp. Found. Comput. Sci., Milwaukee, WI, USA, Oct. 23–25, 1995, pp. 374–382.
  10. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, “Traffic matrix estimation: Existing techniques and new directions,” in Proc. SIGCOMM, 2002, pp. 161–174.
  11. R. G. Gallager, “A minimum delay routing algorithm using distributed computation,” IEEE Trans. Commun., vol. COM-25, no. 1, pp. 73–85, Jan. 1977.
  12. M. Andrews, A. Fernández Anta, L. Zhang, and W. Zhao, “Routing for power minimization in the speed scaling model,” IEEE/ACM Trans. Netw., vol. 20, no. 1, pp. 285–294, Feb. 2012.
  13. Y. Wang, G. Lu, and X. Li, “A study of Internet packet reordering,” in Proc. Int. Conf. Inf. Netw. (ICOIN), 2004, pp. 350–359.
  14. J. A. Aroca, A. Chatzipapas, A. Fernández Anta, and V. Mancuso, “A measurement-based analysis of the energy consumption of data center servers,” in Proc. 5th Int. Conf. Future Energy Syst. e-Energy, 2014, pp. 63–74.
  15. T. Bingmann and D. Yordanov, “Robert Gallager’s minimum delay routing algorithm using distributed computation,” in Proc. Seminar (WS’07), 2007, pp. 15–31.
  16. R. T. Marler and J. S. Arora, “Survey of multi-objective optimization methods for engineering,” Struct. Multidiscip. Optim., vol. 26, no. 6, pp. 369–395, 2004.
  17. L. Zadeh, “Optimality and non-scalar-valued performance criteria,” IEEE Trans. Autom. Control, vol. AC-8, no. 1, pp. 59–60, Jan. 1963.
  18. D. Lee and N. Brownlee, “Passive measurement of one-way and two-way flow lifetimes,” ACM SIGCOMM Comput. Commun. Rev., vol. 37, no. 3, pp. 17–28, 2007.
  19. J. Charzinski, “HTTP/TCP connection and flow characteristics,” Perform. Eval., vol. 42, nos. 2–3, pp. 149–162, 2000.
  20. S. Uhlig, B. Quoitin, J. Lepropre, and S. Balon, “Providing public intradomain traffic matrices to the research community,” Comput. Commun. Rev., vol. 36, no. 1, pp. 83–86, 2006

Downloads

Published

2018-06-30

Issue

Section

Research Articles

How to Cite

[1]
S. Sailakshmi, B. Chandhramouli, " Mobile Ad hoc Networks with Security Using Pre-Existing Routing for Green Internet, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 5, pp.208-212, May-June-2018.