The 5th International Workshop on Localized Algorithms and Protocols
for Wireless Sensor Networks, June 29, 2011.
In conjunction with DCOSS '11, Barcelona, Spain
Important Dates:
Manuscript Submission: Apr. 01, 2011
Acceptance Notification: Apr. 30, 2011
Camera ready: May 30, 2011
LOCALGOS 2011 aims to cover comprehensively the algorithmic issues in the
hot area of ad hoc and sensor networking. It concentrates on such network
layer problems as data communication (routing, QoS-routing, geocasting,
multicasting, broadcasting, etc.) and topology control (neighbor discovery,
power adjustment, neighbor elimination, etc.). The main paradigm shift is
to apply localized (or greedy) schemes as opposed to existing protocols
requiring global information. Localized algorithms are distributed approaches
where simple local node behavior achieves a desired global objective.
Localized protocols provide scalable solutions, that is, solutions for
wireless networks with an arbitrary number of nodes.
The objective of the workshop is to present state of the art research results
on various aspects of localized algorithms and protocols in this rapidly
growing area of ad hoc and sensor networks.
Topics of interest include, but are not limited to:
* Localized unicast and multicast routing protocols
* Localized broadcasting algorithms
* Localized QoS communication protocols
* Localized geocasting protocols
* Localized clustering algorithms
* Localized protocols for duty-cycled sensor networks
* Localized auto-configuration and network formation algorithms
* Topology construction and maintenance based on local information
* Energy-efficient and bandwidth-efficient communication
* Relative positioning algorithms based on local information
* Network graph properties supporting localized protocols
* Localized algorithms for data management and query
* Localized incentive schemes for selfish wireless networks
* Localized algorithms in delay/disruption tolerant networks
* Security based on local information in wireless sensor networks
* Bounds analysis in localized solutions
* Worst and average case analysis in localized algorithms
Papers are solicited in the IEEE proceedings format with up to six (6) pages.
Papers in PDF format must be submitted via Easy Chair by using the following
URL: https://www.easychair.org/account/signin.cgi?timeout=1;conf=localgos10.
All submissions must be original prior unpublished work and not under review
elsewhere. All papers will be reviewed and selected based on their
originality, merit, and relevance to the workshop. Accepted and presented
papers will appear in the DCOSS proceedings and the IEEE Digital Library.
Please email to TPC chairs if you have any questions.
Steering Committee:
Ivan Stojmenovic, University of Ottawa, Canada
Program Co-Chairs
Song Guo, University of Aizu, Japan
Symeon Papavassiliou, National Technical University of Athens, Greece
Publicity Chair
Jiming Chen, Zheijiang University, China
Xu Li, INRIA Lille, France
**********************************************************
*
* 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/
*
**********************************************************
Posts
