Show simple item record

dc.contributor.author Μπιτζιόπουλος, Αριστείδης el
dc.contributor.author Γαβαλάς, Δαμιανός el
dc.contributor.author Κωνσταντόπουλος, Χαράλαμπος el
dc.contributor.author Πάντζιου, Γραμματή Ε. el
dc.date.accessioned 2015-05-23T15:39:28Z
dc.date.available 2015-05-23T15:39:28Z
dc.date.issued 2015-05-23
dc.identifier.uri http://hdl.handle.net/11400/10991
dc.rights Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.source http://www.hindawi.com/journals/ijdsn/2010/206517/ en
dc.subject Ασύρματα δίκτυα αισθητήρων
dc.subject μοντέλο πελάτη/διακομιστή
dc.subject εφαρμογές συγχώνευσης δεδομένων
dc.subject εναλλακτικοί αλγορίθμοι
dc.subject Wireless sensor networks
dc.subject client/server model
dc.subject data fusion applications
dc.subject alternative algorithms
dc.title CBID en
heal.type journalArticle
heal.secondaryTitle a scalable method for distributed data aggregation in wireless sensor networks en
heal.classification Τεχνολογία
heal.classification Πληροφορική
heal.classification Technology
heal.classification Computer science
heal.classificationURI **N/A**-Τεχνολογία
heal.classificationURI **N/A**-Πληροφορική
heal.classificationURI http://id.loc.gov/authorities/subjects/sh85133147
heal.classificationURI http://skos.um.es/unescothes/C00750
heal.keywordURI http://id.loc.gov/authorities/subjects/sh2008004547
heal.identifier.secondary DOI: 10.1155/2010/206517
heal.language en
heal.access campus
heal.recordProvider Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε. el
heal.publicationDate 2010
heal.bibliographicCitation Mpitziopoulos, A., Gavalas, D., Konstantopoulos, C. and Pantziou, G. (2010) CBID: A Scalable Method for Distributed Data Aggregation in WSNs. International Journal of Distributed Sensor Networks. [Online] Vol.2010, Article ID 206517. pp.13. Available from: http://www.hindawi.com [Accessed 23/05/2015] en
heal.abstract Mobile Agent (MA) technology has been recently proposed in Wireless Sensors Networks (WSNs) literature to answer the scalability problem of client/server model in data fusion applications. Herein we present CBID, a novel algorithm that calculates near-optimal routes for MAs that incrementally fuse the data as they visit the Sensor Nodes (SNs) while also enabling fast updates on the designed itineraries upon changes of network topology. CBID dispatches in parallel a number of MAs that sequentially visit sensor nodes arranged in tree structures and upon visiting an SN with two or more child SNs, the MAs (master MAs) clone of themselves with each clone (slave MA) visiting a tree branch. When all slave MAs return to that SN, they deliver their collected data to the master MA and are then disposed of. This results in a significant reduction of the overall energy expenditure and response time. Simulation results prove the high effectiveness of CBID in data fusion tasks compared to other alternative algorithms. en
heal.publisher Taylor & Francis en
heal.journalName International Journal of Distributed Sensor Networks en
heal.journalType peer-reviewed
heal.fullTextAvailability true


Files in this item

  • Name: 206517.pdf
    Size: 1.855Mb
    Format: PDF

The following license files are associated with this item:

Show simple item record

Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες Except where otherwise noted, this item's license is described as Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες