Introduction to algorithms
Distributed algorithms for guiding navigation across a sensor network
Proceedings of the 9th annual international conference on Mobile computing and networking
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Self-Organizing Sensor Networks for Integrated Target Surveillance
IEEE Transactions on Computers
Communication power optimization in a sensor network with a path-constrained mobile observer
ACM Transactions on Sensor Networks (TOSN)
Distributed Mobility Management for Target Tracking in Mobile Sensor Networks
IEEE Transactions on Mobile Computing
A mobility prediction based relay deployment framework for conserving power in manets
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Distributed virtual-movement scheme for improving energy efficiency in wireless sensor networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Honeybees: combining replication and evasion for mitigating base-station jamming in sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Mission-oriented k-coverage in mobile wireless sensor networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Primate-Inspired Communication Methods for Mobile and Static Sensors and RFID Tags
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.01 |
In this paper, we consider a mobile ad hoc sensor network. The mobility of the sensor nodes is designed with the cost of communication and mobility in mind along with consideration of the possible scanning tasks of the nodes. Our mobility algorithm is developed in the context of a distributed system where, for any single mobile node, only local information about associated energy costs is known. We use a distributed simulated annealing framework to govern the motion of the nodes and prove that, in a limiting sense, a global objective function comprising mobility and communication energy costs will be minimized. This paper concludes with a simulation study focusing on mobile sensors with dual roles of scanning and relaying higher priority tracking traffic from tracking nodes.