Partitioning algorithm for a resource-constrained robotic skin sensor network
| Autor: | Mikhail Vilgelm, Gordon Cheng, Philipp Mittendorfer, Gabriel Neamtu, Wolfgang Kellerer |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
0209 industrial biotechnology
Brooks–Iyengar algorithm Network packet Computer science business.industry Distributed computing Resource constrained Real-time computing 020206 networking & telecommunications Robotics 02 engineering and technology Load balancing (computing) 020901 industrial engineering & automation Packet loss 0202 electrical engineering electronic engineering information engineering Artificial intelligence Latency (engineering) business Wireless sensor network Algorithm |
| Zdroj: | BlackSeaCom |
| DOI: | 10.1109/blackseacom.2016.7901579 |
| Popis: | Sensor applications in robotics, such as artificial robotic skin, feature the shrinking size of nodes, and increasing scale of sensor networks. Together with a requirement for low complexity hardware for individual nodes, this leads to network optimization challenges. In this paper, we introduce a heuristic-based network partitioning algorithm for routing in a wired robotic skin sensor network, which aims at minimizing end-to-end latency and decreasing packet loss. Our algorithm is partitioning the network in sub-trees while balancing load on the root node connections. We benchmark its load balancing and evaluate its end-to-end latency and packet drops via simulation. The evaluation results show the superiority of our algorithm with respect to the state-of-the-art solutions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|