Deriving efficient mobile agent routes in wireless sensor networks with NOID algorithm

dc.contributor.author	Μπιτζιόπουλος, Αριστείδης	el
dc.contributor.author	Γαβαλάς, Δαμιανός	el
dc.contributor.author	Κωνσταντόπουλος, Χαράλαμπος	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.date.accessioned	2015-05-26T22:35:03Z
dc.date.issued	2015-05-27
dc.identifier.uri	http://hdl.handle.net/11400/11215
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4394337	en
dc.subject	Ιάβα
dc.subject	δρομολόγηση δικτύου τηλεπικοινωνιών
dc.subject	ασύρματα δίκτυα αισθητήρων
dc.subject	Java
dc.subject	telecommunication network routing
dc.subject	Wireless sensor networks
dc.title	Deriving efficient mobile agent routes in wireless sensor networks with NOID algorithm	en
heal.type	conferenceItem
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.1109/PIMRC.2007.4394337
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2007-09-03
heal.bibliographicCitation	Mpitziopoulos, A. Gavalas, D., Pantziou, G. and Konstantopoulos, C. (2007) Deriving Efficient Mobile Agent Routes in Wireless Sensor Networks with NOID Algorithm. Proceedings of the 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC’2007). Athens: IEEE	en
heal.abstract	In this article, we consider the problem of calculating an appropriate number of near-optimal (subject to a certain routing objective) routes for mobile agents (MAs) that incrementally fuse the data as they visit the nodes in a distributed sensor network. We propose an improved heuristic algorithm which computes an approximate solution to the problem by suggesting an appropriate number of MAs and constructing 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	IEEE	en
heal.fullTextAvailability	true
heal.conferenceName	Proceedings of the 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC’2007)	en
heal.conferenceItemType	short paper