Thursday, October 31, 2013

[DMANET] 3rd CFP: Special Issue on "Heuristics for Reliable and Efficient, Wireless Sensor Networks Deployments" (J. of Heuristics, Springer, Q1)

[Apologies if you got multiple copies of this email]

SECOND CALL FOR PAPERS:
Special Issue on "HEURISTICS FOR RELIABLE AND EFFICIENT WIRELESS SENSOR
NETWORKS DEPLOYMENTS"

PDF: http://arco.unex.es/hrewsn
http://www.springer.com/mathematics/applications/journal/10732

Journal of Heuristics
Springer, ISSN: 1381-1231. Editor-in-Chief: Manuel Laguna.
Impact factor (2012): 1.471 (Q1, COMPUTER SCIENCE, THEORY & METHODS).


Aims and Scope:
==============
Wireless Sensor Networks are nowadays an extended engineering technology
for many markets due to the great amount of their possibilities in
collecting data from complex environments and processing them for
different purposes. Nevertheless, this interest is not enough to apply
this kind of networks as trustworthy solution for many real-world
environments, such as industrial processes and critical infrastructures,
where high reliability is required, together with other related key
aspects as energy, security and efficiency. Many companies could
overcome their reluctances if economic, reliable and easily deployed
solutions are provided in this field. In this scenario, the heuristics
and computational intelligence play an important role to solve many
involved optimization problems, doing necessary the research on advanced
solutions that result in a successful product. In this sense, there are
many challenges, trends and open possibilities in this area that deserve
to be known. In this special issue, we seek original, high quality
articles, clearly focused on theoretical or practical aspects of the
heuristics and mathematical optimization methods for obtaining reliable
and efficient wireless sensor networks, including but not limited to the
topics shown below.


Topics of Interest:
==================
The topics related to heuristics for reliable and efficient Wireless
Sensor Networks deployments that are relevant to this special issue
include but are not limited to:

* Energy minimization aspects: network lifetime and power savings.
* Efficient networks deployments.
* Heuristics and computational intelligence applied for solving
optimization problems.
* Multiobjective optimization problems.
* Fault tolerance and quality of service.
* Robust routing algorithms, network protocols and operating systems.
* Security and privacy aspects of the communications.
* Microprocessors, circuits, and embedded applications.
* Application cases, user studies and experiences.

Papers must be tailored to the problem of the wireless sensor networks
and explicitly consider heuristics and mathematical optimization
methods. The editors maintain the right to reject papers they deem to be
out of scope of this special issue. Only originally unpublished
contributions and invited articles will be considered for the issue.
Authors should submit their manuscripts through Editorial Manager
http://www.editorialmanager.com/heur/, selecting "SI - HREWSN" as the
article type.


Important Dates:
===============
Submission deadline: December 1st, 2013.
Acceptation notification: April 1st, 2014.
Final Papers: June 1st, 2014.


Guest Editors:
=============
Lead Editor:
Dr. Juan A. Gomez-Pulido
Dept. of Technologies of Computers and Communications, Univ. of
Extremadura, Spain
http://arco.unex.es/jangomez
E-mail
: jangomez@unex.es

Editor#2:
Jose M. Lanza-Gutierrez
Dept. of Technologies of Computers and Communications, Univ. of
Extremadura, Spain
E-mail: jmlanza@unex.es

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************