Finding minimum weight connected dominating set in stochastic graph based on learning automata

Information Sciences

Volumn 200, Issue , 2012, Pages 57-77

  Akbari Torkestani, Javad ^a   Meybodi, Mohammad Reza ^b  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Dominating set; Learning automata; Minimum connected dominating set; Stochastic graph

Indexed keywords

ARBITRARY GRAPHS; BACKBONE NODES; CONNECTED DOMINATING SET; CONNECTED DOMINATING SETS; DOMINATING SETS; GRAPH VERTEX; HEURISTICS AND APPROXIMATIONS; LEARNING AUTOMATA; LEARNING RATES; MINIMUM CONNECTED DOMINATING SET; MINIMUM WEIGHT; NUMBER OF SAMPLES; RANDOM WEIGHT; ROUTING NODE; ROUTING OVERHEADS; SAMPLING RATES; STANDARD SAMPLING METHODS; STOCHASTIC GRAPHS; VIRTUAL BACKBONE;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; STOCHASTIC SYSTEMS;

AD HOC NETWORKS;

EID: 84860290983     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2012.02.057     Document Type: Article

References (46)

1. J. Akbari Torkestani, M.R. Meybodi, Approximating the minimum connected dominating set in stochastic graphs based on learning automata, in: Proceedings of International Conference on Information Management and Engineering (ICIME 2009), Malaysia, 2009, pp. 672-676.
2. F.B. Alt, Bonferroni inequalities and intervals, in: Encyclopedia of Statistical Sciences, vol. 1, 1982, pp. 294-301.
3. K.M. Alzoubi, X.-Y. Li, Y. Wang, P.J. Wan, and O. Frieder Geometric spanners for wireless ad hoc network IEEE Transactions on Parallel and Distributed Systems 14 4 2003 408 421
4. K.M. Alzoubi, P.J. Wan, and O. Frieder Distributed heuristics for connected dominating sets in wireless ad hoc networks Journal of Communications and Networks 4 1 2002 22 29
5. K.M. Alzoubi, P.J. Wan, O. Frieder, New distributed algorithm for connected dominating set in wireless ad hoc networks, in: Proceedings of the 35th Hawaii International Conference on System Sciences, 2002.
6. K.M. Alzoubi, P.-J. Wan, and O. Frieder Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad hoc networks International Journal of Foundations of Computer Science 14 2 2003 287 303
7. S. Basagni, D. Bruschi, and I. Chlamtac A mobility-transparent deterministic broadcast mechanism for ad hoc network IEEE/ACM Transactions on Networking 7 6 1999 799 807 (Pubitemid 30553378)
8. S. Basagni, M. Conti, S. Giordano, and I. Stojmenovic Mobile Ad Hoc Networking 2004 IEEE Press
9. J. Akbari Torkestani, and M.R. Meybodi A link stability-based multicast routing protocol for wireless mobile ad hoc networks Journal of Network and Computer Applications 34 4 2011 1429 1440
10. C.E. Bonferroni, Teoria Statistica Delle Classi e Calcolo Delle Probabilit'a, Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commerciali di Firenze, vol. 8, 1936, pp. 3-62.
11. O. Booij, Z. Zivkovic, and B. Kröse Efficient data association for view based SLAM using connected dominating sets Robotics and Autonomous Systems 57 12 2009 1225 1234
12. S. Butenko, X. Cheng, C. Oliveira, and P.M. Pardalos A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks Recent Developments in Cooperative Control and Optimization 2004 Kluwer Academic Publishers 61 73
13. X. Cheng, M. Ding, D. Hongwei, and X. Jia Virtual backbone construction in multihop ad hoc wireless networks Journal of Wireless Communications and Mobile Computing 6 2006 183 190
14. I. Chlamtac, and S. Kutten Tree-based broadcasting in multihop radio networks IEEE Transactions on Computing 36 10 1987 1209 1223
15. I. Chlamtac, M. Conti, and J. Liu Mobile ad hoc networking: imperatives and challenges Journal of Ad Hoc Networks 1 2003 13 64 (Pubitemid 40421395)
16. B.N. Clark, C.J. Colbourn, and D.S. Johnson Unit disk graphs Discrete Mathematics 86 1990 165 177
17. F. Dai, and J. Wu An extended localized algorithm for connected dominating set formation in ad hoc wireless networks IEEE Transactions on Parallel and Distributed Systems 15 10 2004 908 920 (Pubitemid 40527339)
18. O. Dousse, F. Baccelli, and P. Thiran Impact of interferences on connectivity in ad hoc networks IEEE/ACM Transactions on Networking 13 2 2005 425 436 (Pubitemid 40690836)
19. R.G. Gallager, P.A. Humblet, and P.M. Spira A distributed algorithm for minimum weight spanning trees ACM Transaction on Programming Languages and Systems 5 1983 66 77
20. S. Guha, and S. Khuller Approximation algorithms for connected dominating sets Algorithmica 20 4 1998 374 387 (Pubitemid 128664048)
21. S. Holm A simple sequentially rejective multiple test procedure Scandinavian Journal of Statistics 6 1979 65 70
22. B. Han Zone-based virtual backbone formation in wireless ad hoc networks Ad Hoc Networks 7 1 2009 183 200
23. Http://dimacs.rutgers.edu/Challenges.
24. K.R. Hutson, and D.R. Shier Minimum spanning trees in networks with varying edge weights Annals of Operations Research vol. 146 2006 Springer 3 18 (Pubitemid 44290700)
25. S. Lakshmivarahan, and M.A.L. Thathachar Bounds on the convergence probabilities of learning automata IEEE Transactions on Systems, Man, and Cybernetics 6 1976 756 763
26. D. Li, H. Du, P.-J. Wan, X. Gao, Z. Zhang, and W. Wu Construction of strongly connected dominating sets in asymmetric multihop wireless networks Theoretical Computer Science 410 8-10 2009 661 669
27. Y. Li, M.T. Thai, F. Wang, C.W. Yi, P.J. Wang, D.Z. Du, On greedy construction of connected dominating sets in wireless networks, Special issue of Wireless Communications and Mobile Computing (WCMC), 2005.
28. H. Lim, and C. Kim Flooding in wireless ad hoc networks Journal of Computer Communications 24 2001 353 363 (Pubitemid 32160641)
29. D. Lokshtanov, M. Mnich, and S. Saurabh A linear kernel for a planar connected dominating set Theoretical Computer Science 412 23 2011 2536 2543
30. M.V. Marathe, H. Breu, H.B. Hunt, S.S. Ravi, and D.J. Rosenkrantz Simple heuristics for unit disk graphs Networks 25 1995 59 68
31. P. Mohapatra, and S. Krishnamurthy Ad hoc Networks: Technologies and Protocols 2005 Springer Science
32. K.S. Narendra, and M.A.L. Thathachar Learning Automata: An Introduction 1989 Printice-Hall New York
33. C. Pang, R. Zhang, Q. Zhang, and J. Wang Dominating sets in directed graphs Information Sciences 180 2010 3647 3652
34. M.A.L. Thathachar, and B.R. Harita Learning automata with changing number of actions IEEE Transactions on Systems, Man, and Cybernetics SMG17 1987 1095 1100 (Pubitemid 18568122)
35. Y.-T. Tsai, Y.-L. Lin, and F.R. Hsu Efficient algorithms for the minimum connected domination on trapezoid graphs Information Sciences 177 12 2007 2405 2417 (Pubitemid 46528947)
36. V. Turau, and B. Hauck A self-stabilizing algorithm for constructing weakly connected minimal dominating sets Information Processing Letters 109 14 2009 763 767
37. Y. Wang, W. Wang, X.-Y. Li, Distributed low-cost backbone formation for wireless ad hoc networks, in: Proceedings of the Sixth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2005), 2005, pp. 2-13. (Pubitemid 43037578)
38. J. Wu, H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, in: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication, 1999, pp. 7-14.
39. J. Wu, F. Dai, M. Gao, and I. Stojmenovic On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks Journal of Communications and Networks 4 1 2002 1 12
40. J. Wu, B. Wu, and I. Stojmenovic Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets Journal of Wireless Communications and Mobile Computing 3 2003 425 438 (Pubitemid 40183716)
41. L. Wu, E. Shan, and Z. Liu On the k-tuple domination of generalized de Brujin and Kautz digraphs Information Sciences 180 2010 4430 4435
42. R. Xie, D. Qi, Y. Li, J.Z. Wang, A novel distributed MCDS approximation algorithm for wireless sensor networks, Journal of Wireless Communications and Mobile Computing, 2007.
43. B. Yin, H. Shi, and Y. Shang An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks Journal of Parallel and Distributed Computing 71 1 2011 27 39
44. F. Zou, Y. Wang, X.-H. Xu, X. Li, H. Du, P. Wan, and W. Wu New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs Theoretical Computer Science 412 3 2011 198 208
45. J. Akbari Torkestani, An adaptive learning automata-based ranking function discovery algorithm, Journal of Intelligent Information Systems, http://dx.doi.org/10.1007/s10844-012-0197-4.
46. J. Akbari Torkestani A new approach to the job scheduling problem in computational grids Journal of Cluster Computing 2012 10.1007/s10586-011-0192-5