Comparison of two CDS algorithms on random unit ball graphs

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2005, Pages 206-211

  Hansen, Jennie C ^a   Schmutz, Eric ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b DREXEL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALL GRAPHS; STOCHASTIC MODEL;

GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY;

ALGORITHMS;

EID: 32144441332     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. C.Adjih,P.Jacquet, L.Viennot,Computing Connected Dominating Sets with Multipoint Relays, INRIA RR-4597(2002).
2. 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) 1-8.
3. d, Advances in Appl.Probab 29 (3) (1997) 582-594.
4. E.Baccelli and P.Jacquet, Flooding Techniques in Mobile Ad Hoc Networks, INRIA RR-5002 (2003).
5. M.Cardei,X.Cheng,X.Cheng, D.Du,Connected Domination in Multihop Ad Hoc Wireless Networks, JCIS (2002) 251-205.
6. B. Chen, K. Jamieson, H. Balakrishnan, R. Morris, Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks Proc. of the 6th ACM MOB/COM Conf., Rome, Italy, July 2001.
7. B.N. Clark,C.J. Colburn, and D.J.Johnson, Unit Disk Graphs,Discrete Mathematics 86(1-3) (1990) 165-177.
8. B.Das and V. Bharghavan Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets, International Conference on Communications 1 (1997) 376-380.
9. 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.
10. F.Dai and J.Wu, Performance analysis of broadcast protocols in ad hoc networks based on self pruning, IEEE Trans.on Parallel and Distributed Systems 15 (11) (2004).
11. E.N.Gilbert, Random Plane Networks, J.Soc.Indust.Appl.Math. 9 (1961) 533.
12. A.Godbole and B.Wielund, On the Domination Number of a Random Graph, Electronic Journal of Combinatorics 8 #R37 (2001)
13. S.Guha and S.Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (4) (1998) 374-387.
14. P. Gupta and P. R. Kumar, Internets in the sky: The capacity of three dimensional wireless networks, Communications in Information and Systems, 1 (1) (2001) 33-50.
15. P.Gupta and P.R.Kumar, "Critical power for asymptotic connectivity in wireless networks", in Stochastic Analysis, Control, Optimization and Applications, Birkhauser (1999) 547-566.
16. W.K.Hale, Frequency Assignment: Theory and Applications,Proc. IEEE 68 (1980) 1497-1514.
17. J.C.Hansen and E.Schmutz, The Expected Size of the Rule k Dominating Set:I, submitted(preprint at arXiv:cs.DM/0408067.)
18. J.C.Hansen, E.Schmutz,L.Sheng The Expected Size of the Rule k Dominating Set:II, submitted(preprint at arXiv:cs.DM/0408068.)
19. P.Jacquet, Analytical Results on Connected Dominating Sets in Mobile Ad Hoc Networks, INRIA RR-5173 (2004).
20. P.Jacquet, A.Laouiti,P.Minet,L.Viennot, Performance of Mutltipoint Relaying in Ad Hoc Mobil Routing Protocols, In "Networking 2002" Lecture Notes in Computer Science 2345 (2002) 387-398.
21. D.Lichtenstein, Planar formulae and their uses, SIAM J.Comput. 11(2) (1982) 329-343.
22. M.V.Marathe,H.Breu,H.B.Hunt,S.S.Ravi,and D.J.Rosenkrantz, Simple Heuristics for Unit Disk Graphs, Networks 25 no.2 (1995) 59-68.
23. C.McDiarmid, Discrete mathematics and radio channel assignment, Recent Advances in algorithms and combinatorics, 27-63, CMS Books Math (2003).
24. C.McDiarmid, Random channel assignment in the plane, Random Structures and Algorithms 22 (2) 187-212.
25. W.Peng and X.Lu,On the reduction of broadcast redundancy in mobile ad hoc networks, Proceedings of the 1'st ACM International Symposium on Mobile Ad Hoc Networking (2000)129-130.
26. Random Geometric Graphs, Oxford Studies in Probability 5, Oxford University Press, (2003) ISBN 0-19-850626-0.
27. R.Sivakumar, B.Das, and V. Bharghavan, Spinebased routing in ad hoc networks, Cluster Computing 1 (2) (1998) 237-248.
28. I. Stojmenovic, M. Seddigh, J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 1,(2002), 14-25.
29. Y.C.Tseng,S.Y.Ni, Y.S.Chen, J.P.Sheu,The broadcast storm problem in a mobile ad hoc network, Wireless Networks 8(2-3) (2002) 153-167.
30. J. Wu and H.Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Workshop on Discrete Algorithms and Methods for MOBILE Computing and Communications (1999) 7-14.
31. A.C.C.Yao, On constructing spanning trees in k dimensional spaces and related problems, SIAM J. Computing 11 (4) (1982) 721-736.