CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Optimum Power Utilization in Wireless Sensor Network using Partition Technique

by T. Sujithra, S. Anbarasu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Number 7
Year of Publication: 2012
Authors: T. Sujithra, S. Anbarasu
10.5120/4833-7091

T. Sujithra, S. Anbarasu . Optimum Power Utilization in Wireless Sensor Network using Partition Technique. International Journal of Computer Applications. 39, 7 ( February 2012), 23-27. DOI=10.5120/4833-7091

@article{ 10.5120/4833-7091,
author = { T. Sujithra, S. Anbarasu },
title = { Optimum Power Utilization in Wireless Sensor Network using Partition Technique },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 39 },
number = { 7 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 23-27 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume39/number7/4833-7091/ },
doi = { 10.5120/4833-7091 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:25:50.275104+05:30
%A T. Sujithra
%A S. Anbarasu
%T Optimum Power Utilization in Wireless Sensor Network using Partition Technique
%J International Journal of Computer Applications
%@ 0975-8887
%V 39
%N 7
%P 23-27
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

We Propose Balanced, Localized, Robust, Dynamic state changing and energy efficient spanning tree approaches for Wireless sensor networks which we call Balanced energy Efficient Spanning Tree with Sleep scheduling(BEESP-SS). In this paper first we construct the spanning tree based on RNG(Relative Neighborhood Graph) after that we find the minimum spanning tree it considers the different parent selection strategies and select the best among them, Our major concern is to balance the load with in the spanning tree, actual spanning tree is constructed based on the transmitter and receiver residual energy. It is done by measuring the energy level of the nodes in the spanning tree, because energy is drain out when large number of messages travelling through the particular node by limiting the messages travelled through the sensor nodes we can improve the lifetime of the spanning tree and reduce the frequency of spanning tree, it is done by partitioning the messages based on the energy level of the node in the spanning tree and redirect the messages to the some other nodes in the spanning tree. The proposed solution also adapted the Sleep Scheduling Algorithm, it wake up the sensor nodes in the network when it is needed. This paper also handles the route maintenance it includes node insertion and node deletion.

References
  1. HuseyinOzgur Tan, Member ,IEEE, Ibrahim Korpeoglu, Member,IEEE and Ivan Stojmenovic,Fellow,IEEE, ”Computing Localized Power Efficient Data Aggregation Trees for sensor networks”,vol 22,March 2011
  2. J.WuandI.Stojmenovic,“AdHocNetworks,”Computer,vol.37,no.2,pp. 29-31,Feb.2004.
  3. H.O¨.TanandI.Korpeoglu,“PowerEfficientDataGatheringand AggregationinWireless SensorNetworks,”SIGMODRecord,vol.32,no.4,pp. 66-71,2003.
  4. R.Prim,“ShortestConnectingNetworksandSome Generalizations,”BellSystemTechnicalJ.,vol.36,pp.1389-1401,1957.
  5. N.Li,J.C.Hou,and L.Sha,“Design and AnalysisofanmstBasedTopologyControlAlgorithm,”Proc.IEEEINFOCOM,2003.
  6. H.O.Tan, I.Korpeoglu, andI. Stojmenovic,“ADistributedand DynamicData GatheringProtocol for Sensor Networks,”Proc. 21st Int’l Conf.Advanced NetworkingandApplications,pp. 220-227,2007.
  7. J.Bachrachand C.Taylor, “LocalizationinSensorNetworks,”Handbook of Sensor Networks: Algorithms and Architectures,I.Stojmenovic, ed.,pp. 277-310,Wiley, 2005.
  8. J.HightowerandG.Borriello, “LocationSystemsforUbiquitousComputing,”Computer,vol.34,no.8,pp. 57-66,Aug.2001.
  9. W.R.Heinzelman, A.Chandrakasan,andH.Balakrishnan,“Energy-EfficientCommunicationProtocol for Wireless Micro sensor Networks,”Proc. 33rd Ann. Hawaii Int’lConf. System Sciences,pp.3005-3014,2000.
  10. V.Rodopluand T. Meng, “MinimumEnergy MobileWirelessNetworks,”IEEE J.SelectedAreasinComm.,vol.17,no.8,pp.1333-1344, Aug.1999.
  11. S.Singh,M.Woo,and C.S.Raghavendra,“Power-AwareRoutinginMobile Ad HocNetworks,”Proc.Int’lConf.MobileComputing andNetworking,pp. 181-190,1998.
  12. S. Singh, M. Woo, and C.S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. Int’l Conf. Mobile Computing and Networking, pp. 181-190, 1998.
  13. I. Stojmenovic and X. Lin, “Power-Aware Localized Routing inWireless Networks,” IEEE Trans. Parallel and Distributed Systems,vol. 12, no. 11, pp. 1122-1133, Nov. 2001.
  14. J.-H. Chang and L. Tassiulas, “Energy Conserving Routing inWireless Ad-Hoc Networks,” Proc. IEEE INFOCOM ’00, pp. 22-31,Mar. 2000.
  15. J. Chang and L. Tassiulas, “Maximum Lifetime Routing inWireless Sensor Networks,” Proc. Advanced Telecomm. and InformationDistribution Research Program Conf., 2000.
  16. C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand DistanceVector Routing,” Proc. Second IEEE Workshop Mobile ComputingSystems and Applications, p. 90, 1999.
  17. C. Intanagonwiwat, R. Govindan, and D. Estrin, “DirectedDiffusion: A Scalable and Robust Communication Paradigm forSensor Networks,” Proc. Int’l Conf. Mobile Computing and Networking,pp. 56-67, 2000.
  18. K. Kalpakis, K. Dasgupta, and P. Namjoshi, “Maximum LifetimeData Gathering and Aggregation in Wireless Sensor Networks,”Proc. 2002 IEEE Int’l Conf. Networking (ICN ’02), pp. 685-696, Aug.2002.
  19. S. Lindsey and C.S. Raghavendra, “Pegasis: Power-EfficientGathering in Sensor Information Systems,” Proc. IEEE AerospaceConf., Mar. 2002.
  20. C.Hua and T.-S.P. Yum, “Optimal Routing and Data Aggregationfor Maximizing Lifetime of Wireless Sensor Networks,” IEEE/ACM Trans. Networking, vol. 16, no. 4, pp. 892-903, Aug. 2008.
  21. S.Upadhyayula and S.K.S. Gupta, “Spanning Tree BasedAlgorithms for Low Latency and Energy Efficient Data AggregationEnhanced Convergecast (DAC) in Wireless Sensor Networks,”Ad Hoc Networking, vol. 5, no. 5, pp. 626-648, 2007.
  22. I.S.-J. Park and I.-R.Sivakumar, “Energy Efficient Correlated DataAggregation for Wireless Sensor Networks,” Int’l J. DistributedSensor Networks, vol. 4, no. 1, pp. 13-27, 2008.
  23. M.D. Penrose, “The Longest Edge of the Random MinimalSpanning Tree,” The Annals of Applied Probability, vol. 7, no. 2,pp. 340-361, 1997.
  24. S. Hussain and O. Islam, “An Energy Efficient Spanning TreeBased Multi-Hop Routing in Wireless Sensor Networks,” Proc.IEEE Wireless Comm. and Networking Conf. (WCNC ’07), pp. 4383-4388, Mar. 2007.
  25. Y. Wu, S. Fahmy, and N.B. Shroff, “On the Construction of aMaximum-Lifetime Data Gathering Tree in Sensor Networks: Npcompletenessand Approximation Algorithm,” Proc. IEEE INFOCOM,pp. 356-360, 2008.
  26. F.J. Ovalle-Martinez, I. Stojmenovic, F. Garcia-Nocetti, and J.Solano-Gonzalez, “Finding Minimum Transmission Radii forPreserving Connectivity and Constructing Minimal SpanningTrees in Ad Hoc and Sensor Networks,” J. Parallel and DistributedComputing, vol. 65, no. 2, pp. 132-141, 2005.
Index Terms

Computer Science
Information Sciences

Keywords

Wireless Sensor network Partitioning sleep scheduling algorithm Localized Minimum spanning tree(LMST) Relative Neighborhood Graph(RNG)

Powered by PhDFocusTM