CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

To Find Energy Efficient Protocol by using Minimum Spanning Tree

by Ankush Uppal, Ramanjot Kaur
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 178 - Number 33
Year of Publication: 2019
Authors: Ankush Uppal, Ramanjot Kaur
10.5120/ijca2019919199

Ankush Uppal, Ramanjot Kaur . To Find Energy Efficient Protocol by using Minimum Spanning Tree. International Journal of Computer Applications. 178, 33 ( Jul 2019), 6-11. DOI=10.5120/ijca2019919199

@article{ 10.5120/ijca2019919199,
author = { Ankush Uppal, Ramanjot Kaur },
title = { To Find Energy Efficient Protocol by using Minimum Spanning Tree },
journal = { International Journal of Computer Applications },
issue_date = { Jul 2019 },
volume = { 178 },
number = { 33 },
month = { Jul },
year = { 2019 },
issn = { 0975-8887 },
pages = { 6-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume178/number33/30749-2019919199/ },
doi = { 10.5120/ijca2019919199 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:52:05.843677+05:30
%A Ankush Uppal
%A Ramanjot Kaur
%T To Find Energy Efficient Protocol by using Minimum Spanning Tree
%J International Journal of Computer Applications
%@ 0975-8887
%V 178
%N 33
%P 6-11
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Remote Sensor Networks (WSN) alludes to a gathering of moment, low power-driven sensor hubs that are spatially circulated to check the various environmental conditions. These sensor nodes are lightweight in nature, have constrained computational ability and correspondence transfer speed. These sensor hubs are little, savvy detecting and imparting gadgets that are modified for detecting the earth conditions (like fire, mugginess, and so forth), assembling the information and handling it to draw shifted expressive data. Vitality utilization is the significant outline issue which emerges while planning the directing conventions for WSNs. Since WSN conventions are subjected to the sort of use for which they are being set, so the routing conventions intended for the system ought to have the capacity to satisfy every one of the prerequisites of the application. The real issue identified with the outlining of the conventions is to draw out the lifetime of the system i.e. the sensor hubs in the system get by in the system for a more drawn out timeframe without depleting off their full energy. In this paper, a routing scheme based on minimum spanning tree generation along with partitioning the network into grids is proposed. This methodology depends on the idea of Grid i.e. partitioning the network area into parts in view of isolating the nodes from each other and then in-turn generating Minimum Spanning Tree (MST) structure for communication among sensor nodes. Proposed scheme i.e. one MST at node level inside a grid and other at Grid head level between various grids so as to diminish the heap and increment the system lifetime of WSN.

References
  1. Li, Changle, et al. "A survey on routing protocols forlarge-scale wireless sensor networks." Sensors 11.4 (2011): 3498-3526.
  2. Manjeshwar, Arati, and Dharma P. Agrawal. "TEEN: a routing protocol for enhanced efficiency in wireless sensor networks." In Parallel and Distributed Processing Symposium, International, vol. 3, pp. 30189a-30195a, IEEE Computer Society, 2001.
  3. Nikolidakis, Stefanos A., et al. "Energy efficient routing in wireless sensor networks through balanced clustering." Algorithms 6.1 (2013): 29-42.
  4. Nikolidakis, Stefanos A., et al. "Energy efficient routing in wireless sensor networks through balanced clustering." Algorithms 6.1 (2013): 29-42.
  5. Nikolidakis, Stefanos A., et al. "Energy efficient routing in wireless sensor networks through balanced clustering." Algorithms 6.1 (2013): 29-42.
  6. Nikolidakis, Stefanos A., et al. "Energy efficient routing in wireless sensor networks through balanced clustering." Algorithms 6.1 (2013): 29-42.
  7. kkaya, Kemal, and Mohamed Younis. "A survey on routing protocols for wireless sensor networks." Ad hoc networks 3.3 (2005): 325-349.
  8. Bathla Gaurav, Khan Gulista “Minimum Spanning Tree based Routing Strategy for Homogeneous WSN”, International Journal on Cloud Computing Services and Architecture (IJCCSA), vol.1, issue 2, pp. 22-29, August 2011.
  9. Bathla Gaurav, Khan Gulista “Minimum Spanning Tree based Routing Strategy for Homogeneous WSN”, International Journal on Cloud Computing Services and Architecture (IJCCSA), vol.1, issue 2, pp. 22-29, August 2011.
  10. Bathla Gaurav, Khan Gulista “Minimum Spanning Tree based Routing Strategy for Homogeneous WSN”, International Journal on Cloud Computing Services and Architecture (IJCCSA), vol.1, issue 2, pp. 22-29, August 2011.
  11. Bathla Gaurav, Khan Gulista “Minimum Spanning Tree based Routing Strategy for Homogeneous WSN”, International Journal on Cloud Computing Services and Architecture (IJCCSA), vol.1, issue 2, pp. 22-29, August 2011.
  12. Khan, Abdul Waheed, Abdul Hanan Abdullah, Mohammad AbdurRazzaque, and Javed Iqbal Bangash. "VGDRA: a virtual grid-based dynamic routes adjustment scheme for mobile sink-based wireless sensor networks." IEEE sensors journal 15, no. 1 (2015): 526-534.
  13. Heinzelman, Wendi Rabiner, AnanthaChandrakasan, and Hari Balakrishnan. "Energy-efficient communication protocol for wireless microsensor networks." In System sciences, Proceedings of the 33rd annual Hawaii international conference, pp. 1-10, IEEE, 2000.
  14. Heinzelman, Wendi Rabiner, AnanthaChandrakasan, and Hari Balakrishnan. "Energy-efficient communication protocol for wireless microsensor networks." In System sciences, Proceedings of the 33rd annual Hawaii international conference, pp. 1-10, IEEE, 2000.
  15. Lindsey, Stephanie, and Cauligi S. Raghavendra. "PEGASIS: Power-efficient gathering in sensor information systems." In Aerospace conference proceedings, vol. 3, pp. 1125-1130, IEEE, 2002.
  16. B. Tang, J. Wang, X. Geng, Y. Zheng, and J.-U. Kim, “A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink,” nt. J. Grid Distrib. Comput., vol. 5, no. 3, pp. 133–140, 2012.
  17. B. Tang, J. Wang, X. Geng, Y. Zheng, and J.-U. Kim, “A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink,” nt. J. Grid Distrib. Comput., vol. 5, no. 3, pp. 133–140, 2012.
  18. B. Tang, J. Wang, X. Geng, Y. Zheng, and J.-U. Kim, “A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink,” nt. J. Grid Distrib. Comput., vol. 5, no. 3, pp. 133–140, 2012.
  19. B. Tang, J. Wang, X. Geng, Y. Zheng, and J.-U. Kim, “A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink,” nt. J. Grid Distrib. Comput., vol. 5, no. 3, pp. 133–140, 2012.
  20. Tan, HüseyinÖzgür, and Ibrahim Körpeoǧlu. "Power efficient data gathering and aggregation in wireless sensor networks." ACM Sigmod Record, vol. 32, issue 4, pp. 66-71, 2003.
  21. Z. H. Mir and Y.-B. Ko, “A quadtree-based data dissemination protocol for wireless sensor networks with mobile sinks,” in Proc. Personal Wireless Commun., 2006, pp. 447–458.
Index Terms

Computer Science
Information Sciences

Keywords

WSN Routing Minimum Spanning Tree Energy Efficiency

Powered by PhDFocusTM