Name
Abstract | ||
|---|---|---|
A Wireless Sensor Network consists of several simple sensor nodes deployed in an environment having as primary goal data acquisition. However, due to limited sensor communication range, oftentimes it is necessary to use a mobile sink node that will visit sensor nodes to gather up their collected data. An important aspect that must be taken into account in this case are the intrinsic limitations of the vehicle used, such as kinematic and dynamic constraints, since most of the vehicles present in our everyday life have such restrictions. Therefore, this work addresses the problem of planning efficient paths, which are length and time of collection optimized for data gathering by a mobile robot with bounded curvature. We propose the use of the classical NSGA-II in order to tackle both objective functions. The methodology was evaluated through several experiments in a simulated environment. The results outperform the classical evolutionary approach to the single-objective problem specially considering the trade-off between overall length and collecting time. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.cor.2016.07.004 | Computers & OR |
Keywords | Field | DocType |
Data gathering,Traveling salesman problem,Dubins vehicle,Wireless sensor network | Motion planning,Key distribution in wireless sensor networks,Data collection,Mathematical optimization,Data acquisition,Real-time computing,Travelling salesman problem,Mobile wireless sensor network,Wireless sensor network,Mobile robot,Mathematics,Distributed computing | Journal |
Volume | Issue | ISSN |
84 | C | 0305-0548 |
Citations | PageRank | References |
4 | 0.39 | 19 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Douglas Guimarães Macharet | 1 | 49 | 9.22 |
| Jefferson W. G. Monteiro | 2 | 4 | 0.39 |
| Geraldo Robson Mateus | 3 | 413 | 42.30 |
| Mario Fernando Montenegro Campos | 4 | 557 | 51.60 |