S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, European Symposium on Algorithms, 1996.
DOI : 10.1007/3-540-61680-2_55

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

B. Das and V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, Proceedings of ICC'97, International Conference on Communications, 1997.
DOI : 10.1109/ICC.1997.605303

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, vol.15, issue.10, pp.908-920, 2004.
DOI : 10.1109/TPDS.2004.48

C. Fragouli, J. Widmer, and J. L. Boudec, A Network Coding Approach to Energy Efficient Broadcasting, 2006.

J. Park, M. Gerla, D. S. Lun, Y. Yi, and M. Médard, Codecast: a network-coding-based ad hoc multicast protocol, IEEE Wireless Communications, vol.13, issue.5, 2006.
DOI : 10.1109/WC-M.2006.250362

Y. Wu, P. A. Chou, and S. Kung, Minimum-Energy Multicast in Mobile Ad Hoc Networks Using Network Coding, IEEE Transactions on Communications, vol.53, issue.11, pp.1906-1918, 2005.
DOI : 10.1109/TCOMM.2005.857148

D. S. Lun, N. Ratnakar, M. Médard, R. Koetter, D. R. Karger et al., Minimum-cost multicast over coded packet networks, IEEE Transactions on Information Theory, vol.52, issue.6, pp.2608-2623, 2006.
DOI : 10.1109/TIT.2006.874523

URL : http://arxiv.org/abs/cs/0503064

J. Y. Yu and P. H. Chong, A survey of clustering schemes for mobile ad hoc networks, IEEE Communications Surveys & Tutorials, vol.7, issue.1, 2005.
DOI : 10.1109/COMST.2005.1423333

B. Clark, C. Colbourn, and D. Johnson, Unit disk graphs, Discrete Mathematics, vol.86, pp.1-3, 1990.
DOI : 10.1016/s0167-5060(08)71047-1

D. S. Lun, M. Médard, R. Koetter, and M. Effros, On coding for reliable communication over packet networks, Physical Communication, vol.1, issue.1, 2007.
DOI : 10.1016/j.phycom.2008.01.006

T. Ho, R. Koetter, M. Médard, D. Karger, and M. Effros, The benefits of coding over routing in a randomized setting, IEEE International Symposium on Information Theory, 2003. Proceedings., 2003.
DOI : 10.1109/ISIT.2003.1228459

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.244, issue.S, pp.373-395, 1984.
DOI : 10.1007/BF02579150

A. Ramamoorthy, J. Shi, and R. D. , On the Capacity of Network Coding for Random Networks, IEEE Transactions on Information Theory, vol.51, issue.8, pp.2878-2885, 2005.
DOI : 10.1109/TIT.2005.851725

S. A. Aly, V. Kapoor, J. Meng, and A. Klappenecker, Bounds on the Network Coding Capacity for Wireless Random Networks, 2007 Information Theory and Applications Workshop, 2007.
DOI : 10.1109/ITA.2007.4357585

M. Jafarisiavoshani, C. Fragouli, and S. Diggavi, Subspace Properties of Randomized Network Coding " Information Theory for Wireless Networks, 2007.

R. J. Gardner and P. Gronchi, A Brunn-Minkowski inequality for the integer lattice, Transactions of the American Mathematical Society, vol.353, issue.10, pp.3995-4042, 2001.
DOI : 10.1090/S0002-9947-01-02763-5

K. Voss, Discrete Images, Objects, and Functions in Z n, 1993.
DOI : 10.1007/978-3-642-46779-0

C. Adjih, S. Y. Cho, and P. Jacquet, Near Optimal Broadcast with Network Coding in Large Sensor Networks, Proceedings of the first workshop on Information Theory for Sensor Networks, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00166617

C. Adjih, S. Y. Cho, and P. Jacquet, Near Optimal Broadcast with Network Coding in Large Homogeneous Networks, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00145231

C. Adjih and S. Y. Cho, manuscript notes of this technical report, WNC-CDS-manuscript-notes.pdf, available from at hal.inria.fr in the source distribution of this report, INRIA Centre de recherche INRIA Paris ? Rocquencourt Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex