Show simple item record

dc.contributor.authorChatzimilioudis, Georgiosen
dc.contributor.authorZeinalipour-Yazdi, Constantinos D.en
dc.contributor.authorGunopulos, Dimitriosen
dc.creatorChatzimilioudis, Georgiosen
dc.creatorZeinalipour-Yazdi, Constantinos D.en
dc.creatorGunopulos, Dimitriosen
dc.date.accessioned2019-11-13T10:38:53Z
dc.date.available2019-11-13T10:38:53Z
dc.date.issued2010
dc.identifier.isbn978-1-4503-0151-0
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/53690
dc.description.abstractWe 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.sourceMobiDE 2010 - Proceedings of the 9th ACM International Workshop on Data Engineering for Wireless and Mobile Access, in Conjunction with ACM SIGMOD / PODS 2010en
dc.source9th ACM International Workshop on Data Engineering for Wireless and Mobile Access, MobiDE'10, Held in Conjunction with SIGMOD 2010en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-77958041002&doi=10.1145%2f1850822.1850829&partnerID=40&md5=a4c3eb70f514a043c4fb2b4219fb389d
dc.subjectOptimizationen
dc.subjectAlgorithmsen
dc.subjectCommunicationen
dc.subjectSensor networksen
dc.subjectWireless sensor networksen
dc.subjectTrees (mathematics)en
dc.subjectCentralized algorithmsen
dc.subjectWireless sensoren
dc.subjectHot spoten
dc.subjectDistributed algorithmen
dc.subjectQuery executionen
dc.subjectCollisionen
dc.subjectCommunication costen
dc.subjectNetwork layouten
dc.subjectNetwork nodeen
dc.subjectNode degreeen
dc.subjectPacket collisionsen
dc.subjectQuery treeen
dc.subjectRetransmissionsen
dc.subjectSmallest energiesen
dc.subjectWireless sensor networken
dc.titleMinimum-hot-spot query trees for wireless sensor networksen
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.identifier.doi10.1145/1850822.1850829
dc.description.startingpage33
dc.description.endingpage40
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: ACM SIGMODen
dc.description.notesConference code: 82003en
dc.description.notesCited By :11</p>en
dc.contributor.orcidZeinalipour-Yazdi, Constantinos D. [0000-0002-8388-1549]
dc.gnosis.orcid0000-0002-8388-1549


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record