An approach for near-optimal distributed data fusion in wireless sensor networks

dc.contributor.author	Γαβαλάς, Δαμιανός	el
dc.contributor.author	Μπιτζιόπουλος, Αριστείδης	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Κωνσταντόπουλος, Χαράλαμπος	el
dc.date.accessioned	2015-05-23T16:22:50Z
dc.date.issued	2015-05-23
dc.identifier.uri	http://hdl.handle.net/11400/11001
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://link.springer.com/article/10.1007%2Fs11276-009-0211-0	en
dc.subject	συγχώνευση δεδομένων
dc.subject	ασύρματα δίκτυα αισθητήρων
dc.subject	βελτιστοποίηση δρομολογίου
dc.subject	ευρετική
dc.subject	Data fusion
dc.subject	Wireless sensor networks
dc.subject	Itinerary optimization
dc.subject	Heuristic
dc.title	An approach for near-optimal distributed data fusion in wireless sensor networks	en
heal.type	journalArticle
heal.classification	Πληροφορική
heal.classification	Μηχανική υπολογιστών
heal.classification	Computer science
heal.classification	Computer engineering
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Μηχανική υπολογιστών
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://id.loc.gov/authorities/subjects/sh85029495
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh2008004547
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh85060556
heal.identifier.secondary	DOI: 10.1007/s11276-009-0211-0
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2010-07
heal.bibliographicCitation	Gavalas, D., Mpitziopoulos, A., Pantziou, G. and Konstantopoulos, C. (2010) An Approach for Near-Optimal Distributed Data Fusion in Wireless Sensor Networks. Wireless Networks. [Online] 6 (5). pp.1407-1425. Available from: http://link.springer.com [Accessed 23/05/2015]	en
heal.abstract	In wireless sensor networks (WSNs), a lot of sensory traffic with redundancy is produced due to massive node density and their diverse placement. This causes the decline of scarce network resources such as bandwidth and energy, thus decreasing the lifetime of sensor network. Recently, the mobile agent (MA) paradigm has been proposed as a solution to overcome these problems. The MA approach accounts for performing data processing and making data aggregation decisions at nodes rather than bring data back to a central processor (sink). Using this approach, redundant sensory data is eliminated. In this article, we consider the problem of calculating near-optimal routes for MAs that incrementally fuse the data as they visit the nodes in a WSN. The order of visited nodes (the agent’s itinerary) affects not only the quality but also the overall cost of data fusion. Our proposed heuristic algorithm adapts methods usually applied in network design problems in the specific requirements of sensor networks. It computes an approximate solution to the problem by suggesting an appropriate number of MAs that minimizes the overall data fusion cost and constructs near-optimal itineraries for each of them. The performance gain of our algorithm over alternative approaches both in terms of cost and task completion latency is demonstrated by a quantitative evaluation and also in simulated environments through a Java-based tool.	en
heal.publisher	Springer US	en
heal.journalName	Wireless Networks	en
heal.journalType	peer-reviewed
heal.fullTextAvailability	false