dc.contributor.author | Chatzimilioudis, Georgios | en |
dc.contributor.author | Zeinalipour-Yazdi, Constantinos D. | en |
dc.contributor.author | Gunopulos, Dimitrios | en |
dc.creator | Chatzimilioudis, Georgios | en |
dc.creator | Zeinalipour-Yazdi, Constantinos D. | en |
dc.creator | Gunopulos, Dimitrios | en |
dc.date.accessioned | 2019-11-13T10:38:53Z | |
dc.date.available | 2019-11-13T10:38:53Z | |
dc.date.issued | 2010 | |
dc.identifier.isbn | 978-1-4503-0151-0 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53690 | |
dc.description.abstract | We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optimally balanced communication tree with minimum overhead. The balancing of the node degrees results in the minimization of packet collisions during query execution, that would otherwise require numerous retransmissions and reduce the lifetime of the network. We compare our simple distributed algorithm against previous work and a centralized solution and show that for most network layouts it outperforms competition and achieves tree balance very close to the centralized algorithm. It also has the smallest energy overhead possible to construct the tree, increasing the lifetime of the network even more. Copyright 2010 ACM. | en |
dc.source | MobiDE 2010 - Proceedings of the 9th ACM International Workshop on Data Engineering for Wireless and Mobile Access, in Conjunction with ACM SIGMOD / PODS 2010 | en |
dc.source | 9th ACM International Workshop on Data Engineering for Wireless and Mobile Access, MobiDE'10, Held in Conjunction with SIGMOD 2010 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-77958041002&doi=10.1145%2f1850822.1850829&partnerID=40&md5=a4c3eb70f514a043c4fb2b4219fb389d | |
dc.subject | Optimization | en |
dc.subject | Algorithms | en |
dc.subject | Communication | en |
dc.subject | Sensor networks | en |
dc.subject | Wireless sensor networks | en |
dc.subject | Trees (mathematics) | en |
dc.subject | Centralized algorithms | en |
dc.subject | Wireless sensor | en |
dc.subject | Hot spot | en |
dc.subject | Distributed algorithm | en |
dc.subject | Query execution | en |
dc.subject | Collision | en |
dc.subject | Communication cost | en |
dc.subject | Network layout | en |
dc.subject | Network node | en |
dc.subject | Node degree | en |
dc.subject | Packet collisions | en |
dc.subject | Query tree | en |
dc.subject | Retransmissions | en |
dc.subject | Smallest energies | en |
dc.subject | Wireless sensor network | en |
dc.title | Minimum-hot-spot query trees for wireless sensor networks | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.identifier.doi | 10.1145/1850822.1850829 | |
dc.description.startingpage | 33 | |
dc.description.endingpage | 40 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Conference Object | en |
dc.description.notes | <p>Sponsors: ACM SIGMOD | en |
dc.description.notes | Conference code: 82003 | en |
dc.description.notes | Cited By :11</p> | en |
dc.contributor.orcid | Zeinalipour-Yazdi, Constantinos D. [0000-0002-8388-1549] | |
dc.gnosis.orcid | 0000-0002-8388-1549 | |