Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3 Full article
Journal |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||
---|---|---|---|---|---|
Output data | Year: 2017, Volume: 10718, Pages: 141-154 Pages count : 14 DOI: 10.1007/978-3-319-72751-6_11 | ||||
Tags | Convergecast scheduling problem; Data aggregation; Grid graph; Min-length conflict-free scheduling; Wireless sensor networks | ||||
Authors |
|
||||
Affiliations |
|
Cite:
Erzin A.
, Plotnikov R.
Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
Lecture Notes in Computer Science. 2017. V.10718. P.141-154. DOI: 10.1007/978-3-319-72751-6_11 Scopus OpenAlex
Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
Lecture Notes in Computer Science. 2017. V.10718. P.141-154. DOI: 10.1007/978-3-319-72751-6_11 Scopus OpenAlex
Identifiers:
Scopus: | 2-s2.0-85040109583 |
OpenAlex: | W2776521330 |