Abstract
Minimum Connected Dominating Sets (MCDSs) are used as virtual backbones for efficient routing and broadcasting in wireless networks extensively. However, the MCDS problem is NP-Complete even in Unit Disk Graphs. Therefore, many heuristic-based approximation algorithms have been proposed recently. In these approaches, networks are deterministic where two nodes are assumed either connected or disconnected. In most real applications, however, there are many intermittently connected wireless links called lossy links, which only provide probabilistic connectivity. For wireless networks with lossy links, we propose a Probabilistic Network Model (PNM). Under this model, we measure the quality of Connected Dominating Sets (CDSs) using CDS reliability defined as the minimum upper limit of the node-to-node delivery ratio between any pair of dominators in a CDS. We attempt to construct a MCDS while its reliability is above a preset application-specified threshold, called Reliable MCDS (RMCDS). We claim that constructing a RMCDS is NP-Hard under the PNM model. We propose a novel Genetic Algorithm (GA) called RMCDS-GA to solve the RMCDS problem. To evaluate the performance of RMCDS-GA, we conduct comprehensive simulations. The simulation results show that compared with the traditional MCDS algorithms, RMCDS-GA can construct a more reliable CDS without increasing the size of a CDS.
This work is partly supported by the NSF under grant No. CCF-0545667, CNS-0831634, and by the 111 project of China under the grant No. 111-2-14.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wassim, E.H., Ala, A.F., Mohsen, G., Chen, H.H.: On Efficient Network Planning and Routing in Large-Scale MANETs. IEEE Transactions on Vehicular Technology 58(7) (2009)
Polat, B.K., Sachdeva, P., Ammar, M.H., Zegura, E.W.: Message Ferries as Generalized Dominating Sets in Intermittently Connected Mobile Networks. In: MobiOpp 2010, Pisa, Italy (2010)
Helmy, A., Garg, S., Pamu, P., Nahata, N.: CARD: A Contact-based Architecture for Resource Discovery in Ad Hoc Networks. MONET 10(1), 99–113 (2004)
Deb, B., Bhatnagar, S., Nath, B.: Multi-resolution state retrieval in sensor networks. In: IWSNPA (2003)
Ammari, H.M., Giudici, J.: On the Connected k-Coverage Problem in Heterogeneous Sensor Nets: The Curse of Randomness and Heterogeneity. In: ICDCS (2009)
Ji, S., Li, Y., Jia, X.: Capacity of Dual-Radio Multi-Channel Wireless Sensor Networks for Continuous Data Collection. In: Infocom (2011)
Wan, P.J., Huang, S.C.-H., Wang, L., Wan, Z., Jia, X.: Minimumlatency aggregation scheduling in multihop wireless networks. In: MobiHoc 2009 (2009)
Ephremides, A., Wieselthier, J., Baker, D.: A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling. Proceeding of the IEEE 75(1), 56–73 (1987)
Guha, S., Khuller, S.: Approximation Algorithms for Connected Domimating Sets. Algorithmica 20, 374–387 (1998)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman & Co., New York (1979)
Wu, J., Li, H.: On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In: DIALM (1999)
Li, Y., Thai, M., Wang, F., Yi, C., Wang, P., Du, D.: On Greedy Construction of Connected Dominating Sets in Wireless Networks. Wireless Comm. and Mobile Computing 5(8), 927–932 (2005)
Cerpa, A., Wong, J., Kuang, L., Potkonjak, M., Estrin, D.: Statistical model of lossy links in wireless sensor networks. In: IPSN 2005, Los Angeles, CA (2005)
Liu, Y., Zhang, Q., Ni, L.-M.: Opportunity-Based Topology Control in Wireless Sensor Networks. In: TPDS 2010, vol. 21(9) (2010)
Wan, P.J., Huang, S.C.-H., Wang, L., Wan, Z., Jia, X.: Minimum-latency aggregation scheduling in multihop wireless networks. In: MobiHoc (2009)
Agrawal, A., Barlow, R.: A Survey of Network Reliability and Domination Theory. Operations Research 32, 298–323 (1984)
Hu, X., Zhang, J., Yu, Y., Chung, H., Lim, Y., Shi, Y., Luo, X.: Hybrid Genetic Algorithm Using a Forward Encoding Scheme for Lifetime Maximization of Wireless Sensor Networks. ITECÂ 14(5) (2010)
Holland, J.H.: Adaptation in Natural and Artificial System. University of Michigan Press, Ann Arbor (1975)
Karp, B., Kung, H., GPSR: greedy perimeter stateless routing for wireless networks. In: MobiCom 2000, New York, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, J.(., Cai, Z., Ji, S., Beyah, R., Pan, Y. (2011). A Genetic Algorithm for Constructing a Reliable MCDS in Probabilistic Wireless Networks. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2011. Lecture Notes in Computer Science, vol 6843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23490-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-23490-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23489-7
Online ISBN: 978-3-642-23490-3
eBook Packages: Computer ScienceComputer Science (R0)