Return-path: Received: from [127.0.0.1] (helo=stiedprmman1.va.neustar.com) by megatron.ietf.org with esmtp (Exim 4.43) id 1HS9EY-0004pk-F6; Fri, 16 Mar 2007 06:00:26 -0400 Received: from [10.91.34.44] (helo=ietf-mx.ietf.org) by megatron.ietf.org with esmtp (Exim 4.43) id 1HS9EX-0004pM-GN for manet@ietf.org; Fri, 16 Mar 2007 06:00:25 -0400 Received: from tamdhu.uni-trier.de ([136.199.54.243]) by ietf-mx.ietf.org with esmtp (Exim 4.43) id 1HS9ER-00089b-PX for manet@ietf.org; Fri, 16 Mar 2007 06:00:25 -0400 Received: from notebookhannes (tamdhu.uni-trier.de [136.199.54.243]) by tamdhu.uni-trier.de (Postfix) with ESMTP id AE4001D01EC for ; Fri, 16 Mar 2007 11:00:14 +0100 (CET) From: "Hannes Frey" To: Date: Fri, 16 Mar 2007 11:00:10 +0100 Message-ID: <002401c767b1$e28f1a50$7600a8c0@notebookhannes> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable X-Mailer: Microsoft Office Outlook 11 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.3028 Thread-Index: Acdnsb157RzxnFn/Roq4d+6ejXpPog== X-Spam-Score: 0.0 (/) X-Scan-Signature: 926f893f9bbbfa169f045f85f0cdb955 Subject: [manet] Call for Papers - LOCALGOS 2007 X-BeenThere: manet@ietf.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: Mobile Ad-hoc Networks List-Unsubscribe: , List-Post: List-Help: List-Subscribe: , Errors-To: manet-bounces@ietf.org = ----------------------------------------------------------------------- Our apologies if you receive duplicates of this posting. Please feel free to distribute it to those who might be interested. = ----------------------------------------------------------------------- = *********************************************************************** * CALL FOR PAPERS = * * = * * LOCALGOS 2007 = * * = * * First International Workshop on Localized Algorithms and Protocols = * * for Wireless Sensor Networks = * * http://ants.dif.um.es/localgos07 = * * = * * In conjunction with the IEEE International Conference on = * * Distributed Computing in Sensor Systems (DCOSS 2007) = * * www.dcoss.org = * * = * * June 18 - 20, 2007 = * * Santa Fe, New Mexico, USA = * * = * * Submission Deadline: March 23, 2007 = * = *********************************************************************** Wireless sensor networks consist of a large set of embedded devices each having limited computation and communication capabilities. By using = wireless multihop communication, small chunks of collected data are aggregated = and sent towards some selected data sinks. In this way individual = measurements emerge to a global picture of the entire physical phenomenon. Wireless sensor networks enable rapid deployment, require minimum maintenance = effort, and have minimum influence on the measured phenomenon. It is envisioned = that in many application scenarios sensor networks will lead us beyond the = scale, precision, and detail of what we can measure with traditional techniques today. Sensor networks may have hundreds or thousands of nodes, with limited = energy supplies and communication capabilities. Thus, it is of paramount = importance for the networking algorithms and protocols to be able to scale with a = very large number of devices. The main paradigm shift to achieve those = desirable properties is to apply localized (or greedy) schemes as opposed to = existing protocols requiring global information. Localized algorithms are = distributed algorithms 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, which = is the main goal of this plan. This workshop will bring together researchers working in the field of localized algorithms and protocols for wireless sensor networks. The = main objective is on data communication, topology control, sensor coverage, = and sensor localization. Data communication problems are those in which one = or multiple sources need to send data to one or multiple destinations. They include among others, unicast and multicast routing, geocasting and data gathering. In the routing problem a path is created to allow the data = source to send packets to one (unicast) or multiple (multicast) destinations. Geocasting consist of sending a data packet to all sensor nodes within a pre-defined geographic area. In the data gathering problem, data from a = set of sensor nodes is collected and transmitted toward one or multiple (eventually mobile) base stations. Topology control algorithms and = protocols include problems such as neighbor detection, boundary detection, and = network organization problems in which a subset of the original topology = satisfying some properties is obtained. Examples of topology control problems are computation of dominating sets, planar graphs, and energy efficient sub topologies. Sensor coverage denotes the ability of a sensor network to = cover each point in a given area by a certain minimum number of sensor nodes. Localized coverage control includes energy conserving sleep cycles, and autonomous mobile sensor nodes which collaboratively move to achieve a desired area coverage. The majority of localized protocols require that nodes are aware of their physical position. In relative positioning such information is made available by means of distance measurements between neighboring nodes and triangulation, while the distance between two = neighbor nodes is estimated by measuring the received signal strength. SCOPE ----- The main objective of the workshop is to present state of the art = research results in the area of localized algorithms and protocols for wireless sensor networks. The workshop covers among others the following research topics (not limited to): - Unicast and multicast routing - Broadcasting - Energy-efficient and bandwidth-efficient communication=20 - Security in wireless sensor networks - Data management, query processing and data delivery - Topology construction and maintenance in wireless sensor networks - Localized protocols for duty-cycled sensor networks - Geocasting techniques for wireless sensor networks - Auto-configuration and network formation protocols and algorithms - Relative positioning algorithms - Lower bounds on information exchange required for localized solutions - Network graph properties supporting localized protocols - Worst and average case analysis on the deviation from optimal = solutions IMPORTANT DATES --------------- Manuscript Submission: March 23, 2007 Acceptance Notification: April 15, 2007 Final Manuscript Due: May 01, 2007 PAPER SUBMISSION ---------------- Submitted manuscripts may not exceed 12 single-spaced pages using = 12-point size font on 8.5x11 inch pages, including figures and tables. References = may be included in addition to the 12 pages. Submissions will be judged on correctness, originality, technical strength, significance, quality of presentation, and interest and relevance to the workshop attendees. Submitted papers may not have appeared in or be under consideration for another conference or a journal. Accepted papers will be published in = the workshop proceedings of the International Conference on Distributed Computing in Sensor Systems (DCOSS 2007). Please submit papers via Easy Chair by using the following URL: http://www.easychair.org/LOCALGOS07/. In case of trouble with the = submission you may send your publication by email to both program co-chairs (pedrom = at dif.um.es, frey at imada.sdu.dk). GENERAL CHAIR ------------- Ivan Stojmenovic, SITE, University of Ottawa PROGRAM CO-CHAIR ---------------- Pedro M. Ruiz Martinez, University of Murcia, Spain Hannes Frey, IMADA, University of Southern Denmark=20 PROGRAM COMMITTEE ----------------- Raffaele Bruno, IIT-CNR, Italy=20 Silvia Giordano, University of Applied Science, SUPSI, Switzerland=20 Isabelle Guerin Lassous, INRIA Rhone Alpes, France=20 Francois Ingelrest, EPFL, Lausanne, Swizerland=20 Lars M. Kristensen, University of Aarhus, Denmark=20 Thomas Kunz, Carleton University, Canada=20 Miguel A. Labrador, Univ. South Florida, USA=20 Hai Liu, SITE, University of Ottawa, Canada=20 Norbert Luttenberger, Universitat Kiel, Germany=20 Pietro Manzoni, Univ. Politecnica de Valencia, Spain=20 Mikhail Nesterenko, Kent State University, USA Luis Orozco, Univ. Castilla La Mancha, Spain=20 Josep Paradells, Technical University of Catalonia (UPC), Spain=20 Sumesh J Philip, Western Illinois University, USA S. S. Ravi, State University of New York at Albany, USA=20 Steffen Rothkugel, University of Luxemburg=20 Stefan Ruehrup, SITE, University of Ottawa, Canada=20 Gregor Schiele, Universit=E4t Mannheim _______________________________________________ manet mailing list manet@ietf.org https://www1.ietf.org/mailman/listinfo/manet