Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3-Reference-Cited by-同舟云学术

Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3

Published:2017 Issue: Volume: Page:141-154
ISSN:0302-9743
Container-title:Algorithms for Sensor Systems
language:
Short-container-title:

Author:

Erzin Adil,Plotnikov Roman

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-72751-6_11

Reference9 articles.

1. Aldyn-ool, T.A., Erzin, A.I., Zalyubovskiy, V.V.: The coverage of a planar region by randomly deployed sensors. Vestn. Novosib. Gos. Univ. Ser. Mat. Mekh. Inform. 10(4), 7–25 (2010)

2. De Souza, E., Nikolaidis, I.: An exploration of aggregation convergecast scheduling. Ad Hoc Netw. 11, 2391–2407 (2013)

3. Erzin, A., Pyatkin, A.: Convergecast scheduling problem in case of given aggregation tree. The complexity status and some special cases. In: 10th International Symposium on Communication Systems, Networks and Digital Signal Processing, article 16, 6 p. IEEE-Xplore, Prague (2016)

4. Lecture Notes in Computer Science;A Erzin,2017

5. Lecture Notes in Computer Science;J Gagnon,2015

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

1. Aggregation Tree Construction Using Hierarchical Structures;Mathematical Optimization Theory and Operations Research;2023

2. Multi-channel Conflict-Free Square Grid Aggregation;Lecture Notes in Computer Science;2021

3. Two-Channel Conflict-Free Square Grid Aggregation;Lecture Notes in Computer Science;2020

4. The Convergecast Scheduling Problem on a Regular Triangular Grid;Mathematical Optimization Theory and Operations Research;2019