JOURNAL ARTICLE

Cost-efficient routing with controlled node mobility in sensor networks

Abstract

In this paper, an energy-efficient strategy is proposed for tracking a moving target in a mobile sensor network. The energy expenditure of the sensors in the network is assumed to be due to communication, sensing and movement. First, the target area is divided into a grid of sufficiently small rectangular cells in order to search for near optimal locations for the sensors in different time instants. The grid is then converted to a graph with properly weighted edges. A shortest-path algorithm is subsequently used to route information from target to destination by a subset of sensors.

Keywords:
Computer science Wireless sensor network Grid Shortest path problem Routing (electronic design automation) Node (physics) Real-time computing Path (computing) Computer network Energy (signal processing) Graph Distributed computing Engineering Mathematics

Metrics

12
Cited By
1.47
FWCI (Field Weighted Citation Impact)
17
Refs
0.83
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Distributed Control Multi-Agent Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Security in Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.