Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Energy Efficiency Using Load Balanced Clustering - Dual Data Uploading In Wireless Sensor Networks

Author : D.Iswarya 1 G.Rajeswari 2

Date of Publication :22nd March 2018

Abstract: In mobile wireless networks, the developing vicinity based applications have prompted the requirement for very compelling and vitality productive neighbor disclosure conventions. The Primary worry in a Wireless Sensor Network is Energy utilization. The primary issue in the system is the point at which the information is sent from hub to sink, the information will be lost because of low vitality of node.The structure utilizes dispersed load adjusted grouping and double information transferring, which is alluded to as LBC-DDU. It comprises of three-layer (I) sensor layer (ii) group head layer, and (iii) portable gatherer (called SenCar layer). At the sensor layer, a disseminated stack adjusted grouping (LBC) calculation is proposed for sensors to self-arrange themselves into bunches. At the bunch head layer, the between group transmission extend is deliberately ensured the network among the bunches. Numerous group heads inside a bunch participate with each other to perform vitality sparing between bunch correspondences

Reference :

    1. Sony, “Sony PS Vita–Near,” [Online]. Available: http://us.playstation. com/psvita
    2. Y. Agarwal et al., “Wireless wakeups revisited: Energy management for VoIP over Wi-Fi smartphones,” in Proc. MobiSys, 2007, pp. 179–191.
    3. M. Bakht, M. Trower, and R. H. Kravets, “Searchlight: Won't you be my neighbor?,” in Proc. MobiCom, 2012, pp. 185–196.
    4. L.D.Baumert, Cyclic Difference Sets. NewYork, NY,USA:
    5. S. Bitan and T. Etzion, “Constructions for optimal constant weight cyclically permutable codes and difference families,” IEEE Trans. Inf. Theory, vol. 41, no. 1, pp. 77–87, Jan. 1995.
    6. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge University Press, 2004.
    7.  F. R. K. Chung, J. A. Salehi, and V. K. Wei, “Optical orthogonal codes: Design, analysis, and applications,” IEEE Trans. Inf. Theory, vol. 35 , no. 3, pp. 595–604, May 1989
    8. P. Dutta and D. E. Culler, “Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications,” in Proc. SenSys, 2008, pp. 71–84.
    9. T. Evans and H. Mann, “On simple difference sets,” Sankhyâ, Indian J. Statist., vol. 11, pp. 357–364, 1951.
    10. E. Felemban et al., “SAND: Sectored-antenna neighbor discovery protocol for wireless networks,” in Proc. IEEE SECON, 2010, pp. 1–9.
    11. H. Han, Y. Liu, G. Shen, Y. Zhang, and Q. Li, “DozyAP: Power-efficient Wi-Fi tethering,” in Proc. MobySys, 2012, pp. 421–434.

Recent Article