An Approach to Construct Weighted Minimum Spanning Tree in Wireless Sensor Networks
Topology control is critical to extend the lifetime of energy constrained Wireless Sensor Networks (WSNs). Topology control mechanism can be divided into two processes: topology construction and topology maintenance. During topology construction one creates a reduced topology to ensure network connectivity and coverage. In topology maintenance, one recreates or changes the reduced topology when the network is no longer optimal. In this research the authors concentrate on Minimum Spanning Tree (MST) which is a commonly seen problem during the design of a topology construction protocol for WSNs. As the amount of running time and messages successfully delivered are important metrics to measure the efficacy of distributed algorithms, much research to create simple, local and energy efficient algorithms for WSNs thereby creating sub optimal MSTs has been studied. In this research, two popular approaches are discussed to create a Spanning Tree in the WSNs- Random Nearest Neighbor Tree (Random NNT) and Euclidian Minimum Spanning Tree (Euclidian MST). Next, the authors propose a method which has the goals to balance the network load evenly among all of the nodes and increase the number of successful message deliveries to the sink. Finally a comparison between the three algorithms is conducted in the Matlab environment. Simulation results demonstrate significant improvement for both load balancing and number of message deliveries after implementation of the proposed algorithm.
KeywordsTopology construction protocol Minimum Spanning Tree Nearest Neighbor Tree Load balancing Simple Weighted Spanning Tree
Unable to display preview. Download preview PDF.
- 4.Kui, X., Sheng, Y., Du, H., Liang, J.: Constructing a CDS-Based Network Backbone for Data Collection in Wireless Sensor Networks. International Journal of Distributed Sensor Networks 2013, Article ID 258081, 12 (2013), http://dx.doi.org/10.1155/2013/258081
- 5.Mario, P., Rojas, W.: Topology control in wireless sensor networks. PhD Dissertation, University of South Florida (2010)Google Scholar
- 6.Raei, H., Sarram, M., Adibniya, F., Tashtarian, F.: Optimal distributed algorithm for minimum connected dominating sets in Wireless Sensor Networks. In: IEEE Conference on Mobile Ad Hoc and Sensor Systems, pp. 695–700 (2008)Google Scholar
- 7.Butenko, S., Cheng, X., Oliveira, C., Pardalos, P.M.: A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks, pp. 61–73. Kluwer Academic (2004)Google Scholar
- 10.Kumar, V., Arunan, T., Balakrishnan, N.: E-span: Enhanced-span with directional antenna. In: Proceedings of IEEE Conference on Convergent Technologies for Asia-Pacific Region, vol. 2, pp. 675–679 (2002)Google Scholar
- 13.Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14 (1999)Google Scholar
- 14.Yuanyuan, Z., Jia, X., Yanxiang, H.: Energy efficient distributed connected dominating sets construction in wireless sensor networks. In: Proceeding of the 2006 ACM International Conference on Communications and Mobile Computing, pp. 797–802 (2006)Google Scholar
- 15.Wightman, P., Labrador, M.: A3: A topology control algorithm for wireless sensor networks. In: Proceedings of IEEE Globecom (2008)Google Scholar
- 16.Khan, M.A.M.: Distributed Approximation Algorithms for Minimum Spanning Trees and other Related Problems with Applications to Wireless Ad Hoc Networks. Ph.D. Dissertation, Purdue University (December 2007)Google Scholar
- 17.Saha, S.: Topology Control Protocols in Wireless Sensor Networks. MS Thesis, Texas A&M University-Kingsville (May 2014)Google Scholar