Energy Optimization in Mobile Wireless Sensor Networks with Mobile Targets Achieving Efficient Coverage for Critical Applications


  • Germí¡n A. Montoya Universidad de los Andes Colombia, Cra 1 Este No 19A - 40 Bogotí¡
  • Carlos Velí¡squez-Villada Universidad de los Andes Colombia, Cra 1 Este No 19A - 40 Bogotí¡
  • Yezid Donoso Universidad de los Andes Colombia, Cra 1 Este No 19A - 40 Bogotí¡


MWSN, multiobjective optimization, shortest path, coverage, location, energy efficiency.


The Mobile Wireless Sensor Networks (MWSN), classified within MANETS, have multiple applications for critical situations management such as target monitoring and tracking in conflict zones, supporting urban security, critical infrastructure monitoring, remote locations exploration (i.e. aerospace exploration), and patients monitoring and care in health facilities, among others. All of these applications have requirements of certain intelligence in the network that can be used for network’s self-configuration in order to find targets, guarantee connectivity and information availability until its reception. This paper proposes a MWSN architecture with an initial random distribution in a specific work area, and a centralized management to perform autonomous decision making about the movement and connectivity of the sensors. The work area presents mobile targets with interesting events which must be covered by the mobile sensors, and thus, send the collected information through the network to any base station available. Our work shows a dynamic mathematical model used to maximize targets’ coverage and send its sensed information to the base stations available, while minimizing system’s power consumption and maximizing operation time. The heuristic algorithm we used to construct and find a feasible solution is also shown.


Ahuja R. K., Magnanti T. L. and OrlinJ. B., Network Flows, Prentice-Hall, ISBN 978- 0136175490, 1993.

Church R. and ReVelle C., The maximal covering location problem, Papers in Regional Science, 32(1):101-118, 1974.

V. Chvátal. A greedy heuristic for the set-covering problem, Mathematics of Operations Research, INFORMS. 4(3):233-235, 1979.

Baldacci R., Dell'Amico M., Salazar González J., The Capacitated m-Ring-Star Problem, Operations Research, 55(6):1147-1162, 2007.

Powell W. B., Approximate Dynamic Programming, John Wiley & Sons, 2nd Edition, ISBN 978-0-470-60445-8, 2012.

Chabini I., Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time, Transportation Research Record, 1645(-1):170-175, 1998.

Chakraborty N., Sycara K., Reconfiguration algorithms for mobile robotic networks, Robotics and Automation (ICRA), 2010 IEEE International Conference on, pp.5484-5489, 3-7 May 2010.

Zavlanos M. M., Ribeiro A. and Pappas G. J., Distributed control of mobility & routing in networks of robots, Signal Processing Advances in Wireless Communications (SPAWC), 2011 IEEE 12th International Workshop on, pp.236-240, 26-29 June 2011.

Miao L., Qi H. and Wang F., Biologically-inspired self-deployable heterogeneous mobile sensor networks, Intelligent Robots and Systems 2005, (IROS 2005). 2005 IEEE/RSJ International Conference on, pp. 2363- 2368, 2-6 Aug 2005.

Wang Y.-C., Wu F.-J. and Tseng Y.-C., Mobility management algorithms and applications for mobile sensor networks, Wireless Communications and Mobile Computing, 12(1):7-21, 2012.

Cortes J., Martinez S., Karatas T., and Bullo F., Coverage control for mobile sensing networks, Robotics and Automation, IEEE Transactions on, 20(2):243-255, April 2004.



Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.