B. N. Clark, C. J. Colbourn, and D. S. Johnson, Unit disk graphs, Discrete Mathematics, vol.86, issue.1-3, pp.165-177, 1990.
DOI : 10.1016/0012-365X(90)90358-O

URL : http://doi.org/10.1016/0012-365x(90)90358-o

X. Chen, X. Hu, and J. Zhu, Minimum Data Aggregation Time Problem in Wireless Sensor Networks, pp.133-142, 2005.
DOI : 10.1007/11599463_14

V. Annamalai, S. K. Gupta, and L. Schwiebert, On tree-based convergecasting in wireless sensor networks, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003., pp.1942-1947, 2003.
DOI : 10.1109/WCNC.2003.1200684

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

B. Yu, J. Li, and Y. Li, Distributed Data Aggregation Scheduling in Wireless Sensor Networks, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.2159-2167, 2009.
DOI : 10.1109/INFCOM.2009.5062140

X. Xu, M. Li, X. Mao, S. Tang, and S. Wang, A delay-efficient algorithm for data aggregation in multihop wireless sensor networks, Parallel and Distributed Systems, IEEE Transactions on, vol.22, issue.1, pp.163-175, 2011.

M. Ren, L. Guo, and J. Li, A New Scheduling Algorithm for Reducing Data Aggregation Latency in Wireless Sensor Networks, International Journal of Communications, Network and System Sciences, vol.03, issue.08
DOI : 10.4236/ijcns.2010.38091

T. D. Nguyen, V. Zalyubovskiy, and H. Choo, Efficient time latency of data aggregation based on neighboring dominators in wsns, Global Telecommunications Conference (GLOBECOM 2011), pp.1-6, 2011.

E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi, In-network aggregation techniques for wireless sensor networks: a survey, Wireless Communications, IEEE, vol.14, issue.2, pp.70-87, 2007.

A. Casteigts, S. Chaumette, and A. Ferreira, Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks, Structural Information and Communication Complexity, pp.126-140, 2010.
DOI : 10.1145/72981.72982

URL : https://hal.archives-ouvertes.fr/hal-00408054

A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-Varying Graphs and Dynamic Networks, Ad-hoc, Mobile, and Wireless Networks, pp.346-359, 2011.
DOI : 10.1109/COMST.2006.323440

URL : https://hal.archives-ouvertes.fr/hal-00854287

F. Kuhn and R. Oshman, Dynamic networks, ACM SIGACT News, vol.42, issue.1, pp.82-96, 2011.
DOI : 10.1145/1959045.1959064

A. Casteigts, P. Flocchini, B. Mans, and N. Santoro, Shortest, Fastest, and Foremost Broadcast in Dynamic Networks, International Journal of Foundations of Computer Science, vol.26, issue.04, pp.499-522, 2015.
DOI : 10.1142/S0129054115500288

A. Casteigts, P. Flocchini, B. Mans, and N. Santoro, Building fastest broadcast trees in periodicallyvarying graphs, arXiv preprint

A. Clementi, R. Silvestri, and L. Trevisan, Information spreading in dynamic graphs, Proceedings of the 2012 ACM symposium on Principles of distributed computing, pp.37-46, 2012.
DOI : 10.1145/2332432.2332439

S. Abshoff and F. Meyer-auf-der-heide, Structural information and communication complexity: 21st international colloquium, pp.194-209, 2014.

A. Cornejo, S. Gilbert, and C. Newport, Aggregation in dynamic networks, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.195-204, 2012.
DOI : 10.1145/2332432.2332468

T. Biedl and G. Kant, A better heuristic for orthogonal graph drawings, Computational Geometry, vol.9, issue.3, pp.159-180, 1998.
DOI : 10.1016/S0925-7721(97)00026-6

D. Lichtenstein, Planar Formulae and Their Uses, SIAM Journal on Computing, vol.11, issue.2, pp.329-343, 1982.
DOI : 10.1137/0211025

Q. Bramas and S. , The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks, Stabilization, Safety, and Security of Distributed Systems, pp.36-50, 2015.
DOI : 10.1007/978-3-319-21741-3_3

URL : https://hal.archives-ouvertes.fr/hal-01419900