Gathering with Minimum Delay in Tree Sensor Networks-Reference-Cited by-同舟云学术

Gathering with Minimum Delay in Tree Sensor Networks

Published: Issue: Volume: Page:262-276
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

Bermond Jean-Claude,Gargano Luisa,Rescigno Adele A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-69355-0_22.pdf

Reference26 articles.

1. Lecture Notes in Computer Science;J.-C. Bermond,2006

2. Bermond, J.-C., Gargano, L., Rescigno, A.: Gathering with Minimum Delay in Sensor Networks, INRIA TR (2008), http://hal.inria.fr/inria-00256896/fr/

3. Bermond, J.-C., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Hardness and approximation of gathering in static radio networks. Parallel Processing Letters 16(2), 165–183 (2006)

4. Bermond, J.-C., Peters, J.: Efficient gathering in radio grids with interference. In: AlgoTel 2005, pp. 103–106, Presqu’île de Giens (2005)

5. Bermond, J.-C., Yu, M.: Optimal gathering algorithms in multi-hop radio tree-networks with interferences (manuscript, 2008)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity;Structural Information and Communication Complexity;2023

2. Optimal data gathering paths and energy-balance mechanisms in wireless networks;Ad Hoc Networks;2011-08

3. Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas;Structural Information and Communication Complexity;2011

4. GATHERING WITH MINIMUM COMPLETION TIME IN SENSOR TREE NETWORKS;Journal of Interconnection Networks;2010-03

5. Data Gathering in Wireless Networks;Texts in Theoretical Computer Science. An EATCS Series;2009