Balanced Energy Efficient Spanning Tree Approaches for Wireless Sensor Network with Sleep Scheduling Algorithm
DOI:
https://doi.org/10.51983/ajcst-2012.1.1.1663Keywords:
Wireless Sensor network, Partitioning, sleep scheduling algorithm, Localized Minimum spanning tree (LMST), Relative Neighborhood Graph (RNG)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). They are based on the topologies. It is constructed using RNG. Localized Minimum Spanning tree is constructed based on these topologies(LMST).The actual routing tree is constructed based on the transmitter and receiver residual energy. We also consider different parent selection strategies while constructing routing tree and select the best among them. Our solution also involves the load balancing 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, 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
Huseyin Ozgur 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
J.Wuand I.Stojmenovic, “AdHoc Networks,” Computer,vol.37, no.2,pp. 29-31,Feb.2004.
H.O.Tanand I.Korpeoglu, “Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks,” SIGMOD Record, vol.32, no.4,pp. 66-71,2003.
R.Prim, “Shortest Connecting Networks and Some Generalizations,” Bell System Technical J., vol.36,pp. 1389-1401,1957.
N.Li,J.C.Hou, and L. Sha,“Design and Analysis of an mst Based Topology Control Algorithm,” Proc. IEEE INFOCOM, 2003.
H.O.Tan, I.Korpeoglu, and I. Stojmenovic, “A Distributed and Dynamic Data Gathering Protocol for Sensor Networks,”Proc. 21st Int’l Conf. Advanced Networking and Applications, pp. 220-227, 2007.
J.Bachrach and C.Taylor, “Localization in Sensor Networks,” Handbook of Sensor Networks: Algorithms and Architectures, I.Stojmenovic, ed., pp. 277-310, Wiley, 2005.
J.Hightowerand G.Borriello, “Location Systems for Ubiquitous Computing,” Computer, vol.34,no.8,pp. 57-66, Aug.2001.
W.R.Heinzelman, A.Chandrakasan, and H.Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Micro sensor Networks,” Proc. 33rd Ann. Hawaii Int’l Conf. System Sciences,pp.3005-3014,2000.
V.Rodopluand T. Meng, “Minimum Energy Mobile Wireless Networks, ”IEEE J.Selected Areasin Comm., vol.17, no.8, pp.1333-1344, Aug.1999.
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.
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.
I. Stojmenovic and X. Lin, “Power-Aware Localized Routing in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, Nov. 2001.
J.-H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM ’00, pp. 22-31, Mar. 2000. [15] J. Chang and L. Tassiulas, “Maximum Lifetime Routing in Wireless Sensor Networks,” Proc. Advanced Telecomm. and Information Distribution Research Program Conf., 2000.
C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications, p. 90, 1999.
C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” Proc. Int’l Conf. Mobile Computing and Networking, pp. 56-67, 2000.
K. Kalpakis, K. Dasgupta, and P. Namjoshi, “Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks,” Proc. 2002 IEEE Int’l Conf. Networking (ICN ’02), pp. 685-696, Aug.2002.
S. Lindsey and C.S. Raghavendra, “Pegasis: Power-Efficient Gathering in Sensor Information Systems,” Proc. IEEE Aerospace Conf., Mar. 2002.
C.Hua and T.-S.P. Yum, “Optimal Routing and Data Aggregation for Maximizing Lifetime of Wireless Sensor Networks,” IEEE/ACM Trans. Networking, vol. 16, no. 4, pp. 892-903, Aug. 2008.
S.Upadhyayula and S.K.S. Gupta, “Spanning Tree Based Algorithms for Low Latency and Energy Efficient DataAggregation Enhanced Converge cast (DAC) in Wireless Sensor Networks,” Ad Hoc Networking, vol. 5, no. 5, pp. 626-648, 2007.
I.S.-J. Park and I.-R.Sivakumar, “Energy Efficient Correlated Data Aggregation for Wireless Sensor Networks,” Int’l J. Distributed Sensor Networks, vol. 4, no. 1, pp. 13-27, 2008.
M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” The Annals of Applied Probability, vol. 7, no. 2,pp. 340-361, 1997.
S. Hussain and O. Islam, “An Energy Efficient Spanning Tree Based Multi-Hop Routing in Wireless Sensor Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC ’07), pp. 4383-4388, Mar. 2007.
Y. Wu, S. Fahmy, and N.B. Shroff, “On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: Np completeness and Approximation Algorithm,” Proc. IEEE INFOCOM, pp. 356-360, 2008.
F.J. Ovalle-Martinez, I. Stojmenovic, F. Garcia-Nocetti, and J.Solano-Gonzalez, “Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks,” J. Parallel and Distributed Computing, vol. 65, no. 2, pp. 132-141, 2005.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2012 The Research Publication
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
