dc.contributor.author |
Mpitziopoulos, A |
en |
dc.contributor.author |
Gavalas, D |
en |
dc.contributor.author |
Konstantopoulos, C |
en |
dc.contributor.author |
Pantziou, G |
en |
dc.date.accessioned |
2014-03-01T02:51:04Z |
|
dc.date.available |
2014-03-01T02:51:04Z |
|
dc.date.issued |
2007 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/35338 |
|
dc.subject.other |
Heuristic algorithms |
en |
dc.subject.other |
Java programming language |
en |
dc.subject.other |
Mobile telecommunication systems |
en |
dc.subject.other |
Problem solving |
en |
dc.subject.other |
Sensor data fusion |
en |
dc.subject.other |
Wireless sensor networks |
en |
dc.subject.other |
Distributed sensor network |
en |
dc.subject.other |
Mobile agents (MA) |
en |
dc.subject.other |
Near-optimal itineraries |
en |
dc.subject.other |
Network routing |
en |
dc.title |
Deriving efficient mobile agent routes in wireless sensor networks with NOID algorithm |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1109/PIMRC.2007.4394337 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1109/PIMRC.2007.4394337 |
en |
heal.identifier.secondary |
4394337 |
en |
heal.publicationDate |
2007 |
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. © 2007 IEEE. |
en |
heal.journalName |
IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC |
en |
dc.identifier.doi |
10.1109/PIMRC.2007.4394337 |
en |