Effective determination of mobile agent ltineraries for data aggregation on sensor networks

dc.contributor.author	Κωνσταντόπουλος, Χαράλαμπος	el
dc.contributor.author	Μπιτζιόπουλος, Αριστείδης	el
dc.contributor.author	Γαβαλάς, Δαμιανός	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.date.accessioned	2015-05-23T16:11:38Z
dc.date.issued	2015-05-23
dc.identifier.uri	http://hdl.handle.net/11400/10997
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://www.computer.org/csdl/trans/tk/2010/12/ttk2010121679-abs.html	en
dc.subject	ασύρματα δίκτυα αισθητήρων
dc.subject	δομές δεδομένων
dc.subject	Wireless sensor networks
dc.subject	Data structures (Computer science)
dc.title	Effective determination of mobile agent ltineraries for data aggregation on 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/sh85035862
heal.identifier.secondary	DOI: 10.1109/TKDE.2009.203
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2010-12
heal.bibliographicCitation	Konstantopoulos, C., Pantziou, G., Gavalas, D. and Mpitziopoulos, A. (2010) Effective Determination of Mobile Agent Itineraries for Data Aggregation on Sensor Networks. IEEE Transactions on Knowledge and Data Engineering. 22 (12). pp.1679-1693. Available from: http://www.computer.org [Accessed 23/05/2015]	en
heal.abstract	A key feature of wireless sensor networks (WSNs) is the collaborative processing, where the correlation existing over the local data of sensor nodes (SNs) is exploited so that the total data volume can be reduced (data aggregation). The use of Mobile Agents (MAs), i.e., software entities able of migrating among nodes and resuming execution naturally, fits in this scenario; the local data of an SN can be combined with the data collected by an MA from other SNs in a way that depends on the specific program code of the MA. In this paper, we consider the problem of calculating near-optimal routes for MAs that incrementally aggregate the data as they visit the nodes in a distributed sensor network. Our algorithm follows a greedy-like approach always selecting the next node to be included in an itinerary in such a way that the cost of the so far formed itineraries is kept minimum at each step. Simulation results confirm the high effectiveness of the proposed algorithm as well as its performance gain over alternative approaches. Also, with the use of proper data structures, the computational complexity of the algorithm is kept low as it is formally proved in the paper.	en
heal.journalName	IEEE Transactions on Knowledge and Data Engineering	en
heal.journalType	peer-reviewed
heal.fullTextAvailability	false