[DMANET] ACM CHANTS 2014 (co-located with ACM MobiCom): deadline extension

*************************************

[Our sincere apologies if you receive multiple copies of this message]

*************************************

Due to numerous requests, we have decided to extend the CHANTS deadline by a few days.

***

Please note that CHANTS welcomes submissions for both regular papers and demonstration papers. The full details are in the CFP below.

***
______________________________________________________________________

ACM CHANTS 2014 - 9th Workshop on Challenged Networks
co-located with ACM MobiCom 2014
7 September 2014, Maui, Hawaii, USA

www.acm-chants.org/14


Supported by the FP7 EU MOTO project
http://www.fp7-moto.eu
______________________________________________________________________


******* DEADLINE EXTENSION *******
******* Papers registration: June 11th *******
******* Papers submission: June 15th *******


SCOPE AND OVERVIEW
__________________

Challenged networks comprise those situations where communication is desired,
but traditional Internet architectures fail to provide it effectively.
Such networks may be characterized by intermittent connectivity, a heterogeneous
mix of nodes, nodal churn, and widely varying network conditions. Traditional
examples of challenged networks include inter-planetary networks, sensor and
wildlife monitoring networks, underwater networks, rural and remote areas,
and military battlefields. Recently, challenged networking has also found
applications in everyday settings, for which they were not initially conceived,
such as opportunistic networking supporting data-centric communications,
traffic offloading from cellular networks, mobile cloud computing,
opportunistic and participatory sensing. Inter-disciplinary approaches to
challenged networking protocols are also successfully explored, exploiting,
for example, findings in the area of social networking.
The availability of enabling technologies in mobile devices, such as
WiFi direct in Android and D2D communication in latest LTE releases, will
further push towards practical developments of challenged networking solutions.

This workshop builds on the success of the eight previous CHANTS workshops,
and WDTN 2005, to stimulate research on the most novel and challenging topics
of challenged network research. CHANTS provides an ideal venue for researchers
and engineers to present cutting-edge work and results, as research papers or demos,
in the following topics:

- Delay/disruption-tolerant networks (DTNs)
- Opportunistic communication and computing
- Architecture, design, and implementation of communication systems
for challenged networks
- Modeling, analysis and characterization of challenged networks and protocols
- Network Coding in Challenged Networks
- Information Centric and Content-centric Networking in Challenged Networks
- Security/Trust/Privacy concerns and solutions in challenged networks
- Case studies involving real challenged network solutions in various stages
of development or use
- Applications of challenged networks in disrupted scenarios
(e.g. disaster relief and emergency management) and in daily use
(e.g., vehicular networks, mobile social networking, censorship evasion, crowdsourcing,
sensor networks)
- Green and energy-efficient communication using challenged networks
- Real-world mobility trace collection, analysis, and modeling for challenged environments
- Network science methods for challenged networks
- Mobile data offloading via challenged networks
- Test and simulation tools for evaluating challenged network systems
- Configuration, management, and monitoring of challenged networks
- Challenged networking techniques for mobile cloud
- Challenged networking techniques for participatory and opportunistic sensing

Selected papers will be forward-looking, will describe their relationship
to existing work, and will have impact and implications for ongoing or future research.
We aim to have a highly interactive workshop, also including demos, which have been
an integral part of CHANTS. Paper authors who can also run a demo of their work will be
encouraged to do so. In exceptional cases, where live demos are simply not practical
to present, poster or video presentations of practical results are acceptable.


PAPER FORMAT AND SUBMISSION INSTRUCTIONS
________________________________________

Papers should neither have been published elsewhere nor being
currently under review by another conference or journal.
Submitted papers must be no more than 6 pages long, and should adhere to
the standard ACM conference proceedings format.
Demo proposals (to be published as part of the proceedings) must not be longer
than 3 pages plus 1 page description of the precise setup and requirements
(the 1-page setup description will not be published in the proceedings).
Papers will be reviewed single blind.
Please follow the submission link at: http://www.acm-chants.org


EDITORIAL FOLLOW-UPS
_____________________

Extended versions of the selected workshop papers will be considered for
possible fast track publication on the Computer Communications Journal (Elsevier),
in a special section on Challenged Networks.


IMPORTANT DATES
_______________

Abstract Registration (Extended): 11 June 2014
Submission Deadline (Extended): 15 June 2014
Authors Notification: 13 July 2014
Camera Ready Due: 20 July 2014
Workshop: 7 September 2014



ORGANIZING COMMITTEE
____________________

Program Committee Chairs
- Mario Gerla (UCLA, USA)
- Andrea Passarella (IIT-CNR, Italy)

Technical Program Committee
- Mostafa Ammar (Georgia Institute of Technology, USA)
- Aruna Balasubramanian (University of Washington, USA)
- Fehmi Ben Abdesslem (SICS Swedish ICT, Sweden)
- Chiara Boldrini (IIT-CNR, Italy)
- Scott Burleigh (Jet Propulsion Laboratory, California Institute of Technology, USA)
- Guohong Cao (Penn State University, USA)
- Vania Conan (Thales Communications & Security, France)
- Marco Conti (IIT-CNR, Italy)
- Marcelo Dias de Amorim (CNRS and UPMC, France)
- Roberto Di Pietro (Roma Tre University of Rome, Italy)
- Do Young Eun (North Carolina State University, USA)
- Stephen Farrell (Trinity College Dublin, Ireland)
- Ahmed Helmy (University of Florida, USA)
- Tristan Henderson (University of St Andrews, UK)
- Pan Hui (Deutsche Telekom Laboratories/Hong Kong Univ. of Science and Technology, Hong Kong)
- Karin Anna Hummel (ETH Zurich, Switzerland)
- Mohan Kumar (Rochester Institute of Technology, USA)
- Kyunghan Lee, (UNIST Ulsan National Institute of Science and Technology, Korea)
- Uichin Lee (KAIST-KSE, Korea Advanced Institute of Science and Technology, Korea)
- Anders Lindgren (SICS Swedish ICT, Sweden)
- Giovanni Neglia (INRIA Sophia-Antipolis, France)
- Melek Onen (EURECOM, France)
- Joerg Ott (Aalto University, Finland)
- Elena Pagani (University of Milan, Italy)
- Andreea Hossmann-Picu (ETH Zurich, Switzerland)
- Thrasyvoulos Spyropoulos (EURECOM, France)
- Stavros Toumpis (Athens University of Economics and Business, Greece)
- Eiko Yoneki (University of Cambridge, UK)

Steering Committee
- Kevin Almeroth, UC-Santa Barbara, USA
- Mostafa Ammar, Georgia Tech, USA
- Christophe Diot, Technicolor, France
- Deborah Estrin, UC-Los Angeles, USA
- Kevin Fall, Carnegie Mellon University, USA
- Joerg Ott, Aalto University, Finland
- James Scott, Microsoft Research Cambridge, UK

Publicity Co-Chairs
- Elisabetta Biondi (IIT-CNR, Italy)
- Yong Li (Tsinghua University, China)
- Sungwon Yang (UCLA, USA)

Web Chair
- Fehmi Ben Abdesslem (SICS Swedish ICT, Sweden)

For more information, please check out www.acm-chants.org or write to
the workshop co-chairs at chants2014@iit.cnr.it
**********************************************************
*
* 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/
*
**********************************************************