Several Strategies to Compute the Minimum Stochastic Dominating Sets in Graphs

Wen  Dong; Shi Qiao

doi:10.4028/www.scientific.net/AMM.380-384.1221

Paper Titles

Reliability Model Choice Based on AHP and Entropy Weight-TOPSIS
p.1197

A Queuing Model for IEEE 802.11 DCF Performance Analysis
p.1202

Risk Evaluation of CCIT Model in Ant Colony Housing Supply Based on AHP-Grey Clustering Method
p.1210

A Novel Disruption Operator in Particle Swarm Optimization
p.1216

Several Strategies to Compute the Minimum Stochastic Dominating Sets in Graphs
p.1221

Computer Simulation of the Subwavelength Design for Different Characteristic Equations
p.1226

Research on Clustering Algorithm for Wireless Sensor Networks
p.1231

An Algorithm Based on SIFT Matching Combined SR Saliency Detection with Frequency Segmentation for Remote Sensing Images
p.1235

Efficient Bounded Model Checking for LTL
p.1239

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 380-384Several Strategies to Compute the Minimum...

Several Strategies to Compute the Minimum Stochastic Dominating Sets in Graphs

Abstract:

On this paper, a simple introduction about the concept of the domination set in graphs and the research progress is presented. The definition of stochastic dominating set is introduced as well; We designed several strategies to compute the stochastic dominating set, and analyzed the domination rate using probability theory in the broadcasting model. These strategies have important theory value to solve network communication redundancy package problem.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 380-384)

Pages:

1221-1225

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.380-384.1221

Citation:

Cite this paper

Online since:

August 2013

Authors:

Wen Dong, Shi Qiao

Keywords:

Dominating Set, Domination Rate, Graph Theory, Stochastic Dominating Set

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] T.J. Shi X.M. Fang, Virtual Backbone Network Construction Algorithm Based on Connected Dominating Set,. Computer Engineering, vol. 37, no. 1, pp.116-118, (2011).

Google Scholar

[2] D.Y. Li,D. Zh. Du,X. ZH. Cheng,X. Huang, Polynomial-time approximation scheme for minumun connected dominating set in ad hoc wireless networks. Manuscript, China, (2003).

DOI: 10.1002/net.10097

Google Scholar

[3] K. Wang J.G. Yu, Simple construction strategy for weakly connected dominating set in wireless networks,. Computer Engineering and Applications, vol. 47, no. 20, pp.81-84 , (2011).

Google Scholar

[4] S.G. Li, On connected k-domination numbers of graphs, Discrete Mathematics, vol. 274, pp.303-310, (2004).

DOI: 10.1016/s0012-365x(03)00203-6

Google Scholar

[5] J.M. Xu,F. Tian, Bounds for distance domination number of graphs, Manuscript, China, (2003).

Google Scholar

[6] F. Tian J.M. Xu, Distance irredundance and connected domination numbers of a graph, Manuscript, China, (2004).

Google Scholar

[7] Y.S. Wang W.W. Zhuang,T. ZH. Hu, Conditionally stochastic domination of generalized order statistics from two samples,. Statistical papers, no. 6, pp.369-373, (2010).

DOI: 10.1007/s00362-008-0194-4

Google Scholar

[8] X.F. Zhao, Heuristic Algorithm for Minimum Connected r-hop k-dominating Set, Computer Engineering, vol. 38, no. 21, pp.67-73, (2011).

Google Scholar

[9] H.B. Hunt III S.S. Ravi D.J. Rosenkrantz M.V. Marathe,H. Breu, Simple heuristics for unit disk graphs,. Proceedings of the 4th Canadian Conference on Computational Geometry, pp.244-249, August (1992).

DOI: 10.1002/net.3230250205

Google Scholar

[10] W. Teresa F.H. Haynes, Nordhaus-gaddum inequalities for domination in graphs., Discrete Mathematics, Vol. 155, pp.99-105, (1996).

DOI: 10.1016/0012-365x(94)00373-q

Google Scholar