A Multi-Objective Genetic Algorithm for constructing load-balanced virtual backbones in probabilistic Wireless Sensor Networks

A Connected Dominating Set (CDS) is used as a Virtual Backbone (VB) for efficient routing and broadcasting in Wireless Sensor Networks (WSNs). Currently, almost all existing works focus on constructing Minimum-sized CDS under the Deterministic Network Model (DNM). However, due to the existence of many probabilistic lossy links in WSNs, it is more practical to obtain a VB under the realistic Probabilistic Network Model (PNM). Moreover, load-balance factor cannot be neglected when constructing a VB to prolong network lifetime. Hence, in this paper, we propose a Multi-Objective Genetic Algorithm (MOGA) to construct a Load-Balanced Virtual Backbone under PNM (LBVBP). Through simulations, we demonstrate that our proposed methods extend network lifetime by 65% on average compared with the existing state-of-the-art approaches.

[1]  Weili Wu,et al.  Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[2]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[3]  Deborah Estrin,et al.  Statistical model of lossy links in wireless sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[4]  CaiZhipeng,et al.  Distributed data collection in large-scale asynchronous wireless sensor networks under the generalized physical interference model , 2013 .

[5]  Jianzhong Li,et al.  O(ε)-Approximation to physical world by sensor networks , 2013, 2013 Proceedings IEEE INFOCOM.

[6]  Shouling Ji,et al.  Snapshot and Continuous Data Collection in Probabilistic Wireless Sensor Networks , 2014, IEEE Transactions on Mobile Computing.

[7]  Carlos A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Comput. Intell. Mag..

[8]  Xiaohua Jia,et al.  Minimum-latency aggregation scheduling in multihop wireless networks , 2009, MobiHoc '09.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[11]  Yi Pan,et al.  Greedy construction of load-balanced virtual backbones in wireless sensor networks , 2014, Wirel. Commun. Mob. Comput..

[12]  Shouling Ji,et al.  Cell-based snapshot and continuous data collection in wireless sensor networks , 2013, TOSN.

[13]  Yi Pan,et al.  Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks , 2013, Theor. Comput. Sci..

[14]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[15]  Yi Pan,et al.  Load-balanced CDS construction in wireless sensor networks via genetic algorithm , 2012, Int. J. Sens. Networks.

[16]  Carlos A. Coello Coello,et al.  Evolutionary multiobjective optimization , 2011, WIREs Data Mining Knowl. Discov..

[17]  Shouling Ji,et al.  Distributed Data Collection in Large-Scale Asynchronous Wireless Sensor Networks Under the Generalized Physical Interference Model , 2013, IEEE/ACM Transactions on Networking.

[18]  Donghyun Kim,et al.  A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[19]  A. Floren,et al.  ' " ' " ' " . " ' " " " " " ' " ' " " " " " : ' " 1 , 2001 .

[20]  Mark A. Shayman,et al.  A p-norm Flow Optimization Problem in Dense Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[21]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[22]  Zhongzhi Shi,et al.  A fast multi-objective evolutionary algorithm based on a tree structure , 2010, Appl. Soft Comput..